End-to-end scheduling to meet deadlines in distributed systems

Author

Bettati, R. ; Liu, Jane W S

Author_Institution

Dept. of Comput. Sci., Illinois Univ., Urbana, IL, USA

fYear

1992

fDate

9-12 Jun 1992

Firstpage

452

Lastpage

459

Abstract

Algorithms for scheduling a class of systems in which all the tasks execute on different processors in turn in the same order are described. This end-to-end scheduling problem is known as the flow-shop problem. Two cases in which the problem is tractable are presented, and a heuristic for the NP-hard general case is evaluated. The traditional flow-shop model is generalized in two directions. First, an algorithm for scheduling flow shops in which tasks can be serviced more than once by some processors is presented. Second, a heuristic algorithm for scheduling flow shops with periodic tasks is described. Scheduling systems with more than one flow shop are considered

Keywords

computational complexity; distributed processing; heuristic programming; scheduling; NP-hard general case; distributed systems; end-to-end scheduling; flow-shop problem; heuristic; heuristic algorithm; Communication networks; Computer science; Distributed computing; Heuristic algorithms; Intelligent networks; Job shop scheduling; Processor scheduling; Scheduling algorithm; Time factors; Timing;

fLanguage

English

Publisher

ieee

Conference_Titel

Distributed Computing Systems, 1992., Proceedings of the 12th International Conference on

Conference_Location

Yokohama

Print_ISBN

0-8186-2865-0

Type

conf

DOI

10.1109/ICDCS.1992.235009

Filename

235009