Skip to main content
Log in

An algorithm reminiscent of euclidean-gcd for computing a function related to pinwheel scheduling

  • Published:
Algorithmica Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. 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.

    Article  MATH  MathSciNet  Google Scholar 

  2. H. Lenstra, Integer Programming with a Fixed Number of Variables,Mathematics of Operations Research, Vol. 8, No. 4, pp. 538–548, November 1983.

    Article  MATH  MathSciNet  Google Scholar 

  3. 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.

    Article  MATH  MathSciNet  Google Scholar 

  4. 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.

    Article  Google Scholar 

  5. M. Chan and F. Chin, Schedulers for Larger Classes of Pinwheel Instances,Algorithmica, Vol. 9, No. 5, pp. 425–462, May 1993.

    Article  MATH  MathSciNet  Google Scholar 

  6. 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.

  7. H. Wilf,Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, NJ, 1986.

    MATH  Google Scholar 

  8. X. Deng, Mathematical Programming: Complexity and Applications, Ph.D. Thesis, Stanford, 1989.

  9. E. Thorne, An Analysis of Majewski's NineLM Algorithms, Senior Thesis, Department of Computer Sciences, University of Texas at Austin, December 1989.

Download references

Author information

Authors and Affiliations

Authors

Additional information

Communicated by C. L. Liu.

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02523234

Key words

Navigation