Dynamic Data Distribution and Processor Repartitioning for Irregularly Structured Computations

Irregular applications comprise a significant and increasing portion of jobs running in parallel environments. Recent research has shown that, in parallel environments, both the system utilization and application turn around time improve when resources allocated to applications can be dynamically adjusted at run-time, depending on the workload. To realize this, at least some of the parallel applications in the system need to be dynamically reconfigurable. We have implemented the Distributed Resource Management System (DRMS) that supports the development and execution of regular and irregular reconfigurable applications in time-variant resource environments. In this paper, we discuss DRMS support for developing reconfigurable irregular applications and describe the dynamic data redistribution mechanisms in some detail. We also present performance levels achieved by the data redistribution primitives, using a sparse Cholesky factorization algorithms as a model irregular application. Our results show that the cost of dynamic data redistribution among different processor configurations for irregular data are comparable to those for regular data.

[1]  Bharat Kumar,et al.  A Clustering Algorithm for Parallel Sparse Cholesky Factorization , 1995, Parallel Process. Lett..

[2]  Prithviraj Banerjee,et al.  Processor Allocation and Scheduling of Macro Dataflow Graphs on Distributed Memory Multicomputers by the PARADIGM Compiler , 1993, 1993 International Conference on Parallel Processing - ICPP'93.

[3]  Scott B. Baden,et al.  A robust parallel programming model for dynamic non-uniform scientific computations , 1994, Proceedings of IEEE Scalable High Performance Computing Conference.

[4]  Ken Kennedy,et al.  Value-Based Distributions and Alignments in Fortran D , 1994 .

[5]  José E. Moreira,et al.  Application-Assisted Dynamic Scheduling on Large-Scal Multi-Computer Systems , 1996, Euro-Par, Vol. II.

[6]  Ken Kennedy,et al.  Fortran D Language Specification , 1990 .

[7]  Guy L. Steele,et al.  The High Performance Fortran Handbook , 1993 .

[8]  Prithviraj Banerjee,et al.  Exploiting spatial regularity in irregular iterative applications , 1995, Proceedings of 9th International Parallel Processing Symposium.

[9]  José E. Moreira,et al.  Supporting Dynamic Data and Processor Repartitioning for Irregular Applications , 1996, IRREGULAR.

[10]  W. E Nagel.  1988 International conference on supercomputing , 1988 .

[11]  John G. Lewis,et al.  Sparse matrix test problems , 1982, SGNM.

[12]  Tilak Agerwala,et al.  SP2 System Architecture , 1999, IBM Syst. J..

[13]  Tao Yang,et al.  Run-time compilation for parallel sparse matrix computations , 1996, ICS '96.

[14]  Joel H. Saltz,et al.  Run-time and compile-time support for adaptive irregular problems , 1994, Proceedings of Supercomputing '94.

[15]  Scott B. Baden,et al.  Run-time Data Distribution for Block-Structured Applications on Distributed Memory Computers , 1995, PPSC.

[16]  Michele Colajanni,et al.  Supporting irregular data distributions for heterogeneous clusters , 1996 .

[17]  Ken Kennedy,et al.  Integrated Support for Task and Data Parallelism , 1994, Int. J. High Perform. Comput. Appl..

[18]  Rice UniversityCORPORATE,et al.  High performance Fortran language specification , 1993 .

[19]  Andreas Müller,et al.  Extending high performance Fortran for the support of unstructured computations , 1995, ICS '95.

[20]  John Zahorjan,et al.  Zahorjan processor allocation policies for message-passing parallel computers , 1994, SIGMETRICS 1994.

[21]  Joel H. Saltz,et al.  Data parallel programming in an adaptive environment , 1995, Proceedings of 9th International Parallel Processing Symposium.

[22]  Jonathan Walpole,et al.  A user-level process package for PVM , 1994, Proceedings of IEEE Scalable High Performance Computing Conference.

[23]  José E. Moreira,et al.  Dynamic resource management on distributed systems using reconfigurable applications , 1997, IBM J. Res. Dev..

[24]  Barbara M. Chapman,et al.  User defined mappings in Vienna Fortran , 1993, SIGP.

[25]  José E. Moreira,et al.  A Programming Environment for Dynamic Resource Allocation and Data Distribution , 1996, LCPC.

[26]  Mark S. Squillante,et al.  Processor Allocation in Multiprogrammed Distributed-Memory Parallel Computer Systems , 1997, J. Parallel Distributed Comput..

[27]  Raj Vaswani,et al.  A dynamic processor allocation policy for multiprogrammed shared-memory multiprocessors , 1993, TOCS.

[28]  Barbara M. Chapman,et al.  Vienna-Fortran/HPF Extensions for Sparse and Irregular Problems and Their Compilation , 1997, IEEE Trans. Parallel Distributed Syst..

[29]  Barbara M. Chapman,et al.  Extending HPF for Advanced Data-Parallel Applications , 1994, IEEE Parallel & Distributed Technology: Systems & Applications.

[30]  Gene H. Golub,et al.  Matrix computations , 1983 .