Algorithmics: the spirit of computing
Algorithmics: the spirit of computing
Information Processing Letters
Compared to what?: an introduction to the analysis of algorithms
Compared to what?: an introduction to the analysis of algorithms
Approximation algorithms for NP-hard problems
Parallel computation: models and methods
Parallel computation: models and methods
Introduction to Numerical Computation
Introduction to Numerical Computation
The Characterization of Data-Accumulating Algorithms
IPPS '99/SPDP '99 Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing
Three non Conventional Paradigms of Parallel Computation
Proceedings of the First Heinz Nixdorf Symposium on Parallel Architectures and Their Efficient Use
| Hi-index | 0.00 |
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 when computed by a sequential computer. Similar results were derived recently in the areas of real-time optimization and real-time cryptography.