Sciweavers

1192 search results - page 210 / 239
» Computing Weakest Readings
Sort
View
CLUSTER
2004
IEEE
15 years 5 months ago
FTC-Charm++: an in-memory checkpoint-based fault tolerant runtime for Charm++ and MPI
As high performance clusters continue to grow in size, the mean time between failure shrinks. Thus, the issues of fault tolerance and reliability are becoming one of the challengi...
Gengbin Zheng, Lixia Shi, Laxmikant V. Kalé
98
Voted
DSN
2004
IEEE
15 years 5 months ago
Automated Synthesis of Multitolerance
We concentrate on automated synthesis of multitolerant programs, i.e., programs that tolerate multiple classes of faults and provide a (possibly) different level of fault-toleranc...
Sandeep S. Kulkarni, Ali Ebnenasir
ICDCS
2000
IEEE
15 years 5 months ago
Graceful Quorum Reconfiguration in a Robust Emulation of Shared Memory
Providing shared-memory abstraction in messagepassing systems often simplifies the development of distributed algorithms and allows for the reuse of sharedmemory algorithms in the...
Burkhard Englert, Alexander A. Shvartsman
131
Voted
ISMIR
2000
Springer
148views Music» more  ISMIR 2000»
15 years 5 months ago
IR for Contemporary Music: What the Musicologist Needs
Active listening is the core of musical activity Listening does not only concern receiving musical information. On the contrary, it is "active" and based on a set of int...
Alain Bonardi
FPCA
1995
15 years 5 months ago
Pi-Calculus, Dialogue Games and PCF
Game semantics is an unusual denotational semantics in that it captures the intensional (or algorithmic) and dynamical aspects of the computation. This makes it an ideal semantica...
J. M. E. Hyland, C.-H. Luke Ong