5128 search results - page 746 / 1026 » When Abstraction Fails |
179
click to vote
POPL
1996
ACM
15 years 10 months ago
1996
ACM
that defines abstract costs for measuring or analyzing the performance of computations, (2) to supply the users with a mapping of these costs onto runtimes on various machine model...
156
click to vote
WDAG
1997
Springer
15 years 10 months ago
1997
Springer
Abstract. This work presents new algorithms for the "Do-All" problem that consists of performing t tasks reliably in a message-passing synchronous system of p fault-prone...
142
click to vote
EURODAC
1994
IEEE
15 years 10 months ago
1994
IEEE
Abstract -- A general framework for synthesis of asynchronous control circuits at the state graph level is proposed. The framework can consider both concurrency reduction as well a...
215
click to vote
ALP
1992
Springer
15 years 10 months ago
1992
Springer
Rewriting is a computational paradigm that specifies the actions, but not the control. We introduce a hierarchical structure repreat a high level of abstraction, a form of control....
169
click to vote
ICS
1994
Tsinghua U.
15 years 10 months ago
1994
Tsinghua U.
Abstract. We present a method to enhance wormhole routing algorithms for deadlock-free fault-tolerant routing in tori. We consider arbitrarily-located faulty blocks and assume only...