首页> 美国政府科技报告 >Parallel Access to Synchronization Variables
【24h】

Parallel Access to Synchronization Variables

机译:并行访问同步变量

获取原文

摘要

The following synchronization problem occurs in parallel processing: a set of n processes need to begin execution of their next tasks only after every process has completed its current task. Such a barrier synchronization is usually implemented by shared variable(s) in a tightly coupled multiprocessor. We define the completion time as the earliest time when every process knows that all other processes have completed. We develop analytical models using Markov chains to estimate the effects of barrier synchronization on the completion time of processes. Three algorithms are given to implement barrier synchronization and completion time expressions are derived for these implementations. The relative merits of the three schemes are compared. Two schemes require O(nlogn) accesses as opposed to 2n-1, the idealized number of accesses. The third scheme which is difficult to implement has a linear growth in the number of accesses (approx. 4n). 11 refs., 3 figs. (ERA citation 13:013834)

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号