Real-time Scheduling on Heterogeneous
Multiprocessors
The Challenge. It is often the case
that these multiprocessor platforms are not completely homogeneous,
but are comprised of several different kinds of processors and other
resources. We are studying scheduling-theoretic issues that arise when
real-time systems are implemented upon such heterogeneous
multi-resource platforms.
The Approach. We are studying the
problem from several different perspectives:
- We are exploring the computational
complexity of determining whether real-time systems specified
in certain popular models (e.g., the periodic task model) can
be scheduled to meet all deadlines upon specified uniform
multiprocessor platforms.
- The earliest deadline first scheduling algorithm (EDF) is very commonly used in uniprocessor
real-time systems. We are developing the algorithms and analysis
tools necessary to be able to apply EDF to uniform multiprocessor
systems.
- Static priority scheduling algorithms,
such as the rate-monotonic algorithm, are very popular with the
designers of (uniprocessor) real-time systems. We are developing the
algorithms and analysis tools necessary for extending staticl-priority
scheduling algorithms in general (the rate-monotonic scheduling
algorithm, in particular) to uniform multiprocessor systems.
Associated Personnel.
Funding provided by: The National Science Foundation
Last updated on 2001/11/27 by SkB.