Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Processing Time and Memory Requirements for Multi-instalment Divisible Job Processing

  • Conference paper
  • First Online:
Parallel Processing and Applied Mathematics (PPAM 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2328))

Abstract

Divisible job model is a very efficient tool representing certain kind of distributed computations. It can be applied for jobs that can be divided into an arbitrary number of independent tasks. In this work we analyse a new type of communication that can shorten the schedule length and reduce memory requirements. Two types of multi-instalment processing models are taken into account; their influence on processing time and memory requirements is examined.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bataineh, S., Robertazzi, T.: Distributed computation for a bus network with communication delays. Proceedings of the 25-th Conference in Information Sciences and Systems, Baltimore (1991)

    Google Scholar 

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

    Google Scholar 

  3. V. Bharadwaj, D Ghose, V. Mani, An efficient load distribution strategy for a distributed linear network of processors with communication delays. Computer Math. Applic. (1995)

    Google Scholar 

  4. Błażewicz, J. and Drozdowski, M.: Scheduling Divisible Jobs on Hypercubes. Parallel Computing vol. 21 (1995) 1945–1956

    Article  MathSciNet  Google Scholar 

  5. Błażewicz, J. and Drozdowski, M., Guinand, F., Trystram, D.: Scheduling a divisible task in a 2-dimensional mesh. Discrete Applied Mathematics 94(1-3), (1999 June) 35–50

    Google Scholar 

  6. Błażewicz, J. and Drozdowski, M., Markiewicz, M.: Divisible task scheduling — concept and verification. Parallel Computing 25 (1999) 87–98

    Article  MathSciNet  MATH  Google Scholar 

  7. Drozdowski, M. and Wolniewicz, P.: Experiments with Scheduling Divisible Tasks in Clusters of Workstations. in A. Bode, T. Ludwig, W. Karl, R. Wismüler (eds.): EURO-Par 2000, LNCS 1900, Springer-Verlag (2000) 311–319

    Google Scholar 

  8. Drozdowski, M. and Głazek, W.: Scheduling divisible loads in a three-dimensional mesh of processors. Parallel Computing 25 (1999) 381–404

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Poznań Supercomputing and Networking Center, ul. Noskowskiego 10, 61-704, Poznań, Poland

    Paweł Wolniewicz

  2. Poznań University of Technology, ul. Piotrowo 3a, 60-965, Poznań, Poland

    Maciej Drozdowski

Authors
  1. Paweł Wolniewicz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Maciej Drozdowski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Mathematics and Computer Science, Technical University of Czestochowa, Dabrowskiego 73, 42-200, Czestochowa, Poland

    Roman Wyrzykowski

  2. Computer Science Department, University of Tennessee, 122 Volunteer Blvd, Knoxville, TN, 37996-3450, USA

    Jack Dongarra

  3. Computer Science Department, Oklahoma State University, 700 N. Greenwood Ave., Tulsa, OK, 74106, USA

    Marcin Paprzycki

  4. DTU, UNI-C, Danish Computing Centre for Research and Education, Bldg. 304, 2800, Lyngby, Denmark

    Jerzy Waśniewski

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wolniewicz, P., Drozdowski, M. (2002). Processing Time and Memory Requirements for Multi-instalment Divisible Job Processing. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2001. Lecture Notes in Computer Science, vol 2328. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48086-2_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-48086-2_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43792-5

  • Online ISBN: 978-3-540-48086-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation