We study the M/D/1 queue when jobs have firm deadlines for waiting (or sojourn) time. If a deadline is not met, a job-specific deadline violation cost is incurred. We derive explicit value functions for this M/D/1 queue that enable the development of efficient cost-aware dispatching policies to parallel servers. The performance of the resulting dispatching policies is evaluated by means of simulations.Peer reviewe
We consider job dispatching in systems with N parallel servers. In redundancy-d policies, replicas o...
The workload of many real-time systems can be characterized as a set of preemptable jobs with linear...
Deadline assignment is to assign each subtask composing a distributed task with a local deadline suc...
We study the M/D/1 queue when jobs have firm deadlines for waiting (or sojourn) time. If a deadline ...
AbstractWe consider a dispatching system, where jobs with deadlines for their waiting times are assi...
Consideration is given to the problem of efficient job allocation in the class of systems with paral...
We consider a heterogeneous two-server system processing fixed size jobs. This includes the scheduli...
We consider the task assignment problem to heterogeneous parallel servers with switching delay, wher...
Accepted for publication in Queueing Systems: Theory and Applications (QUESTA)Policy iteration techn...
Abstract. A model of two coupled single-server queues is analyzed in the steady state. Each new arri...
As a field, queueing theory predominantly assumes that the arrival rate of jobs and the system param...
We consider a cluster of heterogeneous servers, modeled as M/G/1 queues with different processing sp...
A key point in parallel systems design is the way clients requests are forwarded and distributed amo...
At present, solutions of many practical problems require significant computational resources and sys...
This paper considers the problem of server-side scheduling for jobs composed of multiple pieces with...
We consider job dispatching in systems with N parallel servers. In redundancy-d policies, replicas o...
The workload of many real-time systems can be characterized as a set of preemptable jobs with linear...
Deadline assignment is to assign each subtask composing a distributed task with a local deadline suc...
We study the M/D/1 queue when jobs have firm deadlines for waiting (or sojourn) time. If a deadline ...
AbstractWe consider a dispatching system, where jobs with deadlines for their waiting times are assi...
Consideration is given to the problem of efficient job allocation in the class of systems with paral...
We consider a heterogeneous two-server system processing fixed size jobs. This includes the scheduli...
We consider the task assignment problem to heterogeneous parallel servers with switching delay, wher...
Accepted for publication in Queueing Systems: Theory and Applications (QUESTA)Policy iteration techn...
Abstract. A model of two coupled single-server queues is analyzed in the steady state. Each new arri...
As a field, queueing theory predominantly assumes that the arrival rate of jobs and the system param...
We consider a cluster of heterogeneous servers, modeled as M/G/1 queues with different processing sp...
A key point in parallel systems design is the way clients requests are forwarded and distributed amo...
At present, solutions of many practical problems require significant computational resources and sys...
This paper considers the problem of server-side scheduling for jobs composed of multiple pieces with...
We consider job dispatching in systems with N parallel servers. In redundancy-d policies, replicas o...
The workload of many real-time systems can be characterized as a set of preemptable jobs with linear...
Deadline assignment is to assign each subtask composing a distributed task with a local deadline suc...