CODES+ISSSACM Press, 2003 |
No grāmatas satura
1.–3. rezultāts no 22.
92. lappuse
... Assignment Code The Dynamic Single Assignment Code ( dSAC ) derived from a weakly dynamic application ( WDA ) is a program in which every variable is written at most once . This property implies that some 2 The process network synthesis ...
... Assignment Code The Dynamic Single Assignment Code ( dSAC ) derived from a weakly dynamic application ( WDA ) is a program in which every variable is written at most once . This property implies that some 2 The process network synthesis ...
122. lappuse
... assignment , is also needed to determine on which processor one task will be executed . A good overview of scheduling algorithms can be found in [ 17 ] . In our paper , the terminology task scheduling is used for both the task ordering ...
... assignment , is also needed to determine on which processor one task will be executed . A good overview of scheduling algorithms can be found in [ 17 ] . In our paper , the terminology task scheduling is used for both the task ordering ...
206. lappuse
... assignment of n * [ log2 ( k + 1 ) ] boolean variables . A set of cache states S simply denotes a set of truth assignments of these n * [ log2 ( k + 1 ) ] boolean variables , call it Vs. Thus , a set of cache states S can be represented ...
... assignment of n * [ log2 ( k + 1 ) ] boolean variables . A set of cache states S simply denotes a set of truth assignments of these n * [ log2 ( k + 1 ) ] boolean variables , call it Vs. Thus , a set of cache states S can be represented ...
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