The Processor Working Set and Its Use in Scheduling Multiprocessor Systems

IEEE Transactions on Software Engineering

Volumn 17, Issue 5, 1991, Pages 443-453

  Ghosal, Dipak ^a   Serazzi, Giuseppe ^b   Tripathi, Satish K ^a  

^a UNIVERSITY OF MARYLAND   (United States)

^b UNIVERSITY OF MILAN   (Italy)

Author keywords

Allpcation policies; multiprocessors

Indexed keywords

SCHEDULING;

ALLOCATION POLICIES; MULTIPROCESSOR SCHEDULING; PARALLEL WORKLOAD CHARACTERIZATION; PROCESSOR WORKING SET; QUICKSORT ALGORITHM; TRANSPUTER NET;

COMPUTER SYSTEMS, DIGITAL;

EID: 0026152333     PISSN: 00985589     EISSN: None     Source Type: Journal    
DOI: 10.1109/32.90447     Document Type: Article

References (17)

1. S. G. Akl, Parallel Sorting Algorithms. Englewood Cliffs, NJ: Prentice-Hall, 1988.
2. D. L. Eager, J. Zahorjan, and E. D. Lazowska, “Speedup versus efficiency in parallel systems,” IEEE Trans. Comput., Vol. 38, pp. 408-423, Mar. 1989.
3. L. W. Dowdy, “On the partitioning of multiprocessor systems,” Dept. Comput. Sci., Vanderbilt Univ., Nashville, TN, Tech. Rep., Mar. 1988.
4. M. Fox et al., Solving Problems on Concurrent Processors, Vol. 1. Englewood Cliffs, NJ: Prentice-Hall, 1988.
5. E. Gelenbe, Multiprocessor Performance. New York: Wiley, 1989.
6. D. Ghosai, G. Serazzi, and S. K. Tripathi, “The concept of processor working set for allocation strategies in multiprogrammed parallel systems,” UMIACS, Univ. Maryland, College Park, Tech. Rep. TR-89-95, CS-TR-2323, 1989.
7. W. D. Hillis, The Connection Machine. Cambridge, MA: MIT Press, 1985.
8. The Transputer Family: Product Information, INMOS Group of Companies, June 1986.
9. L. Kleinrock, “Power and deterministic rules of thumb for probabilistic problems in computer communications,” in Proc. Int. Conf. Communications, June 1979, pp. 43.1.1-43.1.10.
10. M. Kumar, “Measuring parallelism in computation-intensive scientific/engineering applications,” IEEE Trans. Comput., Vol. 37, pp. 1088-1098, Sept. 1988.
11. R. B.-L. Lee, “Empirical results on the speedup, efficiency, redundancy, and quality of parallel computations,” in Proc. Int. Conf. Parallel Processing, Aug. 1980, pp. 91-96.
12. M. R. Leuze, L. W. Dowdy, and K. H. Park, “Multiprogramming a distributed-memory multiprocessor,” J. Concurrency Practice, 1989.
13. S. Majumdar, D. L. Eager, and R. Bunt, “Scheduling in multiprogrammed parallel systems,” ACM SIGMETRICS, pp. 104-113, 1988.
14. Multimax Technical Summary, Encore Computer Corp., Marlboro, MA, May 1985.
15. K. H. Park and L. W. Dowdy, “Dynamic partitioning of multiprocessor systems,” Int. J. Parallel Program., 1989.
16. K. C. Sevcik, “Characterization of parallelism in applications and their use in scheduling,” ACM SIGMETRICS, pp. 171-180, 1989.
17. The QNAP2 Reference Manual, Simulog Corp., France, 1989.