ACM Computing Surveys 28A(4), December 1996, http://www.cs.dartmouth.edu/~thc/SDCR96/CormenModel/index.html. Copyright © 1996 by the Association for Computing Machinery, Inc. See the permissions statement below.

---

Abstract: We present the challenge of synthesizing a coherent model that combines the best aspects of the Parallel Disk Model and Bulk Synchronous Parallel models to develop and analyze algorithms that use parallel I/O, computation, and communication.

Categories and Subject Descriptors: B.3.2 [Memory Structures]: Design Styles - Mass storage (e.g., magnetic, optical), Primary memory; B.4.4 [Input/Output and Data Communications]: Performance Analysis and Design Aids - Formal models, Worst-case analysis; D.1.3 [Programming Techniques]: Concurrent Programming - Parallel programming; D.4.2 [Operating Systems]: Storage Management - Secondary Storage; D.4.4 [Operating Systems]: Communications Management - Input/Output; Message sending; Network communication; E.2 [Data Storage Representations]: Contiguous representations; E.5 [Files]: Sorting/searching; F.1.2 [Computation by Abstract Devices]: Modes of Computation - Parallelism and concurrency; F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems - Sorting and searching;

General Terms: Algorithms, Design, Languages, Performance, Theory.

Additional Key Words and Phrases: I/O, external memory, secondary memory, communication, disk drive, parallel disks, sorting, Parallel Disk Model, Bulk Synchronous Parallel Model.

---

Publication Information

Citation

Cormen, T. H., and Goodrich, M. T., 1996. Position Statement, Strategic Directions in Computing Research: Working Group on Storage I/O for Large-Scale Computing, Computing Surveys, 28A(4), December 1996, http://www.cs.dartmouth.edu/~thc/SDCR96/CormenModel/index.html.

Submission date

June 14, 1996

Revision date (if any)

November 5, 1996

Acceptance date

October 31, 1996

Publication Sources

• HTML (of full position paper)

Auxiliary Information

Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept, ACM Inc., fax +1 (212) 869-0481, or permissions@acm.org.