Scheduling in computer science means determining which tasks run when there are multiple runnable tasks. Several CPU scheduling algorithms have different features, and no single one is ideal absolutely for every application. This paper presents an attempt to apply fuzzy logic in the design and implementation of a rule-based scheduling algorithm to solve the shortcoming of well-known scheduling ...

Tasks of an application program of an embedded system are managed by the scheduler of a real-time operating system (RTOS). Most RTOSs adopt just fixed priority scheduling, which is not optimal in all cases. Some applications require earliest deadline first (EDF) scheduling, which is an optimal scheduling algorithm. In order to develop an efficient real-time embedded system, the scheduling algor...

In this paper we will analyze the performance of job scheduler based on many parameters considering the criticality of job. Many job scheduling algorithms have been devised which affect the performance of the system in their own way. Improvement in job scheduling strategies will play a pivotal role in increasing the overall performance of the system. In this work we discuss some basic job sched...

Ethernet-AVB/TSN (Audio Video Bridging/Time-Sensitive Networking) and AFDX (Avionics Full DupleX switched Ethernet) are switched Ethernet technologies, which are both candidates for real-time communication in the context of transportation systems. AFDX implements a fixed priority scheduling strategy with two priority levels. Ethernet-AVB/TSN supports a similar fixed priority scheduling with an ...

This paper addresses the problem of scheduling periodic messages in demand priority network standardized by IEEE 802.12 Committee. As regards the real-time property of the demand priority network, unnecessary blocking time due to its round-robin-based MAC protocol may cause periodic messages to miss their hard deadlines and result in low schedulability of periodic messages. We propose a new mes...

OOine (cyclic executive) and online preemptive, priority-based scheduling are not exclusive options but rather complementary techniques that can be combined to improve analytically veriiable schedulability. Selective ooine scheduling of periodic tasks improves online schedula-bility based on rate-monotonic priority assignment. Relative to pure ooine scheduling, a hybrid approach has the advanta...

Assured Service has been proposed within the Differentiated Services (DiffServ) model to provide relative service differentiation by attempting to allocate bandwidth to different users in a controlled way during periods of network congestion. In this paper, we analyze the Assured Service scheme by means of a priority queueing system with statedependent service scheduling based on thresholds. We...

The use of deadline based channel scheduling in support of real time delivery of application data units (ADU’s) is investigated. Of interest is priority scheduling where a packet with a smaller ratio of delivery deadline over number of hops to destination is given a higher priority. It has been shown that a variant of this scheduling algorithm, based on head-of-the-line priority, is efficient a...

Traditionally, real-time scheduling algorithms prioritize tasks solely based on their timing parameters and cannot effectively handle tasks that have different execution preferences . In this paper, for a set of periodic real-time tasks running on a single processor, where some tasks are preferably executed as soon as possible (ASAP) and others as late as possible (ALAP) , we investigate Prefer...

This paper considers the problem of fixed priority scheduling of periodic tasks where each task’s execution priority may vary. Periodic tasks are decomposed into serially executed subtasks. where each subtask is characterized by an execution time and a fixed priority, and is permitted to have a deadline. A method for determining the schedulability of each task is presented along with its theore...