3,293 Hits in 6.1 sec

Limited Pre-emptive Global Fixed Task Priority

Jose Marinho, Vincent Nelis, Stefan M. Petters, Marko Bertogna, Robert I. Davis
2013 2013 IEEE 34th Real-Time Systems Symposium  
In this paper a limited pre-emptive global fixed task priority scheduling policy for multiprocessors is presented.  ...  This scheduling policy is a generalization of global fully pre-emptive and non-pre-emptive fixed task priority policies for platforms with at least two homogeneous processors.  ...  EXPERIMENTAL SECTION In this paper the theory for limited pre-emptive global fixed task priority scheduling is presented.  ... 
doi:10.1109/rtss.2013.26 dblp:conf/rtss/MarinhoNPBD13 fatcat:gplrt3wgurcunncgjhkxwbnvlq

Global fixed priority scheduling with deferred pre-emption

R.I. Davis, A. Burns, J. Marinho, V. Nelis, S.M. Petters, M. Bertogna
2013 2013 IEEE 19th International Conference on Embedded and Real-Time Computing Systems and Applications  
pre-emptive scheduling (gFPPS) and global fixed priority non-pre-emptive scheduling (gFPNS).  ...  This paper introduces schedulability analysis for global fixed priority scheduling with deferred pre-emption (gFPDS) for homogeneous multiprocessor systems. gFPDS is a superset of global fixed priority  ...  SUMMARY AND CONCLUSIONS Global fixed priority scheduling with deferred preemption (gFPDS), dominates both global fixed priority fully pre-emptive (gFPPS) and global fixed priority non-preemptive scheduling  ... 
doi:10.1109/rtcsa.2013.6732198 dblp:conf/rtcsa/DavisBMNPB13 fatcat:un6sewoij5fgrhqaene7cu3qpi

A review of priority assignment in real-time systems

Robert I. Davis, Liliana Cucu-Grosjean, Marko Bertogna, Alan Burns
2016 Journal of systems architecture  
It examines the role and importance of priority in fixed priority scheduling in all of its guises, including: preemptive and non-pre-emptive scheduling; covering single-and multi-processor systems, and  ...  It is over 40 years since the first seminal work on priority assignment for real-time systems using fixed priority scheduling.  ...  following result 5 for fixed priority pre-emptive scheduling.  ... 
doi:10.1016/j.sysarc.2016.04.002 fatcat:ziodjnqp7jby5pskfspogugd4u

On the compatibility of exact schedulability tests for global fixed priority pre-emptive scheduling with Audsley's optimal priority assignment algorithm

Robert I. Davis, Marko Bertogna, Vincenzo Bonifaci
2015 Real-time systems  
In this short paper, we prove that no exact test for global fixed priority pre-emptive scheduling of sporadic tasks can be compatible with Audsley's algorithm, and hence the OPA algorithm cannot be used  ...  to obtain an optimal priority assignment for such systems.  ...  (The predictability of global fixed priority pre-emptive scheduling (Ha and Liu, 1994) means that task C remains schedulable for execution times of task A less than 4).  ... 
doi:10.1007/s11241-015-9241-0 fatcat:4g76rsbrubcdncmfagzvpuaely

Comparative Study of Scheduling Algorithms for Real Time Environment

Ishan Khera, Ajay Kakkar
2012 International Journal of Computer Applications  
Scheduling is a technique which makes an arrangement of performing certain tasks at specified period.  ...  Real time scheduling algorithms are always pre-emptive which can perform better if the pre-emption is limited. c.  ...  This is also fully pre-emptive technique used for scheduling tasks with static priorities [3] .  ... 
doi:10.5120/6233-7797 fatcat:z6nergndrne5zfsok7x4wbgxae

Priority Assignment for Global Fixed Priority Pre-Emptive Scheduling in Multiprocessor Real-Time Systems

Robert I. Davis, Alan Burns
2009 2009 30th IEEE Real-Time Systems Symposium  
This paper addresses the problem of priority assignment in multiprocessor real-time systems using global fixed task-priority pre-emptive scheduling.  ...  Here we find that Deadline Monotonic priority assignment has relatively poor performance in the multiprocessor case, while DkC priority assignment is highly effective.  ...  In this paper, we focus on priority assignment policies for global fixed task-priority pre-emptive scheduling, which for brevity we refer to as global FP scheduling.  ... 
doi:10.1109/rtss.2009.31 dblp:conf/rtss/DavisB09 fatcat:mept4zmaubdjrgjwrmk4on26x4

Architecture of Task Manager for Real Time OS Explaining Real Time Operating Systems Issues

Javed Ahmad Shaheen
2016 International Journal of Grid and Distributed Computing  
 Timer interrupts in pre-emptive systems. Expands with clock frequency.  When task ends in non-pre-emptive systems.  ...   Timer interrupts in pre-emptive systems. Expands linearly with clock frequency.  When task ends in non-pre-emptive systems. Expands with amount of workload  ... 
doi:10.14257/ijgdc.2016.9.9.33 fatcat:vqa6rnctfrg25kbjxbfhoyj674

Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems

Robert I. Davis, Alan Burns
2010 Real-time systems  
The paper addresses the problem of priority assignment in multiprocessor real-time systems using global fixed task-priority pre-emptive scheduling.  ...  Here we find that Deadline Monotonic priority assignment has relatively poor performance in the multiprocessor case, while DkC priority assignment is highly effective.  ...  that results in the worstcase response time of a task under global fixed priority pre-emptive scheduling.  ... 
doi:10.1007/s11241-010-9106-5 fatcat:lkkemxvxwrey5cxs74ma5olmgu

Hierarchical Scheduling with Ada 2005 [chapter]

José A. Pulido, Santiago Urueña, Juan Zamorano, Tullio Vardanega, Juan A. de la Puente
2006 Lecture Notes in Computer Science  
An example of this approach is the FIRST architecture [6] , one variant of which uses fixed-priority pre-emptive scheduling (FPPS) at the global level, and different kinds of servers to execute the application  ...  The new standard keeps fixed priority pre-emptive scheduling (FPPS) as the basic scheduling mechanism, but it defines a set of new features that extend the Ada tasking model in some significant directions  ... 
doi:10.1007/11767077_1 fatcat:5wnlrvemonafrhp5wq54wxbqgi

A Self-organisation Model for Mobile Robots in Large Structure Assembly Using Multi-agent Systems [chapter]

Spartak Ljasenko, Niels Lohse, Laura Justham, Ivo Pereira, Michael Jackson
2017 Studies in Computational Intelligence  
The model is based on fixed-priority pre-emptive scheduling and uses a blackboard agent as a central information source and to facilitate more common goal directed distributed negotiation and decision  ...  Mobile, self-organising robots are seen to be a possible solution to overcome the current limitations of fixed, dedicated automation systems particularly in the area of large structure assembly.  ...  This is a common problem in fixed-priority pre-emptive scheduling where low priority tasks never get processed due to constantly arriving higher priority tasks.  ... 
doi:10.1007/978-3-319-51100-9_8 fatcat:4orl3eqrpzaizerhr62ecwqdtu

On the effectiveness of cache partitioning in hard real-time systems

Sebastian Altmeyer, Roeland Douma, Will Lunniss, Robert I. Davis
2016 Real-time systems  
We evaluate the performance of cache partitioning compared to state-of-the-art pre-emption cost analysis based on benchmark code and on a large number of synthetic tasksets with both fixed priority and  ...  Abstract In hard real-time systems, cache partitioning is often suggested as a means of increasing the predictability of caches in pre-emptively scheduled systems: when a task is assigned its own cache  ...  Fixed priority pre-emptive scheduling We now recapitulate the exact (sufficient and necessary) schedulability test for fixed priority pre-emptive scheduling of constrained-deadline tasksets based on response  ... 
doi:10.1007/s11241-015-9246-8 fatcat:j2byhbxhp5bwro2okxtcu7phnm

Deadline – Cost Based Job Scheduling Using Greedy Approach in a Multi-Layer Environment

S Selvi, R Maheswari, Dr.B Kalaavathi
2014 International Journal of Computer Trends and Technology  
The user's perspective of efficient scheduling may be based on parameters like task completion time or task execution cost etc.  ...  Scheduling in cloud is responsible for selection of best suitable resources for task execution, by considering some static and dynamic parameters and restrictions of tasks into consideration.  ...  If the newly arrived process has the higher priority than the currently running process, the pre-emptive priority scheduling algorithm pre-empts the currently running process and allocates CPU to the new  ... 
doi:10.14445/22312803/ijctt-v11p116 fatcat:2l6mxvmttzdrvhyz27eopef7t4

Ways for Implementing Highly-Predictable Embedded Systems Using Time-Triggered Co-Operative (TTC) Architectures [chapter]

Mouaaz Nahas, Ahmed M.
2012 Embedded Systems - Theory and Design Methodology  
Pre-emptive scheduling of Task A and Task B in the system shown in Fig. 2: Task B, here, is assigned a higher priority (Nahas, 2008) .  ...  One acknowledged advantage of using TTH scheduler is that it enables the designer to build a static, fixed-priority schedule made up of a collection of co-operative tasks and a single (short) pre-emptive  ... 
doi:10.5772/38051 fatcat:6ypb6rqtmrf3zmn4jr2f32fgfi

Internet Connected e-Healthcare System with Live Video Monitoring using LWIP Stack and SJF Priority Scheduling

2019 International journal of recent technology and engineering  
In Free RTOS used in programming, SJF based priority scheduling is chosen because of reduced average waiting and turnaround time of CPU on performing multiple tasks associated with the camera and other  ...  The internet connectivity part of program is built using LWIP TCP/IP stack in focus of limited microcontroller resource.  ...  Pre-emptive Scheduling For implementing pre-emption scheduling, the algorithm with support priority contains a list of every task at ready state.  ... 
doi:10.35940/ijrte.d5129.118419 fatcat:pfknbbxzzna6pa7dijwa47twga

Fixed priority scheduling with pre-emption thresholds and cache-related pre-emption delays: integrated analysis and evaluation

Reinder J. Bril, Sebastian Altmeyer, Martijn M. H. P. van den Heuvel, Robert I. Davis, Moris Behnam
2017 Real-time systems  
Keywords Fixed-priority pre-emptive scheduling · Fixed-priority scheduling with pre-emption thresholds · Cache-related pre-emption delay · Response-time analysis B Reinder J. Bril  ...  Because cache-related pre-emption delays (CRPD) can have a significant influence on the computation times of tasks, CRPD have been integrated in the response time analysis for fixed-priority pre-emptive  ...  Limited pre-emptive scheduling Limited pre-emptive scheduling schemes received a lot of attention from academia in the last decade.  ... 
doi:10.1007/s11241-016-9266-z fatcat:jw5mwmrfmrcklmrf725lkt7kaq
« Previous Showing results 1 — 15 out of 3,293 results