Scheduling in Multiclass Networks with Deterministic Service Times

Authors:
Rhonda Righter
Affiliations:
Department of Operations and Management Information Systems, Santa Clara University, Santa Clara, CA 95053, USA
Venue:
Queueing Systems: Theory and Applications
Year:
2002

Citing 2
Cited 2

Scheduling networks of queues: heavy traffic analysis of a simple open network

Queueing Systems: Theory and Applications
A tutorial on some new methods for performance evaluation of queueing networks

IEEE Journal on Selected Areas in Communications

Class-Dependent Assignment in cluster-based servers

Proceedings of the 2004 ACM symposium on Applied computing
Deferred Assignment Scheduling in Cluster-Based Servers

Cluster Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider general feed-forward networks of queues with deterministic service times and arbitrary arrival processes. There are holding costs at each queue, idling may or may not be permitted, and servers may fail. We partially characterize the optimal policy and give conditions under which lower priority should be given to jobs that would be delayed later in the network if they were processed now.