109 search results - page 17 / 22 » On queues with service and interarrival times depending on w... |
EURONGI
2006
Springer
13 years 11 months ago
2006
Springer
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...
ETT
2002
13 years 7 months ago
2002
In computer networks, the Strict Priority (SP) discipline is perhaps the most common and simplest method to schedule packets from different classes of applications, each with diver...
HPDC
2006
IEEE
14 years 1 months ago
2006
IEEE
Most parallel computing resources are controlled by batch schedulers that place requests for computation in a queue until access to compute nodes is granted. Queue waiting times a...
WOSP
2000
ACM
13 years 12 months ago
2000
ACM
We present an analytic technique for modeling load balancing policies on a cluster of servers conditioned on the fact that the service times of arriving tasks are drawn from heavy...
DEBS
2008
ACM
13 years 9 months ago
2008
ACM
Existing content-based publish/subscribe systems are designed assuming that all matching publications are equally relevant to a subscription. As we cannot know in advance the dist...