This work focuses on the support of applications that must meet temporal QoS constraints. We propose an approach to automatically derive scheduling information from temporal QoS equations expressed at a high level. The application threads are partitioned into finer grain (or elementary) threads to which QoS constraints are applied. The elementary thread decomposition is used to guide the schedu...

We study a canonical real-time scheduling problem for time-slotted collocated wireless networks serving users with diverse real-time requirements and wireless loss patterns arising from fading. We study two traffic patterns: periodic arrivals with deadline equal to period, and renewal arrivals, in which a new packet from a user arrives when the current one leaves. Wireless channel conditions ar...

With the development of cloud computing, mobile device and industry automation, virtualization plays an important role today. The core of virtualization is hypervisor which directly determines the performance of platform. Therefore, how to allocate resource effectively becomes an important issue. Xen, one of widely used open source projects, is a virtual machine monitor. Simple EDF (Earliest De...

The increasing acceptance of the Earliest Deadline First (EDF) scheduling algorithm in industrial environments, together with the continued usage of Fixed Priority (FP) scheduling is leading to heterogeneous systems with different scheduling policies in the same distributed system. Schedulability analysis techniques usually consider the entire system as a whole (holistic approach), with only on...

To this paper we have study to Reduce the time Complexity of Earliest Deadline First (EDF), a global scheduling scheme for Earliest Deadline First in Real Time System tasks on a Multiprocessors system. Several admission control algorithms for earliest deadline first are presented, both for hard and soft real-time tasks. The average performance of these admission control algorithms is compared w...

Consider the problem of scheduling sporadically-arriving tasks with implicit deadlines using Earliest-Deadline-First (EDF) on a single processor. The system may undergo changes in its operational modes and therefore the characteristics of the task set may change at run-time. We consider a well-established previously published mode-change protocol by Sha et al. and we show that if every mode uti...

Time constraint is the main factor in real time operating system and it affects the deadline of the process. To achieve deadline, proper scheduling algorithm is required to schedule the task. In this paper an Adaptive scheduling algorithm is developed which is the combination of Earliest Deadline First (EDF) and Ant Colony Optimization (ACO). The EDF algorithm places the process in a priority q...

The real time data is stored in real time database. To maintain the temporal validity of real time data different real time scheduling algorithms are used. The valid data is further used for different operations in real time sensing and control system or in process control applications. The real time data values are stored in real time database at every instant of time. So previous data value b...

This paper presents a network with earliest deadline first (EDF) scheduling on a per slot basis. The network is called CCR-EDF (Control Channel based Ring network with EDF scheduling). The topology is a pipelined unidirectional fibre-ribbon ring that supports several simultaneous transmissions in non-overlapping segments and with dedicated fibres for clock and arbitration. In each slot the node...