PELCR is an environment for λ-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. In this paper we discuss the interaction between the effectiveness of aggregation and the schedule sequence of rewriting operations. Then we present a Priority Based (BP) scheduling algorithm well suited for the specific aggregation technique. Results on a classical benchmark λ-term demonstrate that PB allows PELCR to achieve up to 88% of the ideal speedup while executing on a shared memory parallel architecture.
Pedicini, M., Quaglia, F. (2002). Scheduling vs Communication in PELCR. In Burkhard Monien and Rainer Feldmann (a cura di), Euro-Par 2002 Parallel Processing (pp. 648-655). Berlin : Springer Berlin Heidelberg [10.1007/3-540-45706-2_89].
Scheduling vs Communication in PELCR
PEDICINI, MARCO;
2002-01-01
Abstract
PELCR is an environment for λ-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. In this paper we discuss the interaction between the effectiveness of aggregation and the schedule sequence of rewriting operations. Then we present a Priority Based (BP) scheduling algorithm well suited for the specific aggregation technique. Results on a classical benchmark λ-term demonstrate that PB allows PELCR to achieve up to 88% of the ideal speedup while executing on a shared memory parallel architecture.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
