Optimal static load balancing in distributed computer systems
Journal of the ACM (JACM)
Analysis of polling systems
Some properties of polling systems
Queueing Systems: Theory and Applications
Adaptive load sharing in heterogeneous distributed systems
Journal of Parallel and Distributed Computing
Effective bandwidths for the multi-type UAS channel
Queueing Systems: Theory and Applications
Queueing Systems: Theory and Applications
IEEE/ACM Transactions on Networking (TON)
Effective bandwidths for multiclass Markov fluids and other ATM sources
IEEE/ACM Transactions on Networking (TON)
Upper and lower bounds for the multiplexing of multiclass Markovian on/off sources
Performance Evaluation
Modeling and analysis of stochastic systems
Modeling and analysis of stochastic systems
A Randomized Contention-Based Load-Balancing Protocol for a Distributed Multiserver Queuing System
IEEE Transactions on Parallel and Distributed Systems
ATM Network Performance
Applications of SMP Bounds to Multi-class Traffic in High-speed Networks
Queueing Systems: Theory and Applications
Two Symmmetric Queues with Alternating Service and Switching Times
Performance '84 Proceedings of the Tenth International Symposium on Computer Performance Modelling, Measurement and Evaluation
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2
First Passage Times in Fluid Models with an Application to Two Priority Fluid Systems
IPDS '96 Proceedings of the 2nd International Computer Performance and Dependability Symposium (IPDS '96)
BOUNDS FOR FLUID MODELS DRIVEN BY SEMI-MARKOV INPUTS
Probability in the Engineering and Informational Sciences
| Hi-index | 0.00 |
This paper is motivated by the problem of capturing and releasing the CPU by a routine software application in order to accommodate other non-routine requests that need the CPU. Specifically, we consider a network of distributed software agents where each agent is assigned with routine tasks that need to be processed by a CPU. The CPU also receives requests from other processes running on the machine. The problem is to select an optimal threshold on the workload of the agent so that the agent releases the CPU and recaptures it from time-to-time based on its workload.In order to do that, we use a stochastic fluid-flow model with two buffers, one for the agent that runs the routine tasks and the other for the remaining non-routine jobs at the CPU. Input to the two buffers are from on-off sources and the processor switches between the two buffers using a threshold-based policy. We develop analytical approximations for the buffer content distribution and determine the Quality of Service (QoS) experienced by the two sources of traffic. We use the QoS performance measures to formulate and solve an optimization problem to design an optimal threshold value.