Sciweavers

57 search results - page 12 / 12
» The fault span of crash failures
Sort
View
WDAG
1990
Springer
80views Algorithms» more  WDAG 1990»
13 years 9 months ago
Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks
A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...
Ofer Biran, Shlomo Moran, Shmuel Zaks
BMCBI
2005
130views more  BMCBI 2005»
13 years 5 months ago
Squid - a simple bioinformatics grid
Background: BLAST is a widely used genetic research tool for analysis of similarity between nucleotide and protein sequences. This paper presents a software application entitled &...
Paulo C. Carvalho, Rafael V. Glória, Antoni...