S14-EducationalObjectives-0215_2

Ntoatreetoallowapplyingthetreemapping algorithm

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: runtime complexity of both phases of tech mapping algorithm [4] Describe the two phases of the tech mapping algorithm [4] Define arrival time at a node in a timing graph [1] Illustrate two issues when applying tree‐mapping algorithm to Directed Acyclic Graphs (DAG) [4] Execute the tree‐mapping algorithm on a given DAG [2] Describe two techniques to translate a DAG into a tree to allow applying the tree‐mapping algorithm Floorplaning (Weeks 3 and 4) [5] 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.

Ask a homework question - tutors are online