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

LH*_RS -: A highly-available scalable distributed data structure

ACM TRANSACTIONS ON dataBASE SYSTEMS 2005年第3期30卷 769-811页

作者： Litwin, W Moussa, R Schwarz, T Univ Paris 09 F-75016 Paris France Santa Clara Univ Dept Comp Engn Santa Clara CA 95053 USA

LH*(RS) is a high-availability scalable distributed data structure (SDDS). An LH*(RS) file is hash partitioned over the distributed RAM of a multicomputer, for example, a network of PCs, and supports the unavailability of any k >= 1 of its server nodes. The value of k transparently grows with the file to offset the reliability decline. Only the number of the storage nodes potentially limits the file growth. The high-availability management uses a novel parity calculus that we have developed, based on Reed-Salomon erasure correcting coding. The resulting parity storage overhead is about the lowest possible. The parity encoding and decoding are faster than for any other candidate coding we are aware of We present our scheme and its performance analysis, including experiments with a prototype implementation on Wintel PCs. The capabilities of LH*(RS) offer new perspectives to data intensive applications, including the emerging ones of grids and of P2P computing.

关键词： algorithms reliability scalable distributed data structure linear hashing high-availability physical database design P2P grid computing

来源：评论

学校读者我要写书评

暂无评论

A very efficient order preserving scalable distributed data structure 12th

引用

12th International Conference on database and Expert Systems Applications (DEXA)

作者： Di Pasquale, A Nardelli, E Univ Aquila Dipartimento Matemat Pura & Applicata I-67100 Laquila Italy CNR Ist Anal Sistemi & Informat I-00185 Rome Italy

ISBN: (纸本)3540425276

SDDSs (scalable distributed data structures) are access methods specifically designed to satisfy the high performance requirements of a distributed computing environment made up by a collection of computers connected through a high speed network. In this paper we present and discuss performances of ADST, a new order preserving SDDS with a worst-case constant cost for exact-search queries, a worst-case logarithmic cost for update queries, and an optimal worst-case cost for range search queries of O(k) messages, where k is the number of servers covering the query range. Moreover, our structure has an amortized almost constant cost for any single-key query. Finally, our scheme can be easily generalized to manage k-dimensional points, while maintaining the same costs of the k-dimensional case. We report experimental comparisons between ADST and its direct competitors (i.e., LH*, DRT;and RP*) where it is shown that ADST behaves clearly better. Furthermore we show how our basic technique can be combined with recent proposals for ensuring high-availability to an SDDS. Therefore our solution is very attractive for network servers requiring both a fast response time and a high reliability.

关键词： scalable distributed data structure message passing environment multi-dimensional search

来源：评论

学校读者我要写书评

暂无评论

Highly available distributed RAM (HADRAM) for data exchange between power utilities

Highly available distributed RAM (HADRAM) for data exchange ...

引用

38th Annual North American Power Symposium (NAPS)

作者： Cieslicki, Damian Schackeler, Stefan Schwarz, Thomas Santa Clara Univ Dept Comp Engn 500 El Camino Rd Santa Clara CA 95053 USA

ISBN: (纸本)9781424402274

Power Control Centers need to model their systems in real-time to support the necessary control and security functions. Neighboring independent system operators and regional transmission organizations also need to exchange system data. In the USA, a data exchange structure based on EPRI's common information model and XML is evolving. Currently, this data exchange is implemented by providing each local provider with an agent that mediates between data exchange messages and the local database. We propose here a different technology for data exchange built of main memory of commodity computers at different independent system operators to provide a universally accessible database. While distributed memory offers scalability and excellent access times (compared to disk based systems), it is also vulnerable to node outages. Our proposal, Highly Available distributed RAM (HADRAM) is highly reliable and has the speed and bandwidth advantages of distributed memory. This enables it to be used as a standard for the timely exchange of system models and real time SCADA data between power utilities.

关键词： data communication data management distributed random access memory erasure correcting codes in-memory-databases network data exchange power system control power system modeling scalable distributed data structure transmission control

来源：评论

学校读者我要写书评

暂无评论

Survey of research towards robust peer-to-peer networks: Search methods

引用

COMPUTER NETWORKS 2006年第17期50卷 3485-3521页

作者： Risson, John Moors, Tim Univ New S Wales Sch Elect Engn & Telecommun Sydney NSW 2052 Australia

The pace of research on peer-to-peer (P2P) networking in the last five years warrants a critical survey. P2P has the makings of a disruptive technology-it can aggregate enormous storage and processing resources while minimizing entry and scaling costs. Failures are common amongst massive numbers of distributed peers, though the impact of individual failures may be less than in conventional architectures. Thus the key to realizing P2P's potential in applications other than casual file sharing is robustness. P2P search methods are first couched within an overall P2P taxonomy. P2P indexes for simple key lookup are assessed, including those based on Plaxton trees, rings, tori, butterflies, de Bruijn graphs and skip graphs. Similarly, P2P indexes for keyword lookup, information retrieval and data management are explored. Finally, early efforts to optimize range, multi-attribute, join and aggregation queries over P2P indexes are reviewed. Insofar as they are available in the primary literature, robustness mechanisms and metrics are highlighted throughout. However, the low-level mechanisms that most affect robustness are not well isolated in the literature. Furthermore, there has been little consensus on robustness metrics. Recommendations are given for future research. (c) 2006 Elsevier B.V. All rights reserved.

关键词： peer-to-peer network distributed hash table consistent hashing scalable distributed data structure vector model latent semantic indexing dependability torus butterfly network skip graph Plaxton tree de Bruijn graph

来源：评论

学校读者我要写书评

暂无评论

Dynamic range partitioning with asynchronous data balancing 13

Dynamic range partitioning with asynchronous data balancing

引用

Conference on UIC/ATC/ScalCom/CBDCom/IoP/SmartWorld

作者： Belayadi, Djahida Hidouci, Walid Natl High Sch Comp Sci ESI Algiers Algeria

ISBN: (纸本)9781509027712

Our last decade has experienced significant growth in terms of data generated by billions of people connected to the Internet. Recent prognoses about Big data, Internet of Thing and Cloud Computing show growing demand for an efficient processing of huge amount of data with strict time limits. The Best data distribution on Shared Nothing Architecture (SN) is a major issue. SDDS (scalable distributed data structure) is one of the most important data structure family that is able to store and manage a huge amount of data in distributed environments. In this paper, we present an SDDS driven approach in which data is partitioned using the dynamic intervals. We are targeting any application that handles a large volume of data to be distributed over a cluster of parallel processing. This volume of data is continuously supplied in real time from multiple sources. In such situation and to face the risk of major data imbalances (data Skew) that would influence negatively the performance of parallel processing (such as range queries), we propose a self-balancing range partitioning scheme allowing nodes processing to dynamically adjust the boundaries of their ranges. Experimental results show that our approach significantly improves processing time, specially for data sorting operation and keep data balanced over the cluster.

关键词： scalable distributed data structure parallel sorting data skew Shared Nothing architecture

来源：评论

学校读者我要写书评

暂无评论

Fast LH

Fast LH

引用

25th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD)

作者： Chabkinian, Juan Schwarz, Thomas Univ Catolica Uruguay Montevideo Uruguay

ISBN: (纸本)9781479929276

Linear Hashing is a widely used and efficient version of extensible hashing. A distributed version of Linear Hashing is LH* that stores key-indexed records on up to hundreds of thousands of sites in a distributed system. LH* implements the dictionary data structure efficiently since it does not use a central component for the key-based operations of insertion, deletion, actualization, and retrieval and for the scan operation. LH* allows a client or a server to commit an addressing error by sending a request to the wrong server. In this case, the server forwards to the correct server directly or in one more forward operation. We discuss here methods to avoid the double forward, which is rare but might breach quality of service guarantees. We compare our methods with LH* P2P that pushes information about changes in the file structure to clients, whether they are active or not.

关键词： scalable distributed data structure Linear Hashing LH Cloud Computing

来源：评论

学校读者我要写书评

暂无评论

State Estimator (SE) implementation on a distributed computer system

State Estimator (SE) implementation on a distributed compute...

引用

39th North American Power Symposium

作者： Cieslicki, D. Schwarz, T. Santa Clara Univ Dept Comp Engn Santa Clara CA 95053 USA

ISBN: (纸本)9781424417254

In modern Power Control Centers, the State Estimator application is responsible for determining the actual state of a power network based on the current network model, the available telemetry (analog measurements and digital statuses) and pseudo-measurements (scheduling patterns and data manually entered by the operator). At present each control center runs its own, version of a State Estimator. We propose that it is much more economical to run one grid-wide State Estimator at one site and just exchange input and, output data with them individual control centers. In this paper we describe the architecture for a Highly, Available distributed RAM (HADRAM) system that can provide the necessary computational power and reliability.

关键词： data communication data management distributed-random access memory erasure correcting codes in-memory-databases network data exchange power system control power system modeling scalable distributed data structure service oriented architecture (SOA)

来源：评论

学校读者我要写书评

暂无评论

Dynamic range partitioning with asynchronous data balancing

Dynamic range partitioning with asynchronous data balancing

引用

IEEE International Conference on Ubiquitous Intelligence and Computing

作者： Djahida Belayadi Walid Hidouci National High School for Computer Science (ESI)

ISBN: (纸本)9781509027729

关键词： scalable distributed data structure Parallel sorting data skew Shared Nothing architecture

来源：评论

学校读者我要写书评

暂无评论

An Efficient Resource Discovery while Minimizing Maintenance Overhead in SDDS Based Hierarchical DHT Systems

引用

INTERNATIONAL JOURNAL OF GRID AND distributed COMPUTING 2011年第3期4卷 1-23页

作者： Mokadem, Riad Hameurlain, Abdelkader Paul Sabatier Univ IRIT Toulouse France

Using distributed Hash Tables (DHT) for a resource discovery in large-scale systems generates considerable maintenance overhead which affects the routing efficiency. In this paper, we propose a hierarchical DHT solution based on scalable distributed data structures (SDDS) for an efficient resource discovery in data Grids. Our solution deals with a reduced number of gateway peers running a DHT protocol. Each of them serves also as a proxy for second level peers in a single Virtual Organization (VO), structured as an SDDS. We present a cost analysis for a resource discovery process and discuss its capabilities to reduce both lookup and maintenance costs while minimizing the overhead added to the system. The analysis results proved that an SDDS based hierarchical DHT solution offers good performances especially for intra-VO resource discovery queries. They also provide significant system maintenance saves especially when peers frequently join/leave the system.

关键词： Resource discovery data Grid Peer to peer system distributed hash table scalable distributed data structure Super peer models Hierarchical systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：