This paper describes a compiler for transforming serial programs into parallel form, and studies the importance of several transformations. An array machine is selected as the target architecture. A Set of programs is compiled and their execution time is measured by simulation. The transformations a
Automation of program speed-up on parallel-processor computers
β Scribed by W. H. Burkhardt
- Publisher
- Springer Vienna
- Year
- 1968
- Tongue
- English
- Weight
- 810 KB
- Volume
- 3
- Category
- Article
- ISSN
- 0010-485X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
However, the speedup achieved through parallelism is often lower in modern systems. It is no surprise, then, that developers of compilers for data-parallel languages have hypothesized the importance of optimizations that overlap communications with computations in order to reduce execution times and
Highly parallel machines needed to solve compute-intensive scientific applications are based on the distribution of physical memory across the compute nodes. The drawback of such systems is the necessity to write applications in the message passing programming model. Therefore, a lot of research is