A Lightweight Data Location Service for Nondeterministic Exascale Storage Systems

In this article, we present LWDLS, a lightweight data location service designed for Exascale storage systems (storage systems with order of 1018 bytes) and geo-distributed storage systems (large storage systems with physically distributed locations). LWDLS provides a search-based data location solution, and enables free data placement, movement, and replication. In LWDLS, probe and prune protocols are introduced that reduce topology mismatch, and a heuristic flooding search algorithm (HFS) is presented that achieves higher search efficiency than pure flooding search while having comparable search speed and coverage to the pure flooding search. LWDLS is lightweight and scalable in terms of incorporating low overhead, high search efficiency, no global state, and avoiding periodic messages. LWDLS is fully distributed and can be used in nondeterministic storage systems and in deterministic storage systems to deal with cases where search is needed. Extensive simulations modeling large-scale High Performance Computing (HPC) storage environments provide representative performance outcomes. Performance is evaluated by metrics including search scope, search efficiency, and average neighbor distance. Results show that LWDLS is able to locate data efficiently with low cost of state maintenance in arbitrary network environments. Through these simulations, we demonstrate the effectiveness of protocols and search algorithm of LWDLS.

[1]  GhemawatSanjay,et al.  The Google file system , 2003 .

[2]  Parosh Aziz Abdulla Impact of Architecture and Technology for Extreme Scale on Software and Algorithm Design , 2010 .

[3]  Robert B. Ross,et al.  PVFS: A Parallel File System for Linux Clusters , 2000, Annual Linux Showcase & Conference.

[4]  Yuanyuan Yang,et al.  An Efficient Hybrid Peer-to-Peer System for Distributed Data Sharing , 2010, IEEE Transactions on Computers.

[5]  Guihai Chen,et al.  Cycloid: a constant-degree and lookup-efficient P2P overlay network , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[6]  András Varga,et al.  An overview of the OMNeT++ simulation environment , 2008, SimuTools.

[7]  M. Newman,et al.  Random graphs with arbitrary degree distributions and their applications. , 2000, Physical review. E, Statistical, nonlinear, and soft matter physics.

[8]  Ohad Rodeh,et al.  zFS - a scalable distributed file system using object disks , 2003, 20th IEEE/11th NASA Goddard Conference on Mass Storage Systems and Technologies, 2003. (MSST 2003). Proceedings..

[9]  Song Jiang,et al.  LightFlood: Minimizing Redundant Messages and Maximizing Scope of Peer-to-Peer Search , 2008, IEEE Transactions on Parallel and Distributed Systems.

[10]  Carlos Maltzahn,et al.  Ceph: a scalable, high-performance distributed file system , 2006, OSDI '06.

[11]  Ke Wang,et al.  ZHT: A Light-Weight Reliable Persistent Dynamic Scalable Zero-Hop Distributed Hash Table , 2013, 2013 IEEE 27th International Symposium on Parallel and Distributed Processing.

[12]  Anjali Gupta,et al.  One Hop Lookups for Peer-to-Peer Overlays , 2003, HotOS.

[13]  Tao Yang,et al.  Sorrento : A Self-Organizing Storage Cluster for Parallel Data-Intensive Applications , 2003 .

[14]  Matteo Sereno,et al.  Generalized Probabilistic Flooding in Unstructured Peer-to-Peer Networks , 2011, IEEE Transactions on Parallel and Distributed Systems.

[15]  John Bent,et al.  PLFS: a checkpoint filesystem for parallel applications , 2009, Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis.

[16]  Valmir Carneiro Barbosa,et al.  Probabilistic Heuristics for Disseminating Information in Networks , 2004, IEEE/ACM Transactions on Networking.

[17]  M. Newman Clustering and preferential attachment in growing networks. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[18]  Andrew J. Hutton,et al.  Lustre: Building a File System for 1,000-node Clusters , 2003 .

[19]  Rayleigh The Problem of the Random Walk , 1905, Nature.

[20]  Ion Stoica,et al.  The Case for a Hybrid P2P Search Infrastructure , 2004, IPTPS.

[21]  Ben Y. Zhao,et al.  An Infrastructure for Fault-tolerant Wide-area Location and Routing , 2001 .

[22]  Tao Yang,et al.  A Self-Organizing Storage Cluster for Parallel Data-Intensive Applications , 2004, Proceedings of the ACM/IEEE SC2004 Conference.

[23]  Christos Gkantsidis,et al.  Hybrid search schemes for unstructured peer-to-peer networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[24]  Yunhao Liu A Two-Hop Solution to Solving Topology Mismatch , 2008, IEEE Transactions on Parallel and Distributed Systems.

[25]  Li Xiao,et al.  Location awareness in unstructured peer-to-peer systems , 2005, IEEE Transactions on Parallel and Distributed Systems.

[26]  Edith Cohen,et al.  Search and replication in unstructured peer-to-peer networks , 2002, ICS '02.

[27]  Ben Y. Zhao,et al.  Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and , 2001 .

[28]  Ian T. Foster,et al.  Mapping the Gnutella Network , 2002, IEEE Internet Comput..

[29]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[30]  P. Nowoczynski,et al.  Zest Checkpoint storage system for large supercomputers , 2008, 2008 3rd Petascale Data Storage Workshop.

[31]  Frank B. Schmuck,et al.  GPFS: A Shared-Disk File System for Large Computing Clusters , 2002, FAST.

[32]  David Mazières,et al.  Kademlia: A Peer-to-Peer Information System Based on the XOR Metric , 2002, IPTPS.

[33]  Tao Yang,et al.  An Efficient Data Location Protocol for Self.organizing Storage Clusters , 2003, ACM/IEEE SC 2003 Conference (SC'03).

[34]  Ioannis Stavrakakis,et al.  Probabilistic flooding for efficient information dissemination in random graph topologies , 2010, Comput. Networks.

[35]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[36]  Po-Chiang Lin,et al.  Dynamic Search Algorithm in Unstructured Peer-to-Peer Networks , 2009, IEEE Transactions on Parallel and Distributed Systems.

[37]  Matthew L. Curry,et al.  Using the Sirocco File System for High-Bandwidth Checkpoints , 2012 .

[38]  Scott Shenker,et al.  Making gnutella-like P2P systems scalable , 2003, SIGCOMM '03.

[39]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM '01.

[40]  Jian Li,et al.  A Framework for End-to-End Simulation of High-performance Computing Systems , 2008, Simul..

[41]  Christian Bettstetter,et al.  Probabilistic flooding in stochastic networks: Analysis of global information outreach , 2012, Comput. Networks.

[42]  Prashant Malik,et al.  Cassandra: a decentralized structured storage system , 2010, OPSR.

[43]  S.A. Brandt,et al.  CRUSH: Controlled, Scalable, Decentralized Placement of Replicated Data , 2006, ACM/IEEE SC 2006 Conference (SC'06).

[44]  Werner Vogels,et al.  Dynamo: amazon's highly available key-value store , 2007, SOSP.