Lavoisier S.A.S.
14 rue de Provigny
94236 Cachan cedex
FRANCE

Heures d'ouverture 08h30-12h30/13h30-17h30
Tél.: +33 (0)1 47 40 67 00
Fax: +33 (0)1 47 40 67 02


Url canonique : www.lavoisier.fr/livre/autre/dependence-analysis-for-supercomputing-series-in-engineering-and-computer-science/banerjee/descriptif_1748648
Url courte ou permalien : www.lavoisier.fr/livre/notice.asp?ouvrage=1748648

Dependence Analysis for Supercomputing, Softcover reprint of the original 1st ed. 1988 The Springer International Series in Engineering and Computer Science Series, Vol. 60

Langue : Anglais

Auteur :

Couverture de l’ouvrage Dependence Analysis for Supercomputing
This book is on dependence concepts and general methods for dependence testing. Here, dependence means data dependence and the tests are compile-time tests. We felt the time was ripe to create a solid theory of the subject, to provide the research community with a uniform conceptual framework in which things fit together nicely. How successful we have been in meeting these goals, of course, remains to be seen. We do not try to include all the minute details that are known, nor do we deal with clever tricks that all good programmers would want to use. We do try to convince the reader that there is a mathematical basis consisting of theories of bounds of linear functions and linear diophantine equations, that levels and direction vectors are concepts that arise rather natu­ rally, that different dependence tests are really special cases of some general tests, and so on. Some mathematical maturity is needed for a good understand­ ing of the book: mainly calculus and linear algebra. We have cov­ ered diophantine equations rather thoroughly and given a descrip­ of some matrix theory ideas that are not very widely known. tion A reader familiar with linear programming would quickly recog­ nize several concepts. We have learned a great deal from the works of M. Wolfe, and K. Kennedy and R. Allen. Wolfe's Ph. D. thesis at the University of Illinois and Kennedy & Allen's paper on vectorization of Fortran programs are still very useful sources on this subject.
1. Introduction.- 2. Basic Concepts.- 2.1. Relations and Graphs.- 2.2. Orders on Vectors.- 2.3. Program Model.- 3. Dependence.- 3.1. Dependence Concepts.- 3.2. The Dependence Problem.- 4. Bounds of Linear Functions.- 4.1. Introduction.- 4.2. Bounds in Rectangles.- 4.3. Bounds in Trapezoids.- 5. Linear Diophantine Equations.- 5.1. Introduction.- 5.2. Greatest Common Divisors.- 5.3. Single Equation in Two Variables.- 5.4. Single Equation in Many Variables.- 5.5. Systems of Equations.- 6. Dependence Tests.- 6.1. Introduction.- 6.2. One-Dimensional Arrays, Single Loops.- 6.3. One-Dimensional Arrays.- 6.4. General Case.- 6.5. Miscellaneous Comments.- References.

Date de parution :

Ouvrage de 155 p.

15.5x23.5 cm

Disponible chez l'éditeur (délai d'approvisionnement : 15 jours).

52,74 €

Ajouter au panier

Ces ouvrages sont susceptibles de vous intéresser