E. Krevat, V. Vasudevan, Amar Phanishayee, D. Andersen, G. Ganger, Garth A. Gibson, S. Seshan
{"title":"On application-level approaches to avoiding TCP throughput collapse in cluster-based storage systems","authors":"E. Krevat, V. Vasudevan, Amar Phanishayee, D. Andersen, G. Ganger, Garth A. Gibson, S. Seshan","doi":"10.1145/1374596.1374598","DOIUrl":"https://doi.org/10.1145/1374596.1374598","url":null,"abstract":"TCP Incast plagues scalable cluster-based storage built atop standard TCP/IP-over-Ethernet, often resulting in much lower client read bandwidth than can be provided by the available network links. This paper reviews the Incast problem and discusses potential application-level approaches to avoiding it.","PeriodicalId":218652,"journal":{"name":"International Parallel Data Systems Workshop","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132109925","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A result-data offloading service for HPC centers","authors":"H. M. Monti, A. Butt, Sudharshan S. Vazhkudai","doi":"10.1145/1374596.1374608","DOIUrl":"https://doi.org/10.1145/1374596.1374608","url":null,"abstract":"Modern High-Performance Computing applications are consuming and producing an exponentially increasing amount of data. This increase has lead to a significant number of resources being dedicated to data staging in and out of Supercomputing Centers. The typical approach to staging is a direct transfer of application data between the center and the application submission site. Such a direct data transfer approach becomes problematic, especially for staging-out, as (i) the data transfer time increases with the size of data, and may exceed the time allowed by the center's purge policies; and (ii) the submission site may not be online to receive the data, thus further increasing the chances for output data to be purged. In this paper, we argue for a systematic data staging-out approach that utilizes intermediary data-holding nodes to quickly offload data from the center to the intermediaries, thus avoiding the peril of a purge and addressing the two issues mentioned above. The intermediary nodes provide temporary data storage for the staged-out data and maximize the offload bandwidth by providing multiple dataflow paths from the center to the submission site. Our initial investigation shows such a technique to be effective in addressing the above two issues and providing better QOS guarantees for data retrieval.","PeriodicalId":218652,"journal":{"name":"International Parallel Data Systems Workshop","volume":"226 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115743225","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
David O. Bigelow, S. Iyer, T. Kaldewey, R. Pineiro, A. Povzner, S. Brandt, Richard A. Golding, T. Wong, C. Maltzahn
{"title":"End-to-end performance management for scalable distributed storage","authors":"David O. Bigelow, S. Iyer, T. Kaldewey, R. Pineiro, A. Povzner, S. Brandt, Richard A. Golding, T. Wong, C. Maltzahn","doi":"10.1145/1374596.1374605","DOIUrl":"https://doi.org/10.1145/1374596.1374605","url":null,"abstract":"Many applications---for example, scientific simulation, real-time data acquisition, and distributed reservation systems---have I/O performance requirements, yet most large, distributed storage systems lack the ability to guarantee I/O performance. We are working on end-to-end performance management in scalable, distributed storage systems. The kinds of storage systems we are targeting include large high-performance computing (HPC) clusters, which require both large data volumes and high I/O rates, as well as large-scale general-purpose storage systems.","PeriodicalId":218652,"journal":{"name":"International Parallel Data Systems Workshop","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132610470","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A data placement service for petascale applications","authors":"A. Chervenak, R. Schuler","doi":"10.1145/1374596.1374611","DOIUrl":"https://doi.org/10.1145/1374596.1374611","url":null,"abstract":"We examine the use of policy-driven data placement services to improve the performance of data-intensive, petascale applications in high performance distributed computing environments. In particular, we are interested in using an asynchronous data placement service to stage data in and out of application workflows efficiently as well as to distribute and replicate data according to Virtual Organization policies. We propose a data placement service architecture and describe our implementation of one layer of this architecture, which provides efficient, priority-based bulk data transfers.","PeriodicalId":218652,"journal":{"name":"International Parallel Data Systems Workshop","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122096281","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"RADOS: a scalable, reliable storage service for petabyte-scale storage clusters","authors":"S. Weil, A. Leung, S. Brandt, C. Maltzahn","doi":"10.1145/1374596.1374606","DOIUrl":"https://doi.org/10.1145/1374596.1374606","url":null,"abstract":"Brick and object-based storage architectures have emerged as a means of improving the scalability of storage clusters. However, existing systems continue to treat storage nodes as passive devices, despite their ability to exhibit significant intelligence and autonomy. We present the design and implementation of RADOS, a reliable object storage service that can scales to many thousands of devices by leveraging the intelligence present in individual storage nodes. RADOS preserves consistent data access and strong safety semantics while allowing nodes to act semi-autonomously to self-manage replication, failure detection, and failure recovery through the use of a small cluster map. Our implementation offers excellent performance, reliability, and scalability while providing clients with the illusion of a single logical object store.","PeriodicalId":218652,"journal":{"name":"International Parallel Data Systems Workshop","volume":"5 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116793180","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Integrated system models for reliable petascale storage systems","authors":"B. Welch","doi":"10.1145/1374596.1374600","DOIUrl":"https://doi.org/10.1145/1374596.1374600","url":null,"abstract":"The big challenges facing petascale storage systems are not actually those of performanc or traditional fault tolerance schemes, but instead the challenges stem from the inherent complexity of large distributed systems. The best way to address these problems is to build a system model into the system itself, and have the system continuously monitor its current state as compared with the desired state according to the model. Change is applied to the model first, and then the system strives to achieve the new model. The hard part is defining a good model, building good support for introspection, and exploiting these features in the system design. This paper describes this problem in more detail, explains some of the techniques we have used in building the Panasas distributed storage system, and concludes with a summary of the open problems with building petascale storage systems.","PeriodicalId":218652,"journal":{"name":"International Parallel Data Systems Workshop","volume":"166 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134245987","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Towards an I/O tracing framework taxonomy","authors":"A. Konwinski, John Bent, J. Nunez, Meghan Quist","doi":"10.1145/1374596.1374610","DOIUrl":"https://doi.org/10.1145/1374596.1374610","url":null,"abstract":"There is high demand for I/O tracing in High Performance Computing (HPC). It enables in-depth analysis of distributed applications and file system performance tuning. It also aids distributed application debugging. Finally, it facilitates collaboration within and between government, industrial, and academic institutions by enabling the generation of replayable I/O traces, which can be easily distributed and anonymized as necessary to protect confidential or sensitive information. As a response to this demand for tracing tools, various means of I/O trace generation exist. We first survey the I/O Tracing Framework landscape, exploring three popular such frameworks: LANL-Trace [3], Tracefs [1], and//TRACE [2].\u0000 We next develop an I/O Tracing Framework taxonomy. The purpose of this taxonomy is to assist I/O Tracing Framework users in formalizing their tracing requirements, and to provide the developers of I/O Tracing Frameworks a language to categorize the functionality and performance of them. The taxonomy categorizes I/O Tracing Framework features such as the type of data captured, trace replayability, and anonymization. The taxonomy also considers elapsed-time overhead and performance overhead. Finally, we provide a case study in the use of our new taxonomy, revisiting all three I/O Tracing Frameworks explored in our survey, to formally classify the features of each.","PeriodicalId":218652,"journal":{"name":"International Parallel Data Systems Workshop","volume":"16 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114114104","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Swapnil Patil, Garth A. Gibson, S. Lang, Milo Polte
{"title":"GIGA+: scalable directories for shared file systems","authors":"Swapnil Patil, Garth A. Gibson, S. Lang, Milo Polte","doi":"10.1145/1374596.1374604","DOIUrl":"https://doi.org/10.1145/1374596.1374604","url":null,"abstract":"There is an increasing use of high-performance computing (HPC) clusters with thousands of compute nodes that, with the advent of multi-core CPUs, will impose a significant challenge for storage systems: The ability to scale to handle I/O generated by applications executing in parallel in tens of thousands of threads. One such challenge is building scalable directories for cluster storage - i.e., directories that can store billions to trillions of entries and handle hundreds of thousands of operations per second.","PeriodicalId":218652,"journal":{"name":"International Parallel Data Systems Workshop","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125768623","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
J. Koren, A. Leung, Yi Zhang, C. Maltzahn, S. Ames, E. L. Miller
{"title":"Searching and navigating petabyte-scale file systems based on facets","authors":"J. Koren, A. Leung, Yi Zhang, C. Maltzahn, S. Ames, E. L. Miller","doi":"10.1145/1374596.1374603","DOIUrl":"https://doi.org/10.1145/1374596.1374603","url":null,"abstract":"As users interact with file systems of ever increasing size, it is becoming more difficult for them to familiarize themselves with the entire contents of the file system. In petabyte-scale systems, users must navigate a pool of billions of shared files in order to find the information they are looking for. One way to help alleviate this problem is to integrate navigation and search into a common framework.\u0000 One such method is faceted search. This method originated within the information retrieval community, and has proved popular for navigating large repositories, such as those in e-commerce sites and digital libraries. This paper introduces faceted search and outlines several current research directions in adapting faceted search techniques to petabyte-scale file systems.","PeriodicalId":218652,"journal":{"name":"International Parallel Data Systems Workshop","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127479212","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Characterizing the I/O behavior of scientific applications on the Cray XT","authors":"P. Roth","doi":"10.1145/1374596.1374609","DOIUrl":"https://doi.org/10.1145/1374596.1374609","url":null,"abstract":"Scientific applications use input/output (I/O) for obtaining initial conditions and execution parameters, as a persistent way of saving program output, and for safeguarding against system unreliability. Although system sizes are expected to continue increasing, I/O performance is not expected to keep pace with system computation and communication performance. Understanding application I/O demands and system I/O capabilities is the first step toward bridging this gap between them. In this paper, we present our approach for characterizing the I/O demands of applications on the Cray XT. We also present preliminary case studies showing the use of our I/O characterization infrastructure with climate studies and combustion simulation programs.","PeriodicalId":218652,"journal":{"name":"International Parallel Data Systems Workshop","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127363876","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}