Results 31 to 40 of about 578,780 (185)

A preemptive repeat priority queue with resampling: Performance analysis [PDF]

open access: yesAnnals of Operations Research, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Joris Walraevens   +2 more
openaire   +4 more sources

An LP-Based Algorithm for Scheduling Preemptive and/or Non-Preemptive Real-Time Tasks

open access: yesJournal of Advanced Mechanical Design, Systems, and Manufacturing, 2010
We consider a real-time system that requires the time stimuli to the system are processed through sequences of tasks to be within specified upper bounds, where the set of tasks can be the mixture of preemptive and non-preemptive tasks, and we propose an ...
Hideki HASHIMOTO, Mutsunori YAGIURA
doaj   +1 more source

Analysis of Multi-Server Priority Queueing System with Hysteresis Strategy of Server Reservation and Retrials

open access: yesMathematics, 2022
A multi-server queueing system with two types of requests and preemptive priority of one type is considered as a model of a cell of a cognitive radio system under practical suggestions about the arrival flows.
Alexander Dudin   +3 more
doaj   +1 more source

On a generalization of the preemptive resume priority [PDF]

open access: yesAdvances in Applied Probability, 1986
This paper considers a queueing system with two classes of customers and a single server, where the service policy is of threshold type. As soon as the amount of work required by the class 1 customers is greater than a fixed threshold, the class 1 customers get the server's attention; otherwise the class 2 customers have the priority.
openaire   +2 more sources

Social welfare and price of anarchy in preemptive priority queues

open access: yesOperations Research Letters, 2020
Consider an unobservable $M|G|1$ queue with preemptive-resume scheduling and two priority classes. Customers are strategic and may join the premium class for a fee. We analyze the resulting equilibrium outcomes, equilibrium stability, and social welfare. We find that for service distributions with coefficient of variation greater than 1, there exists a
Jonathan Chamberlain, David Starobinski
openaire   +3 more sources

Tail Quantile Estimation for Non-Preemptive Priority Queues

open access: yes2022 Winter Simulation Conference (WSC), 2022
Motivated by applications in computing and telecommunication systems, we investigate the problem of estimating p-quantile of steady-state sojourn times in a single-server multi-class queueing system with non-preemptive priorities for p close to 1. The main challenge in this problem lies in efficient sampling from the tail event.
Jin Guang   +6 more
openaire   +3 more sources

Spectrum Handoffs Based on Preemptive Repeat Priority Queue in Cognitive Radio Networks

open access: yesSensors, 2016
Cognitive radio can significantly improve the spectrum efficiency, and spectrum handoff is considered as an important functionality to guarantee the quality of service (QoS) of primary users (PUs) and the continuity of data transmission of secondary ...
Xiaolong Yang   +3 more
doaj   +1 more source

Analysis of Write-back Caches under Fixed-priority Preemptive and Non-preemptive Scheduling [PDF]

open access: yesProceedings of the 24th International Conference on Real-Time Networks and Systems, 2016
This paper introduces analyses of write-back caches integrated into response-time analysis for fixed-priority preemptive and non-preemptive scheduling. For each scheduling paradigm, we derive four different approaches to computing the additional costs incurred due to write backs.
Davis, Robert I.   +2 more
openaire   +3 more sources

Uma Abordagem de escalonamento heterogêneo preemptivo e não preemptivo para sistemas de tempo real com garantia em multiprocessadores [PDF]

open access: yes, 2012
Dissertação (mestrado) - Universidade Federal de Santa Catarina, Centro Tecnológico. Programa de Pós-Graduação em Engenharia de Automação e SistemasSistemas de tempo real são sistemas onde o correto funcionamento não depende somente da resposta lógica ...
Starke, Renan Augusto
core  

Approximation Results for Preemptive Stochastic Online Scheduling [PDF]

open access: yes
We present first constant performance guarantees for preemptive stochastic scheduling to minimize the sum of weighted completion times. For scheduling jobs with release dates on identical parallel machines we derive policies with a guaranteed performance
Megow, Nicole, Vredeveld, Tjark
core   +2 more sources

Home - About - Disclaimer - Privacy