CODES+ISSSACM Press, 2003 |
No grāmatas satura
1.3. rezultāts no 53.
40. lappuse
... events . The first event enables the request . It can be empty . The second event is an output event . When the state machine emits the output event , the control function ends . A control function is referred to as a request in the ...
... events . The first event enables the request . It can be empty . The second event is an output event . When the state machine emits the output event , the control function ends . A control function is referred to as a request in the ...
41. lappuse
event e differs . For an event e , define H ( e ) as the set of event handlers enabled by event e , and define WE as ... event . To assign priorities to the input events , we classify the input events according to their appearances . An ...
event e differs . For an event e , define H ( e ) as the set of event handlers enabled by event e , and define WE as ... event . To assign priorities to the input events , we classify the input events according to their appearances . An ...
43. lappuse
... events , that is , input events are not lost . Similarly , in time period T mentioned in E3 , there are at most ( T * fp ) instances of events of priority p . The WCET of the event handlers satisfies T > Σ ( T × ƒ , × Wp ( p ) ) , i.e. ...
... events , that is , input events are not lost . Similarly , in time period T mentioned in E3 , there are at most ( T * fp ) instances of events of priority p . The WCET of the event handlers satisfies T > Σ ( T × ƒ , × Wp ( p ) ) , i.e. ...
Saturs
An Efficient Retargetable Framework for InstructionSet Simulation | 13 |
Extending the SystemC Synthesis Subset by ObjectOriented Features | 25 |
Hardware Support for Realtime Operating Systems | 45 |
Autortiesības | |
19 citas sadaļas nav parādītas.
Citi izdevumi - Skatīt visu
Bieži izmantoti vārdi un frāzes
abstraction adiabatic circuits algorithm analysis application approach architecture behavior buffer bytecode cache blocks cache line channel chip clock Codesign communication components computation configuration constraints core cycle decoder defined delay design space exploration device device driver DRAM DRAM row dynamic EMAC embedded systems encoder energy error estimation event example execution FIFO flash memory function global hardware IEEE implementation input instruction interface iteration Kahn Process Network latency logic minimization loop M-JPEG mapping methodology module multiple NAND Nash equilibrium Newport Beach node on-chip on-memory cache optimization output overhead packet parallel parameters partitioning performance priority Proc process network processor protocol real-time retiming RTOS model RTPN scheduling Section shown in Figure simulation solution specification speech recognition static step synchronization synthesis system level SystemC Table task graphs TCP/IP technique Technology tion TLMs tool VHDL virtual VLIW wires