This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Evaluation and Optimization of the Robustness of DAG Schedules in Heterogeneous Environments
April 2010 (vol. 21 no. 4)
pp. 532-546
Louis-Claude Canon, LORIA, INRIA, CNRS and Nancy University, Vandoeuvrelès-Nancy
Emmanuel Jeannot, LORIA, INRIA, CNRS and Nancy University, Villers les Nancy
A schedule is said to be robust if it is able to absorb some degree of uncertainty in task or communication durations while maintaining a stable solution. This intuitive notion of robustness has led to a lot of different metrics and almost no heuristics. In this paper, we perform an experimental study of these different metrics and show how they are correlated to each other. Additionally, we propose different strategies for minimizing the makespan while maximizing the robustness: from an evolutionary metaheuristic (best solutions but longer computation time) to more simple heuristics making approximations (medium quality solutions but fast computation time). We compare these different approaches experimentally and show that we are able to find different approximations of the Pareto front for this bicriteria problem.

[1] S. Ali, A.A. Maciejewski, H.J. Siegel, and J.-K. Kim, "Measuring the Robustness of a Resource Allocation," IEEE Trans. Parallel and Distributed Systems, vol. 15, no. 7, pp. 630-641, July 2004.
[2] S. Ali, H.J. Siegel, M. Maheswaran, D. Hensgen, and S. Ali, "Representing Task and Machine Heterogeneities for Heterogeneous Computing Systems," Tamkang J. Science and Eng., Special 50th Anniversary Issue, vol. 3, no. 3, pp. 195-207, Nov. 2000.
[3] I. Assayad, A. Girault, and H. Kalla, "A Bi-Criteria Scheduling Heuristic for Distributed Embedded Systems under Reliability and Real-Time Constraints," Proc. Int'l Conf. Dependable Systems and Networks, pp. 347-356, June 2004.
[4] C.H. Bennett and J. Gill, "Relative to a Random Oracle $A, {\bf P}^A \ne {\bf NP}^A \ne {\rm co-}{\bf NP}^A$ with Probability 1," SIAM J. Computing, vol. 10, no. 1, pp. 96-113, 1981.
[5] L. Bölöni and D.C. Marinescu, "Robust Scheduling of Metaprograms," J. Scheduling, vol. 5, no. 5, pp. 395-412, Sept. 2002.
[6] S. Cahon, N. Melab, and E.-G. Talbi, "ParadisEO: A Framework for the Reusable Design of Parallel and Distributed Metaheuristics," J. Heuristics, vol. 10, no. 3, pp. 357-380, 2004.
[7] L.-C. Canon and E. Jeannot, "Precise Evaluation of the Efficiency and the Robustness of Stochastic DAG Schedules," Research Report 6895, INRIA, Apr. 2009.
[8] C.E. Clark, "The Greatest of a Finite Set of Random Variables," Operations Research, vol. 9, no. 2, pp. 145-162, Mar./Apr. 1961.
[9] A.J. Davenport, C. Gefflot, and J.C. Beck, "Slack-Based Techniques for Robust Schedules," Proc. Sixth European Conf. Planning (ECP '01), pp. 7-18, Sept. 2001.
[10] K. Deb, A. Pratab, S. Agrawal, and T. Meyarivan, "A Fast Elitist Non-Dominated Sorting Genetic Algorithm for Multi-Objective Optimization: NSGA II," IEEE Trans. Evolutionary Computation, vol. 6, no. 2, pp. 182-197, Apr. 2002.
[11] D. Dubois and H. Prade, Possibility Theory: An Approach to Computerized Processing of Uncertainty. Plenum Press, 1988.
[12] H. El-Rewini, T.G. Lewis, and H.H. Ali, Task Scheduling in Parallel and Distributed Systems. Prentice Hall, 1994.
[13] D. England, J. Weissman, and J. Sadagopan, "A New Metric for Robustness with Application to Job Scheduling," Proc. 14th IEEE Int'l Symp. High Performance Distributed Computing (HPDC-14), pp. 135-143, July 2005.
[14] H. Fargier, P. Fortemps, and D. Dubois, "Fuzzy Scheduling: Modelling Flexible Constraints versus Coping with Incomplete Knowledge," European J. Operational Research, vol. 147, no. 2, pp. 231-252, 2003.
[15] S. Felsner and K. Reuter, "The Linear Extension Diameter of a Poset," SIAM J. Discrete Math., vol. 12, no. 3, pp. 360-373, 1999.
[16] A. Gerasoulis, J. Jiao, and T. Yang, "Experience with Graph Scheduling for Mapping Irregular Scientific Computation," Proc. First IPPS Workshop Solving Irregular Problems on Distributed Memory Machines, pp. 1-8, Apr. 1995.
[17] A. Gerasoulis and T. Yang, "A Comparison of Clustering Heuristics for Scheduling Directed Acycle Graphs on Multiprocessors," J. Parallel Distributed Computing, vol. 16, no. 4, pp. 276-291, 1992.
[18] J.N. Hagstrom, "Computational Complexity of PERT Problems," Networks, vol. 18, no. 2, pp. 139-147, 1988.
[19] Y. Jin and J. Branke, "Evolutionary Optimization in Uncertain Environments—A Survey," IEEE Trans. Evolutionary Computation, vol. 9, no. 3, pp. 303-3017, June 2005.
[20] S.-J. Kim, S.P. Boyd, S. Yun, D.D. Patil, and M.A. Horowitz, "A Heuristic for Optimizing Stochastic Activity Networks with Applications to Statistical Digital Circuit Sizing," Optimization and Eng., vol. 8, no. 4, pp. 397-430, Dec. 2007.
[21] E. Learned-Miller and J. DeStefano, "A Probabilistic Upper Bound on Differential Entropy," IEEE Trans. Information Theory, vol. 54, no. 11, pp. 5223-5230, Nov. 2008.
[22] Handbook of Scheduling, J.Y.-T. Leung, ed. Chapman & Hall/CCR, 2004.
[23] J.W.S. Liu and C.L. Liu, "Bounds on Scheduling Algorithms for Heterogeneous Computing Systems," Proc. Int'l Federation for Information Processing (IFIP) Congress '74, pp. 349-353, 1974.
[24] A. Ludwig, R.H. Mohring, and F. Stork, "A Computational Study on Bounding the Makespan Distribution in Stochastic Project Networks," Annals of Operations Research, vol. 102, no. 14, pp. 49-64, Feb. 2001.
[25] M. Matsumoto and T. Nishimura, "Mersenne Twister: A 623-Dimensionally Equidistributed Uniform Pseudo Random Number Generator," ACM Trans. Modeling and Computer Simulation, vol. 8, no. 1, pp. 3-30, 1998.
[26] G. Rudolph and A. Agapie, "Convergence Properties of Some Multi-Objective Evolutionary Algorithms," Proc. Congress on Evolutionary Computation, pp. 1010-1016, July 2000.
[27] J. Eliabeth, P. Sanchez, "Local-Global Scheduling Interactions," PhD thesis, Inst. Nat'l Polytechnique de Gre noble, 2008.
[28] V. Shestak, J. Smith, H.J. Siegel, and A.A. Maciejewski, "A Stochastic Approach to Measuring the Robustness of Resource Allocations in Distributed Systems," Proc. Int'l Conf. Parallel Processing (ICPP '06), pp. 459-470, Aug. 2006.
[29] Z. Shi, E. Jeannot, and J.J. Dongarra, "Robust Task Scheduling in Non-Deterministic Heterogeneous Computing Systems," Proc. IEEE Int'l Conf. Cluster Computing, pp. 1-10, Sept. 2006.
[30] T. Tobita and H. Kasahara, "A Standard Task Graph Set for Fair Evaluation of Multiprocessor Scheduling Algorithms," J. Scheduling, vol. 5, no. 5, pp. 379-394, 2002.
[31] H. Topcuoglu, S. Hariri, and M.-Y. Wu, "Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing," IEEE Trans. Parallel and Distributed Systems, vol. 13, no. 3, pp. 260-274, Mar. 2002.
[32] R.M. van Slyke, "Monte Carlo Methods and the PERT Problem," Operations Research, vol. 11, no. 5, pp. 839-860, Sept./Oct. 1963.
[33] L. Wang, H.J. Siegel, V.R. Roychowdhury, and A.A. Maciejewski, "Task Matching and Scheduling in Heterogeneous Computing Environments Using a Genetic-Algorithm-Based Approach," J. Parallel and Distributed Computing, vol. 47, no. 1, pp. 8-22, Nov. 1997.
[34] E. Zitzler and S. Künzli, "Indicator-Based Selection in Multiobjective Search," Proc. Conf. Parallel Problem Solving from Nature (PPSN VIII), pp. 832-842, Sept. 2004.
[35] E. Zitzler and L. Thiele, "Multiobjective Optimization Using Evolutionary Algorithms—A Comparative Case Study," Lecture Notes in Computer Science, pp. 292-304, Springer, 1998.
[36] E. Zitzler, L. Thiele, M. Laumanns, C.M. Fonseca, and V.G. da Fonseca, "Performance Assessment of Multiobjective Optimizers: An Analysis and Review," IEEE Trans. Evolutionary Computation, vol. 7, no. 2, pp. 117-132, Apr. 2003.

Index Terms:
DAG, stochastic scheduling, robustness, makespan.
Citation:
Louis-Claude Canon, Emmanuel Jeannot, "Evaluation and Optimization of the Robustness of DAG Schedules in Heterogeneous Environments," IEEE Transactions on Parallel and Distributed Systems, vol. 21, no. 4, pp. 532-546, April 2010, doi:10.1109/TPDS.2009.84
Usage of this product signifies your acceptance of the Terms of Use.