Next: ECOT calculation
Up: Parallel Execution of
Previous: Parallel Execution of
Irrespective of P's simulation or execution status,
is equal to
.
The computation of
is significantly more complex.
An LP may send an acknowledgement in two cases:
- By posting a message request on communicator C
at the current simulation time and
waiting on it. The request might
get immediately matched with an already arrived message lying
in the LP's message queue. The lower bound on the send
timestamp of such an acknowledgement would be
.
- Upon getting a message, which gets matched with a
request in its request list on communicator C. Let the timestamp
of the earliest pending request
on communicator C be
. The lower
bound on the send timestamp of such an acknowledgement would be
. L is the minimum message latency
of the target machine.
Consequently,
is
.
Next: ECOT calculation
Up: Parallel Execution of
Previous: Parallel Execution of
Andy Kahn
Wed Jun 25 20:28:02 PDT 1997