Particle advection is an important vector field visualization technique that is difficult to apply to very large data sets
in a distributed setting due to scalability limitations in existing algorithms. In this paper, we report on several experiments using
work requesting dynamic scheduling which achieves balanced work distribution on arbitrary problems with minimal communication
overhead. We present a corresponding prototype implementation, provide and analyze benchmark results, and compare our results
to an existing algorithm.