|
Dartmouth College Computer Science Technical Report series |
CS home TR home TR search TR listserv |
| By author: | A B C D E F G H I J K L M N O P Q R S T U V W Y Z | |
| By number: | 2008, 2007, 2006, 2005, 2004, 2003, 2002, 2001, 2000, 1999, 1998, 1997, 1996, 1995, 1994, 1993, 1992, 1991, 1990, 1989, 1988, 1987, 1986 | |
Abstract:
As the I/O needs of parallel scientific applications increase, file
systems for multiprocessors are being designed to provide applications
with parallel access to multiple disks. Many parallel file systems
present applications with a conventional Unix-like interface that
allows the application to access multiple disks transparently. By
tracing all the activity of a parallel file system in a production,
scientific computing environment, we show that many applications
exhibit highly regular, but non-consecutive I/O access patterns.
Since the conventional interface does not provide an efficient method
of describing these patterns, we present three extensions to the
interface that support strided, nested-strided, and nested-batched I/O
requests. We show how these extensions can be used to express common
access patterns.
Note:
This TR supercedes PCS-TR94-230.
A result of the CHARISMA project.
Appeared in IOPADS '95 at IPPS '95.
Bibliographic citation for this report: [plain text] [BIB] [BibTeX] [Refer]
Or copy and paste:
Nils Nieuwejaar and
David Kotz,
"Low-level Interfaces for High-level Parallel I/O."
Dartmouth Computer Science Technical Report PCS-TR95-253,
March 1995.
Want to be notified about new tech reports? Join our mailing list.
Want to search our technical reports?
Want us to mail you a paper copy of a report? Send your address and the TR number to reports AT cs.dartmouth.edu
Copyright notice: The documents contained in this server are included by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a non-commercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.