消息传递模型下的等待阻塞策略  

Spin-Block Strategy in the Message-Passing Model

作　　者：苗浩[1] 黄刘生[1] 陈国良[1] 

机构地区：[1]中国科技大学计算机系,安徽合肥230026

出　　处：《小型微型计算机系统》2005年第7期1183-1186,共4页Journal of Chinese Computer Systems

基　　金：中科院支持高水平大学项目(KY2706)资助;安徽省教育厅重点科研项目(2003kj049zd)资助

摘　　要：在基于消息传递的并行模型中,通信密集型的应用通常存在大量进程切换的问题.针对集群环境中大量的周期性地进行全局同步操作的应用,传统采用的等待阻塞策略由于没有考虑到应用的特殊性而效果不太明显.本文提出了适合于此类型应用特点的新策略,即一方面在同步点采取阻塞进程抢占策略,另一方面在周期内采取固定时间等待阻塞策略或者应用级的等待阻塞策略.通过基于离散事件的模拟器,对该策略和其他策略进行了模拟比较,结果说明无论从CPU占用时间和系统响应时间该策略都获得了比较理想的效果.In message-passing parallel programming model, there is a big problem of many process-switching in the communication bounded application. Normal spin-block strategy has not obvious effect to some application class such as periodic barrier application. We propose a more effective strategy based on spin-block according to the properties of periodic barrier application. In this strategy, first we preempt the blocking process at barrier point, then we use fixed time spin-block strategy or application-level spin-block strategy during each period. We also developed a discrete event cluster simulator to simulate the strategy, the result from witch shows that both CPU occupation time and application response time is improved obviously.

关 键 词：消息传递 等待阻塞策略 全局同步操作 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]