IMDEA Networks Institute Publications Repository

Asymptotic Competitive Analysis of Task Scheduling Algorithms on a Fault-Prone Machine

Zavou, Elli (2014) Asymptotic Competitive Analysis of Task Scheduling Algorithms on a Fault-Prone Machine. In: The 41st International Colloquium on Automata Languages and Programming (ICALP 2014), 7–11 July 2014, Copenhagen, Denmark.

[img]
Preview
PDF (Asymptotic Competitive Analysis of Task Scheduling Algorithms on a Fault-Prone Machine) - Published Version
Download (688Kb) | Preview
Item Type: Conference or Workshop Papers (Poster)
Additional Information: (Part of a collaborative work with A. Fernández Anta (1), C. Georgiou (3)and D.R. Kowalski (4)) 1 IMDEA Networks Institute, 2 Universidad Carlos III de Madrid, 3 University of Cyprus, 4 University of Liverpool
Subjects: UNSPECIFIED
Divisions: UNSPECIFIED
Depositing User: Elli Zavou
Date Deposited: 09 Jan 2015 13:29
Last Modified: 15 Dec 2016 15:09
URI: http://eprints.networks.imdea.org/id/eprint/921

Actions (login required)

View Item View Item