
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
PierreFrançois Dutot, Tchimou N'Takpé, Frédéric Suter, Henri Casanova, "Scheduling Parallel Task Graphs on (Almost) Homogeneous Multicluster Platforms," IEEE Transactions on Parallel and Distributed Systems, vol. 20, no. 7, pp. 940952, July, 2009.  
BibTex  x  
@article{ 10.1109/TPDS.2009.11, author = {PierreFrançois Dutot and Tchimou N'Takpé and Frédéric Suter and Henri Casanova}, title = {Scheduling Parallel Task Graphs on (Almost) Homogeneous Multicluster Platforms}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {20}, number = {7}, issn = {10459219}, year = {2009}, pages = {940952}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2009.11}, 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  Scheduling Parallel Task Graphs on (Almost) Homogeneous Multicluster Platforms IS  7 SN  10459219 SP940 EP952 EPD  940952 A1  PierreFrançois Dutot, A1  Tchimou N'Takpé, A1  Frédéric Suter, A1  Henri Casanova, PY  2009 KW  Mixed parallelism KW  parallel task graph scheduling KW  performance guarantee KW  multicluster platform. VL  20 JA  IEEE Transactions on Parallel and Distributed Systems ER   
[1] S. Chakrabarti, J. Demmel, and K. Yelick, “Modeling the Benefits of Mixed Data and Task Parallelism,” Proc. Symp. Parallel Algorithms and Architectures (SPAA '95), pp.7483, 1995.
[2] J. Turek, J. Wolf, and P. Yu, “Approximate Algorithms for Scheduling Parallelizable Tasks,” Proc. Symp. Parallel Algorithms and Architectures (SPAA '92), pp.323332, 1992.
[3] W. Ludwig and P. Tiwari, “Scheduling Malleable and Nonmalleable Tasks,” Proc. Symp. Discrete Algorithms, pp.167176, 1994.
[4] R. Lepere, D. Trystram, and G. Woeginger, “Approximation Algorithms for Scheduling Malleable Tasks under Precedence Constraints,” Proc. Ninth Ann. European Symp. Algorithms (ESA '01), pp.146157, 2001.
[5] K. Jansen and H. Zhang, “An Approximation Algorithm for Scheduling Malleable Tasks under General Precedence Constraints,” ACM Trans. Algorithms, vol. 2, no. 3, pp.416434, 2006.
[6] S. Bansal, P. Kumar, and K. Singh, “An Improved TwoStep Algorithm for Task and Data Parallel Scheduling in Distributed Memory Machines,” Parallel Computing, vol. 32, no. 10, pp.759774, 2006.
[7] V. Boudet, F. Desprez, and F. Suter, “OneStep Algorithm for Mixed Data and Task Parallel Scheduling without Data Replication,” Proc. 17th Int'l Parallel and Distributed Processing Symp., 2003.
[8] A. Radulescu and A. van Gemund, “A LowCost Approach Toward Mixed Task and Data Parallel Scheduling,” Proc. 15th Int'l Conf. Parallel Processing (ICPP '01), Sept. 2001.
[9] S. Ramaswany, “Simultaneous Exploitation of Task and Data Parallelism in Regular Scientific Applications,” PhD dissertation, Univ. of Illi nois, 1996.
[10] T. Rauber and G. Rünger, “Compiler Support for Task Scheduling in Hierarchical Execution Models,” J. Systems Architecture, vol. 45, pp.483503, 1998.
[11] N. Vydyanathan, S. Krishnamoorthy, G. Sabin, U. Catalyurek, T. Kurc, P. Sadayappan, and J. Saltz, “An Integrated Approach for Processor Allocation and Scheduling of MixedParallel Applications,” Proc. 35th Int'l Conf. Parallel Processing (ICPP), 2006.
[12] T. N'takpé, F. Suter, and H. Casanova, “A Comparison of Scheduling Approaches for MixedParallel Applications on Heterogeneous Platforms,” Proc. Sixth Int'l Symp. Parallel and Distributed Computing, July 2007.
[13] P.F. Dutot, “Hierarchical Scheduling for Moldable Tasks,” Proc. 11th Int'l EuroPar Conf., pp.302311, 2005.
[14] R. Bolze, F. Cappello, E. Caron, M. Daydé, F. Desprez, E. Jeannot, Y. Jégou, S. Lanteri, J. Leduc, N. Melab, G. Mornet, R. Namyst, P. Primet, B. Quetier, O. Richard, E.G. Talbi, and T. Irena, “Grid'5000: A Large Scale and Highly Reconfigurable Experimental Grid Testbed,” Int'l J. High Performance Computing Applications, vol. 20, no. 4, pp.481494, Nov. 2006.
[15] Grid5000, http:/www.grid5000.org, 2009.
[16] G. Amdahl, “Validity of the Single Processor Approach to Achieving Large Scale Computing Capabilities,” Proc. Am. Federation of Information Processing Soc. (AFIPS) 1967 Spring Joint Computer Conf., vol. 30, pp.483485, Apr. 1967.
[17] F. Suter, “DAG Generation Program,” http://www.loria.fr/ suterdags.html, 2009.
[18] Y.K. Kwok and I. Ahmad, “Benchmarking and Comparison of the Task Graph Scheduling Algorithms,” J. Parallel and Distributed Computing, vol. 59, no. 3, pp.381422, 1999.
[19] G.N.S. Prasanna and B.R. Musicus, “The Optimal Control Approach to Generalized Multiprocessor Scheduling,” Algorithmica, vol. 15, no. 1, pp.1749, 1996.
[20] G.N.S. Prasanna and B.R. Musicus, “Generalized Multiprocessor Scheduling and Applications to Matrix Computations,” IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 6, pp.650664, June 1996.
[21] M. Skutella, “Approximation Algorithms for the Discrete TimeCost Tradeoff Problem,” Math. of Operations Research, vol. 23, no. 4, pp.909929, 1998.
[22] P.F. Dutot and D. Trystram, “Scheduling on Hierarchical Clusters Using Malleable Tasks,” Proc. Symp. Parallel Algorithms and Architectures (SPAA '01), pp.199208, 2001.
[23] T. N'Takpé and F. Suter, “Critical Path and Area Based Scheduling of Parallel Task Graphs on Heterogeneous Platforms,” Proc. 12th Int'l Conf. Parallel and Distributed Systems (ICPADS '06), pp.310, July 2006.
[24] H. Casanova, F. Desprez, and F. Suter, “From Heterogeneous Task Scheduling to Heterogeneous Mixed Parallel Scheduling,” Proc. 10th Int'l EuroPar Conf., pp.230237, Aug. 2004.
[25] 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.
[26] M. Vanhoucke and D. Debels, “The Discrete Time/Cost Trade off Problem: Extensions and Heuristic Procedures,” J. Scheduling, vol. 10, nos.4/5, 2007.
[27] L.R. Graham, “Bounds on Multiprocessing Timing Anomalies,” SIAM J. Applied Math., vol. 2, pp.416429, 1969.
[28] H. Casanova, A. Legrand, and M. Quinson, “SimGrid: A Generic Framework for LargeScale Distributed Experiments,” Proc. 10th Int'l Conf. Computer Modeling and Simulation, Mar. 2008.
[29] SimGrid, http:/simgrid.gforge.inria.fr, 2009.
[30] H. Zhao and R. Sakellariou, “Scheduling Multiple DAGs onto Heterogeneous Systems,” Proc. 15th Heterogeneous Computing Workshop (HCW '06), Apr. 2006.
[31] T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to Algorithms. MIT Press/McGrawHill, 1990.
[32] N. Karmarkar, “A New Polynomial Time Algorithm for Linear Programming,” Combinatorica, vol. 4, no. 4, pp.373395, 1984.
[33] D.G. Luenberger and Y. Ye, Linear and Nonlinear Programming, third ed. Springer, 2008.
[34] CPLEX, http://www.ilog.com/productscplex/, 2009.