Preemptive Task Scheduling for Distributed Systems ?

@inproceedings{Radulescu2000PreemptiveTS,
  title={Preemptive Task Scheduling for Distributed Systems ?},
  author={Andrei Radulescu and Arjan J. C. van Gemund},
  year={2000}
}
Task scheduling in a preemptive runtime environment has pot ential advantages over the non-preemptive case such as better processor utilization and more flexibility when scheduling tasks. Furthermore, preemptive approa ches may need less runtime support (e.g. no task ordering required). In contrast to the non-preemptive case, preemptive task scheduling in a distributed system has not receive d much attention. In this paper we present a low-cost algorithm, called the Preemptive Task Scheduling… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-4 of 4 extracted citations

Fast Preemptive Task Scheduling Algorithm for Homogeneous and Heterogeneous Distributed Memory Systems

2008 Ninth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing • 2008
View 4 Excerpts
Highly Influenced

An intelligent multi-agent distributed battlefield via Multi-Token Message Passing

2009 IEEE International Conference on Computational Intelligence for Measurement Systems and Applications • 2009

References

Publications referenced by this paper.
Showing 1-9 of 9 references

Preemptive task sche duling for distributed systems. TR 1-68340-44(2000)04

A. Rădulescu, A.J.C. van Gemund
Delft Univ. of Technology, • 2000
View 2 Excerpts

Jr.Operating Systems Theory

E. G. Coffman
1973

Similar Papers

Loading similar papers…