Discovering statistical models of availability in large distributed systems: An empirical study of seti@ home

B Javadi, D Kondo, JM Vincent… - IEEE Transactions on …, 2011 - ieeexplore.ieee.org
In the age of cloud, Grid, P2P, and volunteer distributed computing, large-scale systems with
tens of thousands of unreliable hosts are increasingly common. Invariably, these systems …

[ΒΙΒΛΙΟ][B] Discrete-event control of stochastic networks: Multimodularity and regularity

E Altman - 2003 - books.google.com
This work has been made possible largely thanks to the kind support of the Van Gogh
project N. 98001" Multimodularity and Control"(French-Dutch scientific cooperation project) …

[PDF][PDF] The structure and performance of optimal routing sequences

DA van der Laan - 2003 - Citeseer
We consider queueing systems in which arriving customers (jobs) are routed at the moment
of their arrival to N≥ 2 parallel servers, each having its own queue with infinite buffer size …

Gapped Binomial Complexities in Sequences

M Rigo, M Stipulanti… - 2023 IEEE International …, 2023 - ieeexplore.ieee.org
We relate the gapped k-deck problem introduced by Golm et al.(ISIT 2022) to notions arising
in the literature of combinatorics on words. We consider the complexity functions of infinite …

On the average waiting time for regular routing to deterministic queues

A Hordijk, D Van der Laan - Mathematics of Operations …, 2005 - pubsonline.informs.org
We consider a deterministic queueing system in which N≥ 2 servers of different speeds
operate in parallel. Each service in queue i takes the deterministic time Si. Identical …

Couverture d'un mot bidimensionnel par un motif chevauchant

G Gamard - 2017 - theses.hal.science
Nous étudions dans cette thèse la notion de quasipériodicité, introduite par Apostolico et
Ehrenfeucht au début des années 1990, puis étendue aux mots infinis par Solomon Marcus …

[PDF][PDF] D3. 2 Scheduling Heuristics for Desktop Computing

SD Kondo - 2010 - graal.ens-lyon.fr
The main goal of the task was to develop scheduling heuristics for Desktop Computing.
Develo** scheduling strategies in a large 100,000+ node Desktop Computing system is …