Sciweavers

62 search results - page 8 / 13
» On Choosing a Task Assignment Policy for a Distributed Serve...
Sort
View
TPDS
2010
135views more  TPDS 2010»
13 years 6 months ago
Maximizing Service Reliability in Distributed Computing Systems with Random Node Failures: Theory and Implementation
—In distributed computing systems (DCSs) where server nodes can fail permanently with nonzero probability, the system performance can be assessed by means of the service reliabil...
Jorge E. Pezoa, Sagar Dhakal, Majeed M. Hayat
EURONGI
2006
Springer
13 years 11 months ago
Job Scheduling for Maximal Throughput in Autonomic Computing Systems
Abstract. Autonomic computing networks manage multiple tasks over a distributed network of resources. In this paper, we view an autonomic computing system as a network of queues, w...
Kevin Ross, Nicholas Bambos
SIGMETRICS
2008
ACM
159views Hardware» more  SIGMETRICS 2008»
13 years 7 months ago
Weighted fair sharing for dynamic virtual clusters
In a shared server infrastructure, a scheduler controls how quantities of resources are shared over time in a fair manner across multiple, competing consumers. It should support w...
Laura E. Grit, Jeffrey S. Chase
CODES
2009
IEEE
13 years 11 months ago
An MDP-based application oriented optimal policy for wireless sensor networks
Technological advancements due to Moore’s law have led to the proliferation of complex wireless sensor network (WSN) domains. One commonality across all WSN domains is the need ...
Arslan Munir, Ann Gordon-Ross
CDC
2010
IEEE
141views Control Systems» more  CDC 2010»
13 years 2 months ago
Adaptive reservations for feedback control
In this paper, we start from an assigned control law with known probability distributions of its execution time. Our goal is to identify an optimised scheduling policy that allows ...
Daniele Fontanelli, Luca Greco, Luigi Palopoli