CODES+ISSSACM Press, 2003 |
No grāmatas satura
1.3. rezultāts no 37.
40. lappuse
... machine before the firing of transition 8 , are E1 , after the firing are E2 . Obviously , Eout E2 . An event e is sticky iff V81 , e E1 , e e⇒ee E2 , that is , a sticky event remains visible unless it is consumed . An unreliable ...
... machine before the firing of transition 8 , are E1 , after the firing are E2 . Obviously , Eout E2 . An event e is sticky iff V81 , e E1 , e e⇒ee E2 , that is , a sticky event remains visible unless it is consumed . An unreliable ...
41. lappuse
... machine . A timer event is obsolete if the state machine no longer waits for it . The obsoleteness of the timer event models event occurrence timeout . Moreover , a state has at most one up - to - date timer event . To assign priorities ...
... machine . A timer event is obsolete if the state machine no longer waits for it . The obsoleteness of the timer event models event occurrence timeout . Moreover , a state has at most one up - to - date timer event . To assign priorities ...
42. lappuse
... machine is satisfied . S5 ) No circular shared resource requirements . S6 ) The execution result is not affected by the execution order of the state machines . Rule S1 constrains our synthesis method to a statically defined ...
... machine is satisfied . S5 ) No circular shared resource requirements . S6 ) The execution result is not affected by the execution order of the state machines . Rule S1 constrains our synthesis method to a statically defined ...
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