Using runtime measured workload characteristics in parallel processor scheduling

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1162, Issue , 1996, Pages 155-174

  Nguyen, Thu D ^a   Vaswani, Raj ^a   Zahorjan, John ^a  

^a UNIVERSITY OF WASHINGTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EFFICIENCY; PARALLEL PROCESSING SYSTEMS;

INTERACTIVE ENVIRONMENTS; JOB CHARACTERISTICS; PARALLEL PROCESSOR SCHEDULING; PROTOTYPE IMPLEMENTATIONS; RUN-TIME MEASUREMENT; RUNNING APPLICATIONS; SHARED MEMORY MULTIPROCESSOR; WORKLOAD CHARACTERISTICS;

SCHEDULING;

EID: 84955586572     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0022293     Document Type: Conference Paper

References (26)

1. T. E. Anderson, B. N. Bershad, E. D. Lazowska, and H. M. Levy. Scheduler Activations: Effective Kernel Support for the User-Level Management of Parallelism. ACM Transactions on Computer Systems, 10(1): 53-79, Feb. 1992.
2. M. Berry, D. Chen, P. Koss, D. Kuck, S. Lo, Y. Pang, L. Pointer, R. Roloff, A. Sameh, E. Clementi, S. Chin, D. Schneider, G. Fox, P. Messina, D. Walker, C. Hsiung, J. Scharzmeier, K. Lue, S. Orszag, F. Seidl, O. Johnson, R. Goodrum, and J. Martin. The PERFECT Club Benchmarks: Effective Performance Evaluation of Supercomputers. The International Journal of Supercomputer Applications, 3(3): 5-40, 1989.
3. S.-H. Chiang, R. K. Mansharamani, and M. K. Vernon. Use of Application Characteristics and Limited Preemption for Run-To-Completion Parallel Processor Scheduling Policies. In Proceedings of the ACM SIGMETRICS Conference, pages 33-44, May 1994.
4. E. C. Cooper and R. P. Draves. C Threads. Technical Report CMU-CS-88-154, Department of Computer Science, Camegie-Mellon University, June 1988.
5. L. Dowdy. On the Partitioning of Multiprocessor Systems. Technical report, Vanderbilt University, June 1988.
6. D. L. Eager and J. Zahorjan. Chores: Enhanced Run-Time Support for Shared-Memory Parallel Computing. ACM Transactions on Computer Systems, 11(1): 1-32, Feb. 1993.
7. D. G. Feitelson and B. Nitzberg. Job Characteristics of a Production Parallel Scientific Workload on the NASA Ames iPSC/860. In Proceedings of the IPPS'95 Workshop on Job Scheduling Strategies for Parallel Processing, pages 337-360, Apr. 1995.
8. D. G. Feitelson and L. Rudolph. Coscheduling Based on Runtime Identification of Activity Working Sets. International Journal of Parallel Programming, 23(2): 135-160, Apr. 1995.
9. D. Ghosal, G. Serazzi, and S. Tripathi. The Processor Working Set and Its Use in Scheduling Multiprocessor Systems. IEEE Transactions on Software Engineering, 17(5): 443-453, May 1991.
10. K. Guha. Using Parallel Program Characteristics in Dynamic Processor Allocation Policies. Technical Report CS-95-03, Department of Computer Science, York University, May 1995.
11. Kendall Square Research Inc., 170 Tracer Lane, Waltham, MA 02154. KSR/Series Principles of Operation, 1994.
12. S. T. LeuteneggerandM. K. Vernon. The Performance of Multiprogrammed Multiprocessor Scheduling Policies. In Proceedings of the ACM SIGMETRICS Conference, pages 226-236, May 1990.
13. S. Majumdar, D. L. Eager, and R. B. Bunt. Scheduling in Multiprogrammed Parallel Systems. In Proceedings of the ACM SIGMETRICS Conference, pages 104-113, May 1988.
14. E. P. Markatos and T. J. LeBlanc. Using Processor Affinity in Loop Scheduling on Shared-Memory Multiprocessors. IEEE Transactions on Parallel and Distributed Systems, pages 379-400, Apr. 1994.
15. C. McCann, R. Vaswani, and J. Zahorjan. A Dynamic Processor Allocation Policy for Multiprogrammed Shared-Memory Multiprocessors. ACM Transactions on Computer Systems, 11(2): 146-178, May 1993.
16. G. P. McCormick. Nonlinear Programming. John Wiley & Sons, Inc., 1983.
17. T. D. Nguyen, R. Vaswani, and J. Zahonan. Maximizing Speedup Through Self-Tuning of Processor Allocation. In Proceedings of the 10th International Parallel Processing Symposium, pages 463-468, Apr. 1996.
18. T. D. Nguyen, R. Vaswani, and J. Zahonan. Parallel Application Characterization for Multiprocessor Scheduling Policy Design. In Proceedings of the IPPS'96 Workshop on Job Scheduling Strategies for Parallel Processing, Apr. 1996.
19. E. W. Parsons and K. C. Sevcik. Multiprocessor Scheduling for High-Variability Service Time Distribution. In Proceedings of the IPPS'95 Workshop on Job Scheduling Strategies for Parallel Processing, pages 127-145, Apr. 1995.
20. C. Polychronopoulos and D. Kuck. Guided Self-Scheduling: A Practical Scheduling Scheme for Parallel Supercomputers. IEEE Transactions on Computers, C-36(12): 1425-1439, Dec. 1987.
21. E. Rosti, E. Smirni, L. W. Dowdy, G. Serazzi, and B. M. Carlson. Robust Partitioning Policies of Multiprocessor Systems. Performance Evaluation, 19: 141-165, 1994.
22. K. C. Sevcik. Characterizations of Parallelism in Applications and their Use in Scheduling. In Proceedings of the ACM SIGMETRICS Conference, pages 171-180, May 1989.
23. K. C. Sevcik. Application Scheduling and Processor Allocation in Multiprogrammed Parallel Processing Systems. Performance Evaluation, 19(2/3): 107-140, Mar. 1994.
24. J. P. Singh, W.-D. Weber, and A. Gupta. SPLASH: Stanford Parallel Applications for Shared-Memory. Computer Architecture News, 20(1): 5-44, 1992.
25. P. B. Sobalvarro and W. E. Weihl. Demand-based Coscheduling of Parallel Jobs on Multiprogrammed Multiprocessors. In Proceedings of the IPPS'95 Workshop on Job Scheduling Strategies for Parallel Processing, pages 106-126, Apr. 1995.
26. A. Tucker and A. Gupta. Process Control and Scheduling Issues for Multiprogrammed Shared-Memory Multiprocessors. In Proceedings of the 12th ACM Symposium on Operating Systems Principles, pages 159-166, Dec. 1989.