Solving problems on concurrent processors. Vol. 1: General techniques and regular problems
Solving problems on concurrent processors. Vol. 1: General techniques and regular problems
C3P Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
What have we learnt from using real parallel machines to solve real problems?
C3P Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2
C3P Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2
An Analysis of Scatter Decomposition
IEEE Transactions on Computers
A Competitive Analysis of Load Balancing Strategiesfor Parallel Ray Tracing
The Journal of Supercomputing
| Hi-index | 0.00 |
A theoretical basis for the scattered decomposition is worked out in some detail. The basic result has been part of the “folklore” for some time, but has never been proved. The load imbalance expected from a scattered decomposition of a set of computational tasks is proportional n-1/2&sgr;task/mtask where n is the number of tasks assigned to each processor, mtask is the mean time per task and &sgr;task is the root mean square deviation time per task. The constant of proportionality is of O(1), and is a very slowly increasing function of the number of processors.