Optimizing for a multiprocessor: Balancing synchronization costs against parallelism in straight-line code

  • Peter G. Hibbard
  • Thomas L. Rodeheffer
Conference paper

DOI: 10.1007/3-540-11494-7_14

Part of the Lecture Notes in Computer Science book series (LNCS, volume 137)
Cite this paper as:
Hibbard P.G., Rodeheffer T.L. (1982) Optimizing for a multiprocessor: Balancing synchronization costs against parallelism in straight-line code. In: Dezani-Ciancaglini M., Montanari U. (eds) International Symposium on Programming. Programming 1982. Lecture Notes in Computer Science, vol 137. Springer, Berlin, Heidelberg

Abstract

This paper reports on the status of a research project to develop compiler techniques to optimize programs for execution on an asynchronous multiprocessor. We adopt a simplified model of a multiprocessor, consisting of several identical processors, all sharing access to a common memory. Synchronization must be done explicitly, using two special operations that take a period of time comparable to the cost of data operations. Our treatment differs from other attempts to generate code for such machines because we treat the necessary synchronization overhead as an integral part of the cost of a parallel code sequence. We are particularly interested in heuristics that can be used to generate good code sequences, and local optimizations that can then be applied to improve them. Our current efforts are concentrated on generating straight-line code for high-level, algebraic languages.

We compare the code generated by two heuristics, and observe how local optimization schemes can gradually improve its quality. We are implementing our techniques in an experimental compiler that will generate code for Cm*, a real multiprocessor, having several characteristics of our model computer.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1982

Authors and Affiliations

  • Peter G. Hibbard
  • Thomas L. Rodeheffer

There are no affiliations available

Personalised recommendations