Learn More
Using runtime information of load distributions and processor affinity, we propose an adaptive scheduling algorithm and its variations from different control mechanisms. The proposed algorithm applies different degrees of aggressiveness to adjust loop scheduling granularities, aiming at improving the execution performance of parallel loops by making(More)
Referring to a set of real time tasks with arriving time, executing time and deadline, this paper discusses the problem of polynomial time initial-allocating approximation algorithms in a distributed system and five new results are gained which provide a theory for the designing of initial-allocating algorithms of real time tasks.
  • 1