Advertisement

On the Comparative Evaluation of Parallel Languages and Systems: A Functional Note

  • Robert E. Hiromoto
Part of the Workshops in Computing book series (WORKSHOPS COMP.)

Abstract

We propose a comparative approach to the incremental evaluation of parallel functional languages and their systems. The approach relies on the rich source of literature found in numerical software libraries though not restricted solely to them. The approach should extend itself to the analysis of imperative systems as well. This proposal will describe the advantages of such an approach using specific examples.

Keywords

Array Element Functional Language Loop Bound Loop Unroll Loop Rate 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    P.H. Hartel and W.G. Vree, Arrays in a Lazy Functional Language — a Case Study: the Fast Fourier Transform, Department of Computer Systems, Faculty of Mathematics and Computer Science, University of Amsterdam, Tech. Rep. CS-92-02.Google Scholar
  2. [2]
    Profiling Scheduling Strategies on the GRIP parallel reducer Department of Computing Science, University of Glasgow, 17 Lilybank Gardens, Glasgow, Scotland.Google Scholar
  3. [3]
    R.S. Nikhil, Id (version 90.0) Reference Manual, TR CSG Memo 284-1, MIT LCS 1990.Google Scholar
  4. [4]
    D. R. Morais, ID World: An Environment for the Development of Data flow Programs Written in ID, MIT LCS TR-365, may 1986.Google Scholar
  5. [5]
    A.P.W. Böhm and R.E. Hiromoto, The Dataflow Time Complexity of FFT, The Second Workshop on Data-flow: The 19th International Symposium on Computer Architecture, Hamilton Island, Australia, May 25-26, 1992.Google Scholar
  6. [6]
    A.P.W. Böhm and R.E. Hiromoto, The Dataflow Time and Space Complexity of FFT, The Journal of Parallel and Distributed Computing, Vol. 18, pp. 301–313 (1993).CrossRefGoogle Scholar
  7. [7]
    K. R. Traub, G. M. Papadopoulos, M. J. Beckerle, J.E. Hicks and J. Young, Overview of the Monsoon Project, ICCD91, IEEE, Oct 1991, pp 150–155.Google Scholar
  8. [8]
    Arvind, R.A. Ianucci, Instruction Set Definition for a Tagged Token Dataflow Machine, LCS, MIT, 1983Google Scholar
  9. [9]
    M. Wolfe, Optimizing Supercompilers for Supercomputers, MIT Press, 1989.Google Scholar

Copyright information

© British Computer Society 1994

Authors and Affiliations

  • Robert E. Hiromoto
    • 1
  1. 1.Division of Mathematics, Computer Science and StatisticsThe University of Texas at San AntonioSan AntonioUSA

Personalised recommendations