DPARTS. A Dynamic Parallel Adaptive Multiprocessor Real-Time Scheduler.
Progress rept. no. 1, 1 Jul 93-30 Jun 94,
GEORGIA INST OF TECH ATLANTA COLL OF COMPUTING
Pagination or Media Count:
The research questions addressed in this work focus on the development of fast heuristic algorithms, on experimentation with those algorithms, and on the use of such algorithms within the music applications. We are not developing optimal algorithms since all of the scheduling and assignment problems we are addressing have been shown NP-hard. Some specific questions we are addressing include When should DPARTS be invoked What is the required frequency of DPARTS invocation with respect to the latency of scheduling decisions and the overheads incurred by scheduling Should DPARTS have the option of rescheduling existing tasks if such rescheduling can result in the successful scheduling of otherwise unschedulable process sequences Deadline semantics. In our sample music application, precise deadlines are usually not necessary in order to produce acceptable results. As such we are evaluating what type of semantics are appropriate for addressing the application we are scheduling. AN
- Computer Programming and Software