Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
References
Yan Yong and Liu Jian, Optimal initial allocating algorithms for a set of real time tasks in distributed systems.Chinese Journal of Computers (in Chinese), 1989, 12 (5), 328–334.
Yan Yong and Liu Jian, Two efficient approximation algorithms for the initial allocating of real time tasks in distributed systems.Chinese Journal of Computers (in Chinese), 1989, 12 (5), 397–400.
M. R. Garey and D. S. Johnson, Approximation Algorithms for Combinatorial Problem: An Annotated Bibliography. InAlgorithm and Complexity: Recent Results and New Directions, Ed. by J. Traub, Academic Press, 1976.
E. Horowitz and S. Sahni (Ed.), Fundamentals of Computer Algorithms. Computer Science Press, INC., 1978.
M. R. Garey and D. S. Johnson, Two-processor scheduling with start time and deadlines.SIAM J. Comput., 1977, (6).
M. R. Garey and D. S., Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. Computer Science Press, INC., Printed in the U.S.A., 1979.
K. Ramamrithm and J. A. Stankovic, Dynamic task scheduling in distributed hard real-time systems.IEEE Software, 1984. (1).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Yan, Y., Jin, C. A theory for the initial allocating of real time tasks in distributed systems. J. of Comput. Sci. & Technol. 7, 185–188 (1992). https://doi.org/10.1007/BF02945772
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02945772