Algorithm Engineering for Integral and Dynamic Problems

Regular price €142.99
Quantity:
In stock with our UK publisher. 14-28 days
Delivery/Collection within 10-20 working days
14 days return policy Shipping & Delivery
A01=Lucia Rapanotti
Affine Problems
Allocation Function
array processor design
Author_Lucia Rapanotti
Case Study
Category=UYFP
Cellular Automata
computational complexity
Data Dependence
Data Dependence Graph
Dependence Domain
Dependence Graph
discrete optimisation
Dom Ain D2
eq_bestseller
eq_computing
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
eq_non-fiction
Finitely Generated
Gaussian Elimination
Index Expressions
Index Mapping
Integral Recurrences
Knapsack Problem
mathematical modelling
parallel algorithm synthesis for engineers
parallel computation
Polyhedral Convex Sets
Processor Network
Recurrence Equations
recurrence relations
Reduction Phase
Regular Array
Signal Flow Graph
Space Time Mapping
Static Data Dependencies
Systolic Arrays
Unifying Notation

Product details

  • ISBN 9789056993283
  • Weight: 762g
  • Dimensions: 178 x 254mm
  • Publication Date: 23 Jan 2001
  • Publisher: Taylor & Francis Ltd
  • Publication City/Country: GB
  • Product Form: Hardback
Secure checkout Fast Shipping Easy returns
Algorithm engineering allows computer engineers to produce a computational machine that will execute an algorithm as efficiently and cost-effectively as possible given a set of constraints, such as minimal performance or the availability of technology. Addressing algorithm engineering in a parallel setting, regular array syntheses offer powerful computation and embody best practice, but often face the criticism that they are applicable only to restricted classes of algorithms. Algorithm Engineering for Integral and Dynamic Problems reviews the basic principles of regular array synthesis and shows how to extend its use into classes of algorithms traditionally viewed to be beyond its domain of application. The author discusses the transformation of the initial algorithm specification into a specification with data dependencies of increased regularity in order to obtain corresponding regular arrays by direct application of the standard mapping techniques. The book includes a review of the basic principles of regular array synthesis followed by applications of these techniques to well-known algorithms, concluding with numerous case studies to illustrate the methods. Researchers and practitioners in algorithm engineering will find that this text significantly extends their understanding of the applications of regular array synthesis and regular array processors beyond the traditionally narrow field of relevance.

More from this author