287 search results - page 6 / 58 » On the Complexity of Register Coalescing |
ICCD
2003
IEEE
14 years 4 months ago
2003
IEEE
A critical problem in wide-issue superscalar processors is the limit on cycle time imposed by the central register file and operand bypass network. In this paper, a distributed re...
ASYNC
2004
IEEE
13 years 11 months ago
2004
IEEE
Register files of microprocessors have often been cited as performance bottlenecks and significant consumers of energy. The robust and modular nature of quasi-delay insensitive (Q...
CVPR
2004
IEEE
14 years 9 months ago
2004
IEEE
Coalescence, meaning the tracker associates more than one trajectories to some targets while loses track for others, is a challenging problem for visual tracking of multiple targe...
WDAG
2007
Springer
14 years 1 months ago
2007
Springer
The timestamp problem captures a fundamental aspect of asynchronous distributed computing. It allows processes to label events throughout the system with timestamps that provide in...
CIE
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. The Ordinal Register Machine (ORM) is one of several different machine models for infinitary computability. We classify, by complexity, the sets that can be decided quic...