Sciweavers

3398 search results - page 190 / 680
» Implementations of Grid-Based Distributed Parallel Computing
Sort
View
CLADE
2004
IEEE
14 years 2 months ago
Morphable Messaging: Efficient Support for Evolution in Distributed Applications
All but the most briefly used systems must evolve as their mission and roles change over time. Evolution in the context of large distributed systems is extraordinarily complex bec...
Sandip Agarwala, Greg Eisenhauer, Karsten Schwan
IPPS
1997
IEEE
14 years 2 months ago
Control Schemes in a Generalized Utility for Parallel Branch-and-Bound Algorithms
Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these a...
Yuji Shinano, Kenichi Harada, Ryuichi Hirabayashi
IPPS
2007
IEEE
14 years 4 months ago
FixD : Fault Detection, Bug Reporting, and Recoverability for Distributed Applications
Model checking, logging, debugging, and checkpointing/recovery are great tools to identify bugs in small sequential programs. The direct application of these techniques to the dom...
Cristian Tapus, David A. Noblet
ICDCS
2003
IEEE
14 years 3 months ago
Dynamic Module Replacement in Distributed Protocols
Dynamic module replacement — the ability to hot swap a component’s implementation at runtime — is fundamental to supporting evolutionary change in long-lived and highlyavail...
Nigamanth Sridhar, Scott M. Pike, Bruce W. Weide
IPPS
2002
IEEE
14 years 3 months ago
Heaps and Stacks in Distributed Shared Memory
Software-based distributed shared memory (DSM) systems do usually not provide any means to use shared memory regions as stacks or via an efficient heap memory allocator. Instead ...
Markus Pizka, Christian Rehn