Filters








4,464 Hits in 5.9 sec

Analysis of a simple model for non-preemptive blocking-free scheduling

Luis Almeida, Jose Fonseca
2001 13th Euromicro Conference on Real-Time Systems  
In a following part, the paper presents a general theorem that allows to adapt the existing analysis for preemptive scheduling to the referred model.  ...  This paper refers to a simple execution strategy based on synchronised time-triggering and non-preemptive scheduling that allows to eliminate the blocking factor commonly associated to non-preemption and  ...  On the other hand, Vasques [4] suggests the use of an adequate blocking term in usual preemptive RM analysis to account for the effects of non-preemption.  ... 
doi:10.1109/emrts.2001.6159577 fatcat:cweljh4wsndexa5mxl6nbsltgm

Enhancement in System Schedulability by Controlling Task Releases

Basharat Mahmood, Naveed Ahmad, Saif ur, Adeel Anjum
2016 International Journal of Advanced Computer Science and Applications  
It is proved that the proposed technique dominates pure preemptive scheduling.  ...  The proposed technique favors the lower priority tasks by blocking the release of higher priority tasks without hurting their deadlines.  ...  Under fixed pre-emption point model, the non-preemptive regions are predefined while in floating preemption point model the location of non-preemptive regions are un-known.  ... 
doi:10.14569/ijacsa.2016.070760 fatcat:qutijqrcb5dpfmgh4hewj42znu

Preemption delay analysis for floating non-preemptive region scheduling

J. M. Marinho, V. Nelis, S. M. Petters, I. Puaut
2012 2012 Design, Automation & Test in Europe Conference & Exhibition (DATE)  
In real-time systems, there are two distinct trends for scheduling task sets on unicore systems: non-preemptive and preemptive scheduling.  ...  Abstract-In real-time systems, there are two distinct trends for scheduling task sets on unicore systems: non-preemptive and preemptive scheduling.  ...  scheduling, a hybrid solution between non-and fully-preemptive scheduling.  ... 
doi:10.1109/date.2012.6176520 dblp:conf/date/MarinhoNPP12 fatcat:6n7j4ltc6zgovllk2lbe4r52ui

Analysis of OSEK/VDX Based Automotive Applications

Libor Waszniowski, Zdenek Hanzalek
2004 IFAC Proceedings Volumes  
For such system, model checking theory based on timed automata and implemented in model checking tools can be used for verifying complex time and logical properties of proposed model.  ...  The automated transmission system and its control software running under OSEK compliant operating system are modelled and properties necessary for its proper function are verified by model checker UPPAAL  ...  ACKNOWLEDGEMENT This work was supported by the Ministry of Education of the Czech Republic under Project LN00B096.  ... 
doi:10.1016/s1474-6670(17)30344-0 fatcat:gssvyxcwizaqjlmgzk5znbouxm

Parametric Schedulability Analysis of Fixed Priority Real-Time Distributed Systems [chapter]

Youcheng Sun, Romain Soulat, Giuseppe Lipari, Étienne André, Laurent Fribourg
2014 Communications in Computer and Information Science  
to model a larger class of constraints, and perform parametric analysis on many different variables, for example task offsets.  ...  We also present a model of a distributed real-time systems using PSA, and compare the two approaches against classical analysis in Mast.  ...  Rivas, from the Universidad de Cantabria, for their support to installing and using the Mast tool.  ... 
doi:10.1007/978-3-319-05416-2_14 fatcat:is3vjqpwxfg75lfdw7e3j3hbci

Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs with Minsum Criteria [chapter]

Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai
2005 Lecture Notes in Computer Science  
We consider a general class of scheduling problems where a set of dependent jobs needs to be scheduled (preemptively or non-preemptively) on a set of machines so as to minimize the weighted sum of completion  ...  We also improve the results of Kim (SODA 2003, 97-98 ) for npSMC of line graphs and for resource-constrained scheduling.  ...  We thank Moses Charikar and Chandra Chekuri for helpful comments and suggestions.  ... 
doi:10.1007/978-3-540-31833-0_8 fatcat:w4rvcm4nprcjhnthpcnppi3jxq

Formal verification of multitasking applications based on timed automata model

Libor Waszniowski, Zdeněk Hanzálek
2007 Real-time systems  
The application under consideration consists of several non-preemptive tasks and interrupt service routines that can be synchronized by events.  ...  The objective is to use model-checking approach (Larsen et al. 1995; Berard et al. 2001) for automatic verification of the model described in this paper.  ...  Acknowledgements We would like to thank Gerd Behrmann from the Department of Computer Science at Aalborg University, Denmark for his advice related to reducing the complexity of the ready queue model.  ... 
doi:10.1007/s11241-007-9036-z fatcat:z6eik34ehjbztl3ylxqm3er2yq

Timing analysis for embedded systems using non-preemptive EDF scheduling under bounded error arrivals

Michael Short
2017 Applied Computing and Informatics  
However when non-preemptive scheduling techniques are employed there is a potential lack of error confinement should any timing errors occur in individual software tasks.  ...  Previous research has considered the performance of different types of task scheduling algorithm and developed associated timing analysis techniques for such systems.  ...  The author declares no conflict of interests regarding the publication of this article.  ... 
doi:10.1016/j.aci.2016.07.001 fatcat:hjf5jixxqzh5llmf54jcwwj7ne

NPM-BUNDLE: Non-Preemptive Multitask Scheduling for Jobs with BUNDLE-Based Thread-Level Scheduling

Corey Tessler, Nathan Fisher, Michael Wagner
2019 Euromicro Conference on Real-Time Systems  
This work proposes scheduling BUNDLE-based jobs non-preemptively according to the earliest deadline first (EDF) policy.  ...  This thread-level preemption is a requirement for the run-time behavior and WCETO calculation to receive the benefit of BUNDLE-based approaches.  ...  For non-preemptive schedulability analysis, each task τ i ∈ τ 1 or τ m must have a non-preemptive chunk size q i ≥ c i (m i ).  ... 
doi:10.4230/lipics.ecrts.2019.15 dblp:conf/ecrts/TesslerF19 fatcat:u6vrzeqf2nelfkh3esukrl5ksq

Preemptive Packet-Mode Scheduling to Improve TCP Performance [chapter]

Wenjie Li, Bin Liu, Lei Shi, Yang Xu, Dapeng Wu
2005 Lecture Notes in Computer Science  
Analysis and simulation results demonstrate that compared to existing packet-mode schedulers, P-SPF significantly reduces the waiting time for short packets while achieving a high overall throughput when  ...  Specifically, we propose a preemptive packet-mode scheduling architecture and an algorithm called preemptive short packets first (P-SPF).  ...  First, we took a crosslayer approach in the design of switching architectures and scheduling algorithms. Second, we proposed a preemptive packet-mode scheduling architecture.  ... 
doi:10.1007/11499169_20 fatcat:v6w46hcguvcxrc5qrtw2lrsq4y

Parametric Schedulability Analysis of Fixed Priority Real-Time Distributed Systems [article]

Youcheng Sun, Romain Soulat, Giuseppe Lipari, Étienne André, Laurent Fribourg
2013 arXiv   pre-print
The proposed analytic method extends existing sensitivity analysis for single processors to the case of a distributed system, supporting preemptive and non-preemptive scheduling, jitters and unconstrained  ...  Parametric Timed Automata are used to model all possible behaviours of a distributed system, and therefore it is a necessary and sufficient analysis.  ...  Rivas, from the Universidad de Cantabria, for their support to installing and using the MAST tool.  ... 
arXiv:1302.1306v1 fatcat:ufu7bth4fnh4zdpheh4cptdwxa

A Study of Various Algorithms Used for Analyzing Eavesdropping Attack in Industrial Wireless Sensor Network

Dr. K. A. Dattatreya
2017 International Journal for Research in Applied Science and Engineering Technology  
In the event of applying optimal sensor scheduling scheme a sensor with highest secrecy capacity is choosen and the data is transmitted. In this paper various types of scheduling are studied.  ...  Most of the industries use wireless networks for communicating information and data, due to high cable cost.  ...  Round-robin scheduling is very simple, much easy to implement, and starvation free.  ... 
doi:10.22214/ijraset.2017.2078 fatcat:tcnfulcayrenvlwqwcpjftct4m

Cyclic executive for safety-critical Java on chip-multiprocessors

Anders P. Ravn, Martin Schoeberl
2010 Proceedings of the 8th International Workshop on Java Technologies for Real-Time and Embedded Systems - JTRES '10  
In this paper, we present a solution, that uses model checking to find a static schedule, if one exists at all, which gives an implementation of a table driven multiprocessor scheduler.  ...  To evaluate the proposed cyclic executive for multiprocessors we have implemented it in the context of safety-critical Java on a Java processor.  ...  Acknowledgement The comments of the reviewers have been very helpful in preparing the final version of the paper.  ... 
doi:10.1145/1850771.1850779 dblp:conf/jtres/RavnS10 fatcat:itd5ljlxy5eapbtkatoznwhwcy

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

Björn B. Brandenburg
2019 arXiv   pre-print
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  ...  on maximum priority-inversion blocking, and matching asymptotically optimal locking protocols.  ...  The most simple solution is to let tasks spin and make every lock request a non-preemptive section: if tasks execute critical sections non-preemptively, then it is simply impossible for a lock holder to  ... 
arXiv:1909.09600v1 fatcat:tmqcpiuxfbbd5jrcecgvoeanpm

An Optimal Real-Time Scheduling Algorithm for Multiprocessors

Hyeonjoong Cho, Binoy Ravindran, E. Jensen
2006 2006 27th IEEE International Real-Time Systems Symposium (RTSS'06)  
the lock-free retry, blocking time under lock-based.  ...  We consider several object sharing synchronization mechanisms including lock-based, lock-free, and wait-free sharing for LNREF [1], an optimal real-time scheduling algorithm on multiprocessors.  ...  The founder of RTLinux recommends accessing simple critical sections non-preemptively in [19] , for example. We then derive feasible conditions for LNREF under this lockbased scheme.  ... 
doi:10.1109/rtss.2006.10 dblp:conf/rtss/ChoRJ06 fatcat:xetcgphwsfdithfzywtq7nl4yy
« Previous Showing results 1 — 15 out of 4,464 results