Summary
|
For Full-Text PDF, please login, if you are a member of IEICE, or go to Pay Per View on menu list, if you are a nonmember of IEICE. |
|
Entropy Based Evaluation of Communication Predictability in Parallel Applications Alex K. JONES Jiang ZHENG Ahmed AMER Publication IEICE TRANSACTIONS on Information and Systems Vol.E89-D No.2 pp.469-478 Publication Date: 2006/02/01 Online ISSN: 1745-1361 DOI: 10.1093/ietisy/e89-d.2.469 Print ISSN: 0916-8532 Type of Manuscript: Special Section PAPER (Special Section on Parallel/Distributed Computing and Networking) Category: Performance Evaluation Keyword: prediction, communication, parallel processing, entropy, performance, circuit switching, Full Text: PDF(3.9MB)>>
Summary: The performance of parallel computing applications is highly dependent on the efficiency of the underlying communication operations. While often characterized as dynamic, these communication operations frequently exhibit spatial and temporal locality as well as regularity in structure. These characteristics can be exploited to improve communication performance if the correct prediction model is selected to a suitable communication topology. In this paper we describe an entropy based methodology for quantifying and evaluating the success of different prediction models on actual workloads drawn from representative parallel benchmarks. We evaluate two different prediction criteria and combinations thereof: (1) Messages are partitioned by source node. (2) Use of a first order context model. We also describe the threshold for predication designed to largely avoid incorrect predication overheads. Our results show for simple predication models, even on highly dynamic benchmark applications, predictability can be improved by several orders of magnitude. In fact, using simple prediction techniques, over 75% of the communication volume is accurately predictable. | ||||||||||
| ||||||||||
