In order to solve the problem of various faults in grid computing environment, this paper
raises an online distributed fault-tolerant job scheduling algorithm. The algorithm is …

In the square packing problem, the goal is to place a multi-set of square-items of various
sizes into a minimum number of square-bins of equal size. Items are assumed to have …

We study the problem of scheduling n jobs on m identical, fault-prone machines f of which
are prone to crashes by an adversary, where communication takes place via a multiple …

Abstract In Packet Scheduling with Adversarial Jamming, packets of arbitrary sizes arrive
over time to be transmitted over a channel in which instantaneous jamming errors occur at …

Bin packing is a classic optimization problem with many applications and variants. In its
basic form, the goal is to pack items of different sizes in the range (0, 1] into the minimum …

We study online scheduling policies for buffer management models, in which packets are
arriving over time to a buffer of a network switch to be sent through its single output port …

This dissertation tackles several questions in distributed computing and fault-tolerance. It
consists of four main, more or less independent, chapters that all fit into a certain bigger …