Probabilistic Analysis of Parallel Program with Partially Eliminated Barriers

2013 12th IEEE International Conference on Trust, Security and Privacy in Computing and Communications Pub Date : 2013-07-16 DOI:10.1109/TrustCom.2013.228

N. Yonezawa, Ken'ichi Katou, I. Kino, K. Wada

{"title":"Probabilistic Analysis of Parallel Program with Partially Eliminated Barriers","authors":"N. Yonezawa, Ken'ichi Katou, I. Kino, K. Wada","doi":"10.1109/TrustCom.2013.228","DOIUrl":null,"url":null,"abstract":"Since barrier synchronization is a simple means to guarantee the order of data producing and data consuming, it is often used in parallel programs. However, barrier synchronization causes the processors' idle time to increase. To reduce the overhead of barrier synchronization, we have proposed an algorithm which eliminates barrier synchronizations and evaluated its validity experimentally in our previous study. In this paper, we model the behavior of parallel programs and proposed a dependency matrix to represent dependencies among processors. Using the behavioral model, we evaluated the execution time of parallel programs which have three typical dependency patterns. Based on results, we found that 1) if a processors depends on less other processors, the obtained effect of eliminating barriers is higher, 2) even if the number of directly-depended processors is the same between two dependency patterns, less indirectly-depended processors in all previous phases provide more effect of eliminating barriers.","PeriodicalId":206739,"journal":{"name":"2013 12th IEEE International Conference on Trust, Security and Privacy in Computing and Communications","volume":"9 14","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 12th IEEE International Conference on Trust, Security and Privacy in Computing and Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TrustCom.2013.228","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

Abstract

Since barrier synchronization is a simple means to guarantee the order of data producing and data consuming, it is often used in parallel programs. However, barrier synchronization causes the processors' idle time to increase. To reduce the overhead of barrier synchronization, we have proposed an algorithm which eliminates barrier synchronizations and evaluated its validity experimentally in our previous study. In this paper, we model the behavior of parallel programs and proposed a dependency matrix to represent dependencies among processors. Using the behavioral model, we evaluated the execution time of parallel programs which have three typical dependency patterns. Based on results, we found that 1) if a processors depends on less other processors, the obtained effect of eliminating barriers is higher, 2) even if the number of directly-depended processors is the same between two dependency patterns, less indirectly-depended processors in all previous phases provide more effect of eliminating barriers.

查看原文本刊更多论文

部分消除障碍并行程序的概率分析

由于屏障同步是保证数据产生和数据消费顺序的一种简单方法，因此它经常用于并行程序中。但是，屏障同步会导致处理器的空闲时间增加。为了减少屏障同步的开销，我们在之前的研究中提出了一种消除屏障同步的算法，并对其有效性进行了实验评估。本文建立了并行程序的行为模型，并提出了一个依赖矩阵来表示处理器之间的依赖关系。利用行为模型对具有三种典型依赖模式的并行程序的执行时间进行了评估。结果表明:1)一个处理器对其他处理器的依赖越少，所获得的消除壁垒效果越高;2)即使两个依赖模式之间直接依赖的处理器数量相同，在所有阶段中间接依赖的处理器越少，所获得的消除壁垒效果越好。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

2013 12th IEEE International Conference on Trust, Security and Privacy in Computing and Communications

自引率

0.00%

发文量