Allocating Independent Subtasks on Parallel Processors
IEEE Transactions on Software Engineering
An introduction to ray tracing
An introduction to ray tracing
Parallel processing for computer graphics
Parallel processing for computer graphics
Factoring: a practical and robust method for scheduling parallel loops
Proceedings of the 1991 ACM/IEEE conference on Supercomputing
The Voxar Project (Parallel Ray-Tracing)
IEEE Computer Graphics and Applications - Special issue on computer-aided geometric design
Distributing Data and Control for Ray Tracing in Parallel
IEEE Computer Graphics and Applications
Allocating independent tasks to parallel processors: an experimental study
Journal of Parallel and Distributed Computing - Special issue on dynamic load balancing
A Competitive Analysis of Load Balancing Strategiesfor Parallel Ray Tracing
The Journal of Supercomputing
I3D '99 Proceedings of the 1999 symposium on Interactive 3D graphics
An improved illumination model for shaded display
Communications of the ACM
Perfect Load Balancing for Demand-Driven Parallel Ray Tracing
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
(Quasi-) Thread-Safe PVM and (Quasi-) Thread-Safe MPI without Active Polling
Proceedings of the 9th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface
An adaptive subdivision algorithm and parallel architecture for realistic image synthesis
SIGGRAPH '84 Proceedings of the 11th annual conference on Computer graphics and interactive techniques
Parallel Raytracing: A Case Study on Partitioning and Scheduling on Workstation Clusters
HICSS '97 Proceedings of the 30th Hawaii International Conference on System Sciences: Software Technology and Architecture - Volume 1
| Hi-index | 0.00 |
This paper investigates assignment strategies (load balancing algorithms) for process farms which solve the problem of online placement of a constant number of independent tasks with given, but unknown, time complexities onto a homogeneous network of processors with a given latency. Results for the chunking and factoring assignment strategies are summarised for a probabilistic model which models tasks' time complexities as realisations of a random variable with known mean and variance. Then a deterministic model is presented which requires the knowledge of the minimal and maximal tasks' complexities. While the goal in the probabilistic model is the minimisation of the expected makespan, the goal in the deterministic model is the minimisation of the worstcase makespan. We give a novel analysis of chunking and factoring for the deterministic model. In the context of demand-driven parallel ray tracing, tasks' time complexities are unfortunately unknown until the actual computation finishes. Therefore we propose automatic self-tuning procedures which estimate the missing information in run-time. We experimentally demonstrate for an "everyday ray tracing setting" that chunking does not perform much worse than factoring on up to 128 processors, if the parameters of these strategies are properly tuned. This may seem surprising. However, the experimentally measured efficiencies agree with our theoretical predictions.