A scheduling scheme for communicating tasks

Author

Wu, Jie ; Fernandez, Eduardo B.

Author_Institution

Dept. of Comput. Eng., Florida Atlantic Univ., Boca Raton, FL, USA

fYear

1990

fDate

11-13 Mar 1990

Firstpage

91

Lastpage

97

Abstract

Heuristic methods are proposed for assigning a set of soft tasks to a set of PEs (processing elements) in such a way that the set of tasks has a minimum execution time. The objective is to try to meet the performance requirements of applications, especially of real-time applications. Emphasis is placed on specific applications where there are more PEs than active tasks. Two criteria are proposed to measure the quality of an interconnection for these applications. A simple grain-size decision algorithm that groups tasks that communicate with each other into one node is presented

Keywords

graph theory; optimisation; programming theory; scheduling; communicating tasks; execution time; grain-size decision algorithm; graph theory; heuristics; processing elements; programming theory; scheduling; soft tasks; Actuators; Application software; Constraint optimization; Delay effects; Job shop scheduling; Monitoring; Parallel processing; Processor scheduling; Real time systems; Robot sensing systems;

fLanguage

English

Publisher

ieee

Conference_Titel

System Theory, 1990., Twenty-Second Southeastern Symposium on

Conference_Location

Cookeville, TN

ISSN

0094-2898

Print_ISBN

0-8186-2038-2

Type

conf

DOI

10.1109/SSST.1990.138119

Filename

138119