Optimizing Message Delivery in Asynchronous Distributed Applications

Authors:
Girindra D. Sharma;Nael B. Abu-Ghazaleh;Umesh Kumar V. Rajasekaran;Philip A. Wilsey
Affiliations:
-;-;-;-
Venue:
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
Year:
1999

Citing 4
Cited 1

Virtual time

ACM Transactions on Programming Languages and Systems (TOPLAS)
Using MPI: portable parallel programming with the message-passing interface

Using MPI: portable parallel programming with the message-passing interface
An Object-Oriented Time Warp Simulation Kernel

ISCOPE '98 Proceedings of the Second International Symposium on Computing in Object-Oriented Parallel Environments
Active Messages: a Mechanism for Integrated Communication and

Active Messages: a Mechanism for Integrated Communication and

Can PDES scale in environments with heterogeneous delays?

Proceedings of the 2013 ACM SIGSIM conference on Principles of advanced discrete simulation

Quantified Score

Hi-index	0.01

Visualization

Abstract

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.