.png){kind=icon}
.png){kind=icon}
Return
Dynamic data distribution and processor repartitioning for irregularly structured computations
.png){kind=icon}
PRE
AI
DOI：10.1006/jpdc.1998.1436.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (C) 1998 Academic Press.
Keywords:
irregular applications
dynamic data distribution
reconfigurable applications
reconfigurable partitions
DRMS
Journal
IF:
4
Papers:
3.8K
Citations:
4.8K
Organization
No organization information available