.png){kind=icon}
返回
Termination detection in data-driven parallel computations/applications
.png){kind=icon}
PRE
AI
DOI：10.1016/S0743-7315(03)00014-5.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
High-performance computing applications with data-driven communication and computation characteristics require synchronization routines in the form of eureka, barrier, or termination synchronization. In this paper, we consider termination synchronization for two different execution models, the AP and the APS model. In the AP model, processors are either active or passive and a passive processor can be made active by another active processor. In the APS model, processors can also be in a server state. A passive processor entering the server state does not become active again. In addition, a server processor cannot change the status of other processors. We describe and analyze solutions for both models and present experimental work highlighting the differences between the models. We show that in almost all situations the use of an AP algorithm to detect termination in an APS environment will result in loss of performance. Our experimental work on the Cray T3E provides insight into where and why this performance loss occurs. (C) 2003 Elsevier Science (USA). All rights reserved.
Keyword:
data-driven algorithms
termination detection
tree and ring networks
synchronization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4
论文数:
3.8K
被引数:
4.8K
机构
暂无机构信息
引用论文
Similarity judgments and cortical visual responses reflect different properties of object and scene categories in naturalistic images.png)
NeuroImage
OAAI
NeuroImageIF0
OAAI分享收藏分享收藏
查看更多内容