Sciweavers

4800 search results - page 693 / 960
» OO Distributed Programming is Not Distributed OO Programming
Sort
View
HPDC
2011
IEEE
14 years 10 months ago
Algorithm-based recovery for iterative methods without checkpointing
In today’s high performance computing practice, fail-stop failures are often tolerated by checkpointing. While checkpointing is a very general technique and can often be applied...
Zizhong Chen
INFOCOM
2011
IEEE
14 years 10 months ago
Consort: Node-Constrained Opportunistic Routing in wireless mesh networks
— Opportunistic routing is proposed to improve the performance of wireless networks by exploiting the broadcast nature and spatial diversity of the wireless medium. In this paper...
Xi Fang, Dejun Yang, Guoliang Xue
ICDE
2001
IEEE
121views Database» more  ICDE 2001»
16 years 8 months ago
Integrating Semi-Join-Reducers into State of the Art Query Processors
Semi-join reducers were introduced in the late seventies as a means to reduce the communication costs of distributed database systems. Subsequent work in the eighties showed, howe...
Konrad Stocker, Donald Kossmann, Reinhard Braumand...
CP
2009
Springer
16 years 7 months ago
On the Structure of Industrial SAT Instances
Abstract. During this decade, it has been observed that many realworld graphs, like the web and some social and metabolic networks, have a scale-free structure. These graphs are ch...
Carlos Ansótegui, Jordi Levy, Maria Luisa B...
HPCA
2007
IEEE
16 years 7 months ago
A Scalable, Non-blocking Approach to Transactional Memory
Transactional Memory (TM) provides mechanisms that promise to simplify parallel programming by eliminating the need for locks and their associated problems (deadlock, livelock, pr...
Hassan Chafi, Jared Casper, Brian D. Carlstrom, Au...