CODES+ISSSACM Press, 2005 |
No grāmatas satura
1.3. rezultāts no 80.
279. lappuse
... processing paths through the NP . Packets with well understood , relatively simple processing requirements may even bypass the central CPU complex ( AutoRoute ) . In consequence , CPU processing resources are more effectively used and ...
... processing paths through the NP . Packets with well understood , relatively simple processing requirements may even bypass the central CPU complex ( AutoRoute ) . In consequence , CPU processing resources are more effectively used and ...
280. lappuse
... processing requirements can directly be sent to the Traffic Manager unit on the egress side of the NP . As packets bypass the CPU cluster in this operation mode , we call this processing path AutoRoute . The " saved " CPU computing ...
... processing requirements can directly be sent to the Traffic Manager unit on the egress side of the NP . As packets bypass the CPU cluster in this operation mode , we call this processing path AutoRoute . The " saved " CPU computing ...
282. lappuse
... processing capacities for those packets still traversing through the CPU cluster . For even higher values of b in the range of 80 % to 90 % , IPP1 values between 2000 and 3000 can be achieved with FlexPath_2 , allowing the execution of ...
... processing capacities for those packets still traversing through the CPU cluster . For even higher values of b in the range of 80 % to 90 % , IPP1 values between 2000 and 3000 can be achieved with FlexPath_2 , allowing the execution of ...
Saturs
Keynote | 3 |
A Core Flight Software System | 13 |
A CycleAccurate Compilation Algorithm for Custom Pipelined Datapaths | 21 |
Autortiesības | |
31 citas sadaļas nav parādītas.
Citi izdevumi - Skatīt visu
Bieži izmantoti vārdi un frāzes
abstraction algorithm allocation analysis application approach architecture benchmarks binary biochips buffer byte cache channel chip circuit clock communication compiler components compression Computer configuration constraints copies coprocessor core CRAMES cycle cycle accurate simulation data block decoder digital microfluidic DVFS dynamic Echo instructions EEMBC efficient embedded systems energy consumption execution FPGA function graph hardware hash IEEE implementation input instruction-set interface iteration latency loop mapping marked graph memory accesses methodology microblaze microfluidic minimal minterms minterms module multiplier multiprocessor node on-chip operations optimal output overhead packet parallel parameters partition performance pipeline platform port power consumption Proc processor proposed reconfigurable reduce resource router runtime samples scheduling SECTAG Section SELinux simulation space specific speedup switch synchronization synthesis SystemC Table target task techniques tion transaction universal hash functions vector VLIW voltage WCET Xilinx