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

IEEE 33rd international symposium on Reliable distributed systems

作者： Ta Hong Viet Tokyo Inst Technol Dept Comp Sci Tokyo Japan

ISBN: (纸本)9781479955848

Error control codes have been widely adopted to design dependable storage systems, thus number of data accesses becomes numerous. Data access efficiency as well as energy saving are important problems. This paper proposes a method which uses variable information word length for improving data access efficiency in dependable storage systems.

关键词： Adaptive systems Arrays distributed databases Encoding Reliability Resource management Sparse matrices MDS code energy saving erasure correction code maximum distance separable codes distributed databases Sparse matrix Adaptive systems Cache Memory System management of resources Access to Information information retrieval energy saving Energy conservation Error correction codes arrays redundant data

来源：评论

学校读者我要写书评

暂无评论

Transaction Management using Causal Snapshot Isolation in Partially Replicated databases 33

Transaction Management using Causal Snapshot Isolation in Pa...

引用

IEEE 33rd international symposium on Reliable distributed systems

作者： Padhye, Vinit Rajappan, Gowtham Tripathi, Anand Univ Minnesota Dept Comp Sci & Engn Minneapolis MN 55455 USA

ISBN: (纸本)9781479955848

We present here a transaction management protocol using causal snapshot isolation in partially replicated multi-version databases. We consider here replicated databases consisting of multiple disjoint data partitions. A partition is not required to be replicated at all database sites, and a site may contain replicas for any number of partitions. Transactions can execute at any site and read or write data from any subset of the partitions, and its updates are propagated asynchronously to other sites. The protocol ensures that the snapshot observed by a transaction contains data versions that are causally consistent. The protocol requires propagating updates only to the sites replicating the updated items. In developing this protocol, we address the issues that are unique in supporting transactions with causal consistency together with the snapshot isolation model in partially replicated databases. Through experimental evaluations, we demonstrate the scalability of this model and its performance benefits over full replication models.

关键词： Atomic clocks Data models databases Partitioning algorithms Protocols Vectors Data Replication distributed systems Snapshot Isolation Transaction Management replicated databases Partitioning algorithms Atomic clocks data models protocols distributed systems Snapshots Database Data replication write data partitions

来源：评论

学校读者我要写书评

暂无评论

MPI ruby with remote memory access

MPI ruby with remote memory access

引用

13th IEEE international symposium on High Performance distributed Computing (HPDC-13)

作者： Aycock, CC Univ Oxford Comp Lab Oxford OX1 3QD England

Advances in communication for parallel programming have yielded one-sided messaging systems. The MPI bindings for Ruby have been augmented to include the remote memory access functions of MPI-2.

ISBN: (纸本)0780321754

Advances in communication for parallel programming have yielded one-sided messaging systems. The MPI bindings for Ruby have been augmented to include the remote memory access functions of MPI-2.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Query optimization and execution in a parallel analytics DBMS

Query optimization and execution in a parallel analytics DBM...

引用

26th IEEE international parallel and distributed Processing symposium (IPDPS) / Workshop on High Performance Data Intensive Computing

作者： Eavis, Todd Taleb, Ahmad Concordia Univ Dept Comp Sci Montreal PQ H3G 1M8 Canada Najran Univ Dept Comp Sci Najran Saudi Arabia

ISBN: (纸本)9780769546759

Over the past 15 years, data warehousing and OLAP technologies have matured to the point whereby they have become a cornerstone for the decision making process in organizations of all sizes. With the underlying databases growing enormously in size, parallel DBM systems have become a popular target platform. Perhaps the most "obvious" approach to scalable warehousing is to combine a small collection of conventional relational DBMSs into a loosely connected parallel DBMS. Such systems, however, benefit little, if at all, from advances in OLAP indexing, storage, compression, modeling, or query optimization. In the current paper, we discuss a parallel analytics server that has been designed from the ground up as a high performance OLAP query engine. Moreover, its indexing and query processing model directly exploits an OLAP-specific algebra that enables performance optimizations beyond the reach of simple relational DBMS clusters. Taken together, the server provides class-leading query performance with the scalability of shared nothing databases and, perhaps most importantly, achieves this balance with a modest physical architecture.

关键词： Data warehouses parallel processing Query processing

来源：评论

学校读者我要写书评

暂无评论

Automatic tuning of a parallel pattern library for heterogeneous systems with Intel Xeon Phi 12

Automatic tuning of a parallel pattern library for heterogen...

引用

12th IEEE international symposium on parallel and distributed Processing with Applications (ISPA)

作者： Dokulil, Jiri Benkner, Siegfried Univ Vienna Res Grp Sci Comp A-1010 Vienna Austria

ISBN: (纸本)9781479942930

Pattern libraries are important tools for high productivity application development. Their struggle for best performance is complicated by the fact that they are used to execute user-provided code, which is not known during their creation. This makes pattern libraries good candidate for automatic software tuning. In this paper, we deal with automatic online parameter tuning of the HyPHI hybrid pattern library for heterogeneous systems equipped with the Intel Xeon Phi coprocessors. We propose a framework that can be used to combine a pattern library with an existing tuning library in a practical and efficient way. Our experiments show that tuning can noticeably improve the performance of the library and it introduces very little overhead.

关键词： Computerarchitecture Coprocessors databases Kernel Libraries Runtime Tuning IntelXeonPhi automaticsoftwaretuning parallelpatternlibraries Coprocessors Libraries tuning HETEROGENEOUS SYSTEM Runtime Database Kernel parallel mode Self tuning

来源：评论

学校读者我要写书评

暂无评论

An efficient implementation of Term Rewriting System on a distributed memory architecture

引用

IEICE TRANSACTIONS ON INFORMATION AND systems 1997年第4期E80D卷 510-517页

作者： Hachisu, Y Yamamoto, S Hamaguchi, T Agusa, K School of Engineering Nagoya University Nagoya-shi 464-01 Japan

Term Rewriting System (TRS) is a model of computation and it is used in various application such as algebraic specification. TRS has an inherent concurrency and it is suitable for parallel computing. We have already proposed BOB (Bundle Of Branches), which is a mechanism of data management for parallel rewriting. We have proposed a model of parallel rewriting using BOB and implemented a TRS simulator based on this model on a shared memory parallel computer. Because it fully depends on the feature of a shared memory architecture, that is, a process can access any memory element, it is hard to transport it on a distributed memory parallel computer. In this paper, we propose autonomous BOB model. This model is suitable for a distributed memory architecture since a process uses message passing protocol and the method of load balancing is provided. We implement a TRS simulator using this model on a distributed memory architecture and it runs about 30 times faster on 64 processors than on a single processor.

关键词： TRS parallel rewriting BOB

来源：评论

学校读者我要写书评

暂无评论

Performance evaluation of global reading of entire databases

引用

proceedings international symposium on databases in parallel and distributed systems

作者： Pu, Calton Hong, Christine H. Wha, Jae M. Columbia Univ New York NY USA

ISBN: (纸本)0818608935

Using simulation and probabilistic analysis, the authors study the performance of an algorithm to read entire databases with locking concurrency control allowing multiple readers or an exclusive writer. The algorithm runs concurrently with the normal transaction processing (on-the-fly) and locks the entities in the database one by one (incremental). The analysis compares different strategies to resolve the conflicts between the global read algorithm and update. Since the algorithm is parallel in nature, its interference with normal transactions is minimized in parallel and distributed databases. A simulation study shows that one variant of the algorithm can read the entire database with very little overhead and interference with the updates.

关键词： Database systems

来源：评论

学校读者我要写书评

暂无评论

distributed queue-based locking using advanced network features

Distributed queue-based locking using advanced network featu...

引用

34th international Conference on parallel Processing (ICPP)

作者： Devulapalli, A Wyckoff, P Ohio Supercomp Ctr Springfield OH 45502 USA

ISBN: (纸本)0769523803

A distributed Lock Manager (DLM) provides advisory locking services to applications such as databases and file systems that run on distributed systems. Lock management at the server is implemented using First-In-First-Out (FIFO) queues. In this paper, we demonstrate a novel way of delegating the lock management to the participating lock-requesting nodes, using advanced network primitives such as Remote Direct Memory Access (RDMA) and Atomic operations. This nicely complements the original idea of DLM, where management of the lock space is distributed. Our implementation achieves better load balancing, reduction in server load and improved throughput over traditional designs.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Graph-Based Speculative Query Execution in Relational databases 16

Graph-Based Speculative Query Execution in Relational Databa...

引用

16th international symposium on parallel and distributed Computing (ISPDC)

作者： Sasak-Okon, Anna Tudruj, Marek Univ Maria Curie Sklodowska Lublin Pl Marii Curie Sklodowskiej 5 PL-20031 Lublin Poland Polish Acad Sci Inst Comp Sci 21 Ordona Str PL-01237 Warsaw Poland Polish Japanese Inst Informat Technol 83 Koszykowa Str PL-02008 Warsaw Poland

ISBN: (纸本)9781538608623

The paper presents a method for parallel speculative query execution support to be applied in relational database systems. The method is based on dynamic analysis of input query stream in databases serviced in SQLite. A special representation of queries in the form of multigraphs is employed. A middleware called the Speculative Layer is introduced which determines the most promising speculative queries for execution based on analysis of current stream of user queries. The proposed approach assumes a dynamic query speculation window organized in the query queue, which is converted into a query multigraph subdue to the analysis. The paper presents the query graph modelling method and the query graph analysis algorithms based on specific metrics. They aim in finding best candidate queries for speculative execution which fit currently accumulated query window. Experimental results are presented based on the proposed algorithms assessment using a real testbed database serviced in SQLite.

关键词： Servers Relational databases Algorithm design and analysis Measurement Middleware

来源：评论

学校读者我要写书评

暂无评论

T3C: A temporally correct concurrency control algorithm for distributed databases 8

T3C: A temporally correct concurrency control algorithm for ...

引用

8th international symposium on Modeling, Analysis and Simulation of Computer and Telecommunication systems

作者： Boukerche, A Tuck, TW Univ N Texas Parallel Simulat & Distributed Syst PARADISE Res Dept Comp Sci Denton TX 76203 USA

ISBN: (纸本)076950728X

In some scenarios involving on-line transaction processing within a distributed database, it is desirable to synchronize transactions in a manner that guarantees conflict equivalence with a serial schedule ordered by original transaction start times while providing each transaction with an anomaly serializable isolation. Few theoretical concurrency control algorithms guarantee such a conflict equivalence, and we are unaware of any protocol that accomplishes this while supporting real-world issues such as out-of-order transaction messages, out-of-order operation executions, and out-of-order transaction committals without the burden of explicit readset and writeset declarations We describe an algorithm that provides this guarantee mid supports these issues while requiring only table-level writeset declarations.

关键词： Concurrency control

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：