• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 731
Next 10 →

Scale and performance in a distributed file system

by John H. Howard, Michael L. Kazar, Sherri G. Menees, A. Nichols, M. Satyanarayanan, Robert N. Sidebotham, Michael J. West - ACM Transactions on Computer Systems , 1988
"... The Andrew File System is a location-transparent distributed tile system that will eventually span more than 5000 workstations at Carnegie Mellon University. Large scale affects performance and complicates system operation. In this paper we present observations of a prototype implementation, motivat ..."
Abstract - Cited by 933 (45 self) - Add to MetaCart
The Andrew File System is a location-transparent distributed tile system that will eventually span more than 5000 workstations at Carnegie Mellon University. Large scale affects performance and complicates system operation. In this paper we present observations of a prototype implementation

Coda: A Highly Available File System for a Distributed Workstation Environment

by Mahadev Satyanarayanan, James J. Kistler, Puneet Kumar, Maria E. Okasaki, Ellen H. Siegel, David C. Steere - IN IEEE TRANSACTIONS ON COMPUTERS , 1990
"... Coda is a file system for a large-scale distributed computing environment composed of Unix workstations. It provides resiliency to server and network failures through the use of two distinct but complementary mechanisms. One mechanism, server replication,stores copies of a file at multiple servers ..."
Abstract - Cited by 530 (45 self) - Add to MetaCart
Coda is a file system for a large-scale distributed computing environment composed of Unix workstations. It provides resiliency to server and network failures through the use of two distinct but complementary mechanisms. One mechanism, server replication,stores copies of a file at multiple

Network Coding for Large Scale Content Distribution

by Christos Gkantsidis, Pablo Rodriguez Rodriguez
"... We propose a new scheme for content distribution of large files that is based on network coding. With network coding, each node of the distribution network is able to generate and transmit encoded blocks of information. The randomization introduced by the coding process eases the scheduling of bloc ..."
Abstract - Cited by 493 (7 self) - Add to MetaCart
We propose a new scheme for content distribution of large files that is based on network coding. With network coding, each node of the distribution network is able to generate and transmit encoded blocks of information. The randomization introduced by the coding process eases the scheduling

Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility

by Antony Rowstron, Peter Druschel , 2001
"... This paper presents and evaluates the storage management and caching in PAST, a large-scale peer-to-peer persistent storage utility. PAST is based on a self-organizing, Internetbased overlay network of storage nodes that cooperatively route file queries, store multiple replicas of files, and cache a ..."
Abstract - Cited by 803 (23 self) - Add to MetaCart
additional copies of popular files. In the PAST system, storage nodes and files are each assigned uniformly distributed identifiers, and replicas of a file are stored at nodes whose identifier matches most closely the file’s identifier. This statistical assignment of files to storage nodes approximately

Wide-area cooperative storage with CFS

by Frank Dabek, M. Frans Kaashoek, David Karger, Robert Morris, Ion Stoica , 2001
"... The Cooperative File System (CFS) is a new peer-to-peer readonly storage system that provides provable guarantees for the efficiency, robustness, and load-balance of file storage and retrieval. CFS does this with a completely decentralized architecture that can scale to large systems. CFS servers pr ..."
Abstract - Cited by 999 (53 self) - Add to MetaCart
The Cooperative File System (CFS) is a new peer-to-peer readonly storage system that provides provable guarantees for the efficiency, robustness, and load-balance of file storage and retrieval. CFS does this with a completely decentralized architecture that can scale to large systems. CFS servers

Scalable molecular dynamics with NAMD.

by James C Phillips , Rosemary Braun , Wei Wang , James Gumbart , Emad Tajkhorshid , Elizabeth Villa , Christophe Chipot , Robert D Skeel , Laxmikant Kalé , Klaus Schulten - J Comput Chem , 2005
"... Abstract: NAMD is a parallel molecular dynamics code designed for high-performance simulation of large biomolecular systems. NAMD scales to hundreds of processors on high-end parallel platforms, as well as tens of processors on low-cost commodity clusters, and also runs on individual desktop and la ..."
Abstract - Cited by 849 (63 self) - Add to MetaCart
Abstract: NAMD is a parallel molecular dynamics code designed for high-performance simulation of large biomolecular systems. NAMD scales to hundreds of processors on high-end parallel platforms, as well as tens of processors on low-cost commodity clusters, and also runs on individual desktop

The Paradyn Parallel Performance Measurement Tools

by Barton P. Miller, Mark D. Callaghan, Jonathan M. Cargille, Jeffrey K. Hollingsworth, R. Bruce Irvin , Karen L. Karavanic, Krishna Kunchithapadam, Tia Newhall - IEEE COMPUTER , 1995
"... Paradyn is a performance measurement tool for parallel and distributed programs. Paradyn uses several novel technologies so that it scales to long running programs (hours or days) and large (thousand node) systems, and automates much of the search for performance bottlenecks. It can provide precise ..."
Abstract - Cited by 447 (39 self) - Add to MetaCart
Paradyn is a performance measurement tool for parallel and distributed programs. Paradyn uses several novel technologies so that it scales to long running programs (hours or days) and large (thousand node) systems, and automates much of the search for performance bottlenecks. It can provide precise

Making Gnutella-like P2P Systems Scalable

by Yatin Chawathe, Sylvia Ratnasamy, Lee Breslau, Nick Lanham, Scott Shenker , 2003
"... Napster pioneered the idea of peer-to-peer file sharing, and supported it with a centralized file search facility. Subsequent P2P systems like Gnutella adopted decentralized search algorithms. However, Gnutella's notoriously poor scaling led some to propose distributed hash table solutions to t ..."
Abstract - Cited by 429 (1 self) - Add to MetaCart
Napster pioneered the idea of peer-to-peer file sharing, and supported it with a centralized file search facility. Subsequent P2P systems like Gnutella adopted decentralized search algorithms. However, Gnutella's notoriously poor scaling led some to propose distributed hash table solutions

Frangipani: A Scalable Distributed File System

by Chandramohan A. Thekkath, Timothy Mann, Edward K. Lee
"... The ideal distributed file system would provide all its users with coherent, shared access to the same set of files,yet would be arbitrarily scalable to provide more storage space and higher performance to a growing user community. It would be highly available in spite of component failures. It woul ..."
Abstract - Cited by 320 (1 self) - Add to MetaCart
The ideal distributed file system would provide all its users with coherent, shared access to the same set of files,yet would be arbitrarily scalable to provide more storage space and higher performance to a growing user community. It would be highly available in spite of component failures

Leases: An Efficient Fault-Tolerant Mechanism for Distributed File Cache Consistency

by Cary G. Gray, et al. , 1989
"... Caching introduces the overbead and complexity of ensur-ing consistency, reducing some of its performance bene-fits. In a distributed system, caching must deal,wit.h the additional complications of communication and host fail-ures. Leases are proposed as a time-based mechanism that provides efficien ..."
Abstract - Cited by 335 (1 self) - Add to MetaCart
Caching introduces the overbead and complexity of ensur-ing consistency, reducing some of its performance bene-fits. In a distributed system, caching must deal,wit.h the additional complications of communication and host fail-ures. Leases are proposed as a time-based mechanism that provides
Next 10 →
Results 1 - 10 of 731
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University