Performance considerations of shared virtual memory machines
Citations Over TimeTop 14% of 1995 papers
Abstract
Generalized speedup is defined as parallel speed over sequential speed. In this paper the generalized speedup and its relation with other existing performance metrics, such as traditional speedup, efficiency, scalability, etc., are carefully studied. In terms of the introduced asymptotic speed, we show that the difference between the generalized speedup and the traditional speedup lies in the definition of the efficiency of uniprocessor processing, which is a very important issue in shared virtual memory machines. A scientific application has been implemented on a KSR-1 parallel computer. Experimental and theoretical results show that the generalized speedup is distinct from the traditional speedup and provides a more reasonable measurement. In the study of different speedups, an interesting relation between fixed-time and memory-bounded speedup is revealed. Various causes of superlinear speedup are also presented.
Related Papers
- → Hadoop Superlinear Scalability(2015)20 cited
- Quantifying the Sub-optimality of Uniprocessor Fixed Priority Pre-emptive Scheduling for Sporadic Tasksets with Arbitrary Deadlines(2009)
- → Comparison of speedups for computing π using .NET TPL and OpenMP parallelization techonologies(2014)2 cited
- → Visual Search Optimization(2015)1 cited
- → Image processing in airborne applications using multicore embedded computers(2013)