{"title":"Performance of balanced disk array schemes","authors":"W. Burkhard, K. Claffy, T. Schwarz","doi":"10.1109/MASS.1991.160207","DOIUrl":"https://doi.org/10.1109/MASS.1991.160207","url":null,"abstract":"The balanced information dispersal algorithm (BIDA) provides attractive reliability enhancements as well as modest performance gains for the storage of data at a number of storage sites. A balanced disk array (BDA) is an application of BIDA. Although a BDA appears as a single, very reliable, fast direct-access device, it actually consists of a number of independent disks that store data according to a selected dispersal scheme. BDA devices offer exceptionally high fault tolerance combined with better performance than their constituent disks. As a result, a BDA achieves high quality with relatively low-quality components. BDA schemes also offer the flexibility to arrange for a desired ratio between read and write times. The authors discuss the construction, failure tolerance, and performance of BDAs.<<ETX>>","PeriodicalId":158477,"journal":{"name":"[1991] Digest of Papers Eleventh IEEE Symposium on Mass Storage Systems","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134601014","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":"Dynamic hierarchies and optimization in distributed storage systems","authors":"A. Buck, R. Coyne","doi":"10.1109/MASS.1991.160216","DOIUrl":"https://doi.org/10.1109/MASS.1991.160216","url":null,"abstract":"The authors propose techniques to allow controlled penetration of the location transparencies of a distributed storage system by generalizing the simple disk-tape hierarchy paradigm of current storage systems to include multiple co-existing dynamic storage hierarchies. An orthogonal, semantics-free optimization primitive is proposed to manipulate the relation between an object and its hierarchy. By managing the hierarchy attribute of a storage object and a systemwide configuration of storage device hierarchies, one can position objects on any desired set of devices without destroying the fundamental transparencies of the system. The level of detail concerning the storage location of an object can range from general (somewhere in the 'fast' storage hierarchy) to very explicit (a specific disk drive). >","PeriodicalId":158477,"journal":{"name":"[1991] Digest of Papers Eleventh IEEE Symposium on Mass Storage Systems","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124358077","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":"High-performance data systems","authors":"B. Collins","doi":"10.1109/MASS.1991.160202","DOIUrl":"https://doi.org/10.1109/MASS.1991.160202","url":null,"abstract":"It is noted that advances in massively parallel, large-memory computers and cooperative processing networks allow researchers to execute large-scale codes that generate massive amounts of data. Recent developments in high-speed networks allow large amounts of data to be transferred through a HiPPI (High Performance Parallel Interface) network in reasonable time frames. To support this high-performance computing environment, data storage, and data conversion capabilities must be provided to allow the massive amounts of data generated to be stored in a timely and reliable manner and to allow them to be retrieved easily for analysis and display.<<ETX>>","PeriodicalId":158477,"journal":{"name":"[1991] Digest of Papers Eleventh IEEE Symposium on Mass Storage Systems","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134239861","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":"Factors affecting the performance of a DOS-based WORM file server","authors":"S. Hauser, C. Rivera, G. Thoma","doi":"10.1109/MASS.1991.160205","DOIUrl":"https://doi.org/10.1109/MASS.1991.160205","url":null,"abstract":"Commercial software was selected to support archiving and retrieving document image files to and from WORM media over a LAN. As this software was integrated into the system, a performance study was initiated to determine the quantitative effect of several factors on the speed and reliability of image file transfer. These factors include network interface hardware, LAN organization, CPU clock speeds, remaining optical disk capacity, and the use of RAM by the WORM server for maintaining index files and for caching image files. It was found that WORM server CPU speed and the use of RAM for index files or for caching contributed the most to improved throughput. On the other hand, LAN organization and network interface hardware had little effect on throughput.<<ETX>>","PeriodicalId":158477,"journal":{"name":"[1991] Digest of Papers Eleventh IEEE Symposium on Mass Storage Systems","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114161322","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":"Distributed NAStore as the next step","authors":"D. Tweten, Alan Poston","doi":"10.1109/MASS.1991.160225","DOIUrl":"https://doi.org/10.1109/MASS.1991.160225","url":null,"abstract":"The authors describe the goals and requirements that have shaped the emerging NAStore 3 design. They describe the current form of the design, which employs the Bitfile Server interface and the Bitfile Server's Migration Manager to create a transparent distributed file system. They describe how the UNIX system can be modified to work jointly with other UNIX systems to create a distributed file system while continuing to work independently as it does now. They also describe how the NAStore 3 design builds upon NAStore 2 and upon the U.C. Berkeley Redundant Array of Inexpensive Disks (RAID) research. Finally, they outline the prototype construction and system implementation steps to be taken leading to a production NAStore 3 system.<<ETX>>","PeriodicalId":158477,"journal":{"name":"[1991] Digest of Papers Eleventh IEEE Symposium on Mass Storage Systems","volume":"2012 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125409081","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":"National Supercomputing Center mass storage system requirements","authors":"A. Hanushevsky","doi":"10.1109/MASS.1991.160200","DOIUrl":"https://doi.org/10.1109/MASS.1991.160200","url":null,"abstract":"As part of the National Supercomputing Center effort to define mass storage requirements and directions, six national centers were asked to fill out a questionnaire on the topic. Mass storage system requirements deemed significant by the respondents are presented.<<ETX>>","PeriodicalId":158477,"journal":{"name":"[1991] Digest of Papers Eleventh IEEE Symposium on Mass Storage Systems","volume":"283 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121822098","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":"MSS requirements for data acquisition systems","authors":"Stephen W. Miller","doi":"10.1109/MASS.1991.160204","DOIUrl":"https://doi.org/10.1109/MASS.1991.160204","url":null,"abstract":"High-performance data acquisition systems differ in their general requirements in that they accept an input data stream that is essentially uninterruptible, purposefully collect multiple petabytes of data per year, and require near-real-time, high-performance processing on the input stream: the data object creation, storage, and usage domains. The characteristics of these three domains are described.<<ETX>>","PeriodicalId":158477,"journal":{"name":"[1991] Digest of Papers Eleventh IEEE Symposium on Mass Storage Systems","volume":"444 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116513485","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}
N. Hillery, P. Cassels, Richard Misenheimer, Rodney Shojinaga
{"title":"The NCSC mass storage project","authors":"N. Hillery, P. Cassels, Richard Misenheimer, Rodney Shojinaga","doi":"10.1109/MASS.1991.160218","DOIUrl":"https://doi.org/10.1109/MASS.1991.160218","url":null,"abstract":"The authors describe the development of the NCSC (North Carolina Supercomputing Center) Mass Storage System Project, which includes implementing a data storage system based on UniTree running on an IBM 3090 connected to a Cray Y-MP via a high-speed network. They review project planning and execution, giving up-to-date results of testing and user experiences. Integration and extension of the UniTree file system into the other activities of the Supercomputing Center are also discussed. >","PeriodicalId":158477,"journal":{"name":"[1991] Digest of Papers Eleventh IEEE Symposium on Mass Storage Systems","volume":"143 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127480605","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}
D. S. Nydick, Kathy Benninger, Brett Bosley, James Ellis, Jonathan S. Goldick, C. Kirby, Michael J. Levine, Christopher Maher, M. Mathis
{"title":"An AFS-based mass storage system at the Pittsburgh Supercomputing Center","authors":"D. S. Nydick, Kathy Benninger, Brett Bosley, James Ellis, Jonathan S. Goldick, C. Kirby, Michael J. Levine, Christopher Maher, M. Mathis","doi":"10.1109/MASS.1991.160222","DOIUrl":"https://doi.org/10.1109/MASS.1991.160222","url":null,"abstract":"The AFS (Andrew File System) with extensions forms the basis of the distributed mass storage system being implemented at the Pittsburgh Supercomputing Center (PSC). AFS offers transparent, locally cached, secure access to a universal file name space from a wide variety of UNIX platforms. The PSC is extending the standard AFS offering to provide a number of features that are useful in a supercomputing environment. The extensions include a port of AFS client code to Unicos and modifications to support high-performance disk arrays and archival servers such as the Common File System, UniTree, and robotic NSF systems. These features are implemented by the development of generalized multiple residency extensions for AFS servers. Data migration strategies are being developed. The PSC extensions require no changes to the user's AFS client code. >","PeriodicalId":158477,"journal":{"name":"[1991] Digest of Papers Eleventh IEEE Symposium on Mass Storage Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131457535","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":"Performance study of client-server storage systems","authors":"E. Drakopoulos, M. Merges","doi":"10.1109/MASS.1991.160213","DOIUrl":"https://doi.org/10.1109/MASS.1991.160213","url":null,"abstract":"The authors study the performance of a system in which mass storage is provided by a file server node on a network of client processors. The server controls a hierarchy of storage devices and provides all necessary file management functions. The clients are large mainframe UNIX systems that have their own local storage devices. The movement of files among the various storage levels is managed by a hierarchical storage management system. The authors develop and solve a closed queuing network model of the client-server storage system, which is used to analyze the performance of the system for various file movement criteria, and to study the tradeoffs between recalling a file and accessing it by a distributed file system. Several network topologies (Ethernet, FDDI, Channel-to-Channel) and their effect on performance are considered.<<ETX>>","PeriodicalId":158477,"journal":{"name":"[1991] Digest of Papers Eleventh IEEE Symposium on Mass Storage Systems","volume":"515 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123074847","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}