Modeling Communication Locality in Multiprocessors |
| |
| Affiliation: | 1. School of Pharmacy, Nanjing University of Chinese Medicine, Nanjing 210023, China;2. Jiangsu Engineering Research Center for Efficient Delivery System of TCM, Nanjing 210023, China;3. Department of Pharmacy, The Third Affiliated Hospital of Nanjing University of Chinese Medicine, Nanjing 210001, China;1. Department of Civil & Environmental Engineering, University of California, California NanoSystems Institute and Institute of the Environment & Sustainability, Los Angeles, CA, USA;2. Department of Environmental Sciences and Engineering, Gillings School of Global Public Health, University of North Carolina at Chapel Hill, Chapel Hill, NC, USA;3. Department of Civil & Environmental Engineering, Technion – Israel Institute of Technology, Haifa, Israel;1. Department of Gastroenterology and Hepatology, West China Hospital, Sichuan University, Chengdu, Sichuan 610041, PR China;2. West China Biomedical Big Data Center, West China Hospital, Sichuan University, Chengdu, Sichuan 610041, PR China;3. Med-X Center for Informatics, Sichuan University, Chengdu, Sichuan 610041, PR China;4. West China Hospital-SenseTime Joint Lab, Chengdu, Sichuan 610041, PR China;5. Department of Radiology, West China Hospital, Sichuan University, Chengdu, Sichuan 610041, PR China |
| |
| Abstract: | Locality of reference is an important aspect of many computer operations. It is often exploited to optimize the performance of computer functions. In this paper, we apply the locality concept to the communication patterns of parallel programs operating over an interconnection network with a fixed communication latency between any pair of attached nodes. Unbuffered multistage networks and all-optical networks are examples of these. We quantify the notions of spatial and temporal locality in this context, and combine them in a locality measure. This measure is used as the basis for identifying the communication working sets of a parallel program. We focus on programs with a looping structure and investigate conditions under which each working set consists of the complete set of paths required by a single loop. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
