Skip to main content
SpringerLink
Log in

Divisible Loads Scheduling in Hierarchical Memory Systems with Time and Energy Constraints

  • Conference paper
  • First Online:
Parallel Processing and Applied Mathematics

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9574))

Abstract

In this paper we consider scheduling distributed divisible computations in systems with hierarchical memory for energy and time performance criteria. Hierarchical memory allows to conduct computations on big data sets using out-of-core processing instead of coercing application data fit into core storage. However, out-of-core computations are more costly both in time and energy. A model for scheduling divisible loads under time and energy criteria is introduced. Two types of scheduling algorithms are proposed and evaluated: a single-installment algorithm which builds optimum schedules but may use out-of-core storage, and a set of multi-installment algorithms which use limited memory but require more communications.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Agrawal, R., Jagadish, H.V.: Partitioning techniques for large-grained parallelism. IEEE Trans. Comput. 37, 1627–1634 (1988)

    Article  Google Scholar 

  2. Berlińska, J., Drozdowski, M.: Scheduling divisible MapReduce computations. J. Parallel Distrib. Comput. 71, 450–459 (2011)

    Article  MATH  Google Scholar 

  3. Bharadwaj, V., Ghose, D., Mani, V., Robertazzi, T.: Scheduling Divisible Loads in Parallel and Distributed Systems. IEEE Computer Society Press, Los Alamitos (1996)

    Google Scholar 

  4. Cheng, Y.-C., Robertazzi, T.G.: Distributed computation with communication delay. IEEE Trans. Aerosp. Electron. Syst. 24, 700–712 (1988)

    Article  Google Scholar 

  5. Drozdowski, M.: Scheduling for Parallel Processing. Springer, London (2009)

    Book  MATH  Google Scholar 

  6. Drozdowski, M., Marszałkowski, J.M., Marszałkowski, J.: Energy trade-offs analysis using equal-energy maps. Future Gener. Comput. Syst. 36, 311–321 (2014)

    Article  Google Scholar 

  7. Drozdowski, M., Wolniewicz, P.: Out-of-core divisible load processing. IEEE Trans. Parallel Distrib. Syst. 14, 1048–1056 (2003)

    Article  Google Scholar 

  8. Fuller, S.H., Millett, L.I.: Computing performance: game over or next level? Computer 41, 31–38 (2011)

    Article  Google Scholar 

  9. Katz, R.H.: Tech titans building boom. IEEE Spectr. 46(INT), 36–49 (2009). http://www.spectrum.ieee.org/feb09/7327

    Google Scholar 

  10. Marszałkowski, J.M., Drozdowski, M., Marszałkowski, J.: Time and energy performance of parallel systems with hierarchical memory. J. Grid Comput. (2015, accepted). doi:10.1007/s10723-015-9345-8

    Google Scholar 

  11. Mills, R.T., Yue, C., Stathopoulos, A., Nikolopoulos, D.S.: Runtime and programming support for memory adaptation in scientific applications via local disk and remote memory. J. Grid Comput. 5, 213–234 (2007)

    Article  Google Scholar 

  12. Robertazzi, T.: Ten reasons to use divisible load theory. IEEE Comput. 36, 63–68 (2003)

    Article  Google Scholar 

  13. Sohn, J., Robertazzi, T.G., Luryi, S.: Optimizing computing costs using divisible load analysis. IEEE Trans. Parallel Distrib. Syst. 9, 225–234 (1998)

    Article  Google Scholar 

  14. The Green 500, November 2014. http://www.green500.org/

Download references

Author information

Authors and Affiliations

  1. Institute of Computing Science, Poznań University of Technology, Piotrowo 2, 60-965, Poznań, Poland

    Maciej Drozdowski & Jędrzej M. Marszałkowski

Authors
  1. Maciej Drozdowski
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jędrzej M. Marszałkowski
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Maciej Drozdowski .

Editor information

Editors and Affiliations

  1. Czestochowa University of Technolog, Czestochowa, Poland

    Roman Wyrzykowski

  2. Department of Computer Science, University of Southern California, Marina Del Rey, California, USA

    Ewa Deelman

  3. Electrical Engineering & Comput. Science, University of Tennessee, Knoxville, Tennessee, USA

    Jack Dongarra

  4. Czestochowa University of Technology, Institute of Computer & Information Sci., Czestochowa, Poland

    Konrad Karczewski

  5. Department of Computer Science, AGH University of Science and Technology, Krakow, Poland

    Jacek Kitowski

  6. Systèmes d’informations, Big Data et Rec, AGH University of Science and Technology, Krakow, Poland

    Kazimierz Wiatr

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Drozdowski, M., Marszałkowski, J.M. (2016). Divisible Loads Scheduling in Hierarchical Memory Systems with Time and Energy Constraints. In: Wyrzykowski, R., Deelman, E., Dongarra, J., Karczewski, K., Kitowski, J., Wiatr, K. (eds) Parallel Processing and Applied Mathematics. Lecture Notes in Computer Science(), vol 9574. Springer, Cham. https://doi.org/10.1007/978-3-319-32152-3_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-32152-3_11

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-32151-6

  • Online ISBN: 978-3-319-32152-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation