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

  • Paweł Wolniewicz
  • Maciej Drozdowski
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2328)


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.


Processing Time Memory Requirement Schedule Length Data Chunk Startup Time 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 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. 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. 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. 4.
    Błażewicz, J. and Drozdowski, M.: Scheduling Divisible Jobs on Hypercubes. Parallel Computing vol. 21 (1995) 1945–1956MathSciNetCrossRefGoogle Scholar
  5. 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–50Google Scholar
  6. 6.
    Błażewicz, J. and Drozdowski, M., Markiewicz, M.: Divisible task scheduling — concept and verification. Parallel Computing 25 (1999) 87–98MathSciNetzbMATHCrossRefGoogle Scholar
  7. 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–319Google Scholar
  8. 8.
    Drozdowski, M. and Głazek, W.: Scheduling divisible loads in a three-dimensional mesh of processors. Parallel Computing 25 (1999) 381–404MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Paweł Wolniewicz
    • 1
  • Maciej Drozdowski
    • 2
  1. 1.Poznań Supercomputing and Networking CenterPoznańPoland
  2. 2.Poznań University of TechnologyPoznańPoland

Personalised recommendations