Filters








829 Hits in 12.2 sec

Predictability of Fixed-Job Priority Schedulers on Heterogeneous Multiprocessor Real-Time Systems [article]

Liliana Cucu-Grosjean, Joël Goossens
2009 arXiv   pre-print
The multiprocessor Fixed-Job Priority (FJP) scheduling of real-time systems is studied.  ...  An important property for the schedulability analysis, the predictability (regardless to the execution times), is studied for heterogeneous multiprocessor platforms.  ...  Fixed-Job Priority (FJP) schedulers assign priorities to jobs statically and execute the highest-priority jobs on the available processors.  ... 
arXiv:0908.3519v1 fatcat:qwgz6oeg2jcrvpcnwmzcwpnn6q

Exact schedulability tests for real-time scheduling of periodic tasks on unrelated multiprocessor platforms

Liliana Cucu-Grosjean, Joël Goossens
2011 Journal of systems architecture  
In this paper, we study the global scheduling of periodic task systems on unrelated multiprocessor platforms.  ...  For task-level fixed-priority schedulers, based on the upper bounds and the predictability property, we provide exact schedulability tests for asynchronous constrained or arbitrary deadline periodic task  ...  task systems on heterogeneous multiprocessor platforms.  ... 
doi:10.1016/j.sysarc.2011.02.007 fatcat:6ut7ybzvefaibltumkpgrbvyau

A Survey on Scheduling Approaches for Hard Real-Time Systems

Mehrin Rouhifar, Reza Ravanmehr
2015 International Journal of Computer Applications  
In this paper, main scheduling algorithms for hard real-time systems (RTSs) have been investigated that include both uni and multi processors schemes.  ...  Second part contains the different heuristic and partitioned approaches for some specific factors of real-time systems such as energy consumption, dependability, performance, scheduling feasibility and  ...  -Fixed Job Priority: A task jobs have the different priorities, whereas each job has a fixed priority. -Dynamic Priority: each job may have the various priorities at different times.  ... 
doi:10.5120/ijca2015907656 fatcat:na7u3dgqsjhphl253ecd22jkau

Exact Feasibility Tests for Real-Time Scheduling of Periodic Tasks upon Multiprocessor Platforms [article]

Liliana Cucu, Joël Goossens
2008 arXiv   pre-print
We show that job-level fixed-priority schedulers are predictable upon unrelated multiprocessor platforms.  ...  In this paper we study the global scheduling of periodic task systems upon multiprocessor platforms.  ...  Then we prove that job-level fixed-priority schedulers (e.g., EDF and RM) are predictable upon unrelated multiprocessor platforms.  ... 
arXiv:0801.4292v1 fatcat:usqzn7yhjngftdt53r4iywv3i4

Supporting Soft Real-Time Sporadic Task Systems on Heterogeneous Multiprocessors with No Utilization Loss [article]

Guangmo Tong, Cong Liu
2014 arXiv   pre-print
To the best of our knowledge, this paper is the first to show that soft real-time sporadic task systems can be supported on heterogeneous multiprocessors without utilization loss, and with reasonable predicted  ...  Prior research on heterogeneous multiprocessor real-time scheduling has focused on hard real-time systems, where, significant processing capacity may have to be sacrificed in the worst-case to ensure that  ...  Introduction such heterogeneous multiprocessors has focused on hard real-time (HRT) systems.  ... 
arXiv:1405.7322v1 fatcat:25xthcwayjgbvi2ciesavaiciy

Feasibility Intervals for Multiprocessor Fixed-Priority Scheduling of Arbitrary Deadline Periodic Systems

Liliana Cucu, Joel Goossens
2007 2007 Design, Automation & Test in Europe Conference & Exhibition  
We then present our main result: any feasible schedule of asynchronous periodic task sets using a fixed-priority scheduler is periodic from a specific point.  ...  In this paper we study the global scheduling of periodic task systems with arbitrary deadlines upon identical multiprocessor platforms.  ...  concept of scheduling is integral to real-time system design and analysis.  ... 
doi:10.1109/date.2007.364536 fatcat:qbnwgapg4fhhxnawl5pzo7ejji

A WEAKLY HARD SCHEDULING APPROACH OF PARTITIONED SCHEDULING ON MULTIPROCESSOR SYSTEMS

Habibah Ismail, Dayang N. A. Jawawi
2015 Jurnal Teknologi  
Real-time systems or tasks can be classified into three categories, based on the "seriousness" of deadline misses – hard, soft and weakly hard real-time tasks.  ...  As real-time application systems increasingly come to be implemented upon multiprocessor environments, thus, this study applies multiprocessor scheduling approach for verification of weakly hard real-time  ...  Acknowledgement The authors would like to thank profoundly to the Zamalah Scholarship from UTM, the Research Grant University (RUG) Vote No. 05H75, Ministry of Science, Technology and Innovation Malaysia  ... 
doi:10.11113/jt.v77.6204 fatcat:2enfmudg7rewnje3ttsqhjip6a

Genealogy of hard real-time preemptive scheduling algorithms for identical multiprocessors

Dirk Müller, Matthias Werner
2011 Open Computer Science  
AbstractWith the advent of multi-core computer systems, real-time (RT) scheduling on multiprocessors (MPs) is gaining more and more practical relevance.  ...  Basic algorithms developed in the 1970s or earlier are strongly influential on state-of-the-art preemptive hard real-time scheduling algorithms.  ...  Acknowledgments The authors would like to thank Ted Baker for useful comments on a preliminary version of this article.  ... 
doi:10.2478/s13537-011-0023-z fatcat:zbzshcwvivd2pe7xm23o54ux2q

Supporting Soft Real-Time Sporadic Task Systems on Uniform Heterogeneous Multiprocessors with No Utilization Loss

Guangmo Tong, Cong Liu
2016 IEEE Transactions on Parallel and Distributed Systems  
Prior research on uniform heterogeneous multiprocessor real-time scheduling has focused on hard real-time systems, where, significant processing capacity may have to be sacrificed in the worst-case to  ...  To the best of our knowledge, this paper is the first to show that soft real-time sporadic task systems can be supported on uniform heterogeneous multiprocessors without utilization loss under global scheduling  ...  ACKNOWLEDGMENT This work was supported by a start-up grant from the University of Texas at Dallas.  ... 
doi:10.1109/tpds.2015.2503278 fatcat:bzo6dzv4arhinerrzuswsbeiyu

Comparative Study of Scheduling Algorithms for Real Time Environment

Ishan Khera, Ajay Kakkar
2012 International Journal of Computer Applications  
The real time computing systems are those in which there are strict timing constraints that have to be met to get the correct output i.e. the output not only depend on the correctness of the outcome but  ...  Real time systems are expected to change its state in real time even after the controlling processor has stopped its execution.  ...  time of sporadic task systems which are fixed priority scheduled on a preemptive uniprocessor.  ... 
doi:10.5120/6233-7797 fatcat:z6nergndrne5zfsok7x4wbgxae

Machine Learning support Energy Aware Efficient Multiprocessors Mapping of Real Time tasks

Shahira M. Habashy
2019 Zenodo  
This paper immediate a unique model which achieve maximum CPU throughput scheduling while using machine learning to predict the performance of all the available CPU at the scheduling quantum granularity  ...  We show how lightweight ANNs can equip highly true performance predictions for a different set of applications thereby aiding to improve scheduling effectiveness.  ...  Introduction As multiprocessors become more common, they are used in a wider kind of applications, contain real-time and embedded systems.  ... 
doi:10.5281/zenodo.3252967 fatcat:vvopcz6rtrfifga6fvhogr4ivq

Dynamic Task Scheduling Methods in Heterogeneous Systems: A Survey

D. I.GeorgeAmalarethinam, A. Maria Josphin
2015 International Journal of Computer Applications  
Previous studies reveal that many researchers have designed efficient scheduling algorithms with different parameters on multiprocessor systems.  ...  This paper investigates different aspects in scheduling and issues in various levels of the heterogeneous systems.  ...  heterogeneous multiprocessor system focused on a single purpose such as execution time, cost or total data transmission time.  ... 
doi:10.5120/19318-0859 fatcat:qxnjvseeajcyfiyzdq4xxtonw4

Fixed-Priority Memory-Centric Scheduler for COTS-Based Multiprocessors

Gero Schwäricke, Tomasz Kloda, Giovani Gracioli, Marko Bertogna, Marco Caccamo, Marcus Völp
2020 Euromicro Conference on Real-Time Systems  
Memory-centric scheduling attempts to guarantee temporal predictability on commercial-off-the-shelf (COTS) multiprocessor systems to exploit their high performance for real-time applications.  ...  Our approach uses fixed-priority scheduling and proposes a global "memory preemption" scheme to boost real-time schedulability.  ...  systems that do not feature hardware support for predictable memory management, implementation of the memory-centric scheduler within a hypervisor and a real-time operating system kernel that are based  ... 
doi:10.4230/lipics.ecrts.2020.1 dblp:conf/ecrts/SchwarickeKGBC20 fatcat:6aulrulamjbcvir2sh2ezimrie

Multiprocessor Real-Time Locking Protocols: A Systematic Review [article]

Björn B. Brandenburg
2019 arXiv   pre-print
We systematically survey the literature on analytically sound multiprocessor real-time locking protocols from 1988 until 2018, covering the following topics: progress mechanisms that prevent the lock-holder  ...  A special focus is placed on the suspension-oblivious and suspension-aware analysis approaches for semaphore protocols, their respective notions of priority inversion, optimality criteria, lower bounds  ...  Conclusion, Further Directions, and Open Issues Predictable synchronization is one of the central needs in a multiprocessor real-time system, and it is thus not surprising that multiprocessor real-time  ... 
arXiv:1909.09600v1 fatcat:tmqcpiuxfbbd5jrcecgvoeanpm

Coordinating Parallel Processes on Networks of Workstations

Xing Du, Xiaodong Zhang
1997 Journal of Parallel and Distributed Computing  
We discuss its implementation on Unix System V Release 4 (SVR4). Our simulation results on a heterogeneous NOW show the effectiveness of the self-coordinated local scheduling scheme.  ...  An effective NOW scheduling scheme needs sufficient information about system heterogeneity and job interactions.  ...  We appreciate Andrea Dusseau at University of California, Berkeley, and Evangelos Makatos at FORTH in Greece for reading an early version of this paper and for their constructive suggestions.  ... 
doi:10.1006/jpdc.1997.1378 fatcat:ts6zfa2os5hsllbcjdqaopwo44
« Previous Showing results 1 — 15 out of 829 results