This paper addresses optimal mapping of parallel programs composed of a chain of data parallel tasks onto the processors of a parallel system. The input to the programs is a stream of data sets, each of which is processed in order by the chain of tasks. This computation structure, also referred to a
Mixed data and task parallelism with HPF and PVM
β Scribed by Salvatore Orlando; Paolo Palmerini; Raffaele Perego
- Book ID
- 110383855
- Publisher
- Springer US
- Year
- 2000
- Tongue
- English
- Weight
- 205 KB
- Volume
- 3
- Category
- Article
- ISSN
- 1386-7857
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
An increasing number of scientific programs exhibit two forms of parallelism, often in a nested fashion. At the outer level, the application comprises coarse-grained task parallelism, with dependencies between tasks reflected by an acyclic graph. At the inner level, each node of the graph is a data-
This paper presents BCL, a border-based coordination language focused on the solution of numerical applications. Our approach provides a simple parallelism model. Coordination and computational aspects are clearly separated. The former are established using the coordination language and the latter a