Abstract
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.)
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
G.E. Blelloch, P.B. Gibbons, and Y. Matias, “Provably Efficient Scheduling for Languages with Fine-Grained Parallelism,” Proc. of 7th ACM Symposium on Parallel Algorithms and Architecture, 1995, pp. 1–12.
S.H. Chiang, R.K. Mansharamani, and M. Vernon, “Use of Application Characteristics and Limited Preemption for Run-to-Completion Parallel Processor Scheduling Policies,” Proc. of the 1994 ACM Sigmetrics Conference on Measurement and Modeling of Computer Systems, 1994, pp. 33–44.
D. Culler, R. Karp, D. Patterson, A. Sahay, K. Schauser, E. Santos, R. Subramonian, and T. von Eicken, “LogP: Towards a Realistic Model of Parallel Computation,” Proc. of Fourth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, San Diego, 1993, pp. 1–12.
X. Deng and E. Koutsoupias, “Competitive Implementation of Parallel Programs,” The Fourth Annual ACM–SIAM Symposium on Discrete Algorithms, 1993, pp. 455–461.
X. Deng and P. Dymond, “Efficient Routing and Message Bounds for Optimal Parallel Algorithms,” Proc. of 9th International Parallel Processing Symposium, Santa Barbara, California, 1995, pp. 556–562.
X. Deng, N. Gu, T. Brecht, and K. Lu, “Preemptive Scheduling of Parallel Jobs on Multiprocessors,” to be presented on The Seventh Annual ACM–SIAM Symposium on Discrete Algorithms, Atlanta, 1996.
A. Feldmann, M.-Y. Kao, J. Sgall, and S.-H. Teng, “Optimal Online Scheduling of Parallel Jobs with Dependencies,” Proc. of the 25th Annual ACM Symposium on the Theory of Computing, 1993, pp. 642–651.
L.A. Goldberg, M. Jerrum, and P.D. MacKenzie, “An Ω ({ie391-01}) Lower Bound for Routing in Optical Networks,” Proc. of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, 1994, pp. 147–156.
R.L. Graham, “Bounds for certain multiprocessor timing anomalies,” Bell System Technical Journal, vol. 45, pp. 1563–1581, 1966.
L. Hall and D. Shmoys, “Approximation Schemes for Constrained Scheduling Problems,” Proc. of the 30th Annual Symposium on Foundations of Computer Science, 1990, pp. 134–141.
A.R. Karlin, M.S. Manasse, L. Rudolph, and D.D. Sleator, “Competitive snoopy caching,” Algorithmica, vol. 3, pp. 79–119, 1988.
R.M. Karp and V. Ramachandran, “Parallel algorithms for shared-memory machines,” Handbook of Theoretical Computer Science, 1990, pp. 869–942.
M. Kumar, “Measuring parallelism in computation-intensive scientific/engineering applications,” IEEE Transactions on Computers, vol. 37, no.9, pp. 1088–1098, 1988.
T. Leighton, Introduction toParallel Algorithms and Architectures: Arrays–Trees–Hypercubes, Morgan-Kaufmann Publishers, 1992.
S.T. Leutenegger and M.K. Vernon, “The Performance of Multiprogrammed Multiprocessor Scheduling Policies,” Proc. of the 1990 ACM Sigmetrics Conference on Measurement and Modeling of Computer Systems, Boulder, CO, 1990, pp. 226–236.
S.T. Leutenegger and R.D. Nelson, “Analysis of spatial and temporal scheduling policies for semi-static and dynamic multiprocessor environments,” Technical Report RC 17086 (No. 75594), IBM T.J. Watson Research Center, Yorktown Heights, NY, 1991.
W. Ludwig and P. Tiwari, “The power of choice in scheduling parallel tasks,” Computer Science Department, University of Wisconsin, Madison, Report CS TR1190, Madison, WI, 1993.
M.S. Manasse, L.A. McGeoch, and D.D. Sleator, “Competitive Algorithms for On-line Problems,” Twentieth ACM Annual Symposium on Theory of Computing, 1988, pp. 322–333.
R. Mansharamani and M.K. Vernon, “Qualitative behavior of the EQS parallel processor allocation policy,” Technical Report CS TR 1192, Computer Sciences Department, University of Wisconsin, Madison, Madison, WI, 1993.
C. McCann, R. Vaswani, and J. Zahorjan, “A dynamic processor allocation policy for multiprogrammed, shared memory multiprocessors,” ACM Transactions on Computer Systems, vol. 11, no.2, pp. 146–178, 1993.
C. McCann and J. Zahorjan, “Scheduling Memory Constrained Jobs on Distributed Memory Parallel Computers,” Proc. of International Joint Conference on Measurement and Modeling of Computer Systems, ACM Sigmetrics 95 and Performance 95, 1995, pp. 208–219.
R. Motwani, S. Phillips, and E. Torng, “Non-Clairvoyant Scheduling,” Proc. of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms, Austin, Texas, 1993, pp. 422–431.
C. Papadimitriou and M. Yannakakis, “Towards an Architecture-Independent Analysis of Parallel Algorithms,” Proc. of the 20th ACM Symposium on Theory of Computing, 1988, pp. 510–513.
K.C. Sevcik, “Application scheduling and processor allocation in multiprogrammed multiprocessors,” Performance Evaluation, vol. 9, nos.2–3, pp. 107–140, 1994.
D.B. Shmoys, J. Wein, and D.P. Williamson, “Scheduling Parallel Machines On-line,” The 32nd Annual IEEE Symposium on Foundations of Computer Science, 1991, pp. 131–140.
D.D. Sleator and R.E. Tarjan, “Amortized efficiency of list update and paging rules,” Communications of the ACM, vol. 28, no.2, pp. 202–208, 1985.
A. Tucker and A. Gupta, “Process Control and Scheduling Issues for Multiprogrammed Shared-Memory Multiprocessors,” Proc. of the Twelfth ACM Symposium on Operating Systems Principles, 1989, pp. 159–166.
J. Turek, W. Ludwig, J.L. Wolf, L. Fleischer, P. Tiwari, J. Glasgow, U. Schwiegelshohn, and P.S. Yu, “Scheduling Parallelizable Tasks to Minimize Average Response Time,” Proc. of the 6th Annual Symposium on Parallel Algorithms and Architectures, 1994a, pp. 200–209.
J. Turek, U. Schwiegelshohn, J.L. Wolf, and P.S. Yu, “Scheduling Parallel Tasks to Minimize Average Response Time,” Proc. of the 5th SIAM Symposium on Discrete Algorithms, 1994b, pp. 112–121.
J. Turek, U. Schwiegelshohn, J.L. Wolf, and P.S. Yu, “A significantly smarter bound for a slightly smarter SMART algorithm,” IBM Research Division, T.J. Watson Research Center, Report RC19422 (84462), Yorktown Heights, NY 10598, 1994c.
L.G. Valiant, “A bridging model for parallel computation,” CACM, vol. 33, no.8, pp. 103–111, 1990a.
L.G Valiant, “General purpose parallel architectures,” Handbook of Theoretical Computer Science, J. van Leeuwen (Ed.), MIT Press/Elsevier, 1990b, pp. 943–972.
J. Zahorjan and C. McCann, “Processor Scheduling in Shared Memory Multiprocessors,” Proc. of the 1990 ACM Sigmetrics Conference on Measurement and Modeling of Computer Systems, Boulder, CO, 1990, pp. 214–225.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Deng, X., Dymond, P. On Multiprocessor System Scheduling. Journal of Combinatorial Optimization 1, 377–392 (1998). https://doi.org/10.1023/A:1009790611712
Issue Date:
DOI: https://doi.org/10.1023/A:1009790611712