Results 1 to 10 of about 2,490 (199)
A Modeling Framework for Schedulability Analysis of Distributed Avionics Systems [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 This paper presents a modeling framework for schedulability analysis of distributed integrated modular avionics (DIMA) systems that consist of spatially distributed ARINC-653 modules connected by a unified AFDX network. We model a DIMA system as a set of
Pujie Han +3 more
doaj +3 more sources
Analysis of thread schedulability in Huawei LiteOS [PDF]
MATEC Web of Conferences, 2021 Huawei LiteOS is a real-time operating system. Thread schedulability is an important thing to be considered first when we use the RTOS in an application. There are a lot of methods to value thread schedulability in practical application.
Wang Xiaochun
doaj +2 more sources
A new sufficient schedulability analysis for hybrid scheduling [PDF]
International Journal of Applied Mathematics and Computer Science, 2016 Earliest deadline first (EDF) and fixed priority (FP) are the most commonly used and studied scheduling algorithms for real-time systems. This paper focuses on combining the EDF and FP strategies in one system.
Zhang Fengxiang +2 more
doaj +3 more sources
Formal Verification of Real-Time Autonomous Robots: An Interdisciplinary Approach [PDF]
Frontiers in Robotics and AI, 2022 Due to the severe consequences of their possible failure, robotic systems must be rigorously verified as to guarantee that their behavior is correct and safe.
Mohammed Foughali, Alexander Zuepke
doaj +2 more sources
Novel Hybrid Scheduling Technique for Sensor Nodes with Mixed Criticality Tasks [PDF]
Sensors, 2017 Sensor networks become increasingly a key technology for complex control applications. Their potential use in safety- and time-critical domains has raised the need for task scheduling mechanisms specially adapted to sensor node specific requirements ...
Mihai-Victor Micea +3 more
doaj +2 more sources
A Schedulability Test for Sporadic Task DM Scheduling Based on Density Upper Bound
IEEE Access, 2022 Due to low runtime overhead and simple implementation of DM (Deadline Monotonic) scheduling, it is widely used in real-time systems. Aiming at the schedulability test problem of the sporadic task DM scheduling under uniprocessor, a density upper bound of
Hongbiao Liu +4 more
doaj +1 more source
Interactive schedulability analysis [PDF]
ACM Transactions on Embedded Computing Systems, 2006 A typical design process for real-time embedded systems involves choosing the values of certain system parameters and performing a schedulability analysis to determine whether all deadline constraints can be satisfied. If such an analysis returns a negative answer, then some of the parameters are modified and the analysis is invoked once again.
Unmesh D. Bordoloi, Samarjit Chakraborty
openaire +2 more sources
Analysis of Real-time Scheduling Algorithm with Global Fixed Priority [PDF]
Jisuanji gongcheng, 2017 The schedulability can be determined based on deadline analysis and response time analysis for the global Fixed Priority(FP) real-time scheduling algorithm.The traditional method takes into account the real-time tasks with a carry-in job.The processor ...
LIANG Hao,YAN Li,SHEN Xiangjun
doaj +1 more source
Scheduling analysis with martingales [PDF]
Performance Evaluation, 2014 This paper proposes a new characterization of queueing systems by bounding a suitable exponential transform with a martingale. The constructed martingale is quite versatile in the sense that it captures queueing systems with Markovian and autoregressive arrivals in a unified manner; the second class is particularly relevant due to Wold’s decomposition ...
Felix Poloczek, Florin Ciucu
openaire +1 more source
FPZL Schedulability Analysis [PDF]
2011 17th IEEE Real-Time and Embedded Technology and Applications Symposium, 2011 This paper presents the Fixed Priority until Zero Laxity (FPZL) scheduling algorithm for multiprocessor realtime systems. FPZL is similar to global fixed priority preemptive scheduling, however, whenever a task reaches a state of zero laxity it is given the highest priority.
Robert I. Davis 0001, Alan Burns 0001
openaire +1 more source