Efficient Communication Between Parallel Programs with InterComm
| dc.contributor.author | Lee, Jae-Yong | en_US |
| dc.contributor.author | Sussman, Alan | en_US |
| dc.date.accessioned | 2004-05-31T23:35:30Z | |
| dc.date.available | 2004-05-31T23:35:30Z | |
| dc.date.created | 2004-01 | en_US |
| dc.date.issued | 2004-02-25 | en_US |
| dc.description.abstract | We present the design and implementation of InterComm, a framework to couple parallel components that enables efficient communication in the presence of complex data distributions within a coupled application. Multiple parallel libraries and languages may be used in different modules of a single application. The ability to couple such modules is required in many emerging application areas, such as complex simulations that model physical phenomena at multiple scales and resolutions, and remote sensing image data analysis applications. The complexity of the communication algorithms is highly dependent on the distribution of data across the processes in a distributed memory parallel program. We classify the distributions into two types - one that represents a data distribution in a compact way so that the distribution information can be replicated, and one that explicitly describes the location of each data element, so can be very large, requiring that the distribution information be distributed across processes as is the data. InterComm builds on our previous work on the Meta-Chaos program coupling framework. In that work, we showed that the steps required to perform the data exchanges include locating the data to be transferred within the local memories of each program, generating communication schedules (the patterns of interprocessor communication) for all processes, and transferring the data using the schedules. In this paper we describe the new algorithms we have developed, and show how those algorithms greatly improve on the Meta-Chaos algorithms by reducing the high cost of building the communication schedules. We present experimental results showing the performance of various algorithmic tradeoffs, and also compare against the original Meta-Chaos implementation. (UMIACS-TR-2004-04) | en_US |
| dc.format.extent | 204140 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.uri | http://hdl.handle.net/1903/1336 | |
| dc.language.iso | en_US | |
| dc.relation.isAvailableAt | Digital Repository at the University of Maryland | en_US |
| dc.relation.isAvailableAt | University of Maryland (College Park, Md.) | en_US |
| dc.relation.isAvailableAt | Tech Reports in Computer Science and Engineering | en_US |
| dc.relation.isAvailableAt | UMIACS Technical Reports | en_US |
| dc.relation.ispartofseries | UM Computer Science Department; CS-TR-4557 | en_US |
| dc.relation.ispartofseries | UMIACS; UMIACS-TR-2004-04 | en_US |
| dc.title | Efficient Communication Between Parallel Programs with InterComm | en_US |
| dc.type | Technical Report | en_US |
Files
Original bundle
1 - 1 of 1