CODES+ISSSACM Press, 2003 |
No grāmatas satura
1.3. rezultāts no 23.
76. lappuse
... ( wire pipelin- ing ) . This operation trades - off fixing a wire exception with in- creasing its latency by one or more clock cycles and allows to drive long wires with the same clock signal used to control short wires and logic gates ...
... ( wire pipelin- ing ) . This operation trades - off fixing a wire exception with in- creasing its latency by one or more clock cycles and allows to drive long wires with the same clock signal used to control short wires and logic gates ...
190. lappuse
... wires A fault generally lasts at least one clock cycle ( d ≥ 1 ) . The elements of P , with the index d 0 are used to indicate the probability of permanent faults . Since the matrix elements describe the probabilities of different ...
... wires A fault generally lasts at least one clock cycle ( d ≥ 1 ) . The elements of P , with the index d 0 are used to indicate the probability of permanent faults . Since the matrix elements describe the probabilities of different ...
192. lappuse
... wires ) 2x8 SEC - DED ( 26 wires ) 1x16 SEC - DED ( 22 wires ) 10-15 undetected errors 10-20 Figure 4 : Estimation and simulation results 1. Compute the average probability that a wire is not affected by any fault : Pok 2. Compute the ...
... wires ) 2x8 SEC - DED ( 26 wires ) 1x16 SEC - DED ( 22 wires ) 10-15 undetected errors 10-20 Figure 4 : Estimation and simulation results 1. Compute the average probability that a wire is not affected by any fault : Pok 2. Compute the ...
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