This preview shows page 1. Sign up to view the full content.
Unformatted text preview: runtime complexity of both phases of tech mapping algorithm  Describe the two phases of the tech mapping algorithm  Define arrival time at a node in a timing graph  Illustrate two issues when applying tree‐mapping algorithm to Directed Acyclic Graphs (DAG)  Execute the tree‐mapping algorithm on a given DAG  Describe two techniques to translate a DAG into a tree to allow applying the tree‐mapping algorithm Floorplaning (Weeks 3 and 4)  List two primary objectives of the fl...
View Full Document
This document was uploaded on 02/23/2014 for the course ELECTRICAL 556 at University of Texas at Austin.
- Spring '14
- Electrical Engineering