
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Naga Vydyanathan, Sriram Krishnamoorthy, Gerald M. Sabin, Umit V. Catalyurek, Tahsin Kurc, Ponnuswamy Sadayappan, Joel H. Saltz, "An Integrated Approach to LocalityConscious Processor Allocation and Scheduling of MixedParallel Applications," IEEE Transactions on Parallel and Distributed Systems, vol. 20, no. 8, pp. 11581172, August, 2009.  
BibTex  x  
@article{ 10.1109/TPDS.2008.219, author = {Naga Vydyanathan and Sriram Krishnamoorthy and Gerald M. Sabin and Umit V. Catalyurek and Tahsin Kurc and Ponnuswamy Sadayappan and Joel H. Saltz}, title = {An Integrated Approach to LocalityConscious Processor Allocation and Scheduling of MixedParallel Applications}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {20}, number = {8}, issn = {10459219}, year = {2009}, pages = {11581172}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2008.219}, 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  An Integrated Approach to LocalityConscious Processor Allocation and Scheduling of MixedParallel Applications IS  8 SN  10459219 SP1158 EP1172 EPD  11581172 A1  Naga Vydyanathan, A1  Sriram Krishnamoorthy, A1  Gerald M. Sabin, A1  Umit V. Catalyurek, A1  Tahsin Kurc, A1  Ponnuswamy Sadayappan, A1  Joel H. Saltz, PY  2009 KW  Processor allocation KW  scheduling KW  mixed parallelism KW  dataflow graphs KW  localityconscious scheduling. VL  20 JA  IEEE Transactions on Parallel and Distributed Systems ER   
[1] V. Kumar, A. Grama, A. Gupta, and G. Karypis, Introduction to Parallel Computing: Design and Analysis of Algorithms. BenjaminCummings, 1994.
[2] M.J. Quinn, Parallel Computing: Theory and Practice, second ed. McGrawHill, 1994.
[3] Y.K. Kwok and I. Ahmad, “Static Scheduling Algorithms for Allocating Directed Task Graphs to Multiprocessors,” ACM Computing Survey, vol. 31, no. 4, pp. 406471, 1999.
[4] S. Ramaswamy, S. Sapatnekar, and P. Banerjee, “A Framework for Exploiting Task and Data Parallelism on Distributed Memory Multicomputers,” IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 11, pp. 10981116, Nov. 1997.
[5] S. Chakrabarti, J. Demmel, and K. Yelick, “Modeling the Benefits of Mixed Data and Task Parallelism,” Proc. Seventh Ann. ACM Symp. Parallel Algorithms and Architectures (SPAA '95), pp. 7483, 1995.
[6] S.B. Hassen, H.E. Bal, and C.J.H. Jacobs, “A Task and DataParallel Programming Language Based on Shared Objects,” ACM Trans. Programming Languages and Systems, vol. 20, no. 6, pp. 11311170, 1998.
[7] 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. Int'l Conf. Parallel Processing (ICPP '06), pp. 443450, 2006.
[8] N. Vydyanathan, S. Krishnamoorthy, G. Sabin, U. Catalyurek, T. Kurc, P. Sadayappan, and J. Saltz, “Locality Conscious Processor Allocation and Scheduling for MixedParallel Applications,” Proc. IEEE Int'l Conf. Cluster Computing (Cluster '06), pp. 110, 2006.
[9] A. Radulescu, C. Nicolescu, A.J.C. van Gemund, and P. Jonker, “CPR: Mixed Task and Data Parallel Scheduling for Distributed Systems,” Proc. 15th Int'l Parallel and Distributed Processing Symp. (IPDPS '01), p. 39, 2001.
[10] A. Radulescu and A. van Gemund, “A LowCost Approach towards Mixed Task and Data Parallel Scheduling,” Proc. Int'l Conf. Parallel Processing (ICPP '01), pp. 6976, Sept. 2001.
[11] T. Rauber and G. Rünger, “Compiler Support for Task Scheduling in Hierarchical Execution Models,” J. System Architecture, vol. 45, nos. 67, pp. 483503, 1999.
[12] Standard Task Graph Set, Kasahara Laboratory, Waseda Univ., http://www.kasahara.elec.waseda.ac.jpschedule , 2008.
[13] G. Baumgartner, D. Bernholdt, D. Cociorva, R. Harrison, S. Hirata, C. Lam, M. Nooijen, R. Pitzer, J. Ramanujam, and P. Sadayappan, “A HighLevel Approach to Synthesis of HighPerformance Codes for Quantum Chemistry,” Proc. ACM/IEEE Supercomputing Conf. (SC '02), pp. 110, 2002.
[14] G.H. Golub and C.F.V. Loan, Matrix Computations, third ed. Johns Hopkins Univ. Press, 1996.
[15] C.H. Papadimitriou and M. Yannakakis, “Towards an ArchitectureIndependent Analysis of Parallel Algorithms,” SIAM J.Computing, vol. 19, no. 2, pp. 322328, 1990.
[16] J. Du and J.Y.T. Leung, “Complexity of Scheduling Parallel Task Systems,” SIAM J. Discrete Math., vol. 2, no. 4, pp. 473487, 1989.
[17] J. Turek, J.L. Wolf, and P.S. Yu, “Approximate Algorithms Scheduling Parallelizable Tasks,” Proc. Fourth Ann. ACM Symp. Parallel Algorithms and Architectures (SPAA '92), pp. 323332, 1992.
[18] K. Jansen and L. Porkolab, “LinearTime Approximation Schemes for Scheduling Malleable Parallel Tasks,” Proc. 10th Ann. ACMSIAM Symp. Discrete Algorithms (SODA '99), pp.490498, 1999.
[19] J. Blazewicz, M. Machowiak, J. Weglarz, M. Kovalyov, and D. Trystram, “Scheduling Malleable Tasks on Parallel Processors to Minimize the Makespan,” Annals of Operations Research, vol. 129, nos. 14, pp. 6580, 2004.
[20] R. Lepere, D. Trystram, and G.J. Woeginger, “Approximation Algorithms for Scheduling Malleable Tasks under Precedence Constraints,” Int'l J. Foundations of Computer Science, vol. 13, no. 4, pp. 613627, 2002.
[21] 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.
[22] 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. (IPDPS), 2003.
[23] K. Li, “Scheduling Precedence Constrained Parallel Tasks on Multiprocessors Using the Harmonic System Partitioning Scheme,” J. Information Sciences and Eng., vol. 21, no. 2, pp. 309326, 2005.
[24] J. Barbosa, C. Morais, R. Nobrega, and A. Monteiro, “Static Scheduling of Dependent Parallel Tasks on Heterogeneous Clusters,” Proc. Fourth Int'l Workshop Algorithms, Models and Tools for Parallel Computing on Heterogeneous Networks, pp. 18, 2005.
[25] J. Subhlok and G. Vondran, “Optimal LatencyThroughput Tradeoffs for Data Parallel Pipelines,” Proc. Eighth Ann. ACM Symp. Parallel Algorithms and Architectures (SPAA '96), pp. 6271, 1996.
[26] A.N. Choudhary, B. Narahari, D.M. Nicol, and R. Simha, “Optimal Processor Assignment for a Class of Pipelined Computations,” IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 4, pp. 439445, Apr. 1994.
[27] G.N.S. Prasanna and B.R. Musicus, “Generalised Multiprocessor Scheduling Using Optimal Control,” Proc. Third Ann. ACM Symp. Parallel Algorithms and Architectures (SPAA '91), pp. 216228, 1991.
[28] M. Iverson, F. Özgüner, and L. Potter, “Statistical Prediction of Task Execution Times through Analytical Benchmarking for Scheduling in a Heterogeneous Environment,” IEEE Trans. Computers, vol. 48, no. 12, pp. 13741379, Dec. 1999.
[29] M. Cosnard and M. Loi, “Automatic Task Graph Generation Techniques,” Parallel Processing Letters, vol. 5, no. 4, pp. 527538, 1995.
[30] P.B. Bhat, C.S. Raghavendra, and V.K. Prasanna, “Efficient Collective Communication in Distributed Heterogeneous Systems,” Proc. 19th Int'l Conf. Distributed Computing Systems (ICDCS'99), pp. 1524, 1999.
[31] L. Prylli and B. Tourancheau, “Fast Runtime Block Cyclic Data Redistribution on Multiprocessors,” J. Parallel and Distributed Computing, vol. 45, no. 1, pp. 6372, 1997.
[32] S. Srinivasan, R. Kettimuthu, V. Subramani, and P. Sadayappan, “Characterization of Backfilling Strategies for Parallel Job Scheduling,” Proc. Int'l Conf. Parallel Processing Workshops, pp.514519, 2002.
[33] N. Vydyanathan, S. Krishnamoorthy, G. Sabin, U. Catalyurek, T. Kurc, P. Sadayappan, and J. Saltz, “An Integrated Approach to Locality Conscious Processor Allocation and Scheduling of Mixed Parallel Applications,” Technical Report OSUCISRC2/08TR04, Ohio State Univ., ftp://ftp.cse.ohiostate.edu/pub/techreport/ 2008TR04.pdf, 2008.
[34] H. Kasahara and S. Narita, “Parallel Processing of RobotArm Control Computation on a Multiprocessor System,” IEEE J.Robotics and Automation, vol. A1, no. 2, pp. 104113, 1985.
[35] A.B. Downey, “A Model for Speedup of Parallel Programs,” Technical Report CSD97933, http://allendowney.com/researchmodel/, 1997.
[36] A.B. Downey, “A Parallel Workload Model and Its Implications for Processor Allocation,” Proc. Sixth Int'l Symp. High Performance Distributed Computing (HPDC '97), p. 112, 1997.
[37] Task Graphs for Free, http://ziyang.ece.northwestern.edu/tgffindex.html , 2008.