| Rajesh Bordawekar, Alok Choudhary, and J. Ramanujam. Compilation and communication strategies for out-of-core programs on distributedmemory machines. Journal of Parallel and Distributed Computing, 38(2):277--288, November 1996. |
....of communication strategies for out of core distributed memory applications with virtual memory. PMG has a communication step in which boundary information is transmitted between processors. However, we did not attempt to tune LEVEL to improve communication performance. Bordawekar et al. [3] describe communication strategies for performing efficient communication in out of core distributed memory applications. They also describe how these strategies can be used in a virtual memory environment provided custom page replacement policies can be implemented. ffl Spread the gospel. The ....
Rajesh Bordawekar, Alok Choudhary, and J. Ramanujam. Compilation and Communication Strategies for Out-of-core programs on Distributed Memory Machines. Technical report CACR 113. Center for Advanced Computing Research, November 1995.
....1996] was that the good performance was accomplished in a fully automated fashion; the code to exploit the features of HFS was generated by a compiler developed for this purpose. We believe that in the future such compiler technology will become more effective for a wider class of applications [Bordawekar et al. 1996; Cormen and Colvin 1994; Mowry et al. 1996] This will simplify the introduction of new non standard features such as those we propose, since one only has to change a compiler to exploit those features, and not a large set of applications. The building block composition technique we developed for ....
Bordawekar, R., Choudhary, A., and Ramanujam, J. 1996. Compilation and communication strategies for out-of-core programs on distributed-memory machines. Journal of Parallel and Distributed Computing 38, 2 (November), 277--288.
....the compiler should make an important decision as how to perform the communication. The communication in our example can be satisfied by either a collective communication routine as in in core compilation, or by considering the individual communication requirements of the data tiles in memory [3, 4, 5]. The latter performs communication only for the data tiles currently being processed in memory. Although the former communication method is attractive from compiler s point of view since it allows the compiler to easily identify and optimize collective communication patterns, it has been shown in ....
....The latter performs communication only for the data tiles currently being processed in memory. Although the former communication method is attractive from compiler s point of view since it allows the compiler to easily identify and optimize collective communication patterns, it has been shown in [4] that in out of core computations involving transfer of the boundary data it is inefficient. In order for the latter method to be effective however, the compiler should be able to re order processing of data tiles such that whenever a data item is required it should be available in some ....
[Article contains additional citation context not shown here]
R. Bordawekar, A. Choudhary, and J. Ramanujam. Compilation and Communication Strategies for Out-of-core programs on Distributed Memory Machines. In Journal of Parallel and Distributed Computing, 38:(2), November, 1996.
....a chunk of data will not be used any more, the replacement policy can keep that chunk in memory for a long time [11] In [4] the functionality of a ViC , a compiler like preprocessor for out of core C is described. Several compiler methods for out ofcore HPF programs are presented in [15] and [2]. In [12] compiler techniques to choreograph I O for applications based on high level programmer annotations are investigated. The techniques in [15] and [12] are specifically designed for parallel machines whereas our approach can also be used on uniprocessors. To our knowledge, non of the ....
....nests with arrays whose layouts are constrained. We show that this is important for global I O optimization as well. An area of future work is integrating this technique with the techniques designed to eliminate I O costs originating from communication requirements of out ofcore parallel programs [2]. We also intend to employ the algorithm presented in this paper in in core compilers, and investigate its effectiveness at determining memory layouts and in improving cache performance. ....
R. Bordawekar, A. Choudhary and J. Ramanujam. Compilation and Communication Strategies for Out-of-core programs on Distributed Memory Machines. In Journal of Parallel and Distributed Computing, 38(2):277-288, Nov. 1996.
No context found.
Rajesh Bordawekar, Alok Choudhary, and J. Ramanujam. Compilation and communication strategies for out-of-core programs on distributedmemory machines. Journal of Parallel and Distributed Computing, 38(2):277--288, November 1996.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC