Automatic data layout with read-only replication and memory constraints
The memory requirement characteristics of a data layout are particularly important for applications that are executed on a parallel machine mainly because of the amount of main memory that the machine provides, rather than its computation power. It may not be feasible to execute such a memory intensive program on a conventional uniprocessor due to the lack of the necessary memory resources.
Data layouts that specify arrays with multiple read-only copies — each copy with a different data mapping — can significantly reduce the overall execution time of a program since otherwise necessary communication is avoided. However, read-only replication increases a program's memory requirements and therefore should only be applied selectively, in particular for memory intensive applications. This short paper discusses an extension to our previous framework for automatic data layout that considers read-only data replication and minimizes the overall execution time under given memory constraints.
Unable to display preview. Download preview PDF.
- [AW96]T. Autrey and M. Wolfe. Initial results for glacial variable analysis. In Proceedings of the Nineth Workshop on Languages and Compilers for Parallel Computing, San Jose, CA, August 1996.Google Scholar
- [Kre95]U. Kremer. Automatic Data Layout for Distributed Memory Machines. PhD thesis, Rice University, October 1995. Available as CRPC-TR95-559-S.Google Scholar
- [Kre96]U. Kremer. Automatic data layout with read-only replication and memory constraints. Technical Report LCSR-TR93-283, Department of Computer Science, Rutgers University, December 1996.Google Scholar
- [WH95]D. Wood and M. Hill. Cost-effective parallel computing. IEEE Computer, Feb 1995.Google Scholar