Multiprocessor on-line scheduling of hard-real-time tasks

Journal Article · Thu Nov 30 23:00:00 EST 1989 · IEEE (Institute of Electrical and Electronics Engineers) Transactions on Software Engineering; (USA)

DOI:https://doi.org/10.1109/32.58762· OSTI ID:6930695

Dertouzos, M L ^[1]; Mok, A K.L. ^[2]

---

1. Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA (US)
2. Dept of Computer Science, Univ of Texas, Austin, TX (US)

The problems of hard-real-time task scheduling in a multiprocessor environment are discussed in terms of a scheduling game representation of the problem. It is shown that optimal scheduling with a priori knowledge is impossible in the multiprocessor case even if there is no restriction on preemption owing to precedence of mutual exclusion constraints. Sufficient conditions are derived which will permit a set of tasks to be optimally scheduled at run time.

• OSTI ID: 6930695
• Journal Information: IEEE (Institute of Electrical and Electronics Engineers) Transactions on Software Engineering; (USA), Journal Name: IEEE (Institute of Electrical and Electronics Engineers) Transactions on Software Engineering; (USA) Vol. 15:12; ISSN 0098-5589; ISSN IESED
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
990200* -- Mathematics & Computers
ARRAY PROCESSORS
CONSTRAINTS
DATA PROCESSING
DESIGN
ON-LINE MEASUREMENT SYSTEMS
ON-LINE SYSTEMS
OPTIMIZATION
PROCESSING
REAL TIME SYSTEMS
TASK SCHEDULING