Sciweavers

2321 search results - page 94 / 465
» A Protocol for a Distributed Recommender System
Sort
View
PVM
2010
Springer
14 years 12 months ago
Dodging the Cost of Unavoidable Memory Copies in Message Logging Protocols
Abstract. With the number of computing elements spiraling to hundred of thousands in modern HPC systems, failures are common events. Few applications are nevertheless fault toleran...
George Bosilca, Aurelien Bouteiller, Thomas H&eacu...
DEXA
2000
Springer
84views Database» more  DEXA 2000»
15 years 5 months ago
Protocol for Taking Object-Based Checkpoints
Object-based checkpoints are consistent in the object-based system but may be inconsistent according to the traditional message-based definition. We present a protocol for taking ...
Katsuya Tanaka, Makoto Takizawa
EUROPAR
2007
Springer
15 years 5 months ago
Distributed Computation of All Node Replacements of a Minimum Spanning Tree
In many network applications the computation takes place on the minimum-cost spanning tree (MST) of the network; unfortunately, a single link or node failure disconnects the tree. ...
Paola Flocchini, Toni Mesa Enriquez, Linda Pagli, ...
SRDS
2003
IEEE
15 years 6 months ago
Distributed Programming for Dummies: A Shifting Transformation Technique
The perfectly synchronized round model provides the abstraction of crash-stop failures with atomic message delivery. This abstraction makes distributed programming very easy. We p...
Carole Delporte-Gallet, Hugues Fauconnier, Rachid ...
EUROPAR
2003
Springer
15 years 6 months ago
FOBS: A Lightweight Communication Protocol for Grid Computing
The advent of high-performance networks in conjunction with low-cost, powerful computational engines has made possible the development of a new set of technologies termed computat...
Phillip M. Dickens