- Author:
- E. L. Lloyd
Minimum execution time scheduling of task systems with resources has been the subject of several papers over the past few years. The model used for much of this work assumes that the resources associated with computer systems - readers, printers, disk drives - are not "continuous" resources. We present an alternative model of task systems with resources in which the resources are discrete. That is, there are a specific number of indivisible units of each resource and a task may require only integral numbers of those units. Several results involving the worst case performance of list scheduling and critical path scheduling with respect to this model are given. A new result on critical path scheduling of task systems with continuous resources is also given. Finally, a comparison will be made between corresponding bounds for the continuous and discrete models.
Cited By
David R Parallel Ada on Alliant's FX/series Proceedings of the conference on TRI-Ada '88, (135-146)- Cockerham B Parallel compilation of Ada units Proceedings of the conference on TRI-Ada '88, (147-164)
- Bernstein D, Pinter R and Rodeh M Optimal scheduling of arithmetic operations in parallel with memory access (preliminary version) Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (325-333)
- Lloyd E Critical path scheduling of task systems with resource and processor constraints (Extended Abstract) Proceedings of the twelfth annual ACM symposium on Theory of computing, (436-446)
Recommendations
Adaptive task resources allocation in multi-agent systems
AGENTS '01: Proceedings of the fifth international conference on Autonomous agentsIn this paper, we present an adaptive organizational policy for multi-agent systems called \acro{trace}. \acro{trace} allows a collection of multi-agent organizations to dynamically allocate tasks and resources between themselves in order to ...
Priority-Driven Scheduling of Periodic Task Systems on Multiprocessors
The scheduling of systems of periodic tasks upon multiprocessor platforms is considered. Utilization-based conditions are derived for determining whether a periodic task system meets all deadlines when scheduled using the earliest deadline first ...
Low power fixed priority scheduling sporadic task with shared resources in hard real time systems
We consider a scheduling problem of the sporadic task that shares resources.We present a new scheduling policy based on a fixed-priority scheduling.The energy management problem is considered in a real time system.Two techniques are presented to solve a ...