Half-dynamic scheduling with data-flow control

Hideki Sunahara, Mario Tokoro

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish
Title of host publicationSupercomputing - 1st International Conference, Proceedings
PublisherSpringer Verlag
Pages552-562
Number of pages11
Volume297 LNCS
ISBN (Print)9783540189916
DOIs
Publication statusPublished - 1988 Jan 1
Event1st International Conference on Supercomputing, 1987 - Athens, Greece
Duration: 1987 Jun 81987 Jun 12

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume297 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other1st International Conference on Supercomputing, 1987
CountryGreece
CityAthens
Period87/6/887/6/12

    Fingerprint

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Sunahara, H., & Tokoro, M. (1988). Half-dynamic scheduling with data-flow control. In Supercomputing - 1st International Conference, Proceedings (Vol. 297 LNCS, pp. 552-562). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 297 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-18991-2_32