A theory for the initial allocating of real time tasks in distributed systems
A Theory for the Initial Allocating of Real Time Tasks in Distributed Systems

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.