Sciweavers

406 search results - page 2 / 82
» Fast Increment Registers
Sort
View
APLAS
2006
ACM
13 years 11 months ago
Combining Offline and Online Optimizations: Register Allocation and Method Inlining
Abstract. Fast dynamic compilers trade code quality for short compilation time in order to balance application performance and startup time. This paper investigates the interplay o...
Hiroshi Yamauchi, Jan Vitek
ASYNC
2006
IEEE
72views Hardware» more  ASYNC 2006»
14 years 1 months ago
Fast Asynchronous Shift Register for Bit-Serial Communication
A fast asynchronous shift register is used as the serializer and de-serializer in a novel bit-serial on-chip communication link. The link employs two-phase transition-based LEDR e...
Rostislav (Reuven) Dobkin, Ran Ginosar, Avinoam Ko...
CAL
2007
13 years 7 months ago
Physical Register Reference Counting
—Several recently proposed techniques including CPR (Checkpoint Processing and Recovery) and NoSQ (No Store Queue) rely on reference counting to manage physical registers. Howeve...
A. Roth
ICPADS
1998
IEEE
13 years 11 months ago
Fast Mutual Exclusion Algorithms Using Read-Modify-Write and Atomic Read/Write Registers
: Three fast mutual exclusion algorithms using read-modify-write and atomic read/write registers are presented in a sequence, with an improvement from one to the next. The last alg...
Ting-Lu Huang
FMCAD
2007
Springer
14 years 1 months ago
Fast Minimum-Register Retiming via Binary Maximum-Flow
We present a formulation of retiming to minimize the number of registers in a design by iterating a maximum network flow problem. The retiming returned will be the optimum one whi...
Aaron P. Hurst, Alan Mishchenko, Robert K. Brayton