References

1

M. J. Atallah, C. L. Black, D. C. Marinescu, H. J. Siegel, and T. L. Casavant. Models and algorithms for coscheduling compute-intensive tasks on a network of workstations. Journal of Parallel and Distributed Computing, 16(4):319-327, Dec 1992.

2

F. Berman and R. Wolski. AppLeS home page http://www-cse.ucsd.edu/groups/hpcl/apples/apples.html. University of California at San Diego, 1996.

3

M. V. Devarakonda and R. K. Iyer. Predictability of process resource usage: A measurement-based study on UNIX. IEEE Transactions on Software Engineering, 15(12):1579-86, December 1989.

4

A. B. Downey. A model for speedup of parallel programs. Technical Report CSD-97-933, University of California at Berkeley, 1997.

5

A. B. Downey. Using queue time predictions for processor allocation. Technical Report CSD-97-929, University of California at Berkeley, 1997. To appear at the Job Scheduling Strategies for Parallel Programming Workshop at IPPS '97.

6

D. G. Feitelson and B. Nitzberg. Job characteristics of a production parallel scientific workload on the NASA Ames iPSC/860. In D. G. Feitelson and L. Rudolph, editors, Job Scheduling Strategies for Parallel Processing, Springer-Verlag LNCS Vol 949, pages 337-360, April 1995.

7

J. C. French, A. S. Grimshaw, W. A. Wulf, A. C. Weaver, and P. F. Reynolds, Jr. Legion home page http://www.cs.virginia.edu/mentat/legion/legion.html. University of Virginia, 1996.

8

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

9

S. Hotovy. Personal correspondence. 1996.

10

S. Hotovy. Workload evolution on the Cornell Theory Center IBM SP2. In D. G. Feitelson and L. Rudolph, editors, Job Scheduling Strategies for Parallel Processing, Springer-Verlag LNCS Vol 1162, pages 27-40. April 1996.

11

S. Hotovy, D. Schneider, and T. O'Donnell. Analysis of the early workload on the Cornell Theory Center IBM SP2. Technical Report 96TR234, Cornell Theory Center, January 1996.

12

W. E. Leland and T. J. Ott. Load-balancing heuristics and process behavior. In Proceedings of Performance and ACM Sigmetrics, volume 14, pages 54-69, 1986.

13

R. Moore and R. Klobuchar. DOCT home page http://www.sdsc.edu/DOCT. San Diego Supercomputer Center, 1996.

14

K. Steube and R. Moore. Paragon throughput analysis. In Proceedings of the Intel Supercomputer Users Group, pages 264-267, June 1994.

15

M. Wan, R. Moore, G. Kremenek, and K. Steube. A batch scheduler for the Intel Paragon with a non-contiguous node allocation algorithm. In D. G. Feitelson and L. Rudolph, editors, Job Scheduling Strategies for Parallel Processing, Springer-Verlag LNCS Vol 1162, pages 48-64, April 1996.

16

K. Windisch, V. Lo, D. Feitelson, B. Nitzberg, and R. Moore. A comparison of workload traces from two production parallel machines. In 6th Symposium on the Frontiers of Massively Parallel Computation, 1996.