Browsing by Subject "On-line algorithms"
Now showing items 1-6 of 6
-
Article
Adaptive packet scheduling over a wireless channel under constrained jamming
(2017)In this work we consider the communication over a wireless link, between a sender and a receiver, being disrupted by a jammer. The objective of the sender is to transmit as much data as possible to the receiver in the most ...
-
Article
Competitive analysis of task scheduling algorithms on a fault-prone machine and the impact of resource augmentation
(2015)Reliable task execution on machines that are prone to unpredictable crashes and restarts is both important and challenging, but not much work exists on the analysis of such systems. We consider the online version of the ...
-
Article
Online parallel scheduling of non-uniform tasks: Trading failures for energy
(2015)Consider a system in which tasks of different execution times arrive continuously and have to be executed by a set of machines that are prone to crashes and restarts. In this paper we model and study the impact of parallelism ...
-
Article
Online parallel scheduling of non-uniform tasks: Trading failures for energy
(2013)Consider a system in which tasks of different execution times arrive continuously and have to be executed by a set of processors that are prone to crashes and restarts. In this paper we model and study the impact of ...
-
Article
Work-competitive scheduling for cooperative computing with dynamic groups
(2005)The problem of cooperatively performing a set of t tasks in a decentralized computing environment subject to failures is one of the fundamental problems in distributed computing. The setting with partitionable networks is ...
-
Conference Object
Work-competitive scheduling for cooperative computing with dynamic groups
(2003)The problem of cooperatively performing a set of t tasks in a decentralized setting where the computing medium is subject to failures is one of the fundamental problems in distributed computing. The setting with partitionable ...