13489 search results - page 341 / 2698 » Operating System |
214
click to vote
DFG
1992
Springer
15 years 10 months ago
1992
Springer
Determining time necessary for computing important functions on parallel machines is one of the most important problems in complexity theory for parallel algorithms. Recently, a s...
145
click to vote
SIGOPSE
1990
ACM
15 years 10 months ago
1990
ACM
We propose group communication as an efficient mechanism to support fault tolerance. Our approach is based on an efficient reliable broadcast protocol that requires on average onl...
144
click to vote
USENIX
2007
15 years 9 months ago
2007
— We consider the problem of silent email loss in the Internet, where neither the sender nor the intended recipient is notified of the loss. Our detailed measurement study over ...
151
click to vote
USENIX
2008
15 years 9 months ago
2008
New single-machine environments are emerging from abundant computation available through multiple cores and secure virtualization. In this paper, we describe the research challeng...
174
click to vote
USENIX
2008
15 years 9 months ago
2008
Through clean-slate implementation of two storage optimizations--track-aligned extents and track-aligned RAIDs--this paper shows the values of independent validations. The experie...