Sciweavers

406 search results - page 4 / 82
» Fast Increment Registers
Sort
View
IPPS
2007
IEEE
15 years 6 months ago
Microarchitectural Support for Speculative Register Renaming
This paper proposes and evaluates a new microarchitecture for out-of-order processors that supports speculative renaming. We call speculative renaming to the speculative omission ...
Jesús Alastruey, Teresa Monreal, Víc...
PODC
2009
ACM
16 years 8 days ago
Max registers, counters, and monotone circuits
A method is given for constructing a max register, a linearizable, wait-free concurrent data structure that supports a write operation and a read operation that returns the larges...
James Aspnes, Hagit Attiya, Keren Censor
SPAA
2006
ACM
15 years 5 months ago
Fault-tolerant semifast implementations of atomic read/write registers
This paper investigates time-efficient implementations of atomic read-write registers in message-passing systems where the number of readers can be unbounded. In particular we st...
Chryssis Georgiou, Nicolas C. Nicolaou, Alexander ...
ARCS
2010
Springer
15 years 4 months ago
Complexity-Effective Rename Table Design for Rapid Speculation Recovery
Register renaming is a widely used technique to remove false data dependencies in contemporary superscalar microprocessors. The register rename logic includes a mapping table that ...
Görkem Asilioglu, Emine Merve Kaya, Oguz Ergi...