Optimizing message delivery in asynchronous distributed applications

被引:0
作者
Sharma, GD [1 ]
Abu-Ghazaleh, NB [1 ]
Rajasekaran, UKV [1 ]
Wilsey, PA [1 ]
机构
[1] Dept ECECS, Comp Architecture Design Lab, Cincinnati, OH 45221 USA
来源
EURO-PAR'99: PARALLEL PROCESSING | 1999年 / 1685卷
关键词
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Since the message delivery time of asynchronous applications is unpredictable, each asynchronous process must probe (or poll) the network for new messages regularly. If polling is carried out too aggressively, a majority of the probes will be unsuccessful. However, the cost for probing the network is similar to the cost of communication operations. Thus, optimizing the message reception behavior has a significant impact on the performance of the application. This paper studies this problem, and develops a cost model to optimize the polling frequency. We also develop strategies to optimize the message delivery behavior, and study their impact on the performance of a parallel discrete event simulator.
引用
收藏
页码:1204 / 1208
页数:5
相关论文
共 5 条
  • [1] Gropp W. D., 1994, Using MPI-Portable Parallel Programming with the Message -Parsing Interface
  • [2] JEFFERSON D, 1985, ACM T PROGR LANG SYS, V7, P405
  • [3] Radhakrishnan R, 1998, LECT NOTES COMPUT SC, V1505, P13
  • [4] SHARMA GD, 1999, THESIS U CINCINNATI
  • [5] VONEICKEN T, 1992, CSD92675 U CAL