Skip to content
Free planNo credit card requiredStart writing

article · 2013

20 Parallel I/O and the Parallel Virtual File System

Walt Ligon, Rob Ross

Cited by 0Abstract and details only

Abstract

Ever more frequently users of clusters find themselves in an interesting situation: it isn’t the processors, communication network, or memory that is limiting their application; it is the storage system. This might force the users to checkpoint less frequently than they would like, might limit the resolution of output visualization data, or might prevent the use of out-of-core solutions needed for the largest of problems. What’s worse, the I/O hardware in the system may indeed be adequate for the user’s needs but may be being used ineffectively by one of the many software layers involved. A lot of mystery surrounds I/O solutions in clusters today. For this reason we have rewritten this chapter in the second edition. We begin by covering what we believe are some of the most important issues in parallel I/O systems. These include parallel access patterns, parallel I/O system components and architectures, and consistency semantics. Knowing how parallel I/O systems operate and the issues involved can be useful when performance tuning an application for a particular system or choosing an I/O solution to match expected workloads. This material

Cite this paper

APA 7

Ligon, W., & Ross, R. (2013). 20 Parallel I/O and the Parallel Virtual File System.

MLA 9

Ligon, Walt, and Rob Ross. “20 Parallel I/O and the Parallel Virtual File System.” 2013.

Chicago

Ligon, Walt, and Rob Ross. 2013. “20 Parallel I/O and the Parallel Virtual File System.”

Harvard

Ligon, W. and Ross, R. (2013) ‘20 Parallel I/O and the Parallel Virtual File System’.

BibTeX
@article{ligon2013parallel,
  title = {{20 Parallel I/O and the Parallel Virtual File System}},
  author = {Ligon, Walt and Ross, Rob},
  year = {2013}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.