Paging tradeoffs in distributed-shared-memory multiprocessors

Journal of Supercomputing

Volumn 10, Issue 1, 1996, Pages 87-104

  Burger, Douglas C ^a   Hyder, Rahmat S ^a   Miller, Barton P ^a   Wood, David A ^a  

^a University of Wisconsin Madison   (United States)

Author keywords

Scheduling; Shared memory multiprocessors; Synchronization; Virtual memory

Indexed keywords

COMPUTER OPERATING SYSTEMS; STORAGE ALLOCATION (COMPUTER); SUPERCOMPUTERS; SYNCHRONIZATION; VIRTUAL STORAGE;

CENTRAL PROCESSING UNIT; COMMODITY OPERATING SYSTEMS; DISTRIBUTED SHARED MEMORY MACHINE; PAGE FAULTING PROCESSOR; PARALLEL CONTEXT SWITCH; SHARED MEMORY PARALLEL APPLICATION PROGRAM;

PARALLEL PROCESSING SYSTEMS;

EID: 0030100544     PISSN: 09208542     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF00128100     Document Type: Article

References (19)

1. A. Agarwal, R. Simoni, M. Horowitz, and J. Hennessy. An evaluation of directory schemes for cache coherence. In Proceedings of the 15th Annual International Symposium on Computer Architecture, pp. 280-289, 1988.
2. T. Anderson. NOW: Distributed supercomputing on a network of workstations. Presentation at 1993 Fall ARPA HPC Software PI's meeting, September 1993.
3. T. Anderson, D. Culler, and D. Patterson. A case for networks of workstations: NOW. IEEE Micro, Feb. 1995.
4. D. Bailey, J. Barton, T. Lasinski, and H. Simon. The NAS parallel benchmarks. Technical Report RNR-91-002 Revision 2, NASA Ames Research Center, Aug. 1991.
5. F. J. Corbato. A paging experiment with the Multics system. Technical Report MAC-M-384, MIT, May 1968.
6. P. J. Denning. The working set model of program behavior. Communications of the ACM, II: 323-333, May 1968.
7. J. Dongarra, G. A. Geist, R. Manchek, and V. S. Sunderam. Integrated PVM framework supports heterogeneous network computing. Computers in Physics, 7: 166-174, March-April 1993.
8. D. L. Eager, J. Zahorjan, and E. D. Lazowska. Speedup versus efficiency in parallel systems. IEEE Transactions on Computers, 38: 408-123, March 1989.
9. D. G. Feitelson and L. Rudolph. Gang scheduling performance benefits for fine-grained synchronization. Journal of Parallel and Distributed Computing, 16: 306-318, December 1992.
10. L. Iftode, K. Li, and K. Petersen. Memory servers for multicomputer. In Proceedings of 1993 Spring CompCon, pp. 538-547, February 1993.
11. S. T. Leutenegger. Issues in multiprogrammed multiprocessor scheduling. Ph.D. thesis, University of Wisconsin-Madison, August 1990.
12. S. T. Leutenegger and X.-H. Sun. Distributed computing feasibility in a non-dedicated homogenous distributed system. In Proceedings of ACM Supercomputing '93, 1993.
13. J. K. Ousterhout, D. A. Scelza, and P. S. Sindhu. Medusa: An experiment in distributed operating system structure. Communications of the ACM, 23: 92-105, February 1980.
14. S. K. Reinhardt, M. D. Hill, J. R. Larus, A. R. Lebeck, J. C. Lewis, and D. A. Wood. The Wisconsin Wind Tunnel: Virtual prototyping of parallel computers. In Proceedings of the 1993 ACM Sigmetrics Conference on Measurement and Modeling of Computer Systems, pp. 48-60, May 1993.
15. E. Sharakan. Personal communication, April 1994.
16. J. P. Singh, W.-D. Weber, and A. Gupta. SPLASH: Stanford parallel applications for shared memory. Computer Architecture News, 20: 5-44, March 1992.
17. F. Traenkle. Parallel programming models and boundary integral equation methods for microstructure electrostatics. Master's thesis, University of Wisconsin-Madison, 1993.
18. D. Thiebaut and H. Stone. Footprints in the cache. ACM Transactions on Computer Systems, 5: 305-329, November 1987.
19. S. Zhou, J. Wang, X. Zheng, and P. Delisle. Utopia: A load sharing system for large, heterogeneous distributed computer systems. CSRI Technical Report 257, Computer Systems Research Institute, University of Toronto, April 1992.