Download herman-benchmark - UCSD VLSI CAD Laboratory

Survey
yes no Was this document useful for you?
   Thank you for your participation!

* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project

Document related concepts

Zero-configuration networking wikipedia , lookup

Distributed firewall wikipedia , lookup

Computer network wikipedia , lookup

Piggybacking (Internet access) wikipedia , lookup

Cracking of wireless networks wikipedia , lookup

Network tap wikipedia , lookup

Airborne Networking wikipedia , lookup

List of wireless community networks by region wikipedia , lookup

Transcript
Benchmark Update
 Carnegie Cell Library: “Free to all who Enter”

Need to build scaling model of standard cell library

Based on our open 0.35 micron library (real extracted data)

This semester: basic standard cells

This summer: memories
 Timing Models
3/22/02

Actual timing probably is not as important as variations

Simple 1-order models of speed and variations
1
Circuit Benchmarks
New vertical benchmarks:



All designed to comply with common network interface
Interoperability, portability for IP blocks
Why is this interesting/useful for benchmarks?


IOs and other system-level issues make it hard to compare benchmarks
Also good for education
Network
Tile
Network
Tile
Processing
Element
Network
Tile
3/22/02
Network
Tile
Processing
Element
Network
Tile
Processing
Processing
Element
Network
Tile
Processing
Processing
2
New Circuit Bencmarks
 The Network Tile: for streaming applications
 The Processing Elements:

Morphable Floating Point Multiplier:


FP mult and vector add, integer multiply and integer MAC and shift
Morphable Floating Point Adder:

FP add and integer add and shift

Programmable Integer ALU

Programmable FIR filter

SIMD Adder (with funky completion logic)
 All about 20-100k gates each

Can be combined into systems of arbitrary size

Network limits effective Rent’s Exponent

*Actually Network connectivity would determine Rent Exponent

3/22/02
Currently planning 2-D network, creating Rent Exponent of 0.5
3
Dynamic Network Tiles
TILE
TILE
TILE
PE
PE
PE
TILE: the network component
PE: the component at this node
in the network
3/22/02
4
Dynamic Network System
TILE
TILE
TILE
TILE
PE
PE
PE
PE
TILE
TILE
TILE
TILE
PE
PE
TILE
TILE
PE
PE
PE
TILE
PE
TILE
PE
PE
3/22/02
Reference Clock distribution
through network
Each tile generates own clock
Interface decoupled via FIFOs
New Placement Problem:
space utilization vs. distance
5
Target Architecture:
Pipelined Arrays
 Limited Feedback
 Long/short wires predictable
 Clock Skew
 Important Application Domain
3/22/02
6
Classic Wire Length Models
B
A
B
A
C
D
3/22/02
C
D
7
Wire Path Length
Every block is a pipeline stage
Impossible to determine every wire length from floorplan
blocks
Wire Path Length (WPL) measures the distance between
consecutive registers
3/22/02
8
Wire Path Length
B
A
B
A
C
D
3/22/02
C
D
9
Results Key
 Classic

Different random starting position every time

Classic Move Set - Swap
 Classic + LSP

Same legal starting position every time

Classic Move Set - Swap
 New
3/22/02

Same legal starting position every time

New Move Set - Insert/Delete
10
IDEA 60 Block Design
Wire Path Length Longer than
Minimum
250.00%
Classic
Classic + LSP
New
200.00%
150.00%
100.00%
50.00%
0.00%
0.00%
2.00%
4.00%
6.00%
8.00%
10.00%
Area Greater than Minimum
3/22/02
11
1-D DCT
12 Pipeline Stages
Synthesis Speed - 2.25 ns.
Synthesis Area - 668,323 mm2
3/22/02
12
Unfloorplanned
3/22/02
13
Classic
3/22/02
14
Classic + LSP
3/22/02
15
New
3/22/02
16
Results
Dead
WPL
Space
No
Floor
3/22/02
X
X
DRCs Speed
Avg.
Max
Cong. Cong.
0
2.50
0.35
0.98
Classic
0.97% 6.15
850
2.40
0.60
1.32
Classic
+ LSP
1.63% 5.88
138
2.44
0.57
1.31
New
0.09% 5.76
12
2.37
0.54
1.19
17