Performance evaluation of fork and join synchronization primitives
Performance evaluation of fork and join synchronization primitives
复制标题
fork 和 join 同步原语的性能评估
作者：
A. Duda;T. Czachórski
本文提出了一个fork和join同步原语的性能模型。原语用于在分布式系统上执行的并行程序。三个变种的执行并行程序的fork和join原语被认为是提出了评估其性能的有限数量的处理器上的并行模型。由程序引起的同步延迟由状态依赖服务器表示，其服务速率取决于特定的同步方案。封闭形式的结果，两个处理器的情况下，提出了一种数值方法，许多处理器。分叉连接排队网络具有更复杂的结构，即，也以相同的方式分析串联和并联布置的处理器。该网络可以用一个与fork-join原语的嵌套结构相对应的通用任务优先图来模拟作业的执行。研究了程序并行执行的一些性能指标。结果表明，在并行系统中，同步约束可能会显着降低理论上可以获得的加速比。
SummaryThe paper presents a performance model of fork and join synchronization primitives. The primitives are used in parallel programs executed on distributed systems. Three variants of the execution of parallel programs with fork and join primitives are considered and queueing models are proposed to evaluate their performance on a finite number of processors. Synchronization delays incurred by the programs are represented by a state-dependent server with service rate depending on a particular synchronization scheme. Closed form results are presented for the two processor case and a numerical method is proposed for many processors. Fork-join queueing networks having more complex structure i.e., processors arranged in series and in parallel, are also analyzed in the same manner. The networks can model the execution of jobs with a general task precedence graph corresponding to a nested structure of the fork-join primitives. Some performance indices of the parallel execution of programs are studied. The results show that the speedup which can be obtained theoretically in a parallel system may be decreased significantly by synchronization constraints.