Skip to search formSkip to main contentSkip to account menu
  • Publications
  • Influence
Random graph generation for scheduling simulations
TLDR
This work proposes GGen -- a unified and standard implementation of classical task graph generation methods used in the scheduling domain, and provides an in-depth analysis of each generation method, emphasizing important graph properties that may influence scheduling algorithms.
View via Publisher
Discovering Statistical Models of Availability in Large Distributed Systems: An Empirical Study of SETI@home
TLDR
This paper describes an effective method for discovering subsets of hosts whose availability have similar statistical properties and can be modeled with similar probability distributions and shows that these methods and models are critical for the design of stochastic scheduling algorithms across large systems where host availability is uncertain.
View on IEEE
Mining for statistical models of availability in large-scale distributed systems: An empirical study of SETI@home
TLDR
This paper describes an effective method for discovering subsets of hosts whose availability have similar statistical properties and can be modelled with similar probability distributions and finds that this characterization is fundamental in the design of stochastic scheduling algorithms across large-scale systems where host availability is uncertain.
View on IEEE
Perfect simulation and non-monotone Markovian systems
TLDR
It is shown that the envelope approach is efficient for some classes of non-monotone queuing networks, such as networks of queues with batch arrivals, queues with fork and join nodes and/or with negative customers.
View via Publisher
Dynamics of synchronized parallel systems
TLDR
This paper presents a general model for parallel systems and defines a performance parameter that is roughly the throughput of the system and presents an exact calculation for the case of a system composed of two resources and an upper bound for more general systems.
View via Publisher
Some Ergodic Results on Stochastic Iterative Discrete Events Systems
  • J. Vincent
  • Mathematics
    Discret. Event Dyn. Syst.
  • 1 April 1997
TLDR
It is established that the behaviour of the extremas of the process T(n) are linear and some stability properties of such sequences are given and a simple method of estimating the limit points is given.
View on Springer
On the exact simulation of functionals of stationary Markov chains
View via Publisher
A Flexible Checkpoint/Restart Model in Distributed Systems
TLDR
This work presents a new model of coordinated Checkpoint/Restart mechanism for several types of computing platforms parametrized by the process failure distribution, the cost to save a global consistent state of processes and the number of computational resources, and model independency from the type of the failure law makes it completely flexible.
View via Publisher
Stochastic Bounds on Execution Times of Parallel Programs
TLDR
Stochastic bounds are obtained on execution times of parallel programs when the number of processors is unlimited and another upper bound is obtained for parallel programs having 'new better than used in expectation' (NBUE) random variables as task execution times.
View via Publisher
Shrinking Regions : A Paradigm Shift in Demography and Territorial Development
...
...
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License