Working sets, cache sizes, and node granularity issues for large-scale multiprocessors
Edward E. Rothberg, Jaswinder Singh, Anoop Gupta · Proceedings - International Symposium on Computer Architecture/Proceedings · 1993
The distribution of resources among processors, memory and caches is a crucial question faced by designers of large-scale parallel machines. If a machine is to solve problems with a certain data set size, should it be built with a large number of processors each with a small amount of memory, or a smaller number of processors each with a large amount of memory? How much cache memory should be provided per processor for cost-effectiveness? And how do these decisions change as larger problems are run on larger machines?
Cited by 115 works. doi:10.1145/165123.165126 Open-access PDF
Authors
References
- Solving Problems on Concurrent Processors
- Computational Frameworks for the Fast Fourier Transform
- FFTs in external or hierarchical memory
- Parallel hierarchical N-body methods
- Volume rendering on scalable shared-memory MIMD architectures
- Scaling parallel programs for multiprocessors: methodology and examples
- Solid State: VLSI: Some fundamental challenges: Defining and designing the products made possible by very-large-scale integration are first on the list of priority tasks
- Solving Problems On Concurrent Processors Vol. 1: General Techniques and Regular Problems
- Memory requirements for balanced computer architectures
- Hierarchical N-body methods