Abstract
First, a specific coarse-grain dataflow architecture, the ADAM-Architecture, is briefly introduced, highlighting the features which influence the language and compiler design of a high level language for this architecture. It is shown that the key requirement to hide latency leads to new code generation strategies.
In the main part of the paper, an algorithm is presented to generate sequential codeblocks for the ADAM-Architecture from dataflow graphs. We prove that the demonstrated algorithm generates correct code. Comparing the codes generated from the new algorithm and from a traditional leftmost depth-first code generator, the tradeoff between number of used registers and gained concurrency is discussed.
Finally, future research goals and the present state of work are demonstrated.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Adam, T. L., K. M. Chandy and J. R. Dickson. “A Comparison of List Schedules for Parallel Processing Systems.” CACM 12, 12 (12-1974): 685ff.
Aho, A. V., Sethi, R., Ullman, J. D. Compilers Principles, Techniques and Tools. Addison-Wesley, 1986.
Andrews, G. R. and F. B. Schneider. “Concepts and Notations for Concurrent Programming.” Computing Surveys, The Survey and Tutorial Journal of the ACM 15, 1 (1983-3): 3ff.
Arvind and Culler D. E. “Dataflow Architectures”. Ann. Rev. Comput. Sci 1 (1986): 225–53.
Arvind and R. A. Ianucci. “Two Fundamental Issues in Multiprocessing.” in Proceedings of DFVLR — Conference 1987 on Parallel Processing in Science and Engineering, Bonn-Bad Godesberg, D, 6-1987.
Bührer, R., Ekanadham, K., Incorporating Dataflow Ideas into von Neumann Processors for Parallel Execution, IEEE Trans. on Computers, C36(12):1515–1522, Dec. 1987.
Gurd, J. R., Kirkham, C. C., Watson, I. 1985. The Manchester dataflow prototype computer, CACM 28(1):34–52.
McMahon, F. H., L. L. N. L. FORTRAN Kernels: MFLOPS, Lawrence Livermore National Laboratory, 1986.
Maquelin, O. ADAM: a Coarse-Grain Dataflow Architecture that Adresses the Load Balancing and Throttling Problems, submitted to CONPAR 90.
Mitrovic, S. et al. “A Distributed Memory Multiprocessor Based on Dataflow Synchronization” in Proceedings of International Phoenix Conference on Computers and Communication, March 1990
Sarkar, V. Partitioning and Scheduling Parallel Programs for Multiprocessors. London: Pitman Publishers, 1989.
Skedzielewski S and Glauert J. IF1, An Intermediate Form for Applicative Languages, Lawrence Livermore Laboratory, 6-18-1984.
Wyttenbach, J. Design of a Variable Grain Dataflow Machine and its Relation to a New Approach for System Specification, Ph. D. Thesis, ETH Zürich (in preparation).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Murer, S.B. (1990). A latency tolerant code generation algorithm for a coarse grain dataflow machine. In: Burkhart, H. (eds) CONPAR 90 — VAPP IV. VAPP CONPAR 1990 1990. Lecture Notes in Computer Science, vol 457. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53065-7_107
Download citation
DOI: https://doi.org/10.1007/3-540-53065-7_107
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53065-7
Online ISBN: 978-3-540-46597-3
eBook Packages: Springer Book Archive