Computing Publications

Publications Home » A Model of Speculative Parallel S...

A Model of Speculative Parallel Scheduling in Networks of Unreliable Sensors

Zhan Qiu, Peter G. Harrison

Conference or Workshop Paper
28th International Symposium on Computer and Information Sciences (ISCIS 2013)
October, 2013
Lecture Notes in Electrical Engineering
Volume 264
pp.107–116
Springer
ISBN 9783319016030
ISSN 18761100
DOI 10.1007/978-3-319-01604-7_11
Abstract

As systems scale up, their mean-time-to-failure reduces drastically. We consider parallel servers subject to permanent failures but such that only one needs to survive in order to execute a given task. This kind of failure-model is appropriate in at least two types of systems: systems in which repair cannot take place (e.g. spacecraft) and systems that have strict deadlines (e.g. navigation systems). We use multiple replicas to perform the same task in order to improve the reliability of systems. The server in the system is subject to failure while it is on and the time to failure is memoryless, i.e. exponentially distributed. We derive expressions for the Laplace transform of the sojourn time distribution of a tagged task, jointly with the probability that the tagged task completes service, for a network of one or more parallel servers with exponential service times and times to failure.

Keywords
AESOP
BibTEX file for the publication
 

pubs.doc.ic.ac.uk: built & maintained by Ashok Argent-Katwala.