A new formula for speedup and its characterization

Acta Informatica

Volumn 34, Issue 8, 1997, Pages 637-652

  Aczél, János ^a   Ertel, Wolfgang ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b UNIVERSITY OF APPLIED SCIENCES RAVENSBURG WEINGARTEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; FUNCTIONS; PROBABILITY DISTRIBUTIONS; PROBLEM SOLVING; PROGRAM PROCESSORS; RANDOM PROCESSES;

RUNNING TIME; SPEEDUP;

PARALLEL ALGORITHMS;

EID: 0031295221     PISSN: 00015903     EISSN: None     Source Type: Journal    
DOI: 10.1007/s002360050100     Document Type: Article

References (18)

1. J. Aczél: Lectures on Functional Equations and Their Applications, pp. 148-151, 239-244, 278-287, 291. New York, London: Academic Press 1966
2. J. Aczél: A Short Course on Functional Equations Based Upon Recent Applications to the Social and Behavioral Sciences, pp. 25-28, 71-80, 122-132. Dordrecht, Boston, Lancaster, Tokyo: Reidel (Kluwer) 1987
3. J. Aczél: Determining Merged Relative Scores. J. Math. Analysis Appl. 150, 20-40 (1990)
4. J. Aczél: Why, How and How Not to Apply Mathematics to Economics and to Other Social and Behavioral Sciences. An Example: Merging Relative Scores. Grazer Math. Ber. 315, 1-12 (1991)
5. J. Aczél, C. Alsina: On Synthesis of Judgements. Socio-Econ. Plann. Sci. 20, 333-339 (1986)
6. J. Aczél, T.L. Saaty: Procedures for Synthesizing Ratio Judgements. J. Math. Psych. 27, 93-102 (1983)
7. W. Ertel: Random Competition: A Simple, but Efficient Method for Parallelizing Inference Systems. In: Parallelization in Inference Systems. Lect. Notes in Artif. Intell. 590, pp. 195-209. Berlin, Heidelberg, New York: Springer 1992
8. W. Ertel: On the Definition of Speedup. In: PARLE'94, Parallel Architectures and Languages Europe. Lect. Notes Comput. Sci. 817, pp. 289-300. Berlin, Heidelberg, New York: Springer 1994
9. P.J. Fleming, J.J. Wallace: How not to Lie with Statistics: The Correct Way to Summarize Benchmark Results. Commun. ACM 29, 218-221 (1986)
10. A. Goerdt, U. Kamps: On the Reasons for Average Superlinear Speedup in Parallel Backtrack Search. In: Computer Science Logic 93. Lect. Notes Comput. Sci. 832, pp. 106-127. Berlin, Heidelberg, New York: Springer 1994
11. G.H. Hardy, J.E. Littlewood, G. Polya: Inequalities, pp 65-69, 57-162. Cambridge: Cambridge University Press 1952
12. R. Mehrotra, E.F. Gehringer: Superlinear Speedup Through Randomized Algorithms. In: International Conference on Parallel Processing, pp. 291-300. New York: IEEE Computer Society Press 1985
13. K.S. Natarajan: Expected Performance of Parallel Search. In: International Conference on Parallel Processing, pp. 121-125. New York: IEEE Computer Society Press 1989
14. V.N. Rao, V. Kumar: On the Efficiency of Parallel Depth-First Search. IEEE Transactions on Parallel and Distributed Systems 4, 427-437 (1993)
15. F. S. Roberts: Merging Relative Scores. J. Math. Analysis Appl. 147, 30-52 (1990)
16. J.E. Smith: Characterizing Computer Performance with a Single Number. Commun. ACM 31, 1202-1206 (1988)
17. E. Speckenmeyer, B. Monien, O. Vornberger: Superlinear Speedup for Parallel Backtracking. In: Supercomputing. Lect. Notes Comput. Sci. 297, pp. 985-994. Berlin, Heidelberg, New York: Springer 1988
18. X.-H. Sun, J.L. Gustafson: Toward a Better Parallel Performance Metric Parallel Computing 17, 1093-1109 (1991)