Superlinear performance in real-time parallel computation

Journal of Supercomputing

Volumn 29, Issue 1, 2004, Pages 89-111

  Akl, Selim G ^a  

^a QUEEN S UNIVERSITY   (Canada)

Author keywords

Cryptography; Numerical analysis; Optimization; Parallelism; Real time computation; Superlinear quality up; Superlinear speedup

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER SIMULATION; CRYPTOGRAPHY; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING;

PARALLELISM; REAL-TIME COMPUTATION; SUPERLINEAR QUALITY-UP; SUPERLINEAR SPEEDUP;

REAL TIME SYSTEMS;

EID: 3543052263     PISSN: 09208542     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:SUPE.0000022574.59906.20     Document Type: Article

References (22)

1. S. G. Akl. Parallel real-time computation: Sometimes quantity means quality. Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, pp. 2-11, Dallas, Texas, December 2000.
2. S. G. Akl. Parallel Computation: Models and Methods, Prentice-Hall, Upper Saddle River, New Jersey, 1997.
3. S. G. Akl and S. D. Bruda. Parallel real-time optimization: Beyond speedup. Parallel Processing Letters, 9:499-509, 1999.
4. S. G. Akl and L. Fava Lindon. Paradigms for superunitary behavior in parallel computations. Journal of Parallel Algorithms and Applications, 11:129-153, 1997.
5. R. S. Barr and B. L. Hickman. Parallel simplex for large pure network problems: Computational testing and sources of speedup. Operations Research, 42:65-80, 1994.
6. A. Bestavros and V. Fay-Wolfe, eds., Real-Time Database and Information Systems, Kluwer Academic Publishers, Boston, 1997.
7. S. D. Bruda and S. G. Akl. A case study in real-time parallel computation: Correcting algorithms. Journal of Parallel and Distributed Computing, 61:688-708, 2001.
8. S. D. Bruda and S. G. Akl. Real-time computation: A formal definition and its applications. Proceedings of the Workshop on Advances in Parallel and Distributed Computational Models, 8 pages, San Francisco, California, cd-rom publication, April 2001.
9. S. D. Bruda and S. G. Akl. The characterization of data-accumulating algorithms. Theory of Computing Systems, 33:85-96, 2000.
10. J. L. Gustafson. Reevaluating Amdahl's law. Communications of the ACM, 31:532-533, 1988.
11. D. P. Helmbold and C. E. McDowell. Modeling speedup(n) greater than n. IEEE Transactions on Parallel and Distributed Systems, 1:250-256, 1990.
12. R. Janssen. A note on superlinear speedup. Parallel Computing, 4:211-213, 1987.
13. T. H. Lai and S. Sahni. Anomalies in parallel branch and bound algorithms. Communications of the ACM, 27:594-602, 1984.
14. H. W. Lawson. Parallel Processing in Industrial Real-Time Applications, Prentice Hall, Englewood Cliffs, New Jersey, 1992.
15. H. R. Lewis and C. H. Papadimitriou. Elements of the Theory of Computation, Prentice-Hall, Englewood Cliffs, New Jersey, 1981.
16. F. Luccio and L. Pagli. The p-shovelers problem (computing with time-varying data). Proceedings of the Fourth Symposium on Parallel and Distributed Computing, pp. 188-193, Arlington, Texas, December 1992.
17. F. Luccio and L. Pagli. Computing with time-varying data: Sequential complexity and parallel speed-up. Theory of Computing Systems, 31:5-26, 1998.
18. F. Luccio, L. Pagli, and G. Pucci. Three non-conventional paradigms of parallel computation. Lecture Notes in Computer Science, 678:166-175, 1992.
19. R. Mehrotra and E. F. Gehringer. Superlinear speedup through randomized algorithms. Proceedings of the International Conference on Parallel Processing, 291-300, 1985.
20. M. Nagy and S. G. Akl. Real-time minimum vertex cover for two-terminal series-parallel graphs. Proceedings of the Thirteenth Conference on Parallel and Distributed Computing and Systems, pp. 526-534, Anaheim, California, August 2001.
21. D. Parkinson. Parallel efficiency can be greater than unity. Parallel Computing, 3:261-262, 1986.
22. M. Thorin. Real-Time Transaction Processing, Macmillan, London, 1992.