Parallelizing Compilers for Recursive Functions - Couverture souple

M. Reda, Naglaa

 
9783330054417: Parallelizing Compilers for Recursive Functions
Couverture souple
ISBN 10 : 3330054417 ISBN 13 : 9783330054417
Editeur : LAP LAMBERT Academic Publishing, 2017

Synopsis

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.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

Présentation de l'éditeur

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.

Biographie de l'auteur

Naglaa M. Reda is currently a lecturer of Computer Science. She has received her MS.c. and PhD from Faculty of Science, University of Ain Shams, Cairo, Egypt. She has published papers in international referred journals and conferences. Her research interests focus on parallel algorithms, distributed computing systems and bioinformatics.

Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.

Éditeur
LAP LAMBERT Academic Publishing
Date d'édition
2017
Langue
anglais
ISBN 10 
3330054417
ISBN 13 
9783330054417
Reliure
Broché
Nombre de pages
164
Coordonnées du fabricant
non disponible
Personne responsable
KreGa Onlinehandel GmbH
4950000000000
info@krega-onlinehandel.de

Birkenweg 31
Brakel
33034
Allemagne