26/06/2002:
Marco Pedicini (CNR, Italy)
Scheduling vs Communication in PELCR
Résumé
PELCR is an environment for $lambda$-terms reduction on
parallel/distributed computing systems. The computation performed in this
environment is a distributed graph rewriting and a major optimization to
achieve efficient execution consists of a message aggregation technique
exhibiting the potential for strong reduction of the communication
overhead.
We shall introduce the theoretical background for this model of
computation derived from linear logic and geometry of interaction and we
shall discuss more in details the interaction between the effectiveness
of
aggregation and the schedule sequence of rewriting operations. Then we
shall present a Priority Based (BP) scheduling algorithm well suited for
the specific aggregation technique.
In collaboration with F. Quaglia from Dipartimento di Informatica e
Sistemistica dell'Universita' degli Studi di Roma "La Sapienza".