CODES+ISSSACM Press, 2004 |
No grāmatas satura
1.–3. rezultāts no 46.
202. lappuse
... granted to p3 , which requests 94 , while 94 is granted to process p4 . The DAU in Figure 4 receives all requests and releases , decides whether or not the request or grant can cause a deadlock and then permits the request or grant only ...
... granted to p3 , which requests 94 , while 94 is granted to process p4 . The DAU in Figure 4 receives all requests and releases , decides whether or not the request or grant can cause a deadlock and then permits the request or grant only ...
204. lappuse
... granted to p2 since p2 has a priority higher than p3 ; thus , the system would typically end up in deadlock . However , the DAU checks the potential G - dl and then avoids the G- dl by granting MPEG to p3 even though pз has a priority ...
... granted to p2 since p2 has a priority higher than p3 ; thus , the system would typically end up in deadlock . However , the DAU checks the potential G - dl and then avoids the G- dl by granting MPEG to p3 even though pз has a priority ...
205. lappuse
... granted to p3 , q2 is going to be granted to p2 . Thus , pз uses q1 and q3 and then releases q1 and q3 at time t9 ; 93 is granted to p2 , which then uses q2 and qз and finishes its job at time t10 . ( DSP ) P a . P P a1 as ( DSP ) ...
... granted to p3 , q2 is going to be granted to p2 . Thus , pз uses q1 and q3 and then releases q1 and q3 at time t9 ; 93 is granted to p2 , which then uses q2 and qз and finishes its job at time t10 . ( DSP ) P a . P P a1 as ( DSP ) ...
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