Abstract: New challenges in dynamic load balancing

New challenges in dynamic load balancing

Karen D. Devine, Erik G. Boman, Robert T. Heaphy, Bruce A. Hendrickson, James D. Teresco, Jamal Faik, Joseph E. Flaherty, Luis G. Gervasio.

Appl. Numer. Maths. Vol. 52, Issues 2-3, pp. 133-152, 2005.
(Previously published as Williams College Department of Computer Science Technical Report CS-04-02, and Sandia Report SAND2004-1496J, Sandia National Laboratories, 2004)

Data partitioning and load balancing are important components of parallel computations. Many different partitioning strategies have been developed, with great effectiveness in parallel applications. But the load-balancing problem is not yet solved completely; new applications and architectures require new partitioning features. Existing algorithms must be enhanced to support more complex applications. New models are needed for non-square, non-symmetric, and highly connected systems arising from applications in biology, circuits, and materials simulations. Increased use of heterogeneous computing architectures requires partitioners that account for non-uniform computing, network, and memory resources. And, for greatest impact, these new capabilities must be delivered in toolkits that are robust, easy-to-use, and applicable to a wide range of applications. In this paper, we discuss our approaches to addressing these issues within the Zoltan Parallel Data Services toolkit.

Citation (BIBTEX) Paper (PDF; 220KB)