DOCSLIB.ORG

Practical Erasure Codes for Storage Systems the Study

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Practical Erasure Codes for Storage Systems the Study PRACTICAL ERASURE CODES FOR STORAGE SYSTEMS THE STUDY OF ENTANGLEMENT CODES, AN APPROACH THAT PROPAGATES REDUNDANCY TO INCREASE RELIABILITY AND PERFORMANCE Thèse soutenue le 19 mai 2017 à la Faculté des Sciences chaire de Systèmes Complexes programme doctoral Université de Neuchâtel pour l’obtention du grade de Docteur ès Sciences par Verónica del Carmen Estrada Galiñanes acceptée sur proposition du jury: Professeur Peter Kropf, président du jury Université de Neuchâtel, Suisse Professeur Pascal Felber, directeur de thèse Université de Neuchâtel, Suisse Professeur Patrick T. Eugster, rapporteur TU Darmstadt, Allemagne Professeur Ethan L. Miller, rapporteur Université de California à Santa Cruz, États-Unis Neuchâtel, UNINE, 2017 Faculté des Sciences Secrétariat-décanat de Faculté Rue Emile-Argand 11 2000 Neuchâtel – Suisse Tél : + 41 (0)32 718 21 00 E-mail : [email protected] IMPRIMATUR POUR THESE DE DOCTORAT La Faculté des sciences de l'Université de Neuchâtel autorise l'impression de la présente thèse soutenue par Madame Verónica del Carmen Estrada Galiñanes Titre: “Practical Erasure Codes for Storage Systems: The Study of Entanglement Codes, an Approach that Propagates Redundancy to Increase Reliability and Performance” sur le rapport des membres du jury composé comme suit: • Prof. Pascal Felber, directeur de thèse, UniNE • Prof. Peter Kropf, UniNE • Prof. Ethan L. Miller, University of California, Santa Cruz, USA • Prof. Patrick Eugster, TU Darmstadt, D Neuchâtel, le 06.06.2017 Le Doyen, Prof. R. Bshary Imprimatur pour thèse de doctorat www.unine.ch/sciences He explained that an Aleph is one of the points in space that contains all other points. — Jorge Luis Borges (1899-1986), Argentine writer. This work is dedicated to Vinton Cerf for the Internet, Brewster Kahle for the Internet Archive, David S. H. Rosenthal for his blog on digital preservation, my brother Alejandro D. V. Estrada for preserving our family photos, and Rudolf E. Martin, whose love and support sustained me throughout the years . Acknowledgements First and foremost, I would like to thank my advisor Prof. Pascal Felber for his motivation, patience, dedication and extraordinary support throughout these project. In addition to my advisor, I would like to thank the other members of my thesis committee: Prof. Ethan L. Miller, Prof. Patrick Eugster and Prof. Peter Kropf for their insightful feedback and hard questions. This thesis would have been impossible without the support of the Swiss National Science Foundation that promotes collaborative research and encourages young researchers. Many thanks to the researchers that make the “Trustworthy Cloud Storage” Sinergia project possi- ble, in particular, from EPFL DIAS Prof. Anastasia Ailamaki, from EPFL DSLAB Prof. George Candea, from ETH Systems Security Group Prof. Srdjan Capkun, from University of Lugano Prof. Fernando Pedone, and from University of Neuchâtel Prof. Pascal Felber. Many thanks to the Department of Computer Science from University of Houston, to the Goldman Research Group from the European Bioinformatics Institute, the ETH Systems Group, and the Depart- ment of Mathematics from University of Zürich for inviting me to discussions and as a seminar speaker. Many thanks to all the organizations that make possible my frequent attendance to conferences, workshops and other events: Usenix, Google, ACM-W Europe, ACM, Bureau égalité des chances UNINE, and the Internet Archive. And many thanks to CUSO and the Program REGARD for the organization of a variety of courses, ateliers and winter schools. I would like to thank the University of Neuchâtel for giving me a wonderful workplace and opening the door to a large network of resources. In addition to a professional network, this period gave me some lifetime friends. Thanks to Dr. Etienne Riviére who was my first contact with the SNSF sinergia project that motivated this thesis and for his kind support to some of my summer projects like GSoC. Thanks to Dr. Hugues Mercier and Dr. Valerio Schiavoni for pushing me with non-conform zone questions. Thanks to Prof. Elisa Gorla, who made me aware that career planning is an important aspect of a research proposal. Thanks to Dr. Relinde Jurrius for her thoughful and pedagogigal comments. She has the ability to listen carefully avoiding preconceived ideas. Thanks to Muriel Besson for her dedication to PhD students in the mentoring program. Thanks to Dr. Anita Sobe, Dr. Patrick Marlier, Andrei Lapin and Rafael Pires for being great teaching assistant partners. Thanks to Dr. José Valerio for his collaboration in the Tahoe prototype that preceded my research for this thesis. Thanks to Maria Carpen-Amarie and Mirco Koher for reviewing some parts of this thesis. Thanks to Emilie Auclair and other secretaries that help me with the administrative work. Thanks to i Acknowledgements Yarco, Mascha and to all my colleagues for listening to my rehearsals, reading my unfinished work, sharing with me lunch time, coffee breaks, game nights, via ferratas and a plethora of adventures throughout all these years. Thanks to Raph and to Pascal for introducing me to the Alps and for rescuing me when it was necessary. I would like to thank the University of California, Santa Cruz, the Jack Baskin School of Engi- neering, the Center for Research in Storage Systems (CRSS), and the Storage Systems Research Center (SSRC) for hosting my 6-month research doc mobility project. Many thanks to the faculty and associated researchers, in particular to Prof. Ethan L. Miller, Prof. Darrell D. E. Long, Dr. Andy Hospodor, Dr. Ahmed Amer, Dr. Peter Alvaro, Prof. Thomas Schwarz and Prof. Carlos Maltzahn. During my stay, I had the opportunity to attend many seminars, hear interesting talks and discuss with prestigious guests. Many thanks to the participants of the weekly SSRC seminar meetings . Thanks to Cynthia McCarley for her help with administrative issues. Thanks to the International Student and Scholar service office, in particular to Parinaz Zartoshty and Keri Toma for being very kind and helpful towards my inquiries. Thanks to Ivo Gimenez for the nice talk after my PhD crisis and for organizing the social lab events. Thanks to my colleagues, special thanks to Yan Li, Ana McTaggart and Rahul Talari for integrating me in the group and to Andy who donate his house for my farewell party. I would like to thank many researchers, engineers and friends that volunteer their time asking me plenty of questions, answering my questions, reading my drafts, identifying unclear parts, criticizing my work, but overall caring about my research and consequently, encouraging my writing. Special thanks to my co-author Prof. Jehan-François Pâris, who drove my attention towards simple entanglements. Many thanks to Prof. Ruediger Urbanke, who welcomed me in his office to discuss coding theory. Many thanks to Dr. Kevin Greenan, Dr. Jay J. Wylie, who answered my emails on reliability. Many thanks to Dr. Jay Lofstead for being a good listener. Many thanks to Prof. James S. Plank for all his contributions to the field of erasure coding and for answering my emails regarding the jerasure library. Many thanks to Dr. Luciano Bello and Kragen Javier Sitaker for discussing entanglement codes and the Prolog tool to verify minimal erasure patterns. Many thanks to Théo Beigbeder for help in the translations. Many thanks to Rudolf Martin for several discussions. Many thanks to Dr. Luiz Barroso for responding my enquiries about availability in datacenters. Many thanks to Tim Feldman for answering my emails regarding storage. Many thanks to Dr. Jossy Sayir for his honest advices. Many thanks to Dr. Sage Weil and Ceph engineers for clarifying some aspects of the Ceph system’s architecture. Many thanks to my mentors at SIGCOMM 2015, Dr. Paolo Costa and Prof. John Byres. During conferences, poster sessions, doctoral workshops and other events I had the opportunity to discuss different aspects of my research with a large audience, in particular, many thanks, in no particular order, to: Dr. Cheng Huang, Dr. Donald Porter, Dr. Jesus Carretero, Pat Helland, Prof. Christof Fetzer, Prof. Torsten Braun, Prof. Joachim Rosenthal, Dr. Danny Harnik, Dr. Dalit Naor, Dr. Hillel Kolodner, Dr. Eitan Yaakobi, Dr. John Wilkes, Dr. Brent Welch, Prof. Willy Zwaenepoel, Dr. Antonia Wachter-Zeh, Prof. Gustavo Alonso, Dr. Erik Riedel, Robert Krahn, Jonnahtan Saltarin, Prof. Luc Gauthier, Charles Randall and to all my anonymous reviewers. ii Acknowledgements Many thanks to all the people who are working in projects to preserve digital information. Two projects that raised my attention during my research were the Internet Archive and LOCKSS program based at Stanford Libraries. I’d like to thank the people behind the Internet Archive, in particular, Brewster Kahle, John C. Gonzalez, and Wendy Hanamura who received my visits a couple of times. And thanks to the Chief Scientist of the LOCKSS Program Dr. David S. H. Rosenthal for his constant dedication to his blog about archival storage. Indirectly, many people prepared me for this PhD journey, in particular I would like to express my deepest gratitute to all my former professors and instructors, in special to Prof. Gabriel Venturino for classes on circuit analysis and to Prof. Ignacio Alvarez-Hamelin for introducing me to complex systems. Special thanks to my master advisor Prof. Aki Nakao, without his trust it would have been impossible to do my master in Japan and my life would be completely different. Many thanks to Dr. Carlos Rosito for his efforts to ensure that my scholarship application would arrived before deadline. Many thanks to Dr. Roberto Perazzo for his encour- agement and good advices. Many thanks to Carlos Benitez for his support. I would like to thank my family and friends whose companionship and support helped me to perservere with my goal. In particular, my special thanks go to my brave mother who gave me the best she could with her scarce resources and to my father for becoming a role model in surviving, a cheerful companion and guide in the recent years.
Load more

Recommended publications
  • The Parallel File System Lustre
    The parallel file system Lustre Roland Laifer STEINBUCH CENTRE FOR COMPUTING - SCC KIT – University of the State Rolandof Baden Laifer-Württemberg – Internal and SCC Storage Workshop National Laboratory of the Helmholtz Association www.kit.edu Overview Basic Lustre concepts Lustre status Vendors New features Pros and cons INSTITUTSLustre-, FAKULTÄTS systems-, ABTEILUNGSNAME at (inKIT der Masteransicht ändern) Complexity of underlying hardware Remarks on Lustre performance 2 16.4.2014 Roland Laifer – Internal SCC Storage Workshop Steinbuch Centre for Computing Basic Lustre concepts Client ClientClient Directory operations, file open/close File I/O & file locking metadata & concurrency INSTITUTS-, FAKULTÄTS-, ABTEILUNGSNAME (in der Recovery,Masteransicht ändern)file status, Metadata Server file creation Object Storage Server Lustre componets: Clients offer standard file system API (POSIX) Metadata servers (MDS) hold metadata, e.g. directory data, and store them on Metadata Targets (MDTs) Object Storage Servers (OSS) hold file contents and store them on Object Storage Targets (OSTs) All communicate efficiently over interconnects, e.g. with RDMA 3 16.4.2014 Roland Laifer – Internal SCC Storage Workshop Steinbuch Centre for Computing Lustre status (1) Huge user base about 70% of Top100 use Lustre Lustre HW + SW solutions available from many vendors: DDN (via resellers, e.g. HP, Dell), Xyratex – now Seagate (via resellers, e.g. Cray, HP), Bull, NEC, NetApp, EMC, SGI Lustre is Open Source INSTITUTS-, LotsFAKULTÄTS of organizational-, ABTEILUNGSNAME
    [Show full text]
  • A Fog Storage Software Architecture for the Internet of Things Bastien Confais, Adrien Lebre, Benoît Parrein
    A Fog storage software architecture for the Internet of Things Bastien Confais, Adrien Lebre, Benoît Parrein To cite this version: Bastien Confais, Adrien Lebre, Benoît Parrein. A Fog storage software architecture for the Internet of Things. Advances in Edge Computing: Massive Parallel Processing and Applications, IOS Press, pp.61-105, 2020, Advances in Parallel Computing, 978-1-64368-062-0. 10.3233/APC200004. hal- 02496105 HAL Id: hal-02496105 https://hal.archives-ouvertes.fr/hal-02496105 Submitted on 2 Mar 2020 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. November 2019 A Fog storage software architecture for the Internet of Things Bastien CONFAIS a Adrien LEBRE b and Benoˆıt PARREIN c;1 a CNRS, LS2N, Polytech Nantes, rue Christian Pauc, Nantes, France b Institut Mines Telecom Atlantique, LS2N/Inria, 4 Rue Alfred Kastler, Nantes, France c Universite´ de Nantes, LS2N, Polytech Nantes, Nantes, France Abstract. The last prevision of the european Think Tank IDATE Digiworld esti- mates to 35 billion of connected devices in 2030 over the world just for the con- sumer market. This deep wave will be accompanied by a deluge of data, applica- tions and services.
    [Show full text]
  • Evaluation of Active Storage Strategies for the Lustre Parallel File System
    Evaluation of Active Storage Strategies for the Lustre Parallel File System Juan Piernas Jarek Nieplocha Evan J. Felix Pacific Northwest National Pacific Northwest National Pacific Northwest National Laboratory Laboratory Laboratory P.O. Box 999 P.O. Box 999 P.O. Box 999 Richland, WA 99352 Richland, WA 99352 Richland, WA 99352 [email protected] [email protected] [email protected] ABSTRACT umes of data remains a challenging problem. Despite the Active Storage provides an opportunity for reducing the improvements of storage capacities, the cost of bandwidth amount of data movement between storage and compute for moving data between the processing nodes and the stor- nodes of a parallel filesystem such as Lustre, and PVFS. age devices has not improved at the same rate as the disk ca- It allows certain types of data processing operations to be pacity. One approach to reduce the bandwidth requirements performed directly on the storage nodes of modern paral- between storage and compute devices is, when possible, to lel filesystems, near the data they manage. This is possible move computation closer to the storage devices. Similarly by exploiting the underutilized processor and memory re- to the processing-in-memory (PIM) approach for random ac- sources of storage nodes that are implemented using general cess memory [16], the active disk concept was proposed for purpose servers and operating systems. In this paper, we hard disk storage systems [1, 15, 24]. The active disk idea present a novel user-space implementation of Active Storage exploits the processing power of the embedded hard drive for Lustre, and compare it to the traditional kernel-based controller to process the data on the disk without the need implementation.
    [Show full text]
  • On the Performance Variation in Modern Storage Stacks
    On the Performance Variation in Modern Storage Stacks Zhen Cao1, Vasily Tarasov2, Hari Prasath Raman1, Dean Hildebrand2, and Erez Zadok1 1Stony Brook University and 2IBM Research—Almaden Appears in the proceedings of the 15th USENIX Conference on File and Storage Technologies (FAST’17) Abstract tions on different machines have to compete for heavily shared resources, such as network switches [9]. Ensuring stable performance for storage stacks is im- In this paper we focus on characterizing and analyz- portant, especially with the growth in popularity of ing performance variations arising from benchmarking hosted services where customers expect QoS guaran- a typical modern storage stack that consists of a file tees. The same requirement arises from benchmarking system, a block layer, and storage hardware. Storage settings as well. One would expect that repeated, care- stacks have been proven to be a critical contributor to fully controlled experiments might yield nearly identi- performance variation [18, 33, 40]. Furthermore, among cal performance results—but we found otherwise. We all system components, the storage stack is the corner- therefore undertook a study to characterize the amount stone of data-intensive applications, which become in- of variability in benchmarking modern storage stacks. In creasingly more important in the big data era [8, 21]. this paper we report on the techniques used and the re- Although our main focus here is reporting and analyz- sults of this study. We conducted many experiments us- ing the variations in benchmarking processes, we believe ing several popular workloads, file systems, and storage that our observations pave the way for understanding sta- devices—and varied many parameters across the entire bility issues in production systems.
    [Show full text]
  • Lustre* Software Release 2.X Operations Manual Lustre* Software Release 2.X: Operations Manual Copyright © 2010, 2011 Oracle And/Or Its Affiliates
    Lustre* Software Release 2.x Operations Manual Lustre* Software Release 2.x: Operations Manual Copyright © 2010, 2011 Oracle and/or its affiliates. (The original version of this Operations Manual without the Intel modifications.) Copyright © 2011, 2012, 2013 Intel Corporation. (Intel modifications to the original version of this Operations Man- ual.) Notwithstanding Intel’s ownership of the copyright in the modifications to the original version of this Operations Manual, as between Intel and Oracle, Oracle and/or its affiliates retain sole ownership of the copyright in the unmodified portions of this Operations Manual. Important Notice from Intel INFORMATION IN THIS DOCUMENT IS PROVIDED IN CONNECTION WITH INTEL PRODUCTS. NO LICENSE, EXPRESS OR IM- PLIED, BY ESTOPPEL OR OTHERWISE, TO ANY INTELLECTUAL PROPERTY RIGHTS IS GRANTED BY THIS DOCUMENT. EXCEPT AS PROVIDED IN INTEL'S TERMS AND CONDITIONS OF SALE FOR SUCH PRODUCTS, INTEL ASSUMES NO LIABILITY WHATSO- EVER AND INTEL DISCLAIMS ANY EXPRESS OR IMPLIED WARRANTY, RELATING TO SALE AND/OR USE OF INTEL PRODUCTS INCLUDING LIABILITY OR WARRANTIES RELATING TO FITNESS FOR A PARTICULAR PURPOSE, MERCHANTABILITY, OR IN- FRINGEMENT OF ANY PATENT, COPYRIGHT OR OTHER INTELLECTUAL PROPERTY RIGHT. A "Mission Critical Application" is any application in which failure of the Intel Product could result, directly or indirectly, in personal injury or death. SHOULD YOU PURCHASE OR USE INTEL'S PRODUCTS FOR ANY SUCH MISSION CRITICAL APPLICATION, YOU SHALL IN- DEMNIFY AND HOLD INTEL AND ITS SUBSIDIARIES, SUBCONTRACTORS AND AFFILIATES, AND THE DIRECTORS, OFFICERS, AND EMPLOYEES OF EACH, HARMLESS AGAINST ALL CLAIMS COSTS, DAMAGES, AND EXPENSES AND REASONABLE AT- TORNEYS' FEES ARISING OUT OF, DIRECTLY OR INDIRECTLY, ANY CLAIM OF PRODUCT LIABILITY, PERSONAL INJURY, OR DEATH ARISING IN ANY WAY OUT OF SUCH MISSION CRITICAL APPLICATION, WHETHER OR NOT INTEL OR ITS SUBCON- TRACTOR WAS NEGLIGENT IN THE DESIGN, MANUFACTURE, OR WARNING OF THE INTEL PRODUCT OR ANY OF ITS PARTS.
    [Show full text]
  • Parallel File Systems for HPC Introduction to Lustre
    Parallel File Systems for HPC Introduction to Lustre Piero Calucci Scuola Internazionale Superiore di Studi Avanzati Trieste November 2008 Advanced School in High Performance and Grid Computing Outline 1 The Need for Shared Storage 2 The Lustre File System 3 Other Parallel File Systems Parallel File Systems for HPC Cluster & Storage Piero Calucci Shared Storage Lustre Other Parallel File Systems A typical cluster setup with a Master node, several computing nodes and shared storage. Nodes have little or no local storage. Parallel File Systems for HPC Cluster & Storage Piero Calucci The Old-Style Solution Shared Storage Lustre Other Parallel File Systems • a single storage server quickly becomes a bottleneck • if the cluster grows in time (quite typical for initially small installations) storage requirements also grow, sometimes at a higher rate • adding space (disk) is usually easy • adding speed (both bandwidth and IOpS) is hard and usually involves expensive upgrade of existing hardware • e.g. you start with an NFS box with a certain amount of disk space, memory and processor power, then add disks to the same box Parallel File Systems for HPC Cluster & Storage Piero Calucci The Old-Style Solution /2 Shared Storage Lustre • e.g. you start with an NFS box with a certain amount of Other Parallel disk space, memory and processor power File Systems • adding space is just a matter of plugging in some more disks, ot ar worst adding a new controller with an external port to connect external disks • but unless you planned for
    [Show full text]
  • Lustre* with ZFS* SC16 Presentation
    Lustre* with ZFS* Keith Mannthey, Lustre Solutions Architect Intel High Performance Data Division Legal Information • All information provided here is subject to change without notice. Contact your Intel representative to obtain the latest Intel product specifications and roadmaps • Tests document performance of components on a particular test, in specific systems. Differences in hardware, software, or configuration will affect actual performance. Consult other sources of information to evaluate performance as you consider your purchase. For more complete information about performance and benchmark results, visit http://www.intel.com/performance. • Intel technologies’ features and benefits depend on system configuration and may require enabled hardware, software or service activation. Performance varies depending on system configuration. No computer system can be absolutely secure. Check with your system manufacturer or retailer or learn more at http://www.intel.com/content/www/us/en/software/intel-solutions-for-lustre-software.html. • Intel technologies may require enabled hardware, specific software, or services activation. Check with your system manufacturer or retailer. • You may not use or facilitate the use of this document in connection with any infringement or other legal analysis concerning Intel products described herein. You agree to grant Intel a non-exclusive, royalty-free license to any patent claim thereafter drafted which includes subject matter disclosed herein. • No license (express or implied, by estoppel or otherwise)
    [Show full text]
  • Decentralising Big Data Processing Scott Ross Brisbane
    School of Computer Science and Engineering Faculty of Engineering The University of New South Wales Decentralising Big Data Processing by Scott Ross Brisbane Thesis submitted as a requirement for the degree of Bachelor of Engineering (Software) Submitted: October 2016 Student ID: z3459393 Supervisor: Dr. Xiwei Xu Topic ID: 3692 Decentralising Big Data Processing Scott Ross Brisbane Abstract Big data processing and analysis is becoming an increasingly important part of modern society as corporations and government organisations seek to draw insight from the vast amount of data they are storing. The traditional approach to such data processing is to use the popular Hadoop framework which uses HDFS (Hadoop Distributed File System) to store and stream data to analytics applications written in the MapReduce model. As organisations seek to share data and results with third parties, HDFS remains inadequate for such tasks in many ways. This work looks at replacing HDFS with a decentralised data store that is better suited to sharing data between organisations. The best fit for such a replacement is chosen to be the decentralised hypermedia distribution protocol IPFS (Interplanetary File System), that is built around the aim of connecting all peers in it's network with the same set of content addressed files. ii Scott Ross Brisbane Decentralising Big Data Processing Abbreviations API Application Programming Interface AWS Amazon Web Services CLI Command Line Interface DHT Distributed Hash Table DNS Domain Name System EC2 Elastic Compute Cloud FTP File Transfer Protocol HDFS Hadoop Distributed File System HPC High-Performance Computing IPFS InterPlanetary File System IPNS InterPlanetary Naming System SFTP Secure File Transfer Protocol UI User Interface iii Decentralising Big Data Processing Scott Ross Brisbane Contents 1 Introduction 1 2 Background 3 2.1 The Hadoop Distributed File System .
    [Show full text]
  • Understanding Lustre Filesystem Internals
    ORNL/TM-2009/117 Understanding Lustre Filesystem Internals April 2009 Prepared by Feiyi Wang Sarp Oral Galen Shipman National Center for Computational Sciences Oleg Drokin Tom Wang Isaac Huang Sun Microsystems Inc. DOCUMENT AVAILABILITY Reports produced after January 1, 1996, are generally available free via the U.S. Department of Energy (DOE) Information Bridge. Web site http://www.osti.gov/bridge Reports produced before January 1, 1996, may be purchased by members of the public from the following source. National Technical Information Service 5285 Port Royal Road Springfield, VA 22161 Telephone 703-605-6000 (1-800-553-6847) TDD 703-487-4639 Fax 703-605-6900 E-mail [email protected] Web site http://www.ntis.gov/support/ordernowabout.htm Reports are available to DOE employees, DOE contractors, Energy Technology Data Exchange (ETDE) representatives, and International Nuclear Information System (INIS) representatives from the following source. Office of Scientific and Technical Information P.O. Box 62 Oak Ridge, TN 37831 Telephone 865-576-8401 Fax 865-576-5728 E-mail [email protected] Web site http://www.osti.gov/contact.html This report was prepared as an account of work sponsored by an agency of the United States Government. Neither the United States Government nor any agency thereof, nor any of their employees, makes any warranty, express or implied, or assumes any legal liability or responsibility for the accuracy, completeness, or usefulness of any information, apparatus, product, or process disclosed, or represents that its use would not infringe privately owned rights. Reference herein to any specific commercial product, process, or service by trade name, trademark, manufacturer, or otherwise, does not necessarily constitute or imply its endorsement, recommendation, or favoring by the United States Government or any agency thereof.
    [Show full text]
  • Openzfs on Linux Hepix 2014 October 16, 2014 Brian Behlendorf [email protected]
    OpenZFS on Linux HEPiX 2014 October 16, 2014 Brian Behlendorf [email protected] LLNL-PRES-XXXXXX This work was performed under the auspices of the U.S. Department of Energy by Lawrence Livermore National Laboratory under Contract DE-AC52-07NA27344. Lawrence Livermore National Security, LLC 1 Lawrence Livermore National Laboratory LLNL-PRES-xxxxxx High Performance Computing Advanced Simulation Massive Scale Data Intensive Top 500 (June 2014) #3 Sequoia 20.1 Peak PFLOP/s 1,572,864 cores 55 PB of storage at 850 GB/s #9 Vulcan 5.0 Peak PFLOPS/s 393,216 cores 6.7 PB of storage at 106 GB/s World class computing resources 2 Lawrence Livermore National Laboratory LLNL-PRES-xxxxxx Linux Clusters 2001 – First Linux cluster Today – ~10 large Linux clusters (100– 3,000 nodes) and 10-20 smaller ones Near-commodity hardware Open source software stack (TOSS) Tri-Labratory Operating System Stack Modified RHEL targeted for HPC RHEL kernel optimized for clusters Moab and SLURM for scheduling Lustre parallel filesystem Additional packages for monitoring, power/console, compilers, etc LLNL Loves Linux 3 Lawrence Livermore National Laboratory LLNL-PRES-xxxxxx Lustre Lustre is our parallel filesystem of choice Livermore Computing Filesystems: Open – 20PB in 5 filesystems Secure – 22PB in 3 filesystems Plus the 55PB Sequoia filesystem 1000+ storage servers Billions of files Users want: Access to their data from every cluster Good performance High availability How do we design a system to handle this? Lustre is used extensively
    [Show full text]
  • Comparative Analysis of Distributed and Parallel File Systems' Internal Techniques
    Comparative Analysis of Distributed and Parallel File Systems’ Internal Techniques Viacheslav Dubeyko Content 1 TERMINOLOGY AND ABBREVIATIONS ................................................................................ 4 2 INTRODUCTION......................................................................................................................... 5 3 COMPARATIVE ANALYSIS METHODOLOGY ....................................................................... 5 4 FILE SYSTEM FEATURES CLASSIFICATION ........................................................................ 5 4.1 Distributed File Systems ............................................................................................................................ 6 4.1.1 HDFS ..................................................................................................................................................... 6 4.1.2 GFS (Google File System) ....................................................................................................................... 7 4.1.3 InterMezzo ............................................................................................................................................ 9 4.1.4 CodA .................................................................................................................................................... 10 4.1.5 Ceph.................................................................................................................................................... 12 4.1.6 DDFS ..................................................................................................................................................
    [Show full text]
  • Introduction to Distributed File Systems. Orangefs Experience 0.05 [Width=0.4]Lvee-Logo-Winter
    Introduction to distributed file systems. OrangeFS experience Andrew Savchenko NRNU MEPhI, Moscow, Russia 16 February 2013 . .. .. .. .. .. .. .. .. .. .. .. .. .. .. .. .. .. .. .. .. .. .. Outline 1. Introduction 2. Species of distributed file systems 3. Behind the curtain 4. OrangeFS 5. Summary . .. .. .. .. .. .. .. .. .. .. .. .. .. .. .. .. .. .. .. .. .. .. Introduction Why one needs a non-local file system? • a large data storage • a high performance data storage • redundant and highly available solutions There are dozens of them: 72 only on wiki[1], more IRL. Focus on free software solutions. .. .. .. .. .. .. .. .. .. .. .. .. .. .. .. .. .. .. .. .. .. .. Introduction Why one needs a non-local file system? • a large data storage • a high performance data storage • redundant and highly available solutions There are dozens of them: 72 only on wiki[1], more IRL. Focus on free software solutions. .. .. .. .. .. .. .. .. .. .. .. .. .. .. .. .. .. .. .. .. .. .. Species of distributed file systems Network Clustered Distributed Terminology is ambiguous!. .. .. .. .. .. .. .. .. .. .. .. .. .. .. .. .. .. .. .. .. .. .. Network file systems client1 client2 clientN server storage A single server (or at least an appearance) and multiple network clients. Examples: NFS, CIFS. .. .. .. .. .. .. .. .. .. .. .. .. .. .. .. .. .. .. .. .. .. .. Clustered file systems server1 server2 serverN storage Servers sharing the same local storage (usually SAN[2] at block level). shared storage architecture. Examples: GFS2[3], OCFS2[4]. .. .. .. .. .
    [Show full text]