Skip to main content
Log in

Barely Random Algorithms for Multiprocessor Scheduling

  • Published:
Journal of Scheduling Aims and scope Submit manuscript

Abstract

We consider randomized algorithms for on-line scheduling on identical machines. For two machines, a randomized algorithm achieving a competitive ratio of \(\tfrac{4}{3}\) was found by Bartal et al. (1995). Seiden has presented a randomized algorithm which achieves competitive ratios of 1.55665, 1.65888, 1.73376, 1.78295, and 1.81681, for m=3, 4, 5, 6, 7, respectively (Seiden, 2000). A barely random algorithm is one which is a distribution over a constant number of deterministic strategies. The algorithms of Bartal et al. and Seiden are not barely random–in fact, these algorithms potentially make a random choice for each job scheduled. We present the first barely random on-line scheduling algorithms. In addition, our algorithms use less space and time than the previous algorithms, asymptotically.

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

  • Albers, S., “Better bounds for online scheduling,” SIAM J. Comput., 29(2), 459-473 (1999).

    Google Scholar 

  • Bartal, Y., M. Chrobak, and L. L. Larmore, “A randomized algorithm for two servers on the line,” Inform. Comput., 158(1), 53-69, April 2000.

    Google Scholar 

  • Bartal, Y., A. Fiat, H. Karloff, and R. Vohra, “New algorithms for an ancient scheduling problem,” J. Comput. Syst. Sci., 51(3), 359-366, December 1995.

    Google Scholar 

  • Bartal, Y., H. Karloff, and Y. Rabani, “A better lower bound for on-line scheduling,” Inform. Process. Lett., 50(3), 113-116 (May 1994).

    Google Scholar 

  • Ben-David, S., E. Dichterman, J. Noga, and S. S. Seiden, “On the power of barely random online algorithms,” Manuscript.

  • Chen, B., A. van Vliet, and G. Woeginger, “A lower bound for randomized on-line scheduling algorithms,” Inform. Process. Lett., 51(5), 219-222 (September 1994a).

    Google Scholar 

  • Chen, B., A. van Vliet, and G. Woeginger, “New lower and upper bounds for on-line scheduling,” Oper. Res. Lett., 16(4), 221-230 (November 1994b).

    Google Scholar 

  • Epstein, L., J. Noga, S. Seiden, J. Sgall, and G. Woeginger, “Randomized online scheduling on two uniform machines,” J. Scheduling, 4(2), 71-92 (March/April 2001).

    Google Scholar 

  • Faigle, U., W. Kern, and G. Turàn, “On the performance of on-line algorithms for partition problems,” Acta Cybernetica, 9(2), 107-119, 1989.

    Google Scholar 

  • Fleischer, R. and M. Wahl, “Online scheduling revisited,” J. Scheduling, 3(6), 343-353 (November/December 2000).

    Google Scholar 

  • Galambos, G. and G. Woeginger, “An online scheduling heuristic with better worst case ratio than Graham's list scheduling,” SIAM J. Comput., 22(2), 349-355 April 1993.

    Google Scholar 

  • Gormley, T., N. Reingold, E. Torng, and J. Westbrook, “Generating adversaries for request-answer games,” in Proc. 11th ACM-SIAM Symp. on Discrete Algorithms, 2000, pp. 564-565.

  • Graham, R. L., “Bounds for certain multiprocessing anomalies,” Bell Syst. Tech. J., 45, 1563-1581 (1966).

    Google Scholar 

  • Karger, D., S. Phillips, and E. Torng, “A better algorithm for an ancient scheduling problem,” J. Algorithms, 20(2), 400-430 (March 1996).

    Google Scholar 

  • Reingold, N., J. Westbrook, and D. Sleator, “Randomized competitive algorithms for the list update problem,” Algorithmica, 11(1), 15-32 (January 1994).

    Google Scholar 

  • Seiden, S. S., “Randomized online multiprocessor scheduling,” Algorithmica, 28(2), 173-216 (2000).

    Google Scholar 

  • Sgall, J., “A lower bound for randomized on-line multiprocessor scheduling,” Inform. Process. Lett., 63(1), 51-55 (July 1997).

    Google Scholar 

  • Sgall, J., April 1998, Personal Communication.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Seiden, S. Barely Random Algorithms for Multiprocessor Scheduling. Journal of Scheduling 6, 309–334 (2003). https://doi.org/10.1023/A:1022960526107

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1022960526107

Keywords

Navigation