Sciweavers

2110 search results - page 303 / 422
» What is the complexity of a distributed computing system
Sort
View
ICDCS
2000
IEEE
15 years 9 months ago
Secure Group Communication in Asynchronous Networks with Failures: Integration and Experiments
The increasing popularity and diversity of collaborative applications prompts a need for highly secure and reliable communication platforms for dynamic peer groups. Security mecha...
Jonathan Robert Stanton, Yair Amir, Damian Hasse, ...
IPPS
2000
IEEE
15 years 8 months ago
Consensus Based on Failure Detectors with a Perpetual Accuracy Property
This paper is on the Consensus problem, in the context of asynchronous distributed systems made of n processes, at most f of them may crash. A family of failure detector classes s...
Achour Mostéfaoui, Michel Raynal
PPSN
1992
Springer
15 years 8 months ago
Nonstationary Function Optimization using the Structured Genetic Algorithm
In this paper, we describe the application of a new type of genetic algorithm called the Structured Genetic Algorithm (sGA) for function optimization in nonstationary environments...
Dipankar Dasgupta, Douglas R. McGregor
EUROPAR
2006
Springer
15 years 8 months ago
Private Virtual Cluster: Infrastructure and Protocol for Instant Grids
Given current complexity of Grid technologies, the lack of security of P2P systems and the rigidity of VPN technologies make sharing resources belonging to different institutions s...
Ala Rezmerita, Tangui Morlier, Vincent Néri...
HPDC
1995
IEEE
15 years 8 months ago
A High Speed Implementation of Adaptive Shaping for Dynamic Bandwidth Allocation
Most algorithms proposed for controlling traffic prior to entering ATM networks are based on static mechanisms. Such static control mechanisms do not account for the dynamics of ...
Cameron Braun, V. Sirkay, H. Uriona, Srini W. Seet...