Dependence Analysis

Dependence Analysis may be considered to be the second edition of the author's 1988 book, Dependence Analysis for Supercomputing. It is, however, a completely new work that subsumes the material of the 1988 publication. This book is the third volume in the series Loop Transformations for Restru...

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Κύριος συγγραφέας: Banerjee, Utpal (Συγγραφέας)
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Boston, MA : Springer US, 1997.
Σειρά:Loop Transformation for Restructuring Compilers ; 3
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 02795nam a22004575i 4500
001 978-0-585-28122-3
003 DE-He213
005 20151204172115.0
007 cr nn 008mamaa
008 100301s1997 xxu| s |||| 0|eng d
020 |a 9780585281223  |9 978-0-585-28122-3 
024 7 |a 10.1007/b102376  |2 doi 
040 |d GrThAP 
050 4 |a TK7895.M5 
072 7 |a UYF  |2 bicssc 
072 7 |a COM011000  |2 bisacsh 
082 0 4 |a 004.1  |2 23 
100 1 |a Banerjee, Utpal.  |e author. 
245 1 0 |a Dependence Analysis  |h [electronic resource] /  |c by Utpal Banerjee. 
264 1 |a Boston, MA :  |b Springer US,  |c 1997. 
300 |a XVII, 214 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Loop Transformation for Restructuring Compilers ;  |v 3 
505 0 |a Single Loops -- Double Loops -- Perfect Loop Nests -- General Program -- Method of Bounds -- Method of Elimination -- Conclusions. 
520 |a Dependence Analysis may be considered to be the second edition of the author's 1988 book, Dependence Analysis for Supercomputing. It is, however, a completely new work that subsumes the material of the 1988 publication. This book is the third volume in the series Loop Transformations for Restructuring Compilers. This series has been designed to provide a complete mathematical theory of transformations that can be used to automatically change a sequential program containing FORTRAN-like do loops into an equivalent parallel form. In Dependence Analysis, the author extends the model to a program consisting of do loops and assignment statements, where the loops need not be sequentially nested and are allowed to have arbitrary strides. In the context of such a program, the author studies, in detail, dependence between statements of the program caused by program variables that are elements of arrays. Dependence Analysis is directed toward graduate and undergraduate students, and professional writers of restructuring compilers. The prerequisite for the book consists of some knowledge of programming languages, and familiarity with calculus and graph theory. No knowledge of linear programming is required. 
650 0 |a Computer science. 
650 0 |a Microprocessors. 
650 1 4 |a Computer Science. 
650 2 4 |a Processor Architectures. 
650 2 4 |a Computer Science, general. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9780792398097 
830 0 |a Loop Transformation for Restructuring Compilers ;  |v 3 
856 4 0 |u http://dx.doi.org/10.1007/b102376  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-BAE 
950 |a Computer Science (Springer-11645)