CODES+ISSSACM Press, 2004 |
No grāmatas satura
1.–3. rezultāts no 23.
52. lappuse
... packet reassembly and N * C lists for packet queuing , where N is the number of SPI ports , and C the number of traffic classes . IngPkt ; packet reassembly and queuing SchPkt : packet scheduling ( strict priority per port ) EgrPkt ...
... packet reassembly and N * C lists for packet queuing , where N is the number of SPI ports , and C the number of traffic classes . IngPkt ; packet reassembly and queuing SchPkt : packet scheduling ( strict priority per port ) EgrPkt ...
156. lappuse
... packets % 100 80 60 889 20 40 0 200 board ISS timed ISS no timed 125 111 100 167 143 Packet generation frequency ( S1 ) Figure 7 : Percentage of forwarded packets . ticast Helix Packet Switch1 example distributed with Sy- stemC . The ...
... packets % 100 80 60 889 20 40 0 200 board ISS timed ISS no timed 125 111 100 167 143 Packet generation frequency ( S1 ) Figure 7 : Percentage of forwarded packets . ticast Helix Packet Switch1 example distributed with Sy- stemC . The ...
184. lappuse
... packet from the input queue in port B before it can forward the packet . In general , therefore , the overall performance of the network ( measured as the time required to han- dle all the incoming traffic ) improves if the size of the ...
... packet from the input queue in port B before it can forward the packet . In general , therefore , the overall performance of the network ( measured as the time required to han- dle all the incoming traffic ) improves if the size of the ...
Saturs
Keynote | 1 |
DualPipeline Heterogeneous ASIP Design | 12 |
Fast CycleAccurate Simulation and Instruction Set Generation | 18 |
Autortiesības | |
28 citas sadaļas nav parādītas.
Citi izdevumi - Skatīt visu
Bieži izmantoti vārdi un frāzes
algorithm allocation application approach array assignment benchmarks block buffer cache checksum clock compiler components Computer concurrency constraints cosimulator cost cycles data hazard dataflow deadlock decoder design space dTLB dynamic edge embedded systems energy consumption evaluate example execution exploration flash memory function hardware HW/SW IDCT IEEE implementation input instruction set interface iteration latency leakage power livelock logic loop loop fusion mapping memory objects mesochronous methodology multiprocessor node on-chip operation optimal output overhead packet parameters partitioning path performance phase pipeline platform port power consumption problem Proc processor proposed queue reconfigurable register file request requires resource RTOS scenarios scheduling Section shown in Figure signal SIMD simulation solution specification speech recognition Structured ASIC switch synchronization synthesis system-level SystemC Table technique tion type inference type schemes variables Verilog VHDL VLIW XScale