ISBN-13: 9783639163759 / Angielski / Miękka / 2009 / 196 str.
ISBN-13: 9783639163759 / Angielski / Miękka / 2009 / 196 str.
This book presents the investigation, discussion, andimplementation of techniques for the analysis andoptimization of data locality in divide-and-conqueralgorithms as well as the design of new recursivealgorithms (e.g., balanced Strassen--Winograd''s matrixmultiplication and Kleene''s closure). We turn ourattention to recursive algorithms because we findthem appealing (i.e., natural code design, easy tomaintain and test) and we also aim at optimizationtechniques and code generation for loop based codes---non recursive--- in combination with recursivealgorithms, which is a hard problem. This work dwellswith algorithms, architectures, compilers,performance measurement, and performanceinterpretation. Thisbook is interdisciplinary by construction and it isfor systems engineers, computer scientists, andcompiler designers.