Skip to main content
SpringerLink
Log in

Communication Delays and Multiprocessor Tasks

  • Chapter
Handbook on Scheduling

Part of the book series: International Handbook on Information Systems ((INFOSYS))

  • 2193 Accesses

Abstract

One of the assumptions imposed in Chapter 3 was that each task is processed on at most one processor at a time. However, in recent years, with the rapid development of manufacturing as well as microprocessor and especially multi-microprocessor systems, the above assumption has ceased to be justified in some important applications. There are, for example, self-testing multi-microprocessor systems in which one processor is used to test others, or diagnostic systems in which testing signals stimulate the tested elements and their corresponding outputs are simultaneously analyzed [Avi78, DD81]. When formulating scheduling problems in such systems, one must take into account the fact that some tasks have to be processed on more than one processor at a time. On the other hand, communication issues must be also taken into account in systems where tasks (e.g. program modules) are assigned to different processors and exchange information between each other.

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 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.00
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. F. D. Anger, J. Hwang, Y. Chow, Scheduling with sufficiently loosely coupled processors, J. Parallel Distributed Comput. 9, 87–92, 1990.

    Article  Google Scholar 

  2. A. V. Aho, J. E. Hopcroft, J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass., 1974.

    Google Scholar 

  3. A. Avizienis, Fault tolerance: the survival attribute of digital systems, Proc. IEEE 66, 1978, 1109–1125.

    Article  Google Scholar 

  4. M. Ahuja, Y. Zhu, An O(logn) feasibility algorithm for preemptive scheduling of n independent jobs on a hypercube, Inform. Process. Lett. 35, 1990, 7–11.

    Article  Google Scholar 

  5. L. Bianco, J. Błażewicz, M. Drozdowski, P. Dell’Olmo, Scheduling preemptive multiprocessor tasks on dedicated processors, Performance Evaluation 20, 1994,361–371.

    Article  Google Scholar 

  6. L. Bianco, J. Błażewicz, M. Drozdowski, P. Dell’Olmo, Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors, Ann. Oper. Res. 58, 1995,493–517

    Article  Google Scholar 

  7. L. Bianco, J. Błażewicz, M. Drozdowski, P. Dell’Olmo, Linear algorithms for preemptive scheduling of multiprocessor tasks subject to minimal lateness, Discrete Appl. Math. 72, 1997, 25–46.

    Article  Google Scholar 

  8. L. Bianco, J. Błażewicz, M. Drozdowski, P. Dell’Olmo, Preemptive multiprocessor task scheduling with release times and time windows, Ann. Oper. Res. 70, 1997, 43–55.

    Article  Google Scholar 

  9. J. Błażewicz, P. Bouvry, F. Guinand, D. Trystram, Scheduling complete intrees on two uniform processors with communication delays, Inform. Process. Lett. 58, 1996,255–263.

    Article  Google Scholar 

  10. J. Błażewicz, M. Drozdowski, Scheduling jobs on hypercubes, Parallel Computing 21, 1995, 1946–1956.

    Google Scholar 

  11. J. Błażewicz, M. Drozdowski, The performance limits of a two dimensional network of load-sharing processors, Foundations Comput. Dec. Sci 21, 1996, 3–15.

    Google Scholar 

  12. J. Błażewicz, M. Drozdowski, Distributed processing of divisible jobs with communication startup costs, Discrete Appl. Math. 76, 1997, 21–41.

    Article  Google Scholar 

  13. J. Błażewicz, M. Drozdowski, F. Guinand, D. Trystram, Scheduling under architectural constraints, Discrete Appl. Math. 94, 1999, 35–50.

    Article  Google Scholar 

  14. J. Błażewicz, M. Drozdowski, P. Dell’Olmo, M. G. Speranza, Scheduling multiprocessor tasks on three dedicated processors, Inform. Process. Lett. 41, 1992, 275–280.

    Article  Google Scholar 

  15. Corrigendum: Inform. Process. Lett. 49, 1994, 269–270.

    Google Scholar 

  16. J. Błażewicz, M. Drozdowski, G. Schmidt, D. de Werra, Scheduling independent two processor tasks on a uniform duo-processor system, Discrete Appl. Math. 28, 1990, 11–20.

    Article  Google Scholar 

  17. J. Błażewicz, M. Drozdowski, G. Schmidt, D. de Werra, Scheduling independent multiprocessor tasks on a uniform k-processor system, Parallel Computing 20, 1994, 15–28.

    Article  Google Scholar 

  18. J. Błażewicz, M. Drabowski, J. Weglarz, Scheduling independent 2-processor tasks to minimize schedule length, Inform. Process. Lett. 18, 1984, 267–273.

    Article  Google Scholar 

  19. J. Błażewicz, M. Drabowski, J. Weglarz, Scheduling multiprocessor tasks to minimize schedule length, IEEE Trans. Comput. C-35, 1986, 389–393.

    Google Scholar 

  20. J. Błażewicz, M. Drozdowski, D. de Werra, J. Weglarz, Deadline scheduling of multiprocessor tasks, Discrete Appl. Math. 65, 1996, 81–96.

    Article  Google Scholar 

  21. J. Błażewicz, K. Ecker, A linear time algorithm for restricted bin packing and scheduling problems, Oper. Res. Lett. 2, 1983, 80–83.

    Article  Google Scholar 

  22. J. Błażewicz, K. Ecker, B. Plateau, D. Trystram, Handbook on Parallel and Distributed Processing, Springer, Berlin, New York, 2000.

    Google Scholar 

  23. V. E. Benes, Permutation groups, complexes, and rearrangeable connecting networks, Bell Syst. Tech. J. 43, 1964, 1619–1640.

    Google Scholar 

  24. E. Bampis, A. Giannokos, J.-C. König, On the complexity of scheduling with large communication delays, European J. Oper. Res. 94, 1996, 252–260.

    Article  Google Scholar 

  25. V. Bharadwaj, D. Ghose, V. Mani, A study of optimality conditions for load distribution in tree networks with communication delays, Tech.Report 423/GI/02-92, Dept. of Aerospace Engineering, Indian Institute of Science, Bangalore, 1992.

    Google Scholar 

  26. V. Bharadwaj, D. Ghose, V. Mani, Optimal sequencing and arrangement in distributed single-level tree networks with communication delays, IEEE Trans. Parallel Distrib. Syst. 5, 1994, 968–976.

    Article  Google Scholar 

  27. J. Błażewicz, M. Kovalyov, M. Machowiak, D. Trystram, J. Weglarz, Scheduling malleable tasks on parallel processors o minimize the makespan, Annals of Oper. Res. 129, 2004, 65–80.

    Article  Google Scholar 

  28. J. Błażewicz, M. Kovalyov, M. Machowiak, D. Trystram, J. Weglarz, On pre-emptable scheduling malleable tasks, IEEE T. Comput. 2006, to appear.

    Google Scholar 

  29. J. Błażewicz, Z. Liu, Scheduling multiprocessor tasks with chain constraints, European J. Oper. Res. 94, 1996, 231–241.

    Article  Google Scholar 

  30. J. Błażewicz, J. K. Lenstra, A. H. G. Rinnoy Kan, Scheduling subject to resource constraints: classification and complexity, Discrete Appl. Math. 5, 1983,11–24

    Article  Google Scholar 

  31. S. H. Bokhari, On the mapping problem, IEEE Trans. Comput. C-30, 1981, 207–214.

    Google Scholar 

  32. L. Bianco, P. Dell’Olmo, M. G. Speranza, Nonpreemptive scheduling of independent tasks with dedicated resources, Report, IASI, Roma, 1991

    Google Scholar 

  33. S. Bataineh, T. G. Robertazzi, Bus oriented load sharing for a network of sensor driven processors, IEEE Trans. Syst. Man. Cybernet. 21, 1991, 1202–1205.

    Article  Google Scholar 

  34. N. G. de Bruijn, A combinatorial problem, Koninklijke Netherlands: Academie van Wetenschappen, Proc. 49, 1946, 758–764.

    Google Scholar 

  35. P. Brucker, Scheduling Algorithms, Springer, Berlin, 1995.

    Google Scholar 

  36. D. Bertsekas, J. Tsitsiklis, Parallel and Distributed Computation, Prentice Hall, Englewood Cliffs, N.J., 1989.

    Google Scholar 

  37. Y. L. Chen, Y. H. Chin, Scheduling unit-time jobs on processors with different capabilities, Comput. Oper. Res. 16, 1989, 409–417.

    Article  Google Scholar 

  38. I. Y. Colin, P. Chretienne, C.P.M. scheduling with small communication delays and task duplication, Oper. Res. 39, 1991, 680–684.

    Article  Google Scholar 

  39. E. G. Coffman, Jr., M. R. Garey, D. S. Johnson, A. S. La Paugh, Scheduling file transfers, SIAM J. Comput. 14, 1985, 744–780.

    Article  Google Scholar 

  40. P. Chretienne, A polynomial algorithm to optimally schedule tasks over a virtual distributed system under tree-like precedence constraints, European J. Oper. Res. 43, 1989, 225–230.

    Article  Google Scholar 

  41. P. Chretienne, Task scheduling over distributed memory machines, in: Proceedings of the International Workshop on Parallel and Distributed Algorithms, North-Holland, Amsterdam, 1989.

    Google Scholar 

  42. P. Chretienne, Tree scheduling with communication delays, Discrete Appl. Math. 49, 1994, 129–141.

    Article  Google Scholar 

  43. G. I. Chen, T. H. Lai, Preemptive scheduling of independent jobs on a hypercube, Inform. Process. Lett. 28, 1988, 201–206.

    Article  Google Scholar 

  44. R. S. Chang, R. C. T. Lee, On a scheduling problem where a job can be executed only by a limited number of processors, Comput. Oper. Res. 15, 1988, 471–478

    Article  Google Scholar 

  45. P. Chretienne, C. Picouleau, The basic scheduling problem with interprocessor communication delays, MASI Report 91/6, Institut Blaise Pascal, Paris, 1991.

    Google Scholar 

  46. Y. C. Cheng, T. G. Robertazzi, Distributed computation with communication delays, IEEE Trans. Aerospace Electr. Syst. 24, 1988, 511–516

    Google Scholar 

  47. Y. C. Cheng, T. G. Robertazzi, Distributed computation with communication delays, IEEE Trans. Aerospace Electr. Syst. 26, 1990, 511–516.

    Article  Google Scholar 

  48. M. Dal Cin, E. Dilger, On the diagnostability of self-testing multimicroprocessor systems, Microprocessing and Microprogramming 7, 1981, 177–184.

    Article  Google Scholar 

  49. M. Drozdowski, W. Kubiak, Scheduling parallel tasks with sequential heads and tails, Annals of Oper. Res. 90, 1999, 211–246.

    Google Scholar 

  50. J. Du, J. Y-T. Leung, Complexity of scheduling parallel tasks systems, SIAM J. Discrete Math. 2, 1989, 473–487.

    Article  Google Scholar 

  51. M. Drozdowski, Selected Problems of Scheduling Tasks in Multiprocessor Computer Systems, Poznań University of Technology Press, Poznań, 1996.

    Google Scholar 

  52. M. Drozdowski, Real-time scheduling of linear speedup parallel tasks, Inform. Process. Lett. 57, 1996, 35–40.

    Article  Google Scholar 

  53. K. H. Ecker, R. Hirschberg, Scheduling communication demands in networks, Proc. of the Workschop on Parallel and Distributed Real-Time Systems, Newport Beach, 1993.

    Google Scholar 

  54. K. H. Ecker, D. Hammer, Integrated scheduling for CIM systems. Proc. TIMS XXXII, Anchorage, 1994.

    Google Scholar 

  55. K. H. Ecker, H. Hodam, Heuristic algorithms for the task scheduling under consideration of communication delays, Report, T. U. Clausthal, 1996.

    Google Scholar 

  56. H. El-Rewini, T. G. Lewis, Scheduling parallel program tasks onto arbitrary target machines, J. Parallel Distributed Comput. 9, 1990, 138–153.

    Article  Google Scholar 

  57. D. Ghose, V. Mani, Distributed computation in a linear network: Closed-form solutions and computational techniques, IEEE Trans. Aerospace Electr. Syst. 30, 1994, 471–483.

    Article  Google Scholar 

  58. M. Goemans, An approximation algorithm for scheduling on three dedicated processors, Discrete Appl. Math. 61, 1995, 49–60.

    Article  Google Scholar 

  59. R. L. Goke, Banyan networks for partitioning multiprocessor systems, Ph.D. Thesis, Univ. Florida, Gainesville, 1976.

    Google Scholar 

  60. F. Guinand, D. Trystram, Optimal scheduling of UECT trees on two processors, Report, Universite Joseph Fourier, Grenoble, 1993.

    Google Scholar 

  61. A. Gerasoulis, T. Yang, On the granularity and clustering of directed acyclic task graphs, Report TR-153, Dept. Comput. Sci., Rutgers University, 1992.

    Google Scholar 

  62. E. Haddad, Communication protocol for optimal redistribution of divisible load in distributed real-time systems, Proc. of the ISMM Internal. Conf. on Intelligent Information Management Systems, Washington, 1994, 39–42.

    Google Scholar 

  63. J.-J. Hwang, Y.-C. Chow, F. D. Anger, C.-Y. Lee, Scheduling precedence graphs in systems with interprocessor communication times, SIAM J. Comput. 18, 1989, 244–257.

    Article  Google Scholar 

  64. J. A. Hoogeveen, J. K. Lenstra, B. Veltman, Three, four, five, six or the complexity of scheduling with communication delays, Oper. Res. Lett. 16, 1994, 129–136.

    Article  Google Scholar 

  65. C. P. M. van Hoesel, Preemptive scheduling on a hypercube, Report 8963/A, Econometric Institute, Erasmus University, Rotterdam, 1989.

    Google Scholar 

  66. J. A. Hoogeven, S. L. van de Velde, B. Veltman, Complexity of scheduling multiprocessor tasks with prespecified processor allocation, Discrete Appl. Math. 55, 1994, 259–272.

    Article  Google Scholar 

  67. D. S. Johnson, C. L. Monma, A scheduling problem with simultaneous machine requirement, Proc, TIMS XXVI, Copenhagen, 1984.

    Google Scholar 

  68. A. Jakoby, R. Reischuk, The complexity of scheduling problems with communication delays for trees, Proc. Scandinavian Workshop on Algorithmic Theory 3, 1992, 165–177.

    Google Scholar 

  69. H. J. Kim, G. I. Jee, J. G. Lee, Optimal load distribution for tree network processors, 1995, submitted for publication.

    Google Scholar 

  70. H. Krawczyk, M. Kubale, An approximation algorithm for diagnostic test scheduling in multicomputer systems, IEEE Trans. Comput. C-34, 1985, 869–872.

    Google Scholar 

  71. G. A. P. Kindervater, J. K. Lenstra, Parallel computing in combinatorial optimization, Ann. Oper. Res. 14, 1988, 245–289.

    Article  Google Scholar 

  72. C. P. Kruskal, M. Snir, A unified theory of interconnection network structure, Preprint, 1986.

    Google Scholar 

  73. M. Kubale, The complexity of scheduling independent two-processor tasks on dedicated processors, Inform. Proc. Lett. 24, 1987, 141–147.

    Article  Google Scholar 

  74. M. Kubale, Preemptive scheduling of two-processor tasks on dedicated processors (in Polish), Zeszyty Naukowe Politechniki Ślaskiej, Automatyka 100, 1990, 145–153.

    Google Scholar 

  75. J. Y-T. Leung (ed.), Handbook of Scheduling. Algorithms, Models and Performance Analysis, Chapman & Hall/CRC, Boca Raton, 2004.

    Google Scholar 

  76. E. L. Lloyd, Concurrent task systems, Oper. Res. 29, 189–201.

    Google Scholar 

  77. S. Lam, R. Sethi, Worst case analysis of two scheduling algorithms, SIAM J. Comput. 6, 1977, 518–536.

    Article  Google Scholar 

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

    Article  Google Scholar 

  79. R. H. Möhring, Computationally tractable classes of ordered sets, I. Rival (ed.), Algorithms and Order, 105–193, Kluwer, Dordrecht, 1989.

    Google Scholar 

  80. P. Dell’Olmo, M. G. Speranza, Z. S. Tuza, Easy and hard cases of a scheduling problem on 3 dedicated processor, Report, IASI, Rome, 1995.

    Google Scholar 

  81. C. Picouleau, Two new NP-complete scheduling problems with communication delays and unlimited number of processors. Report RP91/24, MASI, Institut Blaise Pascal, Universite Paris VI, 1991.

    Google Scholar 

  82. C. Picouleau, Etude de problèmes d’optimization dans les systèmes distributés, Ph.D. Thesis, Université Paris VI, 1992.

    Google Scholar 

  83. J. G. Peters, M. Syska, Circuit-switched broadcasting in torus networks, IEEE Trans. Parallel Distrib. Syst., 1996, to appear.

    Google Scholar 

  84. F. P. Preparata, J. Vuillemin, The cube-connected cycles: A versatile network for parallel computation, Commun. ACM, May 1981, 300–309.

    Google Scholar 

  85. C. H. Papadimitriou, M. Yannakakis, Towards an architecture-independent analysis of parallel algorithms, SIAM J. Comput. 19, 1990, 322–328.

    Article  Google Scholar 

  86. T. G. Robertazzi, Processor equivalence for a linear daisy chain of load sharing processors, IEEE Trans. Aerospace Electr. Syst. 29, 1993, 1216–1221.

    Article  Google Scholar 

  87. V. J. Rayward-Smith, UET scheduling with unit interprocessor communication delays, Discrete Appl. Math. 18, 1987, 55–71.

    Article  Google Scholar 

  88. V. J. Rayward-Smith, The complexity of preemptive scheduling given interprocessor communication delays, Inform. Process. Lett. 25, 1987, 123–125.

    Article  Google Scholar 

  89. T. H. Szymansky, V. C. Hamacher, On the universality of multipath multistage interconnection networks, J. Parallel Distributed Comput. 7, 1989, 541–569.

    Article  Google Scholar 

  90. X. Shen, E. M. Reingold, Scheduling on a hypercube, Inform. Process. Lett. 40, 1991, 323–328.

    Article  Google Scholar 

  91. J. Sohn, T. G. Robertazzi, A multi-job load sharing strategy for divisible jobs on bus networks, Tech. Report 697, SUNY at Stony Brook College of Eng. and Appl. Sci., 1994

    Google Scholar 

  92. S. Sohn, T. G. Robertazzi, An optimal load sharing strategy for divisible jobs with time-varying processor speed and channel speed, Proc. of the ISCA International Conf. on Parallel and Distributed Computing Systems, Orlando, 1995, 27–32.

    Google Scholar 

  93. J. Sohn, T. G. Robertazzi, Optimal divisible job load sharing for bus networks, IEEE Trans. Aerospace Electr. Syst. 32, 1996.

    Google Scholar 

  94. J. Sohn, T. G. Robertazzi, S. Luryi, Optimizing computing costs using divisible load analysis, Report CEAS 719, University at Stony Brook, 1995.

    Google Scholar 

  95. H. S. Stone, Parallel processing with the perfect shuffle, IEEE Trans. Comput. C-20, 1971, 153–161.

    Article  Google Scholar 

  96. B. Veltman, Multiprocessor Scheduling with Communication Delays, Ph.D. Thesis, CWI-Amsterdam, 1993.

    Google Scholar 

  97. T. A. Varvarigou, V. P. Roychowdhury, T. Kailath, unpublished manuscript, 1992.

    Google Scholar 

  98. J. P. C. Verhoosel, L. R. Welch, E. Liut, D. K. Hammer, A. D. Stoyenko, A model for scheduling of object-based, distributed real-time systems, J. Real-Time Systems 8, 1995, 5–34.

    Article  Google Scholar 

Download references

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

(2007). Communication Delays and Multiprocessor Tasks. In: Handbook on Scheduling. International Handbook on Information Systems. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-32220-7_6

Download citation

Publish with us

Policies and ethics

Search

Navigation