Tomasz Rolski

Learn More
Many processes must complete in the presence of failures. Different systems respond to task failure in different ways. The system may resume a failed task from the failure point (or a saved checkpoint shortly before the failure point), it may give up on the task and select a replacement task from the ready queue, or it may restart the task. The behavior of(More)
In his seminal paper from 1978, Ross set up a few conjectures which formalize a common belief that more variable arrival processes lead to worse performance in queueing systems. We study these types of problems for Cox/GI/1/∞, Cox/GI/∞/∞, and Cox/GI/1/0 systems. Assumptions are stated in terms of ≤idcx-regularity. For example, in the class of stationary(More)
1 Mathematical Institute, University of Wroc law, pl. Grunwaldzki 2/4, 50-384 Wroc law, Poland This work was partially supported by a Marie Curie Transfer of Knowledge Fellowship of the European Community’s Sixth Framework Programme: Programme HANAP under contract number MTKD-CT-200413389. This work was partially supported by This work was partially(More)
We consider a Lévy-driven tandem queue with an intermediate input assuming that its buffer content process obtained by a reflection mapping has the stationary distribution. For this queue, no closed form formula is known, not only for its distribution but also for the corresponding transform. In this paper we consider only light-tailed inputs, and derive(More)