检索结果-内蒙古大学图书馆

international Conference on parallel and distributed Processing Techniques and Applications

作者： Krovi, A Rahimi, S So Illinois Univ Dept Comp Sci Carbondale IL 62901 USA

ISBN: (纸本)1892512459

Digital images are being generated at a phenomenal rate. Currently, the most common method by far for searching digital image databases is based on employing index terms which are entered manually. Content based image retrieval (CM) systems are required to effectively and efficiently use the information that is intrinsically stored in these image databases. However, CBIR on multiple image databases is a slow process that needs performance improvement. In this paper, we present a distributed approach to CBIR, an image retrieval scheme that retrieves images based on segmentation and signature in a distributed environment.

关键词： CBIR distributed systems distributed database

来源：评论

学校读者我要写书评

暂无评论

Design of Performance Benchmark for Time Series databases 18

Design of Performance Benchmark for Time Series Databases

引用

18th IEEE Int Symp on parallel and distributed Proc with Applicat (ISPA) / 10th IEEE Int Conf on Big Data and Cloud Comp (BDCloud) / IEEE Int Symp on Social Comp and Networking (SocialCom) / IEEE Int Conf on Sustainable Comp and Commun (SustainCom)

作者： Wang, Miaoqiong Liu, Siyuan Wei, Kai Liu, Han Jiang, Chunyu Yan, Shu Ma, Pengwei China Acad Informat & Commun Technol Cloud Comp & Big Data Res Inst Beijing Peoples R China

ISBN: (纸本)9781665414852

Time series databases are widely used in fields such as Internet, Internet of Things, and Industrial Internet. However, due to diverse applications and architectures of time series databases, the industry has not yet reached a consensus on their performance testing methods. This article starts from the definition and characteristics of time series databases, analyzes the commonly used benchmarking tools. Based on this, suitable datasets and test methods are designed for performance testing, and performance comparisons are analyzed based on this method.

关键词： Time Series Database Test Method Performance Benchmark Industrial Internet

来源：评论

学校读者我要写书评

暂无评论

Continuous consistency management in distributed real-time databases with multiple writers of replicated data

Continuous consistency management in distributed real-time d...

引用

19th IEEE international parallel and distributed Processing symposium, IPDPS 2005

作者： Gustavsson, Sanny Andler, Sten F. School of Humanities and Informatics University of Skövde Sweden

ISBN: (纸本)0769523129

We introduce a continuous convergence protocol for handling locally committed and possibly conflicting updates to replicated data. The protocol supports local consistency and predictability while allowing replicas to deterministically diverge and converge as updates are committed and replicated. We discuss how applications may exploit the protocol characteristics and describe an implementation where conflicting updates are detected, qualified by a partial update order, and resolved using application-specific forward conflict resolution.

关键词： distributed database systems

来源：评论

学校读者我要写书评

暂无评论

A Real-Time Object-Oriented Data Model and Prototype Implementation 16

A Real-Time Object-Oriented Data Model and Prototype Impleme...

引用

16th IEEE international symposium on Object/Component/Service-Oriented Real-Time distributed Computing (ISORC)

作者： Ellouze, Zied Louati, Nada Bouaziz, Rafik Sfax Univ CES ENIS Sfax 3038 Tunisia Sfax Univ MIRACL ISIMS Sfax 3018 Tunisia

ISBN: (纸本)9781479921133

Real-time databases are different from conventional databases in that they have timing constraints on data and on transactions upon the data. The timing constraints of data require that the current status of the real world must be close enough to the state represented by the contents of the database. The timing constraints of transactions are typically expressed in the form of deadline which indicates a certain time in the future by which a transaction must be completed. Conventional data models can not be directly applied to describe the conceptual data model of a real-time database, since there is no mechanism to deal with the representation of timing constraints. A real-time data model should simultaneously satisfy many goals. It should clearly and concisely provide support for specifying timing constraints on data and transactions, semantics of real-time data and real-time transactions, concurrency control mechanisms, and transactions scheduling policies to meet the timing constraints defined by the real-time applications. This paper presents a real-time object-oriented data model and its use in designing real-time extensions to the DB4O database management system. This data model supports expression of time-constrained data, time-constrained transactions, concurrency control mechanisms, and transactions scheduling policies. It also can be integrated easily in existing object-oriented method and permits automatic code generation of all the real-time code of an application.

关键词： Concurrency control Concurrent computing Data models databases Object oriented modeling Real-time systems Timing data models Concurrency control Object oriented modeling Time constraints Database real-time systems parallel programming Real-time database object orientation real-time data timing sequence

来源：评论

学校读者我要写书评

暂无评论

Performance comparison of parallel programming environments for implementing AIAC algorithms

引用

JOURNAL OF SUPERCOMPUTING 2006年第3期35卷 227-244页

作者： Bahi, JM Contassot-Vivier, S Couturier, R IUT Belfort Montbeliard LIFC F-90016 Belfort France

AIAC algorithms (Asynchronous Iterations Asynchronous Communications) are a particular class of parallel iterative algorithms. Their asynchronous nature makes them more efficient than their synchronous counterparts in numerous cases as has already been shown in previous works. The first goal of this article is to compare several parallel programming environments in order to see if there is one of them which is best suited to efficiently implement AIAC algorithms. The main criterion for this comparison consists in the performances achieved in a global context of grid computing for two classical scientific problems. Nevertheless, we also take into account two secondary criteria which are the ease of programming and the ease of deployment. The second goal of this study is to extract from this comparison the important features that a parallel programming environment must have in order to be suited for the implementation of AIAC algorithms.

关键词： parallel programming (Computer science) parallel computers COMPUTER algorithms ASYNCHRONOUS transfer mode parallel processing (Electronic computers) COMPUTER systems COMPUTER network architectures COMPUTER science COMPUTER programming

来源：评论

学校读者我要写书评

暂无评论

Data Jockey: Automatic Data Management for HPC Multi-Tiered Storage systems 33

Data Jockey: Automatic Data Management for HPC Multi-Tiered ...

引用

33rd IEEE international parallel and distributed Processing symposium (IPDPS)

作者： Shin, Woong Brumgard, Christopher D. Xie, Bing Vazhkudai, Sudharshan S. Ghoshal, Devarshi Oral, Sarp Ramakrishnan, Lavanya Oak Ridge Natl Lab Oak Ridge TN 37830 USA Lawrence Berkeley Natl Lab Berkeley CA USA

ISBN: (纸本)9781728112466

We present the design and implementation of Data Jockey, a data management system for HPC multi-tiered storage systems. As a centralized data management control plane, Data Jockey automates bulk data movement and placement for scientific workflows and integrates into existing HPC storage infrastructures. Data Jockey simplifies data management by eliminating human effort in programming complex data movements, laying datasets across multiple storage tiers when supporting complex workflows, which in turn increases the usability of multi-tiered storage systems emerging in modern HPC data centers. Specifically, Data Jockey presents a new data management scheme called "goal driven data management" that can automatically infer low-level bulk data movement plans from declarative high-level goal statements that come from the lifetime of iterative runs of scientific workflows. While doing so, Data Jockey aims to minimize data wait times by taking responsibility for datasets that are unused or to be used, and aggressively utilizing the capacity of the upper, higher performant storage tiers. We evaluated a prototype implementation of Data Jockey under a synthetic workload based on a year's worth of Oak Ridge Leadership Computing Facility's (OLCF) operational logs. Our evaluations suggest that Data Jockey leads to higher utilization of the upper storage tiers while minimizing the programming effort of data movement compared to human involved, per-domain ad-hoc data management scripts.

关键词： Task analysis Automation Complexity theory Data analysis Computer architecture distributed databases Programming

来源：评论

学校读者我要写书评

暂无评论

parallel Simulation of Power systems with High Penetration of distributed Generation Using GPUs and OpenCL 13

Parallel Simulation of Power Systems with High Penetration o...

引用

13th international symposium on Power Electronics for distributed Generation systems (PEDG)

作者： Zhang, Junjie Mittenbuehler, Marcel Razik, Lukas Benigni, Andrea Forschungszentrum Julich IEK 10 Energy Syst Engn D-52428 Julich Germany Rhein Westfal TH Aachen D-52056 Aachen Germany Raz InformING D-52070 Aachen Germany JARA Energy D-52425 Julich Germany

ISBN: (数字)9781665466189

ISBN: (纸本)9781665466189

In this paper, we present the use of parallel-in-space simulation approach to accelerate the dynamic simulation of power systems with high penetration of distributed generation, i. e. high number of power electronic devices. The approach is implemented using the OpenCL framework and executed on a graphic processing unit (GPU). We benchmark our prototype implementation using a distribution network with increasing number of distributed generator which is modeled by voltage source inverter. Results show that the computation time for the distributed generators solution stays nearly constant with the increasing number of the distributed generators in the network.

关键词： parallel programming power system simulation power electronics

来源：评论

学校读者我要写书评

暂无评论

Balancing the Communication Load of State Transfer in Replicated systems

Balancing the Communication Load of State Transfer in Replic...

引用

30th IEEE international symposium on Reliable distributed systems (SRDS)

作者： Raghavan, Narasimha Vitenberg, Roman Univ Oslo Dept Informat N-0316 Oslo Norway

ISBN: (纸本)9780769544502

State transfer mechanisms are an essential building block in the design of many distribution applications that replicate the state, such as partially replicated databases or view-synchronous group communication. When a reconfiguration occurs, a need arises to ship a subset of objects that constitute the application state to a subset of nodes in the system. The most commonly employed solution is to elect a leader that collects state objects and transmits them to the nodes that need to receive them. In this paper, we present the problem of communication-balanced state transfer wherein the goal is to distribute the load of communication due to state transfer evenly across the participating nodes. We propose an algorithm that achieves the optimal balance, analyze it, and describe how it can be used in a variety of applications. We evaluate the algorithm on a typical setup of partially replicated databases and show that it attains a significant improvement compared with existing approaches.

关键词： Context databases Matrix converters Optimization Protocols Resource management Unicast communication balanced state transfer communication load balancing distributed processing distributed systems distribution applications load balancing partially replica

来源：评论

学校读者我要写书评

暂无评论

Discovering and resolving user intent in heterogeneous databases

引用

FUNDAMENTA INFORMATICAE 2001年第1-2期47卷 137-154页

作者： Fernandes, C Henschen, L Colby Coll Dept Comp Sci Waterville ME 04901 USA Northwestern Univ Dept Elect & Comp Engn Evanston IL 60201 USA

We propose a system whereby subtle semantic ambiguity found in queries of distributed heterogeneous database systems can be resolved by considering the user's intentions, Through the use of domain-specific knowledge embedded within a mediator-based architecture, subtleties in meaning can be explicitly modeled. Through the use of dynamic profiles and active dialogue, the system can discover user intent, providing more satisfying query answers.

关键词： heterogeneous databases mediation intent

来源：评论

学校读者我要写书评

暂无评论

EFFICIENT parallel ALGORITHMS FOR FUNCTIONAL DEPENDENCY MANIPULATIONS 90

引用

2ND international SYMP ON databases IN parallel AND distributed systems ( DPDS 90 )

作者： SRIDHAR, R IYENGAR, SS Department of Computer Science Louisiana State University Baton Rouge LA

ISBN: (纸本)0818620528

Given a set of functional dependencies Σ and a single dependency σ, we show that the algorithm to test whether Σ implies σ is log-space complete in P. The functional dependencies Σ are represented as a directed hypergraph HΣ [1]. We first present a parallel algorithm which solves the above implication problem using P processors on a EREW-PRAM in Ο(e/P + ***) time and on a CRCW-PRAM in Ο(e/P + n) time, where e and n are the number of arcs and nodes of the graph HΣ. For graphs HΣ with fixed degree and diameter, we show that the closure HΣ+ can be computed in NC. We present NC algorithms to obtain a non-redundant and a LR-Minimum cover for the set of functional dependencies Σ. All our algorithms on a n-node directed hypergraph with fixed degree and diameter can be implemented to run in Ο(log2n) time with M(n) processors on a CREW-PRAM model, where M(n) is the cost of multiplying two binary matrices. The algorithms are efficient based on the transitive closure bottleneck phenomenon [7] that is, any improvement in the time and processor complexity of the transitive closure algorithm will result in an improvement by the same amount for the algorithms presented here.

关键词： functional dependency processor complexity minimal cover directed hyper-graph parallel algorithm log-space reduction NC algorithm time complexity non-redundant cover relational databases minimum cover

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：