2432 search results - page 134 / 487 » Using simple abstraction to reinvent computing for paralleli... |
126
click to vote
CCA
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We prove the correctness of a formalised realisability interpretation of extensions of first-order theories by inductive and coinductive definitions in an untyped λ-ca...
106
click to vote
GI
2009
Springer
15 years 9 months ago
2009
Springer
: In this paper we present the concurrent constraint functional programming CCFL and an abstract machine for the evaluation of CCFL programs in a multicore environment. The source ...
129
click to vote
EUROPAR
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. This paper outlines a feasible approach to ranking Grid resources based on an easily obtainable application-specific performance model utilizing low-level performance me...
141
click to vote
CONCUR
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. We apply the theory of asynchronous automata to the synthesis problem of closed distributed systems. We use safe asynchronous automata as implementation model, and charac...
131
click to vote
EUROPAR
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. This article presents a fault tolerant extension for the NaimiTrehel token-based mutual exclusion algorithm. Contrary to the extension proposed by Naimi-Trehel, our appro...