Skip to main content
SpringerLink
Log in

Evaluation of working set algorithms for data-flow machines

  • Conference paper
  • First Online:
RIMS Symposia on Software Science and Engineering II

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 220))

Abstract

This paper extends the algorithms for implementing the working set concept for data-flow machines proposed in [7] in order to cope with dynamic data-flow programs which include branches, loops, and procedure calls. The algorithms for computing the D-, E-, and L-levels are revised and the performance for static data-flow programs is reevaluated. Algorithms to manage branches, loops, and function calls are developed. The effectiveness of these algorithms is shown through computer simulation.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. W. B. Ackerman, "A Structure Processing Facility for Data Flow Computers," Proc. 8th International Conference on Parallel Processing, 1978.

    Google Scholar 

  2. W. B. Ackerman, "A Structure Controller for Data Flow Computers," CGS Memo 156, MIT, Jan 1978.

    Google Scholar 

  3. Arvind and R. Thomas, "I-structures: An efficient data type for functional languages," Univ. of California Irvine Technical Report, 1980.

    Google Scholar 

  4. Arvind and V. Katathail, "A Multiple processor Data-Flow Machine that Supports Generalized Procedures," Proc. 8th Annual Symposium on Computer Architecture, Mineapolis, Minnesota, 1981, 291–302.

    Google Scholar 

  5. H. Asakura, H. Sunahara and M. Tokoro, "A Note on the Structure Memory for the Data-flow Machines with the Working Set Concept," Proc. of the 28th National Conference of Information Processing Society of Japan, Tokyo Japan, March 1984, 4F-10 (in Japanese).

    Google Scholar 

  6. J. B. Dennis and D. P. Misunas, "A preliminary Architecture for a Basic Data Flow Processor," Proc. 2nd Annual Symp osium on Computer Architecture, Jan 1975, 126–132.

    Google Scholar 

  7. M. Tokoro, J. R. Jagannathan and H. Sunahara, "On the Working Set Concept for Data-Flow Machine," Proc. of the 10th Annual Symposium on Computer Architecture, Jun. 1983, 90–97.

    Google Scholar 

  8. P. C. Treleaven, D. R. Brownbridge and R. P. Hopkins, "Data-Driven and Demand-Driven Computer Architecture," ACM Computing Surveys 14, 1 (Mar. 1982), 93–143.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering, Keio University, 223, Yokohama, Japan

    Hideki Sunahara & Mario Tokoro

Authors
  1. Hideki Sunahara
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mario Tokoro
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Eichi Goto Keijiro Araki Taiichi Yuasa

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sunahara, H., Tokoro, M. (1986). Evaluation of working set algorithms for data-flow machines. In: Goto, E., Araki, K., Yuasa, T. (eds) RIMS Symposia on Software Science and Engineering II. Lecture Notes in Computer Science, vol 220. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16470-7_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-16470-7_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16470-8

  • Online ISBN: 978-3-540-39809-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation