Skip to main content
SpringerLink
Log in

Half-dynamic scheduling with data-flow control

  • Session 6A: Problem Mapping And Scheduling
  • Conference paper
  • First Online:
Supercomputing (ICS 1987)

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

Included in the following conference series:

  • 131 Accesses

Abstract

The main problem of parallel processing concerns how to utilize the multiple processors. Much effort has been put into increasing the utilization of the processors. This paper proposes scheduling algorithms for multiple processors combining static scheduling and dynamic scheduling with data-flow control. Evaluation is made in terms of feasibility, efficiency, and performance, through computer simulations.

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. R. D. Acosta, J. Kjelstrup, and H. C. Torng: “An Instruction Issuing Approach to Enhancing Performance in Multiple Functional Unit Processors,” IEEE Trans. on Computers, Vol.C-35, No.9, Sep. 1986, pp.815–828.

    Google Scholar 

  2. M. Amamiya, R. Hasegawa, and H. Mikami: “List Processing with Data Flow Machine,” RIMS Symposia on Software Science and Engineering, E. Goto, at.el. (editors), Lecture Notes in Computer Science, Springer-Verlag, 1982, pp.165–190.

    Google Scholar 

  3. Arvind and V. Kathail: “A Multiple Processor Dataflow Machine that Supports Generalized Procedures,” Proc. of the 8th Annual Symposium on Computer Architecture, May 1981.

    Google Scholar 

  4. E. G. Coffman, Jr.: “Computer and Job-Shop Scheduling Theory,” John Wiley & Sons, 1976.

    Google Scholar 

  5. H. Sunahara and M. Tokoro: “Evaluation of Working Set Algorithms for Data-flow Machine,” RIMS Symposia on Software Science and Engineering, E. Goto, at.el. (editors), Lecture Notes in Computer Science, No.220, Springer-Verlag, 1984, pp.233–260.

    Google Scholar 

  6. H. Sunahara and M. Tokoro: “On the Working Set Concept for Data-flow Machines: Policies and Their Evaluation,” Fifth Generation Computer Architectures, J.V. Woods (editor), Elsevier Science Publishers B.V. (North-Holland), 1986, pp.147–160.

    Google Scholar 

  7. M. Tokoro, J. R. Jagannathan, and H. Sunahara: “On the Working Set Concept for Data-flow Machine,” Proc. of 10th Annual Symposium on Computer Architecture, Jun. 1983, pp.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, Vol.14, No.1, Mar. 1982, pp.93–143.

    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

E. N. Houstis T. S. Papatheodorou C. D. Polychronopoulos

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sunahara, H., Tokoro, M. (1988). Half-dynamic scheduling with data-flow control. In: Houstis, E.N., Papatheodorou, T.S., Polychronopoulos, C.D. (eds) Supercomputing. ICS 1987. Lecture Notes in Computer Science, vol 297. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18991-2_32

Download citation

  • DOI: https://doi.org/10.1007/3-540-18991-2_32

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18991-6

  • Online ISBN: 978-3-540-38888-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation