Modeling communication in parallel algorithms: a fruitful interaction between theory and systems?

  • Authors:

  • Jaswinder Pal Singh;Edward Rothberg;Anoop Gupta

  • Affiliations:

  • Computer Systems Laboratory, Stanford University, Stanford, CA;Intel Supercomputer Systems, 14924 NW Greenbrier Pkwy, C06-09, Beaverton, OR;Computer Systems Laboratory, Stanford University, Stanford, CA

  • Venue:
  • SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
  • Year:
  • 1994

Quantified Score

Hi-index 0.00

Visualization

Abstract

Recently, several theoretical models of parallel architectures have been proposed to replace the PRAM as the model that is presented to an algorithm designer. A primary focus of the new models is to include the cost of interprocessor communication, which is increasingly important in modern parallel architectures. We argue that modeling the communication costs in the architecture or system is only one part of the problem. The other, and usually much more difficult, part is modeling the communication properties of the algorithm itself, which provides necessary inputs into the architectural model to determine overall complexity. In this context, we make three main points in this paper: (i) It is incomplete to describe communication without regard to its relationship with replication. We propose a description of the communication-replication relationship in terms of the working set hierarchy of an algorithm. (ii) Both inherent communication and the communication-replication relationship can be very difficult to model in irregular, dynamic computations that are crucial in many real-world applications. We present some examples that demonstrate this difficulty. (iii) We believe that substantial leverage can be obtained in this effort from the computer systems community, which can provide a hierarchy of simulation and profiling tools—from abstract to detailed—tailored to the needs of the algorithm designers. We propose an initial set of simulation tools, and we discuss possible future refinements to this set.