Skip to main content
SpringerLink
Log in
Book cover

Scheduling for Parallel Processing pp 209–299Cite as

Scheduling with Communication Delays

  • Chapter
  • First Online:

Part of the book series: Computer Communications and Networks ((CCN))

Abstract

In this chapter, we consider scheduling with communication delays. This model assumes that a parallel application is a set of sequential communicating processes (or threads) which can be represented as a directed acyclic graph (DAG). Execution of the tasks in a distributed system causes communication delays if the predecessor and the successor tasks are executed on different processors. Beyond introducing the communication delays, classic scheduling theory assumptions are generally accepted here.

The rest of this chapter is organized in the following way. In Sect. 6.1 motivation for scheduling with communication delays is given with examples of task graphs for parallel algorithms. The scheduling problem is formulated in Sect. 6.2, where variants of the communication delay models are also discussed. A shorthand notation of the scheduling problems is introduced in Sect. 6.3. In Sects. 6.4–6.7 the examined body of knowledge is partitioned according to the limited or unlimited number of processors, and allowed or disallowed task duplication. Scheduling problems are examined along the lines of computational complexity theory. The complexity results and polynomially solvable special cases are presented first. Then, heuristics are discussed. For selected special cases heuristics with performance guarantees exist. Other heuristics have no performance quality guarantees, but provide good solutions on average or solve to optimality certain special cases of the scheduling problem. In Sect. 6.8 we present selected methods of scheduling with communication delays in known interconnection networks. In the following two sections we give examples of scheduling with communication delays under different distributed system models. Thus, in Sect. 6.9 we present scheduling with communication delays in LogP model and in Sect. 6.10 hierarchical delay model. Not all branches of scheduling with communication delays are discussed here. Some approaches not covered in this chapter are mentioned in Sect. 6.11. We conclude this chapter with some general observations in Sect. 6.11.

Other surveys of scheduling with communication delays can be found, e.g., in [29, 35, 76, 110].

This is a preview of subscription content, 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 EPUB and 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
Hardcover Book
USD   109.99
Price excludes VAT (USA)
  • Durable hardcover 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

Learn about institutional subscriptions

References

  1. T.L. Adam, K.M. Chandy, and J.R. Dickson. A comparison of list schedules for parallel processing systems. Communications of the ACM, 17(12):685–690, 1974.

    Article  MATH  Google Scholar 

  2. F. Afrati, E. Bampis, L. Finta, and I. Milis. Scheduling trees with large communication delays on two identical processors. Journal of Scheduling, 8(2):179–190, 2005.

    Article  MATH  MathSciNet  Google Scholar 

  3. I. Ahmad and Y.-K. Kwok. A new approach to scheduling parallel programs using task duplication. In Proceedings of the International Conference on Parallel Processing (ICPP’94), volume 2, pages 47–51, 1994.

    Google Scholar 

  4. I. Ahmad and Y.-K. Kwok. Analysis, evaluation, and comparison of algorithms for scheduling task graphs on parallel processors. In Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN’96), pages 207–213, 1996.

    Google Scholar 

  5. I. Ahmad and Y.-K. Kwok. On exploiting task duplication in parallel program scheduling. IEEE Transactions on Parallel and Distributed Systems, 9(9):872–892, 1998.

    Article  Google Scholar 

  6. I. Ahmad, Y.-K. Kwok, M.-Y. Wu, and W. Shu. CASCH: A tool for computer-aided scheduling. IEEE Concurrency, 8(4):21–33, 2000.

    Article  Google Scholar 

  7. M. Al-Mouhamed and A. Al-Maasarani. Performance evaluation of scheduling precedence-constrained computations on message-passing systems. IEEE Transactions on Parallel and Distributed Systems, 5(12):1317–1322, 1994.

    Article  Google Scholar 

  8. A. Alexandrov, M.F. Ionescu, K.E. Schauser, and C. Scheiman. LogGP: Incorporating long messages into the LogP model for parallel computation. Journal of Parallel and Distributed Computing, 44(1):71–79, 1997.

    Article  Google Scholar 

  9. H.H. Ali and H. El-Rewini. An optimal algorithm for scheduling interval ordered tasks with communication on N processors. Journal of Computer and System Sciences, 51(2):301–306, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  10. E. Bampis, A. Giannakos, and J.-C. König. On the complexity of scheduling with large communication delays. European Journal of Operational Research, 94(2):252–260, 1996.

    Article  MATH  Google Scholar 

  11. E. Bampis, A. Giroudeau, and J.-C. König. Using duplication for the multiprocessor scheduling problem with hierarchical communications. Parallel Processing Letters, 10(1):133–140, 2000.

    Google Scholar 

  12. E. Bampis, A. Giroudeau, and J.-C. König. On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications. RAIRO Operations Research, 36(1):21–36, 2002.

    Article  MATH  MathSciNet  Google Scholar 

  13. E. Bampis, A. Giroudeau, and J.-C. König. An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications. Theoretical Computer Science, 290(3):1883–1895, 2003.

    Article  MathSciNet  Google Scholar 

  14. E. Bampis, A. Giroudeau, and A. Kononov. Scheduling tasks with small communication delays for clusters of processors. Annals of Operations Research, 129(1–4):47–63, 2004.

    Article  MATH  MathSciNet  Google Scholar 

  15. E. Bampis, F. Guinand, and D. Trystram. Some models for scheduling parallel programs with communication delays. Discrete Applied Mathematics, 72(1–2):5–24, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  16. S. Bansal, P. Kumar, and K. Singh. An improved duplication strategy for scheduling precedence constrained graphs in multiprocessor systems. IEEE Transactions on Parallel and Distributed Systems, 14(6):533–544, 2003.

    Article  Google Scholar 

  17. S.K. Baruah. The multiprocessor scheduling of precedence-constrained task systems in the presence of interprocessor communication delays. Operations Research, 46(1):65–72, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  18. S. Baskiyar and C. Dickinson. Scheduling directed a-cyclic task graphs on a bounded set of heterogeneous processors using task duplication. Journal of Parallel and Distributed Computing, 65(8):911–921, 2005.

    Article  MATH  Google Scholar 

  19. O. Beaumont, V. Boudet, and Y. Robert. The iso-level scheduling heuristic for heterogeneous processors. In Proceedings of the 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing (EUROMICRO-PDP’02), pages 335–350, 2002.

    Google Scholar 

  20. O. Beaumont, V. Boudet, and Y. Robert. A realistic model and an efficient heuristic for scheduling with heterogeneous processors. In Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS’02) Workshops, page 0088, 2002.

    Google Scholar 

  21. J. Błażewicz, P. Bouvry, F. Guinand, and D. Trystram. Scheduling complete in-trees on two uniform processors with communication delays. Information Processing Letters, 58(5):255–263, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  22. J. Błażewicz, M. Drozdowski, and K. Ecker. Management of resources in parallel systems. In J. Błażewicz, K. Ecker, B. Plateau, and D. Trystram, editors, Handbook on Parallel and Distributed Processing, pages 263–341. Springer Berlin, 2000.

    Google Scholar 

  23. J. Błażewicz, F. Guinand, B. Penzand and D. Trystram. Scheduling complete trees on two uniform processors with integer speed ratios and communication delays. Parallel Processing Letters, 10(4):267–277, 2000.

    Article  Google Scholar 

  24. C. Boeres, A. Nascimento, and V.E.F. Rebello. Cluster-based task scheduling for the LogP model. International Journal of Foundations of Computer Science, 10(4):405–424, 1999.

    Article  MathSciNet  Google Scholar 

  25. J. Cao, A.T.S. Chan, Y. Sun, S.K. Das, and M. Guo. A taxonomy of application scheduling tools for high performance cluster computing. Cluster Computing, 9(3):355–371, 2006.

    Article  Google Scholar 

  26. P. Chrétienne. A polynomial algorithm to optimally schedule tasks on a virtual distributed system under tree-like precedence constraints. European Journal of Operational Research, 43(2):225–230, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  27. P. Chrétienne. Task scheduling with interprocessor communication delays. European Journal of Operational Research, 57(3):348–354, 1992.

    Article  MATH  Google Scholar 

  28. P. Chrétienne. Tree scheduling with communication delays. Discrete Applied Mathematics, 49(1-3):129–141, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  29. P. Chrétienne and C. Picouleau. Scheduling with communication delays: A survey. In P. Chrétienne, E.G. Coffman Jr., J.K. Lenstra, and Z. Liu, editors, Scheduling Theory and Its Applications, pages 65–90 Wiley, Chichester, 1995.

    Google Scholar 

  30. J.-Y. Colin and P. Colin. Scheduling task and communication on a virtual distributed system. European Journal of Operational Research, 94(2):271–276, 1994.

    Article  Google Scholar 

  31. J.Y. Colin and P. Chrétienne. C.P.M. scheduling with small communication delays and task duplication. Operations Research, 39(4):680–684, 1991.

    Google Scholar 

  32. R.C. Corrêa, A. Ferreira, and P. Rebreyend. Scheduling multiprocessor tasks with genetic algorithms. IEEE Transactions on Parallel and Distributed Systems, 10(8):825–837, 1999.

    Article  Google Scholar 

  33. D.E. Culler, R.M. Karp, D. Patterson, A. Sahay, E.E. Santos, K.E. Schauser, R. Subramonian, and T. Eicken. LogP: A practical model of parallel computation. Communications of the ACM, 39(11):78–85, 1996.

    Article  Google Scholar 

  34. S. Darbha and D.P. Agrawal. A task duplication based scalable scheduling algorithm for distributed memory systems. Journal of Parallel and Distributed Computing, 46(1):15–27, 1997.

    Article  MATH  Google Scholar 

  35. A. Darte, Y. Robert, and F. Vivien. Scheduling and Automated Parallelization. Birkhäuser, Boston, 2000.

    Google Scholar 

  36. M. Dell’Amico and L. Finta. A linear time algorithm for scheduling outforests with communication delays on three processors. Journal of Algorithms, 44(2):287–307, 2002.

    Article  MATH  MathSciNet  Google Scholar 

  37. G.L. Djordjeviæ and M.B. Tošiæ. A heuristic for scheduling task graphs with communication delays onto multiprocessors. Parallel Computing, 22(9):1197–1214, 1996.

    Article  MathSciNet  Google Scholar 

  38. D. Dolev and M.K. Warmuth. Profile scheduling of opposing forests and level orders. SIAM Journal on Algebraic and Discrete Methods, 6(4):665–687, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  39. H. El-Rewini and T.G. Lewis. Scheduling parallel program tasks onto arbitrary target machines. Journal of Parallel and Distributed Computing, 9(2):138–153, 1990.

    Article  Google Scholar 

  40. L. Finta, Z. Liu, I. Millis, and E. Bampis. Scheduling UET-UCT series–parallel graphs on two processors. Theoretical Computer Science, 162(2):323–340, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  41. L. Gao, A.L. Rosenberg, and R.K. Sitaraman. Optimal architecture-independent scheduling of fine-grain tree-sweep computations. In Proceedings of the 7th IEEE Symposium on Parallel and Distributed Processing (SPDP’95), pages 620–629, 1995.

    Google Scholar 

  42. L. Gao, A.L. Rosenberg, and R.K. Sitaraman. Optimal architecture-independent scheduling of fine-grain tree-sweep computations. Technical Report UM-CS-1997-037, Dept. of Computer Science, University of Massachusetts, Amherst, 1997.

    Google Scholar 

  43. A. Gerasoulis and T. Yang. On the granularity and clustering of directed acyclic task graphs. IEEE Transactions on Parallel and Distributed Systems, 4(6):686–701, 1993.

    Article  Google Scholar 

  44. A. Gerasoulis and T. Yang. Efficient algorithms and a software tool for scheduling parallel computation. In P. Chrétienne, E.G. Coffman Jr., J.K. Lenstra, and Z. Liu, editors, Scheduling Theory and Its Applications, pages 111–143. Wiley, Chichester, 1995.

    Google Scholar 

  45. R. Giroudeau, J.C. König, F.K. Moulaï, and J. Palaysi. Complexity and approximation for the precedence constrained scheduling problem with large communication delays. In P.D. Medeiros and J.C. Cunha, editors, Proceedings of Euro-Par 2005. LNCS, volume 3648, pages 252–261. Springer Berlin, 2006.

    Google Scholar 

  46. A. Goldman, G. Mounie, and D. Trystram. Near optimal algorithms for scheduling independent chains in BSP. In Proceedings of the 5th International Conference on High Performance Computing (HIPC’98), pages 310–317, 1998.

    Google Scholar 

  47. F. Guinand and D. Trystram. Scheduling UET trees with communication delays on two processors. RAIRO Operations Research, 34(2):131–144, 2000.

    Article  MathSciNet  Google Scholar 

  48. F. Guinand, A. Moukrim, and E. Sanlaville. Sensitivity analysis of tree scheduling on two machines with communication delays. Parallel Computing, 30(1):103–120, 2004.

    Article  MathSciNet  Google Scholar 

  49. F. Guinand, C. Rapine, and D. Trystram. Worst case analysis of Lawler’s algorithm for scheduling trees with communication delays. IEEE Transactions on Parallel and Distributed Systems, 8(10):1085–1086, 1997.

    Article  Google Scholar 

  50. T. Hagras and J. Janecek. A high performance, low complexity algorithm for compile-time task scheduling in heterogeneous systems. Parallel Computing, 31(7):653–670, 2005.

    Article  Google Scholar 

  51. C. Hanen and A. Munier Kordon. Minimizing the volume in scheduling an out-tree with communication delays and duplication. Parallel Computing, 28(11):1573–1585, 2002.

    Article  MATH  MathSciNet  Google Scholar 

  52. C. Hanen and A. Munier. An approximation algorithm for scheduling dependent tasks on m processors with small communication delays. In Proceedings of INRIA/IEEE Symposium on Emerging Technologies and Factory Automation (ETFA ’95), volume 1, pages 167–189, 1995.

    Google Scholar 

  53. C. Hanen and A. Munier. Using duplication for scheduling unitary tasks on m processors with unit communication delays. Theoretical Computer Science, 178(1–2):119–127, 1997.

    MATH  MathSciNet  Google Scholar 

  54. C. Hanen and A. Munier. Performance of Coffman–Graham schedules in the presence of unit communication delays. Discrete Applied Mathematics, 81(1–3):93–108, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  55. C. Hanen and A. Munier. An approximation algorithm for scheduling dependent tasks on m processors with small communication delays. Discrete Applied Mathematics, 108(3):239–257, 2001.

    Article  MATH  MathSciNet  Google Scholar 

  56. D.S. Hochbaum and D.B. Shmoys. Using dual approximation algorithms for scheduling problems: Theoretical and practical results. Journal of the ACM, 34(1):144–162, 1987.

    Article  MathSciNet  Google Scholar 

  57. L. Hollermann, T.-S. Hsu, D.R. Lopez, and K. Vertanen. Scheduling problems in a practical allocation model. Journal of Combinatorial Optimization, 1(2):129–149, 1997.

    Article  MathSciNet  Google Scholar 

  58. H. Hoogeveen, P. Schuurman, and G.J. Woeginger. Non-approximability results for scheduling problems with minsum criteria. INFORMS Journal on Computing, 13(2):157–168, 2001.

    Article  MathSciNet  Google Scholar 

  59. H. Hoogeveen and G.J. Woeginger. A very difficult scheduling problem with communication delays. Operations Research Letters, 29(3):241–245, 2001.

    Article  MATH  MathSciNet  Google Scholar 

  60. J.A. Hoogeveen, S.L. van de Velde, and B. Veltman. Three, four, five, six or the complexity of scheduling with communication delays. Operations Research Letters, 16(3):129–137, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  61. T.-S. Hsu, J.C. Lee, D.R. Lopez, and W.A. Royce. Task allocation on a network of processors. IEEE Transactions on Computers, 49(12):1339–1353, 2000.

    Article  MathSciNet  Google Scholar 

  62. T.C. Hu. Parallel sequencing and assembly line problems. Operations Research, 9(6):841–848, 1961.

    Article  MathSciNet  Google Scholar 

  63. J.-J. Hwang, Y.-C. Chow, F.D. Anger, and C.-Y. Lee. Scheduling precedence graphs in systems with interprocessor communication times. SIAM Journal on Computing, 18(2):244–257, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  64. A. Jakoby and R. Reischuk. The complexity of scheduling problems with communication delays for trees. In O. Nurmi and E. Ukkonen, editors, Proceedings of the 3rd Scandinavian Workshop on Algorithm Theory (SWAT’92). LNCS, volume 621, pages 165–177. Springer Berlin, 1992.

    Google Scholar 

  65. H. Jung, L. Kirousis, and P. Spirakis. Lower bounds and efficient algorithms for multiprocessor scheduling of dags with communication delays. In Proceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA’89), pages 254–264. ACM, New York, NY, USA, 1989.

    Chapter  Google Scholar 

  66. T. Kalinowski, I. Kort, and D. Trystram. List scheduling of general task graphs under LogP. Parallel Computing, 26(9):1109–1128, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  67. O.H. Kang and D.P. Agrawal. Scalable scheduling for symmetric multiprocessors (SMP). Journal of Parallel and Distributed Computing, 63(3):273–285, 2003.

    Article  MATH  Google Scholar 

  68. R.M. Karp, A. Sahay, E.E. Santos, and K.E. Schauser. Optimal broadcast and summation in the LogP model. In Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA’93), pages 142–153, 1993.

    Google Scholar 

  69. S.J. Kim and J.C. Browne. A general approach to mapping of parallel computation upon multiprocessor architectures. In Proceedings of the International Conference on Parallel Processing, volume 3, pages 1–8, 1988.

    Google Scholar 

  70. B. Kruatrachue and T. Lewis. Grain size determination for parallel processing. IEEE Software, 5(1):23–32, 1988.

    Article  Google Scholar 

  71. Y.-K. Kwok. Parallel program execution on a heterogeneous PC cluster using task duplication. In Proceedings of the 9th Heterogeneous Computing Workshop (HCW’00), pages 364–374, 2000.

    Google Scholar 

  72. Y.-K. Kwok and I. Ahmad. A static scheduling algorithm using dynamic critical path for assigning parallel algorithms onto multiprocessors. In Proceedings of the International Conference on Parallel Processing (ICPP’94), volume 2, pages 155–159, 1994.

    Google Scholar 

  73. Y.-K. Kwok and I. Ahmad. Bubble scheduling: A quasi dynamic algorithm for static allocation of tasks to parallel architectures. In Proceedings of the 7th Symposium on Parallel and Distributed Processing (SPDP’95), pages 36–43, 1995.

    Google Scholar 

  74. Y.K. Kwok and I. Ahmad. Efficient scheduling of arbitrary task graphs to multiprocessors using a parallel genetic algorithm. Journal of Parallel and Distributed Computing, 47(1):58–77, 1997.

    Article  Google Scholar 

  75. Y.K. Kwok and I. Ahmad. Benchmarking and comparison of the task graph scheduling algorithms. Journal of Parallel and Distributed Computing, 59(3):381–422, 1999.

    Article  MATH  Google Scholar 

  76. Y.K. Kwok and I. Ahmad. Static scheduling algorithms for allocating directed task graphs to multiprocessors. ACM Computing Surveys, 31(4):406–471, 1999.

    Article  Google Scholar 

  77. C. Lahlou. Approximation algorithms for scheduling with a limited number of communications. Parallel Computing, 26(9):1129–1162, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  78. J.K. Lenstra, M. Veldhorst, and B. Veltman. The complexity of scheduling trees with communication delays. Journal of Algorithms, 20(1):157–173, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  79. J.Y. Leung. On scheduling independent tasks with restricted execution times. Operations Research, 30(1):163–171, 1982.

    Article  MATH  Google Scholar 

  80. T. Lewis and H. El-Rewini. Parallax: A tool for parallel program scheduling. IEEE Parallel & Distributed Technology: Systems & Applications, 1(2):62–72, 1993.

    Article  Google Scholar 

  81. T.G. Lewis, H. El-Rewini, J. Chu, P. Fortner, and W. Su. Task grapher: A tool for scheduling parallel program tasks. In Proceedings of the 5th Distributed Memory Computing Conference, volume 2, pages 1171–1178, 1990.

    Google Scholar 

  82. J.-C. Liou and M.A. Palis. A new heuristic for scheduling parallel programs on multiprocessor. In Proceedings of the 7th International Conference on Parallel Architectures and Compilation Techniques (PACT’98), pages 358–365, 1998.

    Google Scholar 

  83. W. Löwe and W. Zimmermann. Upper time bounds for executing PRAM-programs on the LogP-machine. In Proceedings of the 9th International Conference on Supercomputing (ICS’95), pages 41–50, 1995.

    Google Scholar 

  84. G. Malewicz, A. L. Rosenberg, and M. Yurkewych. Toward a theory for scheduling dags in internet-based computing. IEEE Transactions on Computers, 55(6):757–768, 2006.

    Article  Google Scholar 

  85. B.A. Malloy, E.L. Lloyd, and M.L. Soffa. Scheduling DAGs for asynchronous multiprocessor execution. IEEE Transactions on Parallel and Distributed Systems, 5(5):498–508, 1994.

    Article  Google Scholar 

  86. R.H. Möhring and M.W. Schäffter. Scheduling series–parallel orders subject to 0/1-communication delays. Parallel Computing, 25(1):23–40, 1999.

    Article  MathSciNet  Google Scholar 

  87. A. Munier. Approximation algorithms for scheduling trees with general communication delays. Parallel Computing, 25(1):41–48, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  88. A. Munier and J.-C. König. A heuristic for a scheduling problem with communication delays. Operations Research, 45(1):145–147, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  89. M.A. Palis, J.-C. Liou, and D.S.L. Wei. Task clustering and scheduling for distributed memory parallel architectures. IEEE Transactions on Parallel and Distributed Systems, 7(1):46–55, 1996.

    Article  Google Scholar 

  90. C.H. Papadimitriou and M. Yannakakis. Towards an architecture-independent analysis of parallel algorithms. SIAM Journal on Computing, 19(2):322–328, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  91. G.-L. Park, B. Shirazi, and J. Marquis. Mapping of parallel tasks to multiprocessors with duplication. In Proceedings of the 31st Hawaii International Conference on System Sciences (HICSS’98), volume 7, pages 96–105, 1998.

    Google Scholar 

  92. G.-L. Park, B. Shirazi, J. Marquis, and H. Choo. Decisive path scheduling: A new list scheduling method. In Proceedings of the 1997 International Conference on Parallel Processing (ICPP’97), pages 472–480, 1997.

    Google Scholar 

  93. C. Picouleau. Etude de Problemes d’Optimisation dans les systemes distribues. Ph.D. thesis, Universite Paris VI, 1992.

    Google Scholar 

  94. C. Picouleau. New complexity results on scheduling with small communication delays. Discrete Applied Mathematics, 60(1–3):331–342, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  95. X. Qin and H. Jiang. Dynamic, reliability-driven scheduling of parallel real-time jobs in heterogeneous systems. In Proceedings of the 2001 International Conference on Parallel Processing (ICPP’01), pages 0113–0122, 2001.

    Google Scholar 

  96. A. Radulescu and A.J.C. van Gemund. Low-cost task scheduling for distributed-memory machines. IEEE Transactions on Parallel and Distributed Systems, 13(6):648–658, 2002.

    Article  Google Scholar 

  97. T. Rauber and G. Runger. Compiler support for task scheduling in hierarchical execution models. Journal of Systems Architecture, 45(6–7):483–503, 1998.

    Google Scholar 

  98. V.J. Rayward-Smith. The complexity of preemptive scheduling given interprocessor communication delays. Information Processing Letters, 25:123–125, 1987.

    Article  MathSciNet  Google Scholar 

  99. V.J. Rayward-Smith. UET scheduling with interprocessor communication delays. Discrete Applied Mathematics, 18(1):55–71, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  100. A. Rosenberg. On scheduling mesh-structured computations for internet-based computing. IEEE Transactions on Computers, 53(9):1176–1186, 2004.

    Article  Google Scholar 

  101. A. Rădulescu, C. Nicolescu, A.J.C. van Gemund, and P.P. Jonker. CPR: Mixed task and data parallel scheduling for distributed systems. In Proceedings of the 15th International Parallel and Distributed Processing Symposium (IPDPS’01), page 1039b, 2001.

    Google Scholar 

  102. V. Sarkar. Partitioning and Scheduling Parallel Programs for Multiprocessors. MIT Press, Cambridge, MA, USA, 1989.

    MATH  Google Scholar 

  103. V. Sarkar and J. Hennessy. Compile-time partitioning and scheduling of parallel programs. In Proceedings of the 1986 SIGPLAN symposium on Compiler construction, pages 17–26, New York, NY, USA, 1986. ACM, New York, NY, USA.

    Chapter  Google Scholar 

  104. S. Selvakumar and C. Siva Ram Murthy. Scheduling precedence constrained task graphs with non-negligible intertask communication onto multiprocessors. IEEE Transactions on Parallel and Distributed Systems, 5(3):328–336, 1994.

    Google Scholar 

  105. Z. Shi. Scheduling tasks with precedence constraints on heterogeneous distributed computing systems. Ph.D. thesis, University of Tennessee, Knoxville, 2006. http://www.cs.utk.edu/~shi/thesis.pdf [online accessed 2 September 2008].

  106. B. Shirazi, H.B. Chen, K. Kavi, J. Marquis, and A.R. Hurson. PARSA: A parallel program software development tool. In Proceedings of the 3rd Symposium on Assessment of Quality Software Development Tools, pages 96–111, 1994.

    Google Scholar 

  107. B. Shirazi, H.B. Chen, and J. Marquis. Comparative study of task duplication static scheduling versus clustering and nonclustering heuristics. Concurrency: Practice and Experience, 7(5):371–389, 1995.

    Article  Google Scholar 

  108. G. Sih and E. Lee. A compile-time scheduling heuristic for interconnection constrained heterogeneous processor architectures. IEEE Transactions on Parallel and Distributed Systems, 4(2):175–187, 1993.

    Article  Google Scholar 

  109. G. Sih and E. Lee. Declustering: A new multiprocessor scheduling technique. IEEE Transactions on Parallel and Distributed Systems, 4(6):625–63, 1993.

    Article  Google Scholar 

  110. O. Sinnen. Task Scheduling for Parallel Systems. Wiley, Hoboken, New Jersey, 2007.

    Book  Google Scholar 

  111. O. Sinnen and L.A. Sousa. Communication contention in task scheduling. IEEE Transactions on Parallel and Distributed Systems, 16(6):503–515, 2005.

    Article  Google Scholar 

  112. A. Świecicka, F. Seredynski, and A.Y. Zomaya. Multiprocessor scheduling and rescheduling with use of cellular automata and artificial immune system support. IEEE Transactions on Parallel and Distributed Systems, 17(3):253–262, 2006.

    Article  Google Scholar 

  113. L. Valiant. A bridging model for parallel computation. Communications of the ACM, 33(8):103–111, 1990.

    Article  Google Scholar 

  114. T.A. Varvarigou, V.P. Roychowdhury, and T. Kailath. Scheduling in and out forests in the presence of communication delays. In Proceedings of the 7th International Parallel Processing Symposium (IPPS’93), pages 222–229, 1993.

    Google Scholar 

  115. T.A. Varvarigou, V.P. Roychowdhury, T. Kailath, and E. Lawler. Scheduling in and out forests in the presence of communication delays. IEEE Transactions on Parallel and Distributed Systems, 7(10):1065–1074, 1996.

    Article  Google Scholar 

  116. B. Veltman. Multiprocessor scheduling with communication delays. Ph.D. thesis, Technical University Eindhoven, 1993.

    Google Scholar 

  117. B. Veltman, B.J. Lageweg, and J.K. Lenstra. Multiprocessor scheduling with communications delays. Parallel Computing, 16:173–182, 1990.

    Article  MATH  Google Scholar 

  118. J. Verriet. Scheduling interval orders with release dates and deadlines. Technical Report UU-CS-1996-12, Department of Information and Computing Sciences, Utrecht University, 1996. http://www.cs.uu.nl/research/techreps/repo/CS-1996/1996-12.pdf [online accessed 29 June 2008].

  119. J. Verriet. Scheduling with communication for multiprocessor computation. Ph.D. thesis, Universiteit Utrecht, The Netherlands, 1998.

    Google Scholar 

  120. J. Verriet. Scheduling interval-ordered tasks with non-uniform deadlines subject to non-zero communication delays. Parallel Computing, 25(1):3–21, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  121. J. Verriet. Scheduling outtrees of height one in the LogP model. Parallel Computing, 26(9):1065–1082, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  122. J. Verriet. Scheduling tree-like task systems with non-uniform deadlines subject to unit-length communication delays. Discrete Applied Mathematics, 101(1–3):269–289, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  123. L. Wang, H.J. Siegel, V.P. Roychowdhury, and A.A. Maciejewski. Task matching and scheduling in heterogeneous computing environments using a genetic-algorithm-based approach. Journal of Parallel and Distributed Computing, 47(1):8–22, 1997.

    Article  Google Scholar 

  124. M.-Y. Wu and D.D. Gajski. Hypertool: A programming aid for message-passing systems. IEEE Transactions on Parallel and Distributed Systems, 1(3):330–343, 1990.

    Article  Google Scholar 

  125. T. Yang and A. Gerasoulis. List scheduling with and without communication delays. Parallel Computing, 19(12):1321–1344, 1993.

    Article  MATH  Google Scholar 

  126. T. Yang and A. Gerasoulis. DSC: Scheduling parallel tasks on an unbounded number of processors. IEEE Transactions on Parallel and Distributed Systems, 5(9):951–967, 1994.

    Article  Google Scholar 

  127. W. Zimmermann, W. Löwe, and D. Trystram. On scheduling send-graphs and receive-graphs under the LogP-model. Information Processing Letters, 82(2):83–92, 2002.

    Article  MATH  MathSciNet  Google Scholar 

  128. A. Zomaya and G. Chan. Efficient clustering for parallel task execution in distributed systems. International Journal of Foundations of Computer Science, 16(2):281–299, 2005.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Poznan University of Technology Inst. Computing Science, ul. Piotrowo 2, 60-695, Poznan, Poland

    Maciej Drozdowski

Authors
  1. Maciej Drozdowski
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Maciej Drozdowski .

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag London Limited

About this chapter

Cite this chapter

Drozdowski, M. (2009). Scheduling with Communication Delays. In: Scheduling for Parallel Processing. Computer Communications and Networks. Springer, London. https://doi.org/10.1007/978-1-84882-310-5_6

Download citation

  • DOI: https://doi.org/10.1007/978-1-84882-310-5_6

  • Published:

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-84882-309-9

  • Online ISBN: 978-1-84882-310-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation