Abstract
The functionLM, which arises in the pinwheel scheduling problem, was previously known to be computable in polynomial time. In this paper we present a practical algorithm to computeLM that runs in linear time.
Similar content being viewed by others
References
R. Holte, L. Rosier, I. Tulchinsky, and D. Varvel, Pinwheel Scheduling with Two Distinct Numbers,Theoretical Computer Science, Vol. 100, No. 1, pp. 105–135, June 1992.
H. Lenstra, Integer Programming with a Fixed Number of Variables,Mathematics of Operations Research, Vol. 8, No. 4, pp. 538–548, November 1983.
R. Kannan, A Polynomial Algorithm for the Two-Variable Integer Programming Problem,Journal of the ACM, Vol. 27, No. 1, pp. 118–122, January 1980.
M. Chan and F. Chin, General Schedulers for the Pinwheel Problem Based on Double-Integer Reduction,IEEE Transactions on Computers, Vol. 41, No. 6, pp. 755–768, June 1992.
M. Chan and F. Chin, Schedulers for Larger Classes of Pinwheel Instances,Algorithmica, Vol. 9, No. 5, pp. 425–462, May 1993.
A. Mok, L. Rosier, I. Tulchinsky, and D. Varvel, Algorithms and Complexity of the Periodic Maintenance Problem,Proceedings of the Fifteenth Symposium on Microprocessing and Microprogramming (EUROMICRO '89), pp. 657–664, Cologne, September 1989.
H. Wilf,Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, NJ, 1986.
X. Deng, Mathematical Programming: Complexity and Applications, Ph.D. Thesis, Stanford, 1989.
E. Thorne, An Analysis of Majewski's NineLM Algorithms, Senior Thesis, Department of Computer Sciences, University of Texas at Austin, December 1989.
Author information
Authors and Affiliations
Additional information
Communicated by C. L. Liu.
Rights and permissions
About this article
Cite this article
Romer, T.H., Rosier, L.E. An algorithm reminiscent of euclidean-gcd for computing a function related to pinwheel scheduling. Algorithmica 17, 1–10 (1997). https://doi.org/10.1007/BF02523234
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02523234