Results 11 to 20 of about 16,132 (297)
Violation Probability in Processor-Sharing Queues [PDF]
IEEE Transactions on Automatic Control, 2008 Processor-sharing queues are often used to model file transmission in networks. While sojourn time is a common performance metric in the queueing literature, average transmission rate is the more commonly discussed metric in the networking literature.
Na Chen 0001, Scott Jordan 0001
openaire +5 more sources
Shared processor scheduling of multiprocessor jobs [PDF]
European Journal of Operational Research, 2020 We study shared processor scheduling of $\textit{multiprocessor}$ weighted jobs where each job can be executed on its private processor and simultaneously on possibly $\textit{many}$ processors shared by all jobs in order to reduce their completion times due to processing time overlap.
Dariusz Dereniowski, Wieslaw Kubiak
openaire +3 more sources
IET Power Electronics, 2021 Inverters‐based islanded microgrids are operated by local digital signal processors, driven by their own local clocks. These local clocks have drifts affecting the clock signals which are used to control the inverters in real time.
Carlos Alfaro +4 more
doaj +1 more source
Aeolus L2 Activities at KNMI [PDF]
EPJ Web of Conferences, 2020 KNMI has had a long involvement with the recently launched Aeolus mission. Aeolus is an ESA Earth-Explorer mission and embarks the Atmospheric Laser Doppler Instrument (ALADIN).
Donovan D. P. +3 more
doaj +1 more source
Shared multi-processor scheduling [PDF]
European Journal of Operational Research, 2017 We study shared multi-processor scheduling problem where each job can be executed on its private processor and simultaneously on one of many processors shared by all jobs in order to reduce the job's completion time due to processing time overlap. The total weighted overlap of all jobs is to be maximized. The problem models subcontracting scheduling in
Dariusz Dereniowski, Wieslaw Kubiak
openaire +2 more sources
On the age of information of processor sharing systems
Journal of Communications and Networks, 2023 In this paper, we examine the Age of Information (AoI) of a source sending status updates to a monitor through a queue operating under the Processor Sharing (PS) discipline. In the PS queueing discipline, all the updates are served simultaneously and, therefore, none of of the jobs wait in the queue to get service.
Beñat Gandarias +2 more
openaire +2 more sources
Non-contiguous processor allocation strategy for 2D mesh connected multicomputers based on sub-meshes available for allocation [PDF]
, 2006 Contiguous allocation of parallel jobs usually suffers from the degrading effects of fragmentation as it requires that the allocated processors be contiguous and has the same topology as the network topology connecting these processors. In non-contiguous
Ould-Khaoua, M. +7 more
core +1 more source
Asymptotic behavior of a critical fluid model for a processor sharing queue via relative entropy
Stochastic Systems, 2016 In this paper, we develop a new approach to studying the asymptotic behavior of fluid model solutions for critically loaded processor sharing queues. For this, we introduce a notion of relative entropy associated with measure-valued fluid model solutions.
Amber L. Puha, Ruth J. Williams
doaj +1 more source
Analysis of queueing model with processor sharing discipline and customers impatience
Operations Research Perspectives, 2018 Queueing systems with processor sharing represent the adequate models for sharing the resources, e.g., components of a computer or a bandwidth of communication systems.
A.N. Dudin +3 more
doaj +1 more source
Higher response time moments for M/M/1 discriminatory processor sharing queues
EAI Endorsed Transactions on Scalable Information Systems, 2016 Obtaining response time moments in processor sharing (PS) queues is difficult due to serving of multiple jobs. Egalitarian PS (EPS) queues are limited to one class of arriving jobs.
Tiberiu Chis, Peter Harrison
doaj +1 more source