Instruction Selection: Principles, Methods, And Applications by Gabriel Hjort BlindellInstruction Selection: Principles, Methods, And Applications by Gabriel Hjort Blindell

Instruction Selection: Principles, Methods, And Applications

byGabriel Hjort Blindell

Hardcover | June 14, 2016

Pricing and Purchase Info

$59.27 online 
$68.95 list price save 14%
Earn 296 plum® points

Prices and offers may vary in store


In stock online

Ships free on orders over $25

Not available in stores


This book presents a comprehensive, structured, up-to-date survey on instruction selection. The survey is structured according to two dimensions: approaches to instruction selection from the past 45 years are organized and discussed according to their fundamental principles, and according to the characteristics of the supported machine instructions. The fundamental principles are macro expansion, tree covering, DAG covering, and graph covering. The machine instruction characteristics introduced are single-output, multi-output, disjoint-output, inter-block, and interdependent machine instructions. The survey also examines problems that have yet to be addressed by existing approaches.

The book is suitable for advanced undergraduate students in computer science, graduate students, practitioners, and researchers.

Gabriel Hjort Blindell's research focuses on advanced computer architecture, compiler construction, parallel systems, combinatorial optimization, algorithms, data structures, and complexity. Since June 2012 he has participated in a research project on constraint-based compilation, in particular he is investigating how constraint progra...
Title:Instruction Selection: Principles, Methods, And ApplicationsFormat:HardcoverDimensions:177 pages, 23.5 × 15.5 × 0.25 inPublished:June 14, 2016Publisher:Springer-Verlag/Sci-Tech/TradeLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:3319340174

ISBN - 13:9783319340173

Look for similar items by category:


Table of Contents

Introduction.- Macro Expansion.- Tree Covering.- DAG Covering.- Graph Covering.- Conclusions.