PVM: Parallel virtual machine: a users' guide and tutorial for networked parallel computing
PVM: Parallel virtual machine: a users' guide and tutorial for networked parallel computing
Compile-time estimation of communication costs for data parallel programs
Journal of Parallel and Distributed Computing
Allocating Task Interaction Graphs to Processors in Heterogeneous Networks
IEEE Transactions on Parallel and Distributed Systems
Performance Comparison of Strategies for Static Mapping of Parallel Programs
HPCN Europe '97 Proceedings of the International Conference and Exhibition on High-Performance Computing and Networking
Compile-Time Estimation of Communication Costs on Multicomputers
IPPS '92 Proceedings of the 6th International Parallel Processing Symposium
Benchmarking the Task Graph Scheduling Algorithms
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Clustering and Reassignment-Based Mapping Strategy for Message-Passing Architectures
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Modelling message-passing programs for static mapping
EURO-PDP'00 Proceedings of the 8th Euromicro conference on Parallel and distributed processing
A New Model for Static Mapping of Parallel Applications with Task and Data Parallelism
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Proceedings of the 8th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface
| Hi-index | 0.00 |
In the distributed processing area, mapping and scheduling are very important issues in order to exploit the gain from parallelization. The generation of efficient static mapping techniques implies a previous modelling phase of the parallel application as a task graph, which properly reflects its temporal behaviour. In this paper we use a new model, the Temporal Task Interaction Graph (TTIG), which explicitly captures the temporal behaviour of program tasks; and we evaluate the advantages that derive from the use of the TTIG model in task allocation. Experimentation was performed in a current PVM environment, for a set of synthetic graphs which exhibit different ratios of computation/ communication cost (coarse-grain, medium-grain). The execution times when these programs were mapped using the information contained in the TTIG model, were compared with the times obtained using the two following mapping alternatives: (a) PVM default scheme and, (b) mapping strategy based on the classical model TIG (Task Interaction Graph). The results confirm that with the TTIG model, better assignments are obtained, providing improvements of up to 49% compared with the PVM assignments and up to 30% compared with TIG assignments.