Sciweavers

1017 search results - page 48 / 204
» Register computations on ordinals
Sort
View
DAC
1989
ACM
13 years 11 months ago
Scheduling and Binding Algorithms for High-Level Synthesis
- New algorithms for high-level synthesis are presented. The first performs scheduling under hardware resource constraints and improves on commonly used list scheduling techniques ...
Pierre G. Paulin, John P. Knight
PODC
2010
ACM
13 years 11 months ago
Brief announcement: a shared disk on distributed storage
A shared disk implementation on distributed storage requires consistent behavior of disk operations. Deterministic consensus on such behavior is impossible when even a single stor...
Stefan Vijzelaar, Herbert Bos, Wan Fokkink
ATAL
2009
Springer
14 years 2 months ago
Computational aspects of Shapley's saddles
Game-theoretic solution concepts, such as Nash equilibrium, are playing an ever increasing role in the study of systems of autonomous computational agents. A common criticism of N...
Felix Brandt, Markus Brill, Felix A. Fischer, Paul...
VLSID
1999
IEEE
87views VLSI» more  VLSID 1999»
14 years 3 hour ago
Optimal Retiming for Initial State Computation
Retiming is a transformation that optimizes a sequential circuit by relocating the registers. When the circuit has an initial state, one must compute an equivalent initial state f...
Peichen Pan, Guohua Chen
IFIP
1993
Springer
13 years 11 months ago
Self-Timed Architecture of a Reduced Instruction Set Computer
An advanced Self-Timed Reduced Instruction Set Computer (ST-RISC) architecture is described. It is designed hierarchically, and is formally specified functionally at the various ...
Ilana David, Ran Ginosar, Michael Yoeli