Parallelizing Compilers Recursive Functions by Reda Naglaa (7 results)

Condition: New.

paperback. Condition: New. NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Parallelizing compilers is one of the most important topics in parallel programming. It is developed to automatically parallelize sequential programs to reduce the burden of programming on parallel computers. At start it concentrates on parallelizing loops then it opens its scope to other aspects such as recursive functions. Consequently, new parallelizing compilers are proposed to automatically parallelize recursive functions in order to be executed efficiently on different parallel systems such as distributed memory massively parallel multicomputers and multiprocessors. A special concern has been for applications of divide-and-conquer algorithms. New algorithms for dependence analysis, partitioning, scheduling, and generating SPMD message passing program are introduced. Also new virtual topologies are proposed. Different types of recursive functions have been examined using variety of parallel machines. Ultimate performance measurements are used aiming at reaching optimality. 164 pp. Englisch.

Condition: New. Print on Demand.

Condition: New. PRINT ON DEMAND.

Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Parallelizing compilers is one of the most important topics in parallel programming. It is developed to automatically parallelize sequential programs to reduce the burden of programming on parallel computers. At start it concentrates on parallelizing loops then it opens its scope to other aspects such as recursive functions. Consequently, new parallelizing compilers are proposed to automatically parallelize recursive functions in order to be executed efficiently on different parallel systems such as distributed memory massively parallel multicomputers and multiprocessors. A special concern has been for applications of divide-and-conquer algorithms. New algorithms for dependence analysis, partitioning, scheduling, and generating SPMD message passing program are introduced. Also new virtual topologies are proposed. Different types of recursive functions have been examined using variety of parallel machines. Ultimate performance measurements are used aiming at reaching optimality.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 164 pp. Englisch.

Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Parallelizing compilers is one of the most important topics in parallel programming. It is developed to automatically parallelize sequential programs to reduce the burden of programming on parallel computers. At start it concentrates on parallelizing loops then it opens its scope to other aspects such as recursive functions. Consequently, new parallelizing compilers are proposed to automatically parallelize recursive functions in order to be executed efficiently on different parallel systems such as distributed memory massively parallel multicomputers and multiprocessors. A special concern has been for applications of divide-and-conquer algorithms. New algorithms for dependence analysis, partitioning, scheduling, and generating SPMD message passing program are introduced. Also new virtual topologies are proposed. Different types of recursive functions have been examined using variety of parallel machines. Ultimate performance measurements are used aiming at reaching optimality.