Results 21 to 30 of about 3,968 (305)
Improved Multiprocessor Global Schedulability Analysis [PDF]
, 2010 A new technique was recently introduced by Bonifaci et al. for the analysis of real-time systems scheduled on multiprocessor platforms by the global Earliest Deadline First (EDF) scheduling algorithm.
Bonifaci, V. +12 more
core +2 more sources
To schedule or not to schedule: When no-scheduling can beat the best-known flow scheduling algorithm in datacenter networks [PDF]
Computer Networks, 2020 Conventional wisdom for minimizing the average flow completion time (AFCT) in the datacenter network (DCN), where flow sizes are highly variable, would suggest scheduling every individual flow. However, we show that considering scheduling delay (including scheduler's computational and communication delays), serving most of the flows without any ...
Soheil Abbasloo +2 more
openaire +2 more sources
Journal of Algorithms, 1998 Summary: On-line machine scheduling has been studied extensively, but the fundamental issue of fairness in scheduling is still mostly open. In this paper, we explore the issue in settings where there are long-lived processes which should be repeatedly scheduled for various tasks throughout the lifetime of a system.
Miklós Ajtai +5 more
openaire +3 more sources
Research on schedulability analysis algorithm of airborne multi partition system
Xibei Gongye Daxue Xuebao, 2023 Partition operating system conforming to ARINC653 is widely used in airborne to support application software integration. Under the two-level scheduling model for partition operating system, the demanding real-time requirements of airborne software are ...
ZHANG Min +3 more
doaj +1 more source
Increasing Speed Scheduling and Flow Scheduling [PDF]
, 2010 Network flows and scheduling have been studied intensely, but separately. In many applications a joint optimization model for routing and scheduling is desireable. Therefore, we study flows over time with a demand split into jobs. The objective is to minimize the weighted sum of completion times of these jobs.
Sebastian Stiller, Andreas Wiese
openaire +1 more source
Dynamic and Static Task Allocation for Hard Real-Time Video Stream Decoding on NoCs [PDF]
Leibniz Transactions on Embedded Systems, 2017 Hard real-time (HRT) video systems require admission control decisions that rely on two factors. Firstly, schedulability analysis of the data-dependent, communicating tasks within the application need to be carried out in order to guarantee timing and ...
Mendis, Hashan R. +2 more
doaj +1 more source
, 2021 Interactions amongst different processes in concurrent software are governed by a protocol. The blocking I/O operations involved in a protocol may temporarily suspend the execution of some processes in an application. Scheduling consists of the allocation of available processors to the appropriate non-suspended processes in an application, such that ...
K.P.C. Dokter (Kasper) +1 more
openaire +2 more sources
Schedulability Comparisons between Priority Queue and FIFO Queue for CAN Messages with Offsets
International Journal of Automotive Engineering, 2013 The Controller Area Network (CAN) is a widely used in-vehicle network and its schedulability is particularly important. In a CAN system, implementing the priority queues is better than FIFO queues with respect to the schedulability, which is widely ...
Chen Yang +3 more
doaj +1 more source
Schedulability Analysis of Mission Critical System Under Timing Constraint [PDF]
Jisuanji gongcheng, 2018 Aiming at the inadequate of workflow schedulability and correction strategy under timing constraint,a schedulability analysis method of Mission Critical System(MCS) based on Timing Constraint Colored Petri Net(TCCP-Net) is proposed.It is divided into ...
CHEN Ying,XING Jianchun,YANG Qiliang,ZHANG Xiaopeng
doaj +1 more source
Utilization Bound Scheduling Analysis for Nonpreemptive Uniprocessor Architecture Using UML-RT
Modelling and Simulation in Engineering, 2014 The key for adopting the utilization-based schedulability test is to derive the utilization bound. Given the computation times, this paper proposes two utilization bound algorithms to derive interrelease times for nonpreemptive periodic tasks, using a ...
S. Ewins Pon Pushpa +1 more
doaj +1 more source