Preemptive scheduling of parallel jobs on multiprocessors

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn Part F129447, Issue , 1996, Pages 159-167

  Deng, Xiaotie ^a   Gu, Nian ^a   Brecht, Tim ^a   Lu, KaiCheng ^b  

^a YORK UNIVERSITY   (Canada)

^b TSINGHUA UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

APPROXIMATION RATIOS; JOB EXECUTION; JOB MODELING; MEAN RESPONSE TIME; PARALLEL JOBS; PRE-EMPTIVE SCHEDULING; PROCESSOR SCHEDULING; SINGLE PHASE;

SCHEDULING;

EID: 84968441721     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (29)

1. 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", Proceedings of Fourth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, San Diego, pp. 1-12, May, 1993.
2. S. H. Chiang, R. K. Mansharamani, and M. Vernon, "Use of Application Characteristics and Limited Preemption for Run-to-Completion Parallel Processor Scheduling Policies", Proceedings of the 1994 ACM Sigmetrics Conference on Measurement and Modeling of Computer Systems, pp. 33-44, 1994.
3. X. Deng and E. Koutsoupias, "Competitive Implementation Of Parallel Programs", The Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 1993, pp. 455-461.
4. X. Deng and C. H. Papadimitriou, "On the Complexity of Cooperative Game Solution Concepts", Mathematics of Operations Research, Vol. 19, No. 2 (1994), pp. 257-266.
5. D.L. Eager, J. Zahorjan, and E.D. Lazowska, "Speedup Versus Efficiency in Parallel Systems", IEEE Trans. on Computers, Vol. 38., No. 3, pp. 408-423, 1989.
6. M. R. Garey, R. L. Graham, "Bounds for Multiprocessor Scheduling with Resource Constraints", SIAM Journal of Computing, Vol. 4, No. 2, pp. 187-200, June, 1975.
7. K. Guha, "Using Parallel Program Characteristics in Dynamic Multiprocessor Allocation Policies" M.Sc. Thesis, Technical Report CS-95-03, Department of Computer Science, York University, May, 1995.
8. A.R. Karlin, M.S. Manasse, L. Rudolph, and D.D. Sleator. "Competitive Snoopy Caching", Algorithmica 3 pp. 79-119, 1988.
9. M. Kumar, "Measuring Parallelism in Computation-Intensive Scientific/Engineering Applications", IEEE Transactions on Computers Vol. 37, No. 9, September, 1988, pp. 1088-1098.
10. 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, August, 1991.
11. 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, November, 1993.
12. S. T. Leutenegger and M. K. Vernon, "The Performance of Multiprogrammed Multiprocessor Scheduling Policies", Proceedings of the 1990 ACM Sigmetrics Conference on Measurement and Modeling of Computer Systems, pp. 226-236, Boulder, CO, May, 1990.
13. 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, November, 1993.
14. M.S. Manasse, L.A. McGeoch, and D.D. Sleator, "Competitive algorithms for on-line problems", Twentieth ACM Annual Symposium on Theory of Computing, pp. 322-333, 1988.
15. R. Motwani, S. Phillips, and E. Torng "Non-Clairvoyant Scheduling", Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 422-431, Austin, Texas, January, 1993.
16. 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, May, 1993.
17. C. McCann and J. Zahorjan, "Scheduling Memory Constrained Jobs on Distributed Memory Parallel Computers", Proceedings of International Joint Conference on Measurement & Modeling of Computer Systems, ACM Sigmetrics 95 and Performance 95, pp. 208-219, 1995.
18. C. Papadimitriou, and M. Yannakakis, "Towards an Architecture-Independent Analysis of Parallel Algorithms", Proceedings of the 20th A CM Symposium on Theory of Computing, pp. 510-513, 1988.
19. K. C. Sevcik, "Application Scheduling and Processor Allocation in Multiprogrammed Multiprocessors", Performance Evaluation, Vol. 9, No. 2-3, pp. 107-140, May, 1994.
20. K. C. Sevcik, "Characterizations of Parallelism in Applications and their use in Scheduling", Proceedings of the 1989 ACM Sigmetrics Conference on Measurement and Modeling of Computer Systems, pp. 171-180, May, 1989.
21. A. Silberschatz, J. Peterson, P. Galvin, Operating System Concepts, Addison-Wesley Publishing Company, New York, 1991.
22. 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.
23. D. B. Shmoys, J. Wein, and D. P. Williamson, "Scheduling Parallel Machines On-line", Foundations of Computer Science, pp. 131-140, 1991.
24. A. Tucker and A. Gupta, "Process Control and Scheduling Issues for Multiprogrammed Shared-Memory Multiprocessors", Proceedings of the Twelfth ACM Symposium on Operating Systems Principles, pp. 159-166, 1989.
25. J. Turek, W. Ludwig, J. L. Wolf, L. Fleischer, P. Tiwari, J. Glasgow, U. Schwiegelshohn, P. S. Yu, "Scheduling Parallelizable Tasks to Minimize Average Response Time", Proceedings of the 6th Annual Sympostum on Parallel Algorithms and Architectures, pp. 200-209, June, 1994.
26. J. Turek, U. Schwiegelshohn, J. L. Wolf, P. S. Yu, "Scheduling Parallel Tasks to Minimize Average Response Time", Proceedings of the 5th SIAM Symposium on Discrete Algorithms, pp. 112-121, 1994.
27. J. Turek, U. Schwiegelshohn, J. L. Wolf, 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, February, 1994.
28. L. G. Valiant, "A Bridging Model for Parallel Computation", CACM, Vol. 33, No. 8, pp. 103-111, August, 1990.
29. J. Zahorjan and C. McCann, "Processor Scheduling in Shared Memory Multiprocessors", Proceedings of the 1990 ACM Sigmetrics Conference on Measurement and Modeling of Computer Systems, pp. 214-225, Boulder, CO, May, 1990.