In this chapter, we propose a general framework for deriving efficient (polynomial-time) algorithms for steady-state scheduling. In the context of large scale platforms (grids or volunteer computing platforms), we show that the characteristics of the resources (volatility, heterogeneity) limit their use to large regular applications. Therefore, steady-state scheduling, that consists in optimizi...

Steady state simulation is used to study long-run behavior. Usually only the expected value of the steady state probability distribution function is estimated. In many cases quantiles of this distribution are of higher interest. In this paper a new usage of quantile estimators is proposed, which is derived from mean value analysis and is based on multiple independent replications. The advantage...

The paper presents a new modeling framework enabling to evaluate the cyclic steady state of a given system of concurrently flowing cyclic processes (SCCP) on the base of the assumed topology of transportation routes, dispatching rules employed, resources and operation times as well as an initial processes allocation. The objective is to provide the rules useful in the course of routing and sche...

This paper presents a new approach to the application mode of image processing operators, the so-called steady-state image processing. The approach reminds a steady-state genetic processing of images by considering each pixel of the image as an individual. So, some pixels are selected, processed and copied back into the image. This differs from the standard approach, where all image pixels are ...