About the Editors |
|
v | |
Preface |
|
xv | |
|
Network Processors: New Horizons |
|
|
1 | (8) |
|
|
|
|
|
|
3 | (1) |
|
|
4 | (1) |
|
|
5 | (2) |
|
|
7 | (2) |
|
|
7 | (2) |
|
Supporting Mixed Real-Time Workloads in Multithreaded Processors with Segmented Instruction Caches |
|
|
9 | (24) |
|
|
Instruction Delivery in NP Data Processors |
|
|
11 | (2) |
|
|
11 | (1) |
|
Using a Cache as a Fixed-Size Control Store |
|
|
12 | (1) |
|
Segmented Instruction Cache |
|
|
13 | (4) |
|
Segment Sizing Strategies |
|
|
14 | (1) |
|
|
14 | (2) |
|
|
16 | (1) |
|
Enforcing Instruction Memory Bandwidth Limits |
|
|
17 | (1) |
|
|
17 | (12) |
|
Benchmark Programs and Methodology |
|
|
17 | (1) |
|
|
18 | (4) |
|
Sources of Conflict Misses |
|
|
22 | (1) |
|
Profile-Driven Code Scheduling to Reduce Misses |
|
|
23 | (2) |
|
Using Set-Associativity to Reduce Misses |
|
|
25 | (2) |
|
|
27 | (2) |
|
|
29 | (1) |
|
Conclusions and Future Work |
|
|
30 | (3) |
|
|
30 | (3) |
|
Efficient Packet Classification with Digest Caches |
|
|
33 | (22) |
|
|
|
|
|
|
34 | (1) |
|
|
35 | (7) |
|
The Case for an Approximate Algorithm |
|
|
36 | (1) |
|
Dimensioning a Digest Cache |
|
|
37 | (1) |
|
|
37 | (2) |
|
A Specific Example of a Digest Cache |
|
|
39 | (2) |
|
Exact Classification with Digest Caches |
|
|
41 | (1) |
|
|
42 | (7) |
|
Reference Cache Implementations |
|
|
44 | (2) |
|
|
46 | (3) |
|
|
49 | (2) |
|
|
49 | (1) |
|
|
50 | (1) |
|
|
51 | (4) |
|
|
52 | (1) |
|
|
52 | (3) |
|
Towards a Flexible Network Processor Interface for RapidIO, Hypertransport, and PCI-Express |
|
|
55 | (26) |
|
|
|
|
|
Interface Fundamentals and Comparison |
|
|
57 | (2) |
|
|
57 | (2) |
|
|
59 | (1) |
|
|
59 | (1) |
|
|
59 | (9) |
|
Click for Packet-Based Interfaces |
|
|
61 | (1) |
|
|
62 | (3) |
|
|
65 | (1) |
|
|
66 | (2) |
|
|
68 | (9) |
|
|
69 | (1) |
|
Simplified Instruction Set with Timing |
|
|
69 | (1) |
|
Mapping and Implementation Details |
|
|
70 | (1) |
|
|
71 | (1) |
|
|
72 | (4) |
|
|
76 | (1) |
|
|
77 | (4) |
|
|
78 | (1) |
|
|
78 | (3) |
|
A High-Speed, Multithreaded TCP Offload Engine for 10 Gb/s Ethernet |
|
|
81 | (18) |
|
|
|
|
|
Requirements on TCP Offload Solution |
|
|
83 | (4) |
|
Architecture of TOE Solution |
|
|
87 | (8) |
|
|
87 | (5) |
|
TCP-Aware Hardware Multithreading and Scheduling Logic |
|
|
92 | (3) |
|
|
95 | (2) |
|
|
97 | (2) |
|
|
98 | (1) |
|
|
98 | (1) |
|
A Hardware Platform for Network Intrusion Detection and Prevention |
|
|
99 | (20) |
|
|
|
|
|
|
|
Design Rationales and Principles |
|
|
100 | (4) |
|
Motivation for Hardware-Based NNIDS |
|
|
100 | (1) |
|
Characterization of NIDS Components |
|
|
101 | (2) |
|
Hardware Architecture Considerations |
|
|
103 | (1) |
|
Prototype NNIDS on a Network Interface |
|
|
104 | (6) |
|
|
104 | (2) |
|
Snort Hardware Implementation |
|
|
106 | (1) |
|
Network Interface to Host |
|
|
107 | (2) |
|
Pattern Matching on the FPGA Coprocessor |
|
|
109 | (1) |
|
|
110 | (1) |
|
|
110 | (5) |
|
|
111 | (1) |
|
|
111 | (3) |
|
|
114 | (1) |
|
|
115 | (4) |
|
|
116 | (3) |
|
Packet Processing on a SIMD Stream Processor |
|
|
119 | (26) |
|
|
|
|
Background: Stream Programs and Architectures |
|
|
120 | (2) |
|
|
120 | (1) |
|
Imagine Stream Architecture |
|
|
121 | (1) |
|
|
122 | (9) |
|
Design Methodology and Implementation Details |
|
|
123 | (2) |
|
|
125 | (5) |
|
|
130 | (1) |
|
|
131 | (8) |
|
Design Methodology and Implementation Details |
|
|
132 | (2) |
|
|
134 | (4) |
|
|
138 | (1) |
|
|
139 | (1) |
|
Conclusions and Future Work |
|
|
140 | (5) |
|
|
142 | (1) |
|
|
142 | (3) |
|
A Programming Environment for Packet-Processing Systems: Design Considerations |
|
|
145 | (28) |
|
|
|
|
|
|
|
|
|
147 | (3) |
|
Packet-Processing Applications |
|
|
147 | (1) |
|
Network Processor and System Architectures |
|
|
148 | (1) |
|
|
149 | (1) |
|
Shangri-La: A Programming Environment for Packet-Processing Systems |
|
|
150 | (2) |
|
Design Details and Challenges |
|
|
152 | (16) |
|
Baker: A Domain-Specific Programming Language |
|
|
152 | (6) |
|
Profile-Guided, Automated Mapping Compiler |
|
|
158 | (6) |
|
|
164 | (4) |
|
|
168 | (5) |
|
|
169 | (4) |
|
RNOS---A Middleware Platform for Low-Cost Packet-Processing Devices |
|
|
173 | (24) |
|
|
|
|
174 | (1) |
|
|
175 | (12) |
|
|
176 | (3) |
|
Input Model---SLA, Flows, and Microflows |
|
|
179 | (2) |
|
|
181 | (1) |
|
|
182 | (5) |
|
Implementation Model of RNOS |
|
|
187 | (5) |
|
|
188 | (1) |
|
|
188 | (1) |
|
|
189 | (3) |
|
Measurements and Comparison |
|
|
192 | (1) |
|
|
193 | (4) |
|
|
194 | (1) |
|
|
194 | (3) |
|
On the Feasibility of Using Network Processors for DNA Queries |
|
|
197 | (22) |
|
|
|
|
198 | (12) |
|
|
199 | (2) |
|
|
201 | (2) |
|
|
203 | (4) |
|
|
207 | (2) |
|
|
209 | (1) |
|
|
210 | (1) |
|
|
211 | (4) |
|
|
215 | (1) |
|
|
216 | (3) |
|
|
217 | (1) |
|
|
217 | (2) |
|
Pipeline Task Scheduling on Network Processors |
|
|
219 | (26) |
|
|
|
The Pipeline Task Assignment Problem |
|
|
221 | (4) |
|
Notation and Assignment Constraints |
|
|
221 | (2) |
|
|
223 | (1) |
|
|
224 | (1) |
|
|
225 | (3) |
|
|
225 | (1) |
|
|
226 | (1) |
|
|
227 | (1) |
|
Pipeline Design with Greedypipe |
|
|
228 | (4) |
|
Number of Pipeline Stages |
|
|
229 | (1) |
|
Sharing of Tasks Between Flows |
|
|
230 | (1) |
|
|
230 | (2) |
|
A Network Processor Problem |
|
|
232 | (10) |
|
Longest Prefix Matching (LPM) |
|
|
233 | (3) |
|
AES Encryption---A Pipelined Implementation |
|
|
236 | (2) |
|
Data Compression---A Pipelined Implementation |
|
|
238 | (1) |
|
Greedypipe NP Example Design Results |
|
|
239 | (3) |
|
|
242 | (3) |
|
|
243 | (1) |
|
|
243 | (2) |
|
A Framework for Design Space Exploration of Resource Efficient Network Processing on Multiprocessor SoCs |
|
|
245 | (34) |
|
|
|
|
|
|
247 | (2) |
|
Modeling Packet-Processing Systems |
|
|
249 | (6) |
|
|
249 | (4) |
|
|
253 | (2) |
|
|
255 | (6) |
|
Forwarding Flow Segments Between PEs |
|
|
256 | (1) |
|
Processing Flow Segments in PEs |
|
|
257 | (2) |
|
|
259 | (2) |
|
Mapping the Application to the System |
|
|
261 | (3) |
|
Estimating the Resource Consumption |
|
|
264 | (4) |
|
A Design Space Exploration Example |
|
|
268 | (7) |
|
Application and System Parameters |
|
|
268 | (3) |
|
|
271 | (4) |
|
|
275 | (4) |
|
|
275 | (1) |
|
|
276 | (3) |
|
Application Analysis and Resource Mapping for Heterogeneous Network Processor Architectures |
|
|
279 | (30) |
|
|
|
|
|
282 | (1) |
|
|
283 | (4) |
|
Static vs. Dynamic Analysis |
|
|
284 | (1) |
|
Annotated Directed Acyclic Graphs |
|
|
285 | (1) |
|
Application Parallelism and Dependencies |
|
|
285 | (2) |
|
|
287 | (1) |
|
ADAG Clustering Using Maximum Local Ratio Cut |
|
|
287 | (4) |
|
Clustering Problem Statement |
|
|
288 | (1) |
|
|
289 | (1) |
|
|
290 | (1) |
|
|
291 | (1) |
|
|
291 | (11) |
|
|
291 | (3) |
|
|
294 | (1) |
|
|
295 | (1) |
|
|
296 | (3) |
|
|
299 | (1) |
|
Identification of Coprocessor Functions |
|
|
299 | (3) |
|
Mapping Application DAGs to NP Architectures |
|
|
302 | (4) |
|
|
302 | (1) |
|
|
303 | (1) |
|
Mapping and Scheduling Results |
|
|
304 | (2) |
|
|
306 | (3) |
|
|
306 | (3) |
Index |
|
309 | |