1855 search results - page 89 / 371 » A coding theorem for distributed computation |
100
Voted
IPPS
2007
IEEE
15 years 6 months ago
2007
IEEE
Due to the extensive requirement of memory and speed for direct numerical simulation (DNS) of channel turbulence, people can only perform DNS at moderate Reynolds number before. W...
92
Voted
P2P
2007
IEEE
15 years 6 months ago
2007
IEEE
Tit-for-tat is widely believed to be the most effective strategy to enforce collaboration among selfish users. However, it has been shown that its usefulness for decentralized an...
113
click to vote
IPPS
1998
IEEE
15 years 4 months ago
1998
IEEE
In this paper, we present several novel strategies to improve software controlled cache utilization, so as to achieve lower power requirements for multi-media and signal processin...
105
Voted
ICPP
1999
IEEE
15 years 4 months ago
1999
IEEE
The vector-clock size necessary to characterize causality in a distributed computation is bounded by the dimension of the partial order induced by that computation. In an arbitrar...
75
Voted
EUROPAR
2004
Springer
15 years 6 months ago
2004
Springer
In this paper we first present two tagging mechanisms; the SCISM and IA-64; thereafter we describe the mapping of IA-64 ISA to a SCISM configuration without changing or reassigni...