6105 search results - page 923 / 1221 » A Parallel Algorithm for Bound-Smoothing |
165
click to vote
IPPS
2006
IEEE
16 years 21 days ago
2006
IEEE
Distributed Hash Tables (DHT) algorithms obtain good lookup performance bounds by using deterministic rules to organize peer nodes into an overlay network. To preserve the invaria...
160
click to vote
IPPS
2006
IEEE
16 years 21 days ago
2006
IEEE
An execution environment consisting of virtual machines (VMs) interconnected with a virtual overlay network can use the naturally occurring traffic of an existing, unmodified ap...
157
click to vote
IPPS
2006
IEEE
16 years 21 days ago
2006
IEEE
Cooperative checkpointing, in which the system dynamically skips checkpoints requested by applications at runtime, can exploit system-level information to improve performance and ...
157
click to vote
IPPS
2006
IEEE
16 years 21 days ago
2006
IEEE
For many performance analysis problems, the ability to reason across traces is invaluable. However, due to non-determinism in the OS and virtual machines, even two identical runs ...
154
click to vote
IPPS
2006
IEEE
16 years 21 days ago
2006
IEEE
In this paper, we propose a methodology for developing component-based real-time systems based on the concept of hierarchical scheduling. Recently, much work has been devoted to t...