Sciweavers

9 search results - page 1 / 2
» An Enhanced Theory of Infinite Time Register Machines
Sort
View
CIE
2008
Springer
13 years 7 months ago
An Enhanced Theory of Infinite Time Register Machines
Abstract. Infinite time register machines (ITRMs) are register machines which act on natural numbers and which are allowed to run for arbitrarily many ordinal steps. Successor step...
Peter Koepke, Russell Miller
AML
2010
102views more  AML 2010»
13 years 5 months ago
The basic theory of infinite time register machines
Merlin Carl, Tim Fischbach, Peter Koepke, Russell ...
CASES
2006
ACM
13 years 11 months ago
Adapting compilation techniques to enhance the packing of instructions into registers
The architectural design of embedded systems is becoming increasingly idiosyncratic to meet varying constraints regarding energy consumption, code size, and execution time. Tradit...
Stephen Hines, David B. Whalley, Gary S. Tyson
CC
2009
Springer
190views System Software» more  CC 2009»
14 years 5 months ago
SSA Elimination after Register Allocation
form uses a notational abstractions called -functions. These instructions have no analogous in actual machine instruction sets, and they must be replaced by ordinary instructions ...
Fernando Magno Quintão Pereira, Jens Palsbe...