
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
LouisClaude 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. 532546, April, 2010.  
BibTex  x  
@article{ 10.1109/TPDS.2009.84, author = {LouisClaude Canon and Emmanuel Jeannot}, title = {Evaluation and Optimization of the Robustness of DAG Schedules in Heterogeneous Environments}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {21}, number = {4}, issn = {10459219}, year = {2010}, pages = {532546}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2009.84}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Evaluation and Optimization of the Robustness of DAG Schedules in Heterogeneous Environments IS  4 SN  10459219 SP532 EP546 EPD  532546 A1  LouisClaude Canon, A1  Emmanuel Jeannot, PY  2010 KW  DAG KW  stochastic scheduling KW  robustness KW  makespan. VL  21 JA  IEEE Transactions on Parallel and Distributed Systems ER   
[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. 630641, 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. 195207, Nov. 2000.
[3] I. Assayad, A. Girault, and H. Kalla, "A BiCriteria Scheduling Heuristic for Distributed Embedded Systems under Reliability and RealTime Constraints," Proc. Int'l Conf. Dependable Systems and Networks, pp. 347356, 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. 96113, 1981.
[5] L. Bölöni and D.C. Marinescu, "Robust Scheduling of Metaprograms," J. Scheduling, vol. 5, no. 5, pp. 395412, 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. 357380, 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. 145162, Mar./Apr. 1961.
[9] A.J. Davenport, C. Gefflot, and J.C. Beck, "SlackBased Techniques for Robust Schedules," Proc. Sixth European Conf. Planning (ECP '01), pp. 718, Sept. 2001.
[10] K. Deb, A. Pratab, S. Agrawal, and T. Meyarivan, "A Fast Elitist NonDominated Sorting Genetic Algorithm for MultiObjective Optimization: NSGA II," IEEE Trans. Evolutionary Computation, vol. 6, no. 2, pp. 182197, Apr. 2002.
[11] D. Dubois and H. Prade, Possibility Theory: An Approach to Computerized Processing of Uncertainty. Plenum Press, 1988.
[12] H. ElRewini, 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 (HPDC14), pp. 135143, 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. 231252, 2003.
[15] S. Felsner and K. Reuter, "The Linear Extension Diameter of a Poset," SIAM J. Discrete Math., vol. 12, no. 3, pp. 360373, 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. 18, 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. 276291, 1992.
[18] J.N. Hagstrom, "Computational Complexity of PERT Problems," Networks, vol. 18, no. 2, pp. 139147, 1988.
[19] Y. Jin and J. Branke, "Evolutionary Optimization in Uncertain Environments—A Survey," IEEE Trans. Evolutionary Computation, vol. 9, no. 3, pp. 3033017, 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. 397430, Dec. 2007.
[21] E. LearnedMiller and J. DeStefano, "A Probabilistic Upper Bound on Differential Entropy," IEEE Trans. Information Theory, vol. 54, no. 11, pp. 52235230, 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. 349353, 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. 4964, Feb. 2001.
[25] M. Matsumoto and T. Nishimura, "Mersenne Twister: A 623Dimensionally Equidistributed Uniform Pseudo Random Number Generator," ACM Trans. Modeling and Computer Simulation, vol. 8, no. 1, pp. 330, 1998.
[26] G. Rudolph and A. Agapie, "Convergence Properties of Some MultiObjective Evolutionary Algorithms," Proc. Congress on Evolutionary Computation, pp. 10101016, July 2000.
[27] J. Eliabeth, P. Sanchez, "LocalGlobal 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. 459470, Aug. 2006.
[29] Z. Shi, E. Jeannot, and J.J. Dongarra, "Robust Task Scheduling in NonDeterministic Heterogeneous Computing Systems," Proc. IEEE Int'l Conf. Cluster Computing, pp. 110, 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. 379394, 2002.
[31] H. Topcuoglu, S. Hariri, and M.Y. Wu, "PerformanceEffective and LowComplexity Task Scheduling for Heterogeneous Computing," IEEE Trans. Parallel and Distributed Systems, vol. 13, no. 3, pp. 260274, Mar. 2002.
[32] R.M. van Slyke, "Monte Carlo Methods and the PERT Problem," Operations Research, vol. 11, no. 5, pp. 839860, 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 GeneticAlgorithmBased Approach," J. Parallel and Distributed Computing, vol. 47, no. 1, pp. 822, Nov. 1997.
[34] E. Zitzler and S. Künzli, "IndicatorBased Selection in Multiobjective Search," Proc. Conf. Parallel Problem Solving from Nature (PPSN VIII), pp. 832842, Sept. 2004.
[35] E. Zitzler and L. Thiele, "Multiobjective Optimization Using Evolutionary Algorithms—A Comparative Case Study," Lecture Notes in Computer Science, pp. 292304, 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. 117132, Apr. 2003.