Parallel efficiency can be greater than unity
Parallel Computing
Communications of the ACM
Parallel processing in industrial real-time applications
Parallel processing in industrial real-time applications
Parallel computation: models and methods
Parallel computation: models and methods
Anomalies in parallel branch-and-bound algorithms
Communications of the ACM
A case study in real-time parallel computation: correcting algorithms
Journal of Parallel and Distributed Computing
Real-Time Database and Information
Real-Time Database and Information
Elements of the Theory of Computation
Elements of the Theory of Computation
Modeling Speedup (n) Greater than n
IEEE Transactions on Parallel and Distributed Systems
Real-Time Computation: A Formal Definition and its Applications
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Three non Conventional Paradigms of Parallel Computation
Proceedings of the First Heinz Nixdorf Symposium on Parallel Architectures and Their Efficient Use
Parallel Real-Time Computation: Sometimes Quantity Means Quality
ISPAN '00 Proceedings of the 2000 International Symposium on Parallel Architectures, Algorithms and Networks
Computing nearest neighbors in real time
Journal of Parallel and Distributed Computing
A parallel approach eliminates measurement perturbations in RLC circuits
The Journal of Supercomputing
Creative destruction of computing systems: analysis and modeling
The Journal of Supercomputing
Accelerating machines: a review
International Journal of Parallel, Emergent and Distributed Systems
Polynomial homotopies on multicore workstations
Proceedings of the 4th International Workshop on Parallel and Symbolic Computation
On the importance of parallelism for quantum computation and the concept of a universal computer
UC'05 Proceedings of the 4th international conference on Unconventional Computation
Optimal task execution times for periodic tasks using nonlinear constrained optimization
The Journal of Supercomputing
Evaluation of parallel paradigms on anisotropic nonlinear diffusion
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
Modelling and Simulation in Engineering
Hi-index | 0.00 |
Can a parallel computer with n processors solve a computational problem more than n times faster than a sequential computer? Can it solve it more than n times better? New computational paradigms offer an affirmative answer to the above questions through concrete examples in which the improvement in speed or quality is superlinear in the number of processors used by the parallel computer. Furthermore, the improvement is consistent and provable. All examples are characterized by the presence of one or several real-time input streams. In one of the examples, an exponential improvement in speed is achieved despite the fact that the processors of the parallel computer are significantly slower than their sequential counterpart. In another example, the improvement in quality is unbounded. A metaphor from everyday life motivates each computational paradigm in which a superlinear improvement in performance is exhibited.