Skip to main content

Advertisement

Springer Nature Link
Log in

Improved multi-processor scheduling for flow time and energy

  • Published:
Journal of Scheduling Aims and scope Submit manuscript

Abstract

Energy usage has been an important concern in recent research on online scheduling. In this paper, we study the tradeoff between flow time and energy (Albers and Fujiwara in ACM Trans. Algorithms 3(4), 2007; Bansal et al. in Proceedings of ACM-SIAM Symposium on Discrete Algorithms, pp. 805–813, 2007b, Bansal et al. in Proceedings of International Colloquium on Automata, Languages and Programming, pp. 409–420, 2008; Lam et al. in Proceedings of European Symposium on Algorithms, pp. 647–659, 2008b) in the multi-processor setting. Our main result is an enhanced analysis of a simple non-migratory online algorithm called CRR (classified round robin) on m≥2 processors, showing that its flow time plus energy is within O(1) times of the optimal non-migratory offline algorithm, when the maximum allowable speed is slightly relaxed. The result still holds even if the comparison is made against the optimal migratory offline algorithm. This improves previous analysis that CRR is O(log P)-competitive where P is the ratio of the maximum job size to the minimum job size.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  • Albers, S., & Fujiwara, H. (2007). Energy-efficient algorithms for flow time minimization. ACM Transactions on Algorithm, 3(4), 49.

    Article  Google Scholar 

  • Albers, S., Muller, F., & Schmelzer, S. (2007). Speed scaling on parallel processors. In Proceedings of symposium on parallelism in algorithms and architectures (pp. 289–298).

  • Avrahami, N., & Azar, Y. (2007). Minimizing total flow time and total completion time with immediate dispatching. Algorithmica, 47(3), 253–268.

    Article  Google Scholar 

  • Awerbuch, B., Azar, Y., Leonardi, S., & Regev, O. (2002). Minimizing the flow time without migration. SIAM Journal on Computing, 31(5), 1370–1382.

    Article  Google Scholar 

  • Bansal, N., Chan, H. L., Lam, T. W., & Lee, L. K. (2008). Scheduling for speed bounded processors. In Proceedings of international colloquium on automata, languages and programming (pp. 409–420).

  • Bansal, N., Kimbrel, T., & Pruhs, K. (2007a). Speed scaling to manage energy and temperature. Journal of the ACM, 54(1), 3.

    Article  Google Scholar 

  • Bansal, N., Pruhs, K., & Stein, C. (2007b). Speed scaling for weighted flow time. In Proceedings of ACM-SIAM symposium on discrete algorithms (pp. 805–813).

  • Brooks, D. M., Bose, P., Schuster, S. E., Jacobson, H., Kudva, P. N., Buyuktosunoglu, A., Wellman, J. D., Zyuban, V., Gupta, M., & Cook, P. W. (2000). Power-aware microarchitecture: design and modeling challenges for next-generation microprocessors. IEEE Micro, 20(6), 26–44.

    Article  Google Scholar 

  • Bunde, D. P. (2009). Power-aware scheduling for makespan and flow. Journal of Scheduling, 12(5), 489–500.

    Article  Google Scholar 

  • Chan, H. L., Chan, W. T., Lam, T. W., Lee, L. K., Mak, K. S., & Wong, P. W. H. (2007). Energy efficient online deadline scheduling. In Proceedings of ACM-SIAM symposium on discrete algorithms (pp. 795–804).

  • Chan, H. L., Lam, T. W., & To, K. K. (2005). Nonmigratory online deadline scheduling on multiprocessors. SIAM Journal on Computing, 34(3), 669–682.

    Article  Google Scholar 

  • Chekuri, C., Goel, A., Khanna, S., & Kumar, A. (2004). Multi-processor scheduling to minimize flow time with ε resource augmentation. In Proceedings of ACM symposium on theory of computing (pp. 363–372).

  • Chekuri, C., Khanna, S., & Zhu, A. (2001). Algorithms for minimizing weighted flow time. In Proceedings of ACM symposium on theory of computing (pp. 84–93).

  • Grunwald, D., Levis, P., Farkas, K. I., Morrey, C. B., & Neufeld, M. (2000). Policies for dynamic clock scheduling. In Proceedings of symposium on operating systems design and implementation (pp. 73–86).

  • Irani, S., & Pruhs, K. (2005). Algorithmic problems in power management. SIGACT News, 32(2), 63–76.

    Article  Google Scholar 

  • Irani, S., Shukla, S., & Gupta, R. K. (2007). Algorithms for power savings. ACM Transactions on Algorithm, 3(4), 41.

    Article  Google Scholar 

  • Kalyanasundaram, B., & Pruhs, K. (2001). Eliminating migration in multi-processor scheduling. Journal of Algorithms, 38, 2–24.

    Article  Google Scholar 

  • Lam, T. W., Lee, L. K., To, I. K. K., & Wong, P. W. H. (2008a). Non-migratory multi-processor scheduling for response time and energy. IEEE Transactions on Parallel and Distributed Systems, 19(11), 1527–1539.

    Article  Google Scholar 

  • Lam, T. W., Lee, L. K., To, I. K. K., & Wong, P. W. H. (2008b). Speed scaling functions for flow time scheduling based on active job count. In Proceedings of European symposium on algorithms (pp. 647–659).

  • Leonardi, S., & Raz, D. (2007). Approximating total flow time on parallel machines. Journal of Computer and System Sciences, 73(6), 875–891.

    Article  Google Scholar 

  • McCullough, J., & Torng, E. (2008). SRPT optimally utilizes faster machines to minimize flow time. ACM Transactions on Algorithms, 5(1), 1.

    Google Scholar 

  • Mudge, T. (2001). Power: a first-class architectural design constraint. Computer, 34(4), 52–58.

    Article  Google Scholar 

  • Phillips, C. A., Stein, C., Torng, E., & Wein, J. (2002). Optimal time-critical scheduling via resource augmentation. Algorithmica, 32(2), 163–200.

    Article  Google Scholar 

  • Pillai, P., & Shin, K. G. (2001). Real-time dynamic voltage scaling for low-power embedded operating systems. In Proceedings of ACM symposium on operating systems principles (pp. 89–102).

  • Pruhs, K., Sgall, J., & Torng, E. (2004). Online scheduling. In J. Leung (Ed.), Handbook of scheduling: algorithms, models and performance analysis (pp. 15-1–15-4). Boca Raton: CRC Press.

    Google Scholar 

  • Pruhs, K., van Stee, R., & Uthaisombut, P. (2008a). Speed scaling of tasks with precedence constraints. Theory of Computing Systems, 43(1), 67–80.

    Article  Google Scholar 

  • Pruhs, K., Uthaisombut, P., & Woeginger, G. (2008b). Getting the best response for your erg. ACM Transactions on Algorithms, 4(3), 38.

    Article  Google Scholar 

  • Weiser, M., Welch, B., Demers, A., & Shenker, S. (1994). Scheduling for reduced CPU energy. In Proceedings of symposium on operating systems design and implementation (pp. 13–23).

  • Yao, F., Demers, A., & Shenker, S. (1995). A scheduling model for reduced CPU energy. In Proceedings of symposium on foundations of computer science (pp. 374–382).

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Hong Kong, Hong Kong, Hong Kong

    Tak-Wah Lam & Lap-Kei Lee

  2. Department of Computer Science, University of Liverpool, Liverpool, UK

    Isaac K. K. To & Prudence W. H. Wong

Authors
  1. Tak-Wah Lam
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Lap-Kei Lee
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Isaac K. K. To
    View author publications

    You can also search for this author inPubMed Google Scholar

  4. Prudence W. H. Wong
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Prudence W. H. Wong.

Additional information

A preliminary version of this paper appeared in the proceedings of the Twentieth ACM Symposium on Parallelism in Algorithms and Architectures, 2008.

T.W. Lam is partially supported by HKU Grant 7176104.

I.K.K. To and P.W.H. Wong are partially supported by EPSRC Grant EP/E028276/1.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lam, TW., Lee, LK., To, I.K.K. et al. Improved multi-processor scheduling for flow time and energy. J Sched 15, 105–116 (2012). https://doi.org/10.1007/s10951-009-0145-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10951-009-0145-5