Results 61 to 70 of about 578,780 (185)
IEEE Access, 2020 Time-Critical systems are both complex and critical. Therefore, thorough verification processes of such systems must be performed, including behavior and timing correctness.
Imene Ben Hafaiedh, Maroua Ben Slimane
doaj +1 more source
Queue lengths and waiting times in the two-class two-server queue with nonpreemptive heterogeneous priority structures. [PDF]
Our aim is to analyze a multiserver queue with nonpreemptive heterogeneous priority structures, which arises in the performance evaluation of batch initiator settings n MVS.
Leemans, Herlinde, Dedene, Guido
core
Simulation Studies of a Multi-priority Dual Queue (MPDQ) with Preemptive and Non-preemptive Scheduling [PDF]
, 2003 Traffic management in communication environments like the Internet is vital in meeting the demand of users. The recent introduction of various dynamic scheduling algorithms has been to target improvements in QoS (Quality of Service). These new algorithms, such as dual queueing, aim to give better QoS to most traffic at the expense of a few rather than ...
Anthony Bedford, Panlop Zeephongsekul
openaire +2 more sources
Discrete-time GeoX/G/1 que with non-preemptive priority [PDF]
, 2003 This paper considers a discrete-time two-class queueing system with non-preemptive priority. Service times of messages of each priority class are i.i.d. according to a general discrete distribution function that may differ between two classes.
Lee, Yutae, Kim, Young Hwa, Huh, Jae Doo
core +1 more source
A PREEMPTIVE PRIORITY QUEUE AS A MODEL WITH SERVER VACATIONS
Journal of the Operations Research Society of Japan, 1996 Summary: We derive the performance measures for non-priority customers in a priority single-server queue with two types of Markovian arrival processes (MAPs). One type of customers has preemptive resume (or repeat) priority over the other. We regard the model with two types of MAP arrivals as an MAP/SM/1 queue with only non-priority customers arrivals,
openaire +3 more sources
Resource sharing in global fixed-priority preemptive multiprocessor scheduling
, 2009 In this paper we consider global fixed-priority preemptive multiprocessor scheduling of constrained-deadline sporadic tasks that share resources in a non-nested manner.
Arvind Easwaran +3 more
core +1 more source
Analysis of an MMAP/PH1, PH2/N/∞ queueing system operating in a random environment
International Journal of Applied Mathematics and Computer Science, 2014 A multi-server queueing system with two types of customers and an infinite buffer operating in a random environment as a model of a contact center is investigated. The arrival flow of customers is described by a marked Markovian arrival process.
Kim Chesoong +3 more
doaj +1 more source
Resource Sharing in Global Fixed-Priority Preemptive Multiprocessor Scheduling
, 2010 In this paper we consider global fixed-priority preemptive multiprocessor scheduling of constrained-deadline sporadic tasks that share resources in a non-nested manner.
Easwaran, Arvind, Andersson, Björn
core +1 more source
Study on Multi-Priority and Multi-Path QoS Routing Protocol for Airborne Heterogeneous Networks
Xibei Gongye Daxue Xuebao, 2019 In order to guarantee the QoS requirements of multiple services in airborne all-domain heterogeneous and flexible networks, we propose a novel multi-priority and multi-path based QoS routing (MP2R) protocol in this paper. In the protocol, in terms of the
doaj +1 more source
Priority-Aware Preemptive Scheduling for Mixed-Priority Workloads in MoE Inference
Proceedings of the 5th Workshop on Machine Learning and SystemsLarge Language Models have revolutionized natural language processing, yet serving them efficiently in data centers remains challenging due to mixed workloads comprising latency-sensitive (LS) and best-effort (BE) jobs. Existing inference systems employ iteration-level first-come-first-served scheduling, causing head-of-line blocking when BE jobs delay
Mohammad Siavashi +3 more
openaire +3 more sources