Parallel real-time numerical computation: beyond speedup. III

For pt. II see Technical Report No. 99-423, Dept. of Comput. and Inf. Sci., Queen's University, Kingston, Ontario, May 1999. Parallel computers can do more than simply speed up sequential computations. They are capable of finding solutions that are far better in quality than those obtained by sequential computers. This fact is demonstrated by analyzing sequential and parallel solutions to numerical problems in a real-time paradigm. In this setting, numerical data required to solve a problem are received as input by a computer system, at regular intervals. The computer must process its inputs as soon as they arrive. It must also produce its outputs at regular intervals, as soon as they are available. We show that for some real-time numerical problems a parallel computer can deliver a solution that is significantly more accurate than that computed by a sequential computer. Similar results were derived recently in the areas of real-time optimization and real-time cryptography.

[1]  J. Miller.  Numerical Analysis , 1966, Nature.

[2]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[3]  Curtis F. Gerald.  Applied numerical analysis , 1970 .

[4]  G. Stewart.  Introduction to matrix computations , 1973 .

[5]  A. Pan,et al.  On Finding and Updating Spanning Trees and Shortest Paths , 1975, SIAM J. Comput..

[6]  Donald E. Knuth,et al.  The art of computer programming: V.1.: Fundamental algorithms , 1997 .

[7]  Francis Y. L. Chin,et al.  Algorithms for Updating Minimal Spanning Trees , 1978, J. Comput. Syst. Sci..

[8]  Shimon Even,et al.  An On-Line Edge-Deletion Problem , 1981, JACM.

[9]  J. Douglas Faires,et al.  Numerical Analysis , 1981 .

[10]  Selim G. Akl,et al.  Design, Analysis, and Implementation of a Parallel Tree Search Algorithm , 1982, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[11]  Greg N. Frederickson,et al.  Data structures for on-line updating of minimum spanning trees , 1983, STOC.

[12]  Toshihide Ibaraki,et al.  On-Line Computation of Transitive Closures of Graphs , 1983, Inf. Process. Lett..

[13]  J. Thomas King,et al.  Introduction to numerical computation , 1984 .

[14]  Selim G. Akl,et al.  Design and analysis of parallel algorithms , 1985 .

[15]  I. V. Ramakrishnan,et al.  O(1) Parallel Time Incremental Graph Algorithms , 1985, FSTTCS.

[16]  I. V. Ramakrishnan,et al.  An O(log n) Algorithm for Parallel Update of Minimum Spanning Trees , 1986, Inf. Process. Lett..

[17]  S. Yakowitz,et al.  An Introduction to Numerical Computations , 1986 .

[18]  Peter J. Varman,et al.  A Parallel Vertex Insertion Algorithm For Minimum Spanning Trees , 1986, ICALP.

[19]  Yishai A. Feldman,et al.  Algorithmics: The Spirit of Computing , 1987 .

[20]  David Harel,et al.  The spirit of computing , 1987 .

[21]  Kurt Mehlhorn,et al.  Parallel Algorithms for Computing Maximal Independent Sets in Trees and for Updating Minimum Spanning Trees , 1988, Inf. Process. Lett..

[22]  Gilles Brassard,et al.  Algorithmics - theory and practice , 1988 .

[23]  L. Boxer,et al.  Dynamic computational geometry on parallel computers , 1989, C3P.

[24]  Shaunak Pawagi,et al.  A Parallel Algorithm for Multiple Updates of Minimum Spanning Trees , 1989, ICPP.

[25]  P. Chaudhuri.  Finding and Updating Depth-First Spanning Trees of Acyclic Digraphs in Parallel , 1990, Comput. J..

[26]  Fabrizio Luccio,et al.  The p-shovelers problem: (computing with time-varying data) , 1992, SIGA.

[27]  Gregory J. E. Rawlins.  Compared to what? - an introduction to the analysis of algorithms , 1992, Principles of computer science series.

[28]  Pranay Chaudhuri.  Parallel algorithms: design and analysis , 1992 .

[29]  R. Sarnath,et al.  Proceedings of the International Conference on Parallel Processing , 1992 .

[30]  Fabrizio Luccio,et al.  Three non Conventional Paradigms of Parallel Computation , 1992, Heinz Nixdorf Symposium.

[31]  John H. Reif,et al.  Synthesis of Parallel Algorithms , 1993 .

[32]  Peter Bro Miltersen,et al.  Complexity Models for Incremental Computation , 1994, Theor. Comput. Sci..

[33]  Selim G. Akl,et al.  Paradigms Admitting Superunitary Behaviour in Parallel Computation , 1994, Parallel Algorithms Appl..

[34]  Sandy Irani,et al.  Online computation , 1996 .

[35]  Pranay Chaudhuri.  Parallel Incremental Algorithms for Analyzing Activity Networks , 1998, Parallel Algorithms Appl..

[36]  D. S. SzyId,et al.  Parallel Computation: Models And Methods , 1998, IEEE Concurrency.

[37]  S. Sitharama Iyengar,et al.  Introduction to parallel algorithms , 1998, Wiley series on parallel and distributed computing.

[38]  Fabrizio Luccio,et al.  Computing with Time-Varying Data: Sequential Complexity and Parallel Speed-Up , 1998, Theory of Computing Systems.

[39]  Selim G. Akl,et al.  Parallel Real-Time Optimization: Beyond Speedup , 1999, Parallel Process. Lett..

[40]  Selim G. Akl,et al.  The Characterization of Data-Accumulating Algorithms , 2000, Theory of Computing Systems.

[41]  Selim G. Akl,et al.  Nonlinearity, Maximization, and Parallel Real-Time Computation , 2000 .

[42]  Selim G. Akl,et al.  Parallel Real-Time Cryptography: Beyond Speedup II , 2000, PDPTA.

[43]  Selim G. Akl,et al.  The Design of Efficient Parallel Algorithms , 2000, Handbook on Parallel and Distributed Processing.

[44]  Selim G. Akl,et al.  On the Data-Accumulating Paradigm , 2001 .

[45]  Selim G. Akl,et al.  A Case Study in Real-Time Parallel Computation: Correcting Algorithms , 2001, J. Parallel Distributed Comput..

[46]  Selim G. Akl,et al.  Secure File Transfer: A Computational Analog To The Furniture Moving Paradigm , 2002, Scalable Comput. Pract. Exp..