CODES+ISSSACM Press, 2004 |
No grāmatas satura
1.–3. rezultāts no 39.
202. lappuse
... request deadlock ( R - dl ) ( line 5 ) . If the request would cause R - dl , the DAU does not accept the request ( i.e. , the request is denied ) ; thus R - dl can be avoided ( line 6 ) . On the other hand , if the request does not ...
... request deadlock ( R - dl ) ( line 5 ) . If the request would cause R - dl , the DAU does not accept the request ( i.e. , the request is denied ) ; thus R - dl can be avoided ( line 6 ) . On the other hand , if the request does not ...
203. lappuse
... request would cause request deadlock ( R - dl ) else deny the request and inform the potential R - dl ( i.e. , livelock ) ( let the requester take care of this livelock situation ) make the request be pending end - if if any process is ...
... request would cause request deadlock ( R - dl ) else deny the request and inform the potential R - dl ( i.e. , livelock ) ( let the requester take care of this livelock situation ) make the request be pending end - if if any process is ...
245. lappuse
... request is TRUE , it implies that this request has already been issued to the slave and now needs to wait for t.wait_cyc cycles before returning a response to the master . Therefore we simply add it to the executing requests set Ract ...
... request is TRUE , it implies that this request has already been issued to the slave and now needs to wait for t.wait_cyc cycles before returning a response to the master . Therefore we simply add it to the executing requests set Ract ...
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