On the Scalability of Dynamic Scheduling Scientific Applications with Adaptive Weighted Factoring

  • Authors:

  • Ioana Banicescu;Vijay Velusamy;Johnny Devaprasad

  • Affiliations:

  • Department of Computer Science, Engineering Research Center for Computational Systems, Mississippi State University, MS, USA;Department of Computer Science, Engineering Research Center for Computational Systems, Mississippi State University, MS, USA;Department of Computer Science, Engineering Research Center for Computational Systems, Mississippi State University, MS, USA

  • Venue:
  • Cluster Computing
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

In heterogeneous environments, dynamic scheduling algorithms are a powerful tool towards performance improvement of scientific applications via load balancing. However, these scheduling techniques employ heuristics that require prior knowledge about workload via profiling resulting in higher overhead as problem sizes and number of processors increase. In addition, load imbalance may appear only at run-time, making profiling work tedious and sometimes even obsolete. Recently, the integration of dynamic loop scheduling algorithms into a number of scientific applications has been proven effective. This paper reports on performance improvements obtained by integrating the Adaptive Weighted Factoring, a recently proposed dynamic loop scheduling technique that addresses these concerns, into two scientific applications: computational field simulation on unstructured grids, and N-Body simulations. Reported experimental results confirm the benefits of using this methodology, and emphasize its high potential for future integration into other scientific applications that exhibit substantial performance degradation due to load imbalance.