References

1

G. Alverson, S. Kahan, R. Korry, C. McCann, and B. Smith. Scheduling on the Tera MTA. Job Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science, 949:19-44, 1995.

2

M. J. Bach. The Design of the UNIX Operating System. Prentice Hall Inc., 1986.

3

T. Brecht. Multiprogrammed parallel application scheduling in NUMA multiprocessors. Ph.D. Thesis, Technical Report CSRI-303, University of Toronto, Toronto, Ontario, June 1994.

4

T. B. Brecht. On the importance of parallel application placement in NUMA multiprocessors. In Proceedings of the Fourth Symposium on Experiences with Distributed and Multiprocessor Systems (SEDMS IV), pages 1-18, San Diego, CA, September 1993.

5

S. 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 1994 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, pages 33-44, Nashville, TN, May 1994.

6

E. Coffman and L. Kleinrock. Feedback queueing models for time-shared systems. Journal of the ACM, 15(4):549-576, October 1968.

7

L. Dowdy. On the partitioning of multiprocessor systems. In Performance 1990: An Internationional Conference on the Performance of Computers and Computer Networks, pages 99-129, March 1990.

8

D. L. Eager, J. Zahorjan, and E. D. Lazowska. Speedup versus efficiency in parallel systems. IEEE Transactions on Computers, 38(3):408-423, March 1989.

9

D. Feitelson and B. Nitzberg. Job characteristics of a production parallel scientific workload on the NASA Ames iPSC/860. Job Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science, 949:337-360, 1995.

10

H. P. Flatt and K. Kennedy. Performance of parallel processors. 12(1):1-20, 1989.

11

D. Ghosal, G. Serazzi, and S. K. Tripathi. The processor working set and its use in scheduling multiprocessor systems. IEEE Transactions on Software Engineering, 17(5):443-453, May 1991.

12

K. Guha. Using parallel program characteristics in dynamic multiprocessor allocation policies. M.Sc. Thesis, Technical Report CS-95-03, York University, North York, Ontario, May 1995.

13

A. Gupta, A. Tucker, and S. Urushibara. The impact of operating system scheduling policies and synchronization methods on the performance of parallel applications. In Proceedings of the 1991 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, pages 120-132, San Diego, CA, May 1991.

14

M. Harchol-Balter and A. Downey. Exploiting process lifetime distributions for dynamic load balancing. In Proceedings of the 1996 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, pages 13-24, Philadelphia, PA, May 1996.

15

J. L. Hellerstein. Achieving service rate objectives with decay usage scheduling. IEEE Transactions on Software Engineering, 19(8):812-825, August 1993.

16

L. Kleinrock. Queueing Systems Volume II: Computer Applications. John Wiley and Sons, 1976.

17

W. E. Leland and T. J. Ott. Load-balancing heuristics and process behavior. In Proceedings of the 1986 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, pages 54-69, Raleigh, NC, 1986.

18

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 Research Division, August, 1 1991.

19

S. T. Leutenegger and M. K. Vernon. The performance of multiprogrammed multiprocessor scheduling policies. In Proceedings of the 1990 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, pages 226-236, Boulder, CO, May 1990.

20

S. Majumdar, D. Eager, and R. B. Bunt. Scheduling in multiprogrammed parallel systems. In Proceedings of the 1988 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, pages 104-113, May 1988.

21

S. Majumdar, D. Eager, and R. B. Bunt. Characterisation of programs for scheduling in multiprogrammed parallel systems. Performance Evaluation, 13:109-130, 1991.

22

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.

23

C. McCann and J. Zahorjan. Scheduling memory constrained jobs on distributed memory parallel computers. In Proceedings of the 1995 ACM SIGMETRICS Joint International Conference on Measurement and Modeling of Computer Systems, pages 208-219, Ottawa, ON, May 1995.

24

T. Nguyen, R. Vaswani, and J. Zahorjan. Maximizing speedup through self-tuning of processor allocation. In Proceedings of the 10th International Parallel Processing Symposium, pages 463-468, Waikiki, HI, April 1996.

25

T. Nguyen, R. Vaswani, and J. Zahorjan. Using runtime measured workload characteristics in parallel processor scheduling. In Proceedings of the IPPS'96 Workshop on Job Scheduling Strategies for Parallel Processor Scheduling, pages 93-104, Waikiki, HI, April 1996.

26

E. Parsons and K. Sevcik. Multiprocessor scheduling for high-variability service time distributions. Job Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science, 949:127-145, 1995.

27

E. Parsons and K. Sevcik. Coordinated allocation of memory and processors in multiprocessors. In Proceedings of the 1996 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, pages 57-67, Philadelphia, PA, May 1996.

28

E. W. Parsons and K. C. Sevcik. Benefits of speedup knowledge in memory-constrained multiprocessor scheduling. In Proceedings of the 1996 Conference on Performance Theory, Measurement and Evaluation of Computer and Communication Systems, October 1996.

29

V. G. J. Peris, M. S. Squillante, and V. K. Naik. Analysis of the impact of memory in distributed parallel processing systems. In Proceedings of the 1994 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, pages 5-18, Nashville, TN, May 1994.

30

S. Setia. The interaction between memory allocations and adaptive partitioning in message-passing multiprocessors,. Job Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science, 949:146-164, 1995.

31

K. C. Sevcik. Characterizations of parallelism in applications and their use in scheduling. In Proceedings of the 1989 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, pages 171-180, 1989.

32

K. C. Sevcik. Application scheduling and processor allocation in multiprogrammed multiprocessors. Performance Evaluation, 9(2-3):107-140, 1994.

33

A. Tucker and A. Gupta. Process control and scheduling issues for multiprogrammed shared-memory multiprocessors. In Proceedings of the Twelfth ACM Symposium on Operating Systems Principles, pages 159-166, 1989.

34

T. H. Wonnacott and R. J. Wonnacott. Introductory Statistics. John Wiley and Sons, Inc., 1990.

35

Chee-Shong Wu. Processor scheduling in multiprogrammed shared memory NUMA multiprocessors. M.Sc. Thesis, University of Toronto, Toronto, Ontario, October 1993.

36

J. Zahorjan and C. McCann. Processor scheduling in shared memory multiprocessors. In Proceedings of the 1990 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, pages 214-225, Boulder, CO, May 1990.

37

S. Zhou and T. B. Brecht. Processor pool-based scheduling for large-scale NUMA multiprocessors. In Proceedings of the 1991 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, pages 133-142, San Diego, CA, May 1991.