Filters








22,259 Hits in 6.6 sec

Towards optimal priority assignment for probabilistic CAN-based systems

Dorin Maxim, Liliana Cucu-Grosjean
2010 2010 IEEE International Workshop on Factory Communication Systems Proceedings  
In this paper we investigate the problem of optimal priority assignment in fixed priority pre-emptive single processor systems where tasks have probabilistic execution times.  ...  For each sub-problem we propose an algorithm that is proved optimal.  ...  Moreover, by probabilistic real-time system we mean a real-time system with at least one parameter described by a random variable.  ... 
doi:10.1109/wfcs.2010.5548602 fatcat:jdo3aio5hffvlodr6nplwn62b4

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 is over 40 years since the first seminal work on priority assignment for real-time systems using fixed priority scheduling.  ...  This tutorial style review provides an in-depth assessment of priority assignment techniques for hard real-time systems scheduled using fixed priorities.  ...  As well as conventional systems, we review priority assignment in mixed criticality systems, and probabilistic real-time systems where worst-case execution times are described by random variables.  ... 
doi:10.1016/j.sysarc.2016.04.002 fatcat:ziodjnqp7jby5pskfspogugd4u

Robust priority assignment for messages on Controller Area Network (CAN)

Robert I. Davis, Alan Burns
2008 Real-time systems  
This paper shows that "Deadline minus jitter" monotonic priority assignment, commonly used for priority assignment in commercial CAN systems, does not always result in the most robust priority ordering  ...  A Robust Priority Assignment algorithm is presented that computes the most robust priority ordering for CAN messages subject to bit errors on the bus.  ...  showed that an optimal priority assignment for CAN messages can be found using Audsley's optimal priority assignment algorithm (Audsley, 1991) .  ... 
doi:10.1007/s11241-008-9065-2 fatcat:bvr4eyftq5bchg2n7jritzrkau

A Parameterized Formal Model for the Analysis of Preemption-Threshold Scheduling in Real-time Systems

Imene Ben Hafaiedh, Maroua Ben Slimane
2020 IEEE Access  
The advantage of these algorithms highly depends on a proper assignment of a set of scheduling attributes, which are priority and preemption threshold.  ...  In this context, preemption threshold scheduling algorithms have been proposed to improve real-time schedulability by managing preemptiveness of tasks.  ...  In the context of fixed priority scheduling algorithms, the authors in [23] propose a review of priority assignment techniques for hard real-time systems scheduled using fixed priorities.  ... 
doi:10.1109/access.2020.2979354 fatcat:v5ove2adkrg43pprb6hj73wqhm

C++ Dynamic Cast in Autonomous Space Systems

Damian Dechev, Rabi Mahapatra, Bjarne Stroustrup, David Wagner
2008 2008 11th IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC)  
Like similar operators in other languages, the C++ dynamic cast operator does not provide the timing guarantees needed for hard real-time embedded systems.  ...  Dynamic cast has an important role in the implementation of the Data Management Services (DMS) of the Mission Data System Project (MDS), the Jet Propulsion Laboratory's experimental work for providing  ...  1 Introduction 1 ISO Standard C++ [8] has become a common choice for hard real-time embedded systems such as the Jet Propulsion Laboratory's Mission Data System [7] .  ... 
doi:10.1109/isorc.2008.20 dblp:conf/isorc/DechevMSW08 fatcat:j5xxqxtgdnbs5ebgybs7a63iji

Energy Efficient Task Assignment with Guaranteed Probability Satisfying Timing Constraints for Embedded Systems

Jianwei Niu, Chuang Liu, Yuhang Gao, Meikang Qiu
2014 IEEE Transactions on Parallel and Distributed Systems  
in real-time embedded systems, ensuring that all the tasks can be done under the time constraint with a guaranteed probability.  ...  The trade-off between system performance and energy efficiency (service time) is critical for battery-based embedded systems.  ...  By adopting a probabilistic approach, we can obtain solutions that not only work for hard real-time systems, but also provide more choices of lower total costs for soft real-time applications, satisfying  ... 
doi:10.1109/tpds.2013.251 fatcat:kudnht3jcndxtdxumqpyuia6k4

Human-Resources Optimization & Re-Adaptation Modelling In Enterprises

S. Zikos, S. Rogotis, S. Krinidis, D. Ioannidis, D. Tzovaras
2017 Zenodo  
The HR optimization toolkit, which comprises the models and the HR optimization tool, has been tested with real data acquired from an industrial environment achieving favourable results towards HR assignment  ...  In this paper, a novel HR optimization & re-adaptation model for enterprises is introduced.  ...  The HR optimization toolkit, which comprises the models and the HR optimization tool, has been tested with real data acquired from an industrial environment achieving favourable results towards HR assignment  ... 
doi:10.5281/zenodo.1111629 fatcat:aq7e3ixifze5vnzj6rxs2zvhui

Approaches for Transient Fault Tolerance in Multiprocessor - A State of Art

M. Shanmugasundaram, R. Kumar, Kittur Harish Mallikarjun
2015 Indian Journal of Science and Technology  
Applications: This comparative analysis will help for us to identify the optimal approaches for tolerating the transient fault in critical real time systems.  ...  Methods: Transient faults are emerging as a critical issue in the reliability of real time systems.  ...  In this paper we have analysed about some of the fault tolerant real-time scheduling algorithms such as RM-FT probabilistic algorithm, dynamic optimal solution, check pointing based technique, Primary/  ... 
doi:10.17485/ijst/2015/v8i15/55793 fatcat:q7qbkvocqfcgzcetcfx375n7km

Effective Traffic Management System for Vehicular Network

2019 VOLUME-8 ISSUE-10, AUGUST 2019, REGULAR ISSUE  
In order to mitigate terrible accidents, We then focus on (traffic light aware routing protocol) TLRC with (Soft Reservation Multiple Access with Priority Assignment) SRMA/PA routing protocols at intersections  ...  Vehicular ad hoc networks are becoming the promising research topic in Intelligent transportation system.  ...  Priority levels are assigned based on the real time and non real time services.  ... 
doi:10.35940/ijitee.a4186.119119 fatcat:7lqbare4vjfjvkfgosdq7dlkfm

A Novel Efficient Task-Assign Route Planning Method for AUV Guidance in a Dynamic Cluttered Environment [article]

Somaiyeh Mahmoud Zadeh, David M.W. Powers, AmirMehdi Yazdani
2016 arXiv   pre-print
The system fives the error of "Bad character(s) in field Abstract" for no reason. Please refer to manuscript for the full abstract  ...  The capability of Autonomous Underwater Vehicles (AUVs) to fulfill the mission objectives is directly influenced by route planning and task assignment system performance.  ...  Some instances of route planning systems applications are in the areas of traffic control [5] , real time routing and trip planning [6] , and so on.  ... 
arXiv:1604.02524v2 fatcat:qxaavurjijatxb2hs436cuot3y

Optimal Priority Assignment for Real-Time Systems: A Coevolution-Based Approach [article]

Jaekwon Lee, Seung Yeob Shin, Shiva Nejati, Lionel C. Briand
2022 arXiv   pre-print
In real-time systems, priorities assigned to real-time tasks determine the order of task executions, by relying on an underlying task scheduling policy.  ...  In this article, we propose an automated method that aims to identify the best possible priority assignments in real-time systems, accounting for multiple objectives regarding safety margins and engineering  ...  Acknowledgements We thank Yago Isasi Parache, LuxSpace, for his support in conducting our industrial case study.  ... 
arXiv:2102.07694v4 fatcat:fsooc2w2hraozinm6bu63xqose

Measuring and Synthesizing Systems in Probabilistic Environments

Krishnendu Chatterjee, Thomas A. Henzinger, Barbara Jobstmann, Rohit Singh
2015 Journal of the ACM  
For general omega-regular specifications, the solution rests on a new, polynomial-time algorithm for computing optimal strategies in MDPs with mean-payoff parity objectives.  ...  Under a probabilistic assumption about the possible inputs, such a preference order is naturally expressed by a weighted automaton, which assigns to each word a value, such that a system is preferred if  ...  In our future work, we will implement our algorithm for MDPs with mean-payoff parity conditions and develop a tool for synthesizing systems in probabilistic environments with ω-regular specifications.  ... 
doi:10.1145/2699430 fatcat:cbt5xosfzbgrnexdsqy3me2v2m

Comparative Study of Scheduling Algorithms for Real Time Environment

Ishan Khera, Ajay Kakkar
2012 International Journal of Computer Applications  
Real time systems are expected to change its state in real time even after the controlling processor has stopped its execution.  ...  Also techniques used for scheduling in real time environment are analyzed and comparison between different techniques have been done.  ...  For hard real time systems, schedulability analysis can be done and calculations of probabilistic Worst Case Execution Time (WCET) analysis can also be done.  ... 
doi:10.5120/6233-7797 fatcat:z6nergndrne5zfsok7x4wbgxae

Measuring and Synthesizing Systems in Probabilistic Environments [chapter]

Krishnendu Chatterjee, Thomas A. Henzinger, Barbara Jobstmann, Rohit Singh
2010 Lecture Notes in Computer Science  
For general omega-regular specifications, the solution rests on a new, polynomial-time algorithm for computing optimal strategies in MDPs with mean-payoff parity objectives.  ...  Under a probabilistic assumption about the possible inputs, such a preference order is naturally expressed by a weighted automaton, which assigns to each word a value, such that a system is preferred if  ...  In our future work, we will implement our algorithm for MDPs with mean-payoff parity conditions and develop a tool for synthesizing systems in probabilistic environments with ω-regular specifications.  ... 
doi:10.1007/978-3-642-14295-6_34 fatcat:ilysbzabmrhbzlhm5owxdl44mq

Practical and Verifiable C++ Dynamic Cast for Hard Real-Time Systems

Damian Dechev, Rabi Mahapatra, Bjarne Stroustrup
2008 Journal of Computing Science and Engineering  
Like similar operators in other languages, the C++ dynamic cast operator does not provide the timing guarantees needed for hard real-time embedded systems.  ...  In this work we introduce and apply a library for extracting semantic information from C++ source code that helps us deliver a practical and verifiable implementation of the fast dynamic casting algorithm  ...  The G&S scheme was devised as a solution to a real industrial problem related to C++ use for hard real time code.  ... 
doi:10.5626/jcse.2008.2.4.375 fatcat:wteob57eebexfkb346rwhe77lu
« Previous Showing results 1 — 15 out of 22,259 results