Abstract | ||
---|---|---|
In this paper we study the performance of applications on multiprocessor systems. In particular we investigate the effect of synchronization and parallelization overhead where the fact that part of the application may be inherently sequential is taken into account. By relating our assumptions to an earlier work by Flatt and Kennedy we establish that the overhead function can be characterized using the concept of convex functions. In order to observe a satisfactory payoff for increased processing power it is essential to increase the problem size accordingly. We discuss linear and nonlinear scaling schemes and compare the corresponding asymptotic performance behaviour. Throughout this investigation we profit from the well developed mathematical apparatus of convex functions. |
Year | DOI | Venue |
---|---|---|
1991 | 10.1016/S0167-8191(05)80003-1 | PARALLEL COMPUTING |
Keywords | Field | DocType |
GUSTAFSON LAW,SPEEDUP,EFFICIENCY,SCALING,PARALLEL OVERHEAD,MULTIPROCESSOR SYSTEMS,ASYMPTOTIC PERFORMANCE BEHAVIOR | Synchronization,Nonlinear system,Computer science,Parallel computing,Algorithm,Multiprocessing,Theoretical computer science,Convex function,Gustafson's law,Scaling,Stochastic game,Speedup | Journal |
Volume | Issue | ISSN |
17 | 12 | 0167-8191 |
Citations | PageRank | References |
2 | 0.46 | 3 |
Authors | ||
1 |
Name | Order | Citations | PageRank |
---|---|---|---|
Dieter Müller-Wichards | 1 | 22 | 6.56 |