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

Maintaining and checking parity in highly available scalable distributed data structures

JOURNAL OF SYSTEMS AND SOFTWARE 2010年第4期83卷 529-542页

作者： Cieslicki, Damian Schaeckeler, Stefan Schwarz, Thomas Santa Clara Univ Dept Comp Engn Santa Clara CA 95053 USA

Access to data stored in distributed main memory is much faster than access to local disks. Highly available, scalable distributed data structures (SODS) utilize this fast access. They counteract the effects of failed or unavailable nodes by storing data redundantly. Since main memory per node is limited, they generate this redundancy by storing parity data calculated with erasure correcting codes instead of using replication. We present here a way to maintain parity that is about 10 times faster than using the traditional 2PC scheme. We also present a scheme that can diagnose a mismatch between parity and user data with very little network traffic. (C) 2009 Elsevier Inc. All rights reserved.

关键词： Availability scalable distributed data structures Parity coherence

来源：评论

学校读者我要写书评

暂无评论

Fast LH*

引用

INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING 2016年第4期44卷 709-734页

作者： Chabkinian, Juan Schwarz, Thomas J. E. Univ Catolica Uruguay Montevideo Uruguay Univ Ctr Amer San Salvador El Salvador

Linear Hashing is an efficient and widely used version of extendible hashing. LH is its distributed version that stores key-value pairs on up to hundreds of thousands of sites in a distributed system. LH implements the dictionary data structure efficiently by not using a central component and allows the key-based operations of insertion, deletion, actualization, and retrieval as well as the scan operation. Because it does not use a central addressing component, clients or servers in LH can commit an addressing error by sending a request to a wrong server. This server then forwards the message to the correct server either directly or in one but never more than one additional forward operation. We discuss here methods to avoid this double forward, which, while rare, still might breach quality of service guarantees. We compare our methods with that pushes information about changes in the file structure to clients, whether they are active or not. A second problem especially relevant in high churn environments such as modern data centers is that sites can suddenly become inaccessible. The various high and scalable reliability versions of LH then reconstruct the data lost on this site elsewhere. We present a solution to the resulting "wandering bucket" problem that allows clients to find the data at their new location.

关键词： scalable distributed data structures LH Cloud computing

来源：评论

学校读者我要写书评

暂无评论

scalable distributed Two-Layer Block Based datastore 11th

Scalable Distributed Two-Layer Block Based Datastore

引用

11th International Conference on Parallel Processing and Applied Mathematics (PPAM)

作者： Krechowicz, Adam Deniziak, Stanislaw Bedla, Mariusz Chrobot, Arkadiusz Lukawski, Grzegorz Kielce Univ Technol Dept Comp Sci Kielce Poland

ISBN: (纸本)9783319321493;9783319321486

Modern distributed systems require fast and scalable datastores for efficient processing of huge amounts of information. Traditional DBMSs are insufficient for such a purpose. Hence, new datastore models were developed. In the paper we present the design and implementation of a scalable distributed two-layer block based datastore. We also discuss experimental results of comparing the performance of our datastore with MongoDB, a widely used NoSQL datastore.

关键词： scalable distributed data structures distributed datastore MongoDB NoSQL datastore

来源：评论

学校读者我要写书评

暂无评论

scalable distributed Two-Layer data structures (SD2DS)

引用

INTERNATIONAL JOURNAL OF distributed SYSTEMS AND TECHNOLOGIES 2013年第2期4卷 15-30页

作者： Sapiecha, Krzysztof Lukawski, Grzegorz Kielce Univ Technol Dept Comp Sci Kielce Poland Cracow Univ Technol Dept Comp Engn Krakow Poland ACM New York NY USA

Scalability and fault tolerance are important features of modern applications designed for the distributed, loosely-coupled computer systems. In the paper, two-layer scalable structures for storing data in a distributed RAM of a multicomputer (SD2DS) are introduced. A data unit of SD2DS (a component) is split into a header and a body. The header identifies the body and contains its address in a network. The headers are stored in the first layer of SD2DS, called the component file, while the bodies are stored in the second layer, called the component storage. Both layers are managed independently. Details of the management algorithms are given, along with SD2DS variant suitable for storing plain records of data. The SD2DS is compared to similar distributed structures and frameworks. Comparison considerations together with test results are also given. The results proved superiority of SD2DS over similar structures.

关键词： Computer Science databases distributed RAM Multicomputers Scalability scalable distributed data structures Two-Layer Design

来源：评论

学校读者我要写书评

暂无评论

A Dependable, scalable, distributed, Virtual data Structure 15th

A Dependable, Scalable, Distributed, Virtual Data Structure

引用

15th International Conference on Algorithms and Architectures for Parallel Processing (ICA3PP)

作者： Grampone, Silvia Litwin, Witold Schwarz, Thomas S. J. Univ Catolica Uruguay Montevideo Uruguay Univ Paris 09 Paris France Univ Ctr Amer San Salvador El Salvador

ISBN: (纸本)9783319271613;9783319271606

Cloud computing allows on-demand access to cheap computing resources. This capability can be used for solving problems autonomously by complete enumeration. We present here SDVRP a data structure based on range partitioning that allows to autonomously divide the computing tasks to as many nodes as are needed to meet a user-imposed dead-line (in the order of minutes) despite heterogeneity of nodes. The data structure monitors itself to deal with failures and changes in node capacities. We use simulation for a proof-of-concept of this data structure.

关键词： Brute force calculations Cloud data structure Range partitioning scalable distributed data structures Failure resilience

来源：评论

学校读者我要写书评

暂无评论

distributed Memory Virtualization with the Use of SDDSfL

Distributed Memory Virtualization with the Use of SDDSfL

引用

9th International Conference on Parallel Processing and Applied Mathematics (PPAM)

作者： Chrobot, Arkadiusz Lasota, Maciej Lukawski, Grzegorz Sapiecha, Krzysztof Kielce Univ Technol Dept Comp Sci Kielce Poland

ISBN: (纸本)9783642314995;9783642315008

scalable distributed data structures (SDDS) are a user level software component that makes it possible to create a single coherent memory pool out of distributed RAMS of multicomputer nodes. In other words they are a tool for distributed memory virtualization. Applications that use SDDS benefit from a fast data access and a scalability offered by such data structures. On the other hand, adapting an application to work with SDDS may require significant changes in its source code. We have proposed an architecture of SDDS called SDDSfL that overcomes this difficulty by providing SDDS functionality for applications in a form of an operating system service. In this paper we investigate usefulness of SDDSfL for different types of applications.

关键词： scalable distributed data structures operating system distributed memory virtualization

来源：评论

学校读者我要写书评

暂无评论

A STORE OF JAVA OBJECTS ON A MULTICOMPUTER

A STORE OF JAVA OBJECTS ON A MULTICOMPUTER

引用

10th International Conference on Enterprise Information Systems

作者： Bedla, Mariusz Sapiecha, Krzysztof Kielce Univ Technol Dept Comp Sci Al 1000 Lecia Panstwa Polskiego 7 PL-25314 Kielce Poland Cracow Univ Technol Dept Comp Sci PL-31155 Krakow Poland

ISBN: (纸本)9789898111364

The research deals with Object Oriented versions of scalable distributed data structures (OOSDDS) to store Java objects in serialized form. OOSDDS can be used as a part of distributed object store. In the paper an architecture for object version of RP* is introduced and its implementation for Java objects is given. Finally performance of the new architecture is evaluated.

关键词： Object store Java scalable distributed data structures

来源：评论

学校读者我要写书评

暂无评论

scalable distributed compact trie hashing (CTH*)

引用

INFORMATION AND SOFTWARE TECHNOLOGY 2004年第14期46卷 923-935页

作者： Zegour, DE INI Dept Informat Algiers Algeria

This last decade, a new class of data structures named scalable distributed data structures (SDDSs), is appeared completely dedicated to a distributed environment. This type of data structures opened an important axis of research, considering that the data management in a transparent manner is fundamental in a computer network. All the existing methods are mainly based on Linear hashing (LH*) and Range-partitioning (RP*). In this paper, we propose a new method with the constraints of the SDDS. Our approach is an adaptation of the well-known method Trie hashing (TH) for a distributed environment, i.e. a network of interconnected computers. The latter uses a digital tree (trie) as access function. Our major objective is the distribution of file buckets and the tree representing the hashing function. We have considered TH with the tree represented in compact form (CTH) because this option is probably more interesting for the reduction of the message size circulating on the network. Contrary to the majority of the existing methods, the proposed one provides the order of distributed files, then facilitates both the range query operations and the ordered traversal of files. Moreover, the following properties make our method a promising opening towards a new class of SDDS: (a) preservation of the order of records, (b) works without multicast (c) three bytes are sufficient to address a server, (d) the transfer of some bytes is enough for the update of the client trees. The access performances should exceed the ones of traditional files and some competitive scalable and distributed data structures. (C) 2004 Elsevier B.V. All rights reserved.

关键词： compact trie hashing linear hashing range-partitioning scalable distributed data structures

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：