A Foreground-Background queueing model with speed or capacity modulation

12/02/2021
by   Andrea Marin, et al.
0

The models studied in the steady state involve two queues which are served either by a single server whose speed depends on the number of jobs present, or by several parallel servers whose number may be controlled dynamically. Job service times have a two-phase Coxian distribution and the second phase is given lower priority than the first. The trade-offs between holding costs and energy consumption costs are examined by means of a suitable cost functions. Two different two-dimensional Markov process are solved exactly. The solutions are used in several numerical experiments. Some counter-intuitive results are observed.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/19/2021

Speed Scaling On Parallel Servers with MapReduce Type Precedence Constraints

A multiple server setting is considered, where each server has tunable s...
research
12/16/2016

A Generalized Performance Evaluation Framework for Parallel Systems with Output Synchronization

Frameworks, such as MapReduce and Hadoop are abundant nowadays. They see...
research
05/01/2022

Scheduling for Multi-Phase Parallelizable Jobs

With multiple identical unit speed servers, the online problem of schedu...
research
07/10/2019

Speed Scaling with Tandem Servers

Speed scaling for a tandem server setting is considered, where there is ...
research
07/21/2019

Multiple Server SRPT with speed scaling is competitive

Can the popular shortest remaining processing time (SRPT) algorithm achi...
research
06/10/2020

Product Forms for FCFS Queueing Models with Arbitrary Server-Job Compatibilities: An Overview

In recent years a number of models involving different compatibilities b...
research
08/18/2021

Modeling Performance and Energy trade-offs in Online Data-Intensive Applications

We consider energy minimization for data-intensive applications run on l...

Please sign up or login with your details

Forgot password? Click here to reset