On Multiprocessor System Scheduling

We show that there is a good algorithm for scheduling the average completion time of a set of unknown DAGs (i.e., data dependency relation graphs of programs) on a multiprocessor in the PRAM model (Karp and Ramachandran, 1990) (orother similar shared memory models.) Then, we show that a large class ofparallel jobs can be scheduled with near-optimal average completion time in the BSP model (Valiant, 1990a) though this is not possible for theclass of all unknown DAGs (Deng and Koutsoupias, 1993) (the same holds forother similar distributed memory models.)

[1]  Ronald L. Graham,et al.  Bounds for certain multiprocessing anomalies , 1966 .

[2]  Richard M. Karp,et al.  Parallel Algorithms for Shared-Memory Machines , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[3]  Guy E. Blelloch,et al.  Provably efficient scheduling for languages with fine-grained parallelism , 1995, SPAA '95.

[4]  Leslie G. Valiant,et al.  General Purpose Parallel Architectures , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[5]  Xiaotie Deng,et al.  Efficient routing and message bounds for optimal parallel algorithms , 1995, Proceedings of 9th International Parallel Processing Symposium.

[6]  Anoop Gupta,et al.  Process control and scheduling issues for multiprogrammed shared-memory multiprocessors , 1989, SOSP '89.

[7]  Mary K. Vernon,et al.  The performance of multiprogrammed multiprocessor scheduling algorithms , 1990, SIGMETRICS '90.

[8]  David P. Williamson,et al.  Scheduling parallel machines on-line , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[9]  Anja Feldmann,et al.  Optimal online scheduling of parallel jobs with dependencies , 1993, STOC.

[10]  Raj Vaswani,et al.  A dynamic processor allocation policy for multiprogrammed shared-memory multiprocessors , 1993, TOCS.

[11]  David B. Shmoys,et al.  Approximation schemes for constrained scheduling problems , 1989, 30th Annual Symposium on Foundations of Computer Science.

[12]  John Zahorjan,et al.  Scheduling memory constrained jobs on distributed memory parallel computers , 1995, SIGMETRICS '95/PERFORMANCE '95.

[13]  Xiaotie Deng,et al.  Preemptive Scheduling of Parallel Jobs on Multiprocessors , 1996, SIAM J. Comput..

[14]  John Zahorjan,et al.  Processor scheduling in shared memory multiprocessors , 1990, SIGMETRICS '90.

[15]  Robert E. Tarjan,et al.  Amortized efficiency of list update and paging rules , 1985, CACM.

[16]  Mihalis Yannakakis,et al.  Towards an architecture-independent analysis of parallel algorithms , 1990, STOC '88.

[17]  Leslie G. Valiant,et al.  A bridging model for parallel computation , 1990, CACM.

[18]  Mary K. Vernon,et al.  Qualitative Behavior of the EQS Parallel Processor Allocation Policy , 1993 .

[19]  Ramesh Subramonian,et al.  LogP: towards a realistic model of parallel computation , 1993, PPOPP '93.

[20]  Xiaotie Deng,et al.  Competitive Implementation of Parallel Programs , 1993, SODA '93.

[21]  Lyle A. McGeoch,et al.  Competitive algorithms for on-line problems , 1988, STOC '88.

[22]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[23]  Philip S. Yu,et al.  Scheduling parallel tasks to minimize average response time , 1994, SODA '94.

[24]  Rajeev Motwani,et al.  Non-clairvoyant scheduling , 1994, SODA '93.

[25]  Philip S. Yu,et al.  Scheduling parallelizable tasks to minimize average response time , 1994, SPAA '94.

[26]  Manoj Kumar,et al.  Measuring Parallelism in Computation-Intensive Scientific/Engineering Applications , 1988, IEEE Trans. Computers.

[27]  Mary K. Vernon,et al.  Use of application characteristics and limited preemption for run-to-completion parallel processor scheduling policies , 1994, SIGMETRICS.