CONTENTS

246 ERNEST SCHEIBER (1)
Algorithm 2 The dispatcher procedure.
1: procedure Dispatcher
2: Data structures: Stack repository;
3: boolean[ ]freeW orker1≤i≤size
4: send messages number ← 0
5: received messages number ← 0
6: for i = 1 : size do
7: freeW orkeri ← true
8: end for
9: Specific initializations of the application
10: Send an ordinary-message to the W orker1
11: freeW orker1 ← false
12: send messages number ← send messages number + 1
13: while repository is not empty or
14: send messages number = received messages number do
15: if send messages number = received messages number then
16: Receive a response message
17: received messages number ← received messages number + 1
18: freeW orkersender−rank ← true
19: Process the received message
20: end if
21: while exists free Workers and the repository is not empty do
22: Extracts an object from the repository
23: Sends an ordinary-message to a free Worker
24: freeW orkerreceiver−rank ← false
25: send messages number ← send messages number + 1
26: end while
27: end while
28: for i = 1 : size do
29: Sends Ending-type-message to the W orkeri
30: end for
31: end procedure
If the worker receives the sequence [x0, x1, . . . , xk−1] (k − 1 < n) with xp ∈
{0, 1, . . . , n − 1} and
(1) xp = xq and |xp − xq| = |p − q| ∀p, q ∈ {0, 1, . . . , k − 1},
then it executes the following operations:
1: for any i ∈ {0, 1, . . . , n − 1} do
2: It verifies the validity conditions (1) of the sequence [x0, x1, . . . , xk−1, i].