Divide-and-Conquer and parallel graph reduction

✍ Scribed by Fethi A. Rabhi; Gordon A. Manson

• Book ID: 104304369
• Publisher: Elsevier Science
• Year: 1991
• Tongue: English
• Weight: 773 KB
• Volume: 17
• Category: Article
• ISSN: 0167-8191
• DOI: 10.1016/s0167-8191(05)80105-x

✦ Synopsis

This paper is concerned with the design of a multiprocessor system supporting the parallel execution of functional programs. Parallelism in such systems is automatically derived by the compiler but this parallelism is unlikely to meet the physical constraints of the target machine. In this paper, these problems are identified for the class of Divide-and-Conquer algorithms and a solution which consists of reducing the depth of the computational tree is proposed. A parallel graph reduction machine simulated on a network of transputers, developed for testing the proposed solutions, is described. Experiments have been conducted on some simple Divide-and-Conquer programs and the results are presented. Lastly, some proposals are made for an automatic system that would efficiently execute any problem belonging to the same class taking into account the nature of the problem as well as the physical characteristics of the implementation.