Abstract The decomposition of an application into processes and the allocation of the latter to the available processors is one of the most crucial problems in the software design phase of message-based distributed systems. In this paper the authors describe a tool which, by monitoring the communications between processes allocated to separate processing elements, is able to provide indications on the effectiveness of the partitioning and mapping actions carried out. The authors first show, with reference to systems built with Transputer family components, the tool's structure, which is highly independent from the system interconnection network; secondly, they show how to make an initial reduction of the data gathered during the monitoring phase.
[1]
Sol M. Shatz,et al.
Introduction to Distributed-Software Engineering
,
1987,
Computer.
[2]
Jake K. Aggarwal,et al.
A Mapping Strategy for Parallel Processing
,
1987,
IEEE Transactions on Computers.
[3]
Francine Berman,et al.
On Mapping Parallel Algorithms into Parallel Architectures
,
1987,
J. Parallel Distributed Comput..
[4]
Umberto Villano,et al.
A simple algorithm for clock synchronization in transputer networks
,
1988,
Softw. Pract. Exp..
[5]
Heinz Mühlenbein,et al.
Mapping Strategies in Message Based Multiprocessor Systems
,
1987,
PARLE.