VERY GOOD: The book is in very good condition, showing only the slightest signs of use and wear.
Product Details
From the back cover: "A program is compiled by analyzing its data dependencies and developing from that a set of partitioning constraints. These practical algorithms are founded on a new theory of data dependence and ordering within functional programs, which defines dependence graphs in terms of a rewrite-rule operational semantics for the language.
"By attacking the ordering problem directly, the book departs from previous approaches that obtain partitioning as a by-product of optimizing lazy evaluation, and cleanly separates partitioning from other code-generation issues. Furthermore, the method is flexible enough to produce both lazy code and a less-restrictive 'lenient' variant that allows larger threads with only a slight decrease in expressive power. Code generation and optimization are explored in depth for both uniprocessor and multiprocessor targets."
