Abstract— In this article, we propose a fully distributed algorithm for finding all primes in an given interval [2..n] (or (L, R), more generally), based on the SMER — Schedul...
Gabriel Paillard, Christian Antoine Louis Lavault,...
This paper makes the case why mobile code is an appropriate solution for platforms running on mobile devices aggregated in mobile ad-hoc networks. It also presents a solution
Distributed or parallel rule-based systems are currently needed for real applications. The proposed architecture of such a system is based on a wrapper allowing the cooperation bet...
We propose a method for coordinating local components that observe a distributed discrete-event system R and execute actions depending on the current state of R. Coordination is a...
Grid computing accomplishes high throughput computing by using a very large number of unexploited computing resources. We present a parallel method GMRES to solve large sparse lin...
The support on cluster environments of ”legacy protocols” is important to avoid rewriting the code of applications, but this support should not prevent to achieve the maximum ...
An important scheduling problem is the one in which there are no dependencies between tasks and the tasks can be of arbitrary size. This is known as the divisible load scheduling ...
Online travel support systems have often been cited as an ideal proving ground for agent-based architectures, yet no working systems have materialized. Over the last few years we ...