| ECEN 625, Fall 2007 |
|
| |
|
|
|
|
|
| Week |
Lecture |
Date |
Lecture Summary |
Reading |
Assignment |
| 1 |
1 |
Sep 5 (Wed) |
Class Overview & Motivation |
N/A |
RTL Review |
| |
2 |
Sep 7 (Fri) |
Synthesis
Problem Overview |
Chapter 1 (pp.
1-35), web article |
|
| 2 |
3 |
Sep 10 (Mon) |
VHDL/RTL
Modeling |
3.1-3.2
(97-115), RTL Semantics |
|
| |
4 |
Sep 12 (Wed) |
Abstract Models |
3.3-3.5
(115-137) |
|
| |
5 |
Sep 14 (Fri) |
Set & Graph
Notation, Directed Graphs |
2.1-2.2.2
(36-40) |
Java, Dotty,
Degree |
| 3 |
6 |
Sep 17 (Mon) |
Perfect Graphs
& Asymtoptic Notation |
2.2.3, Cormen
2.1-2.2 |
|
| |
7 |
Sep 19 (Wed) |
Bounding
Summations and Recurrances |
Cormen 3.1-3.2,
4.1-4.2 |
|
| |
8 |
Sep 21 (Fri) |
Combinatorial
Optimization, Algorithm Tractability |
2.3, Cormen
chapter 36 |
|
| 4 |
9 |
Sep 24 (Mon) |
Shortest Path:
topological sort, Dijkstra, and Bellman Ford |
2.4-2.4.1
(53-56) Cormen (Chap 25, 514-538) |
Minimum Clique |
| |
10 |
Sep 26 (Wed) |
ILP &
Shortest Path ILP, Covering & Partitioning |
2.4.1 (58-67) |
|
| |
11 |
Sep 28 (Fri) |
Shortest Path:
Liao-Wong, all Pairs |
2.4.1 (56-58), Cormen (Chap 26) |
|
| 5 |
12 |
Oct 1 (Mon) |
Synthesis
Problem Overview |
4.1-4.3.4
(141-155) |
Shortest Path |
| |
13 |
Oct 3 (Wed) |
Synthesis
Optimization |
4.4-4.7.1
(156-168) |
|
| |
14 |
Oct 5 (Fri) |
Introduction to
Scheduling & Timing Constraints |
5.1-5.3.3
(185-193) |
|
| 6 |
15 |
Oct 8 (Mon) |
Scheduling under
resource constraints (ILP) |
5.4 - 5.4.1
(198-202) |
No Assignment |
| |
16 |
Oct 10 (Wed) |
Heuristic
Scheduling (List) & Force Directed Scheduling |
5.4.3 - 5.4.4
(207-211, 211-215) |
|
| |
17 |
Oct 12 (Fri) |
Exam #1 (testing
center 10/11-10/12) |
|
|
| 7 |
18 |
Oct 15 (Mon) |
Force Directed
Scheduling, Scheduling w/Alternative Paths |
5.4.4 (211-215) |
No Assignment |
| |
19 |
Oct 17 (Wed) |
Pipeline
Scheduling |
5.6-5.6.2
(218-223) |
|
| |
20 |
Oct 19 (Fri) |
IMS Scheduling
(definitions, terminology, model) |
IMS paper, pages
1-22 |
|
| 8 |
21 |
Oct 22 (Mon) |
SCC
Decomposition, IMS Scheduling (minDist) |
Corment (Chap
23.5), IMS pages 23-39 |
IMS scheduling |
| |
22 |
Oct 24 (Wed) |
IMS Scheduling
Algorithm |
IMS paper, pages
40-68 |
|
| |
23 |
Oct 26 (Fri) |
Binding for
resource dominated |
6.1-6.2.1
(229-237) |
|
| 9 |
24 |
Oct 29 (Mon) |
Register
Sharing/Memory Binding |
6.2.3-6.2.5
(240-245) |
IMS scheduling
(continued) |
| |
25 |
Oct 31 (Wed) |
Binding for
General Circuits |
6.3-6.3.1
(245-248) |
|
| |
26 |
Nov 2 (Fri) |
Module Selection
& Binding for Pipelined Circuits |
6.6 & 6.7
(257-262) |
|
| 10 |
27 |
Nov 5 (Mon) |
Performance
constrained binding, Concurrent binding and scheduling |
6.3.2-6.4
(249-252), 6.5 (252-257) |
Class Project
(Reading) |
| |
28 |
Nov 7 (Wed) |
Efficient
Datapath Merging (Moreano, et.) |
See blackboard
for paper |
|
| |
29 |
Nov 9 (Fri) |
Binding Paper
(False Loops) |
See blackboard
for paper |
|
| 11 |
30 |
Nov 12 (Mon) |
Retiming
(Algorithm overview) |
See blackboard
for paper |
Class Project
(Proposal) |
| |
31 |
Nov 14 (Wed) |
Retiming (C-Slow
retiming and extensions) |
See blackboard
for paper |
|
| |
32 |
Nov 16 (Fri) |
Exam #2 (testing
center 11/15-11/16) |
|
|
| 12 |
33 |
Nov 19 (Mon) |
Concurrent
systems |
No reading |
Class Project () |
| |
34 |
Nov 20 (Tue) |
Specification,
semantics, syntax and Models of Compu |
No reading |
|
| |
|
Nov 21 (Wed) |
No Class -
Thanksgiving Holiday |
|
|
| |
|
Nov 23 (Fri) |
No Class -
Thanksgiving Holiday |
|
|
| 13 |
35 |
Nov 26 (Mon) |
No Class |
|
Class Project () |
| |
36 |
Nov 28 (Wed) |
No Class |
|
|
| |
37 |
Nov 30 (Fri) |
Time, Types, Architecture Exploration, Meta Data |
No reading |
|
| 14 |
38 |
Dec 3 (Mon) |
Tool Overview (Behavioral Compiler, ImpulseC, others) |
No reading |
|
| |
39 |
Dec 5 (Wed) |
No Class (will meet twice on Friday, 12/7) |
|
|
| |
40 |
Dec 7 (Fri) |
Project Reports (1/2). Meet at 3pm for (3/4) |
|
|
| 15 |
41 |
Dec 10 (Mon) |
Project Reports (5/6) |
|
|
| |
42 |
Dec 12 (Wed) |
Project Reports (7/8) |
|
Reports due in
class |
|
|
|
|
|
|
|
|
Dec 17 (Mon) |
Final Exam (11:00 am to 2:00 pm) |
|
|
|
|
|
|
|
|
|
|
|
No class will be held |
|
|
|
|
|
Instructor will not be present |
|
|
|
|
|
|
|
|
|
|
|
|
|
|