This paper focuses on an efficient user-level handling of intensive interprocess communication in distributed parallel applications that are characterised by a high rate of data exchange. A common feature of such systems is that any parallelisation strategy focusing on the largest parallelisable fraction results in the highest possible rate of interprocess communication, compared to other parallelisation strategies. An example of such applications is the class of telecommunication traffic simulators, where the partition-communication phenomenon reveals itself due to the strong data interdependencies among the major parallelisable tasks, namely, encoding of messages, decoding of messages, and interpretation of messages.
[1]
Jayadev Misra,et al.
Distributed discrete-event simulation
,
1986,
CSUR.
[2]
Edsger W. Dijkstra,et al.
Notes on structured programming
,
1970
.
[3]
Thomas Dean,et al.
A Formal Description of the Transportation Problem
,
1992
.
[4]
Konstantinos Sagonas,et al.
On reducing interprocess communication overhead in concurrent programs
,
2002,
ERLANG '02.
[5]
G. Amdhal,et al.
Validity of the single processor approach to achieving large scale computing capabilities
,
1967,
AFIPS '67 (Spring).