Paper Info
Title
A Model of Speculative Parallel Scheduling in Networks of Unreliable Sensors.
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.
Year
DOI
Venue
2013
10.1007/978-3-319-01604-7_11
Lecture Notes in Electrical Engineering
Field
DocType
Volume
Time distribution,Exponential function,Expression (mathematics),Laplace transform,Computer science,Server,Computer network,Parallel scheduling,Exponential distribution,Distributed computing,Spacecraft
Conference
264
ISSN
Citations 
PageRank 
1876-1100
0
0.34
References 
Authors
4
2
Name
Order
Citations
PageRank
Zhan Qiu1394.51
Peter G. Harrison287098.29