Abstract
We adopt the hierarchical communications model of (Bampis, Giroudeau, and König, 2000) and we present an approximation algorithm for the precedence constrained multiprocessor scheduling problem in the presence of small hierarchical communication delays (Chrétienne and Colin, 1991). Our algorithm is based on linear programming and rounding and has a performance guarantee of 12(Φ+1)/(12Φ+1) where Φ≥1 is the ratio of the smallest processing time of the tasks and of the maximum intercluster communication delay. This result generalizes the result of (Bampis, Giroudeau, and König, 2000) for the problem with unit execution times and unit intercluster communication delays.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Anderson, T.E., D.E. Culler, D.A. Patterson, and the NOW Team. (1995). “A Case for NOW (Networks of Workstations).” IEEE Micro 15, 54–64.
Bampis, E., R. Giroudeau, and J.-C. König. (2000). “A Heuristic for the Precedence Constrained Multiprocessor Scheduling Problem with Hierarchical Communications.” In H. Reichel and S. Tison (eds.), Proceedings of STACS, pp. 443–454. Lecture Notes in Computer Science, Vol. 1770. Berlin: Springer.
Bampis, E., R. Giroudeau, and J.C. König. (2002). “On the Hardness of Approximating the Precedence Constrained Multiprocessor Scheduling Problem with Hierarchical Communications.” RAIRO-RO 36, 21–36.
Bhatt, S.N., F.R.K. Chung, F.T. Leighton, and A.L. Rosenberg. (1997). “On Optimal Strategies for Cycle-Stealing in Networks of Workstations.” IEEE Transactions on Computers 46, 545–557.
Blumafe, R. and D.S. Park. (1994). “Scheduling on Networks of Workstations.” In 3rd Internat. Sympos. of High Performance Distr. Computing, pp. 96–105.
Cappello, F., P. Fraignaud, B. Mans, and A.L. Rosenberg. (2000). “HiHCoHP-Towards a Realistic Communication Model for Hierarchical HyperClusters of Heterogeneous Processors.” To appear in the Proceedings of IPDPS'01.
Chen, B., C.N. Potts, and G.J. Woeginger. (1998). “A Review of Machine Scheduling: Complexity, Algorithms and Approximability.” TU Graz, Woe-29.
Chrétienne, P., E.J. Coffman Jr, J.K. Lenstra, and Z. Liu. (1995). Scheduling Theory and Its Applications, New-York: Wiley.
Chrétienne, P. and J.Y. Colin. (1991). “Scheduling with Small Interprocessor Communication Delays.” Operations Research 39(3), 680–684.
Graham, R.L., E.L. Lawler, J.K. Lenstra, and A.H.G. Rinnooy Kan. (1979). “Optimization and Approximation in Deterministics Sequencing and Scheduling Theory: A Survey.” Annals of Discrete Mathematics 5, 287–326.
Munier, A. and C. Hanen. (1995). “An Approximation Algorithm for Scheduling Dependent Tasks on m Processors with Small Communication Delays.” In IEEE Symposium on Emerging Technologies and Factory Automation, Paris.
Pfister, G.F. (1995). In Search of Clusters. New York: Prentice Hall.
Rayward-Smith, V.J. (1987). “UET Scheduling with Unit Interprocessor Communication Delays.” Discrete Applied Mathematics 18, 55–71.
Rosenberg, A.L. (1999). “Guidelines for Data-Parallel Cycle-Stealing in Networks of Workstations I: On Maximizing Expected Output.” Journal of Parallel Distributing Computing, 31–53.
Rosenberg, A.L. (2000). “Guidelines for Data-Parallel Cycle-Stealing in Networks of Workstations II: On Maximizing Guarantee Output.” International Journal on Foundations of Computer Science 11, 183–204.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Bampis, E., Giroudeau, R. & Kononov, A. Scheduling Tasks with Small Communication Delays for Clusters of Processors. Annals of Operations Research 129, 47–63 (2004). https://doi.org/10.1023/B:ANOR.0000030681.44697.7f
Issue Date:
DOI: https://doi.org/10.1023/B:ANOR.0000030681.44697.7f