LSTF: A new scheduling policy for complex real-time tasks in multiple processor systems

Authors

Bo Chao Cheng, New Jersey Institute of Technology
Alexander D. Stoyenko, New Jersey Institute of Technology
Thomas J. Marlowe, Seton Hall University
Sanjoy K. Baruah, New Jersey Institute of Technology

Document Type

Article

Publication Date

1-1-1997

Abstract

We propose a new algorithm, least space-time first (LSTF), for dealing with the general complex-task-multiple-processor model. The results of the proof and simulation shown that LSTF outperforms other established heuristic algorithms (such as earliest-deadline-first) in the sense that it minimizes the maximum tardiness of a set of tasks. LSTF can gracefully incorporate some realistic overhead assumptions, such as context switch.

Identifier

0031130974 (Scopus)

Publication Title

Automatica

External Full Text Location

https://doi.org/10.1016/S0005-1098(96)00245-2

ISSN

00051098

First Page

921

Last Page

926

Issue

5

Volume

33

Grant

CCR-9596282

Fund Ref

National Science Foundation

Recommended Citation

Cheng, Bo Chao; Stoyenko, Alexander D.; Marlowe, Thomas J.; and Baruah, Sanjoy K., "LSTF: A new scheduling policy for complex real-time tasks in multiple processor systems" (1997). Faculty Publications. 16880.
https://digitalcommons.njit.edu/fac_pubs/16880