Coping with anomalies in parallel branch-and-bound algorithms
IEEE Transactions on Computers - The MIT Press scientific computation series
Superlinear speedup of an efficient sequential algorithm is not possible
Parallel Computing
Parallel efficiency can be greater than unity
Parallel Computing
Parallel processing: the Cm* experience
Parallel processing: the Cm* experience
Communications of the ACM
Speedup Versus Efficiency in Parallel Systems
IEEE Transactions on Computers
Form and Content in Computer Science (1970 ACM turing lecture)
Journal of the ACM (JACM)
Anomalies in parallel branch-and-bound algorithms
Communications of the ACM
Combinatorially implosive algorithms
Communications of the ACM
A parallel simulator for performance modelling of broadband telecommunication networks
WSC '92 Proceedings of the 24th conference on Winter simulation
Performance Considerations of Shared Virtual Memory Machines
IEEE Transactions on Parallel and Distributed Systems
Scaling the unscalable: a case study on the AlphaServer SC
Proceedings of the 2002 ACM/IEEE conference on Supercomputing
Superlinear Performance in Real-Time Parallel Computation
The Journal of Supercomputing
Performance-driven processor allocation
OSDI'00 Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4
PADS '10 Proceedings of the 2010 IEEE Workshop on Principles of Advanced and Distributed Simulation
Parallel pre-processing of affymetrix microarray data
Euro-Par 2010 Proceedings of the 2010 conference on Parallel processing
Parallel suboptimal heuristic search for finding a w-admissible solution. performance analysis
ICANCM'11/ICDCC'11 Proceedings of the 2011 international conference on applied, numerical and computational mathematics, and Proceedings of the 2011 international conference on Computers, digital communications and computing
Parallel computing for phase-field models
International Journal of High Performance Computing Applications
| Hi-index | 0.00 |
A simple model of parallel computation which is capable of explaining speedups greater than n on n processors is presented. Necessary and sufficient conditions for these exceptional speedups are derived from the model. Several of the contradictory previous results relating to parallel speedup are resolved by using the model.