Results 271 to 280 of about 98,892 (314)
Some of the next articles are maybe not open access.
Object technologies and real-time scheduling
ACM SIGPLAN OOPS Messenger, 1996Any object-based real-time system gives rise to real-time scheduling issues not easily solved by use of standard scheduling methods, including: (1) the invocation of an object's method may imply the need for online schedulability analysis for the thread(s) able to execute method code, (2) parallelism internal to objects may result in the need to ...
Harold C. Forbes, Karsten Schwan
openaire +1 more source
Real-time scheduling theory and Ada
Computer, 1990Rate monotonic scheduling theory puts real-time software engineering on a sound analytical footing. The authors review the theory and its implications for Ada. >
Lui Sha, John B. Goodenough 0002
openaire +1 more source
A Real Time Scheduler/Dispatcher
2018Real-time systems often spend an inordinate amount of time getting ready to do things in the future and deciding what to do next. Designating a task to be performed at some time in the future, or scheduling, and finding the next task to be run, or dispatching, typically take a total time which is linear in the number of waiting tasks.
openaire +2 more sources
Real time scheduling algorithms and their performances
Microprocessing and Microprogramming, 1990Abstract The present paper describes an approach to task scheduling in real time applications, based on a set of functions describing both the characteristics of the environment to be controlled and the behavior of the controlling tasks. Several scheduling algorithms are defined, and comparative evaluations of their effectiveness - obtained through ...
R. Cobelli +3 more
openaire +1 more source
Real-Time Scheduling with Predictions
2022 IEEE Real-Time Systems Symposium (RTSS), 2022Tianming Zhao 0002 +2 more
openaire +1 more source
Real-time scheduling in distributed systems
Proceedings. International Conference on Parallel Computing in Electrical Engineering, 2003Real-time computer systems are expected to greatly benefit from multiprocessor technology and employing multiprocessor systems for real-time applications has shown to be difficult. A major obstacle is that scheduling algorithms for real-time multiprocessor systems are significantly more complex than for uniprocessor systems.
openaire +1 more source
2011
Many thousands of research papers have been written about how to schedule a set of tasks in a system with a limited amount of resources such that all tasks will meet their deadlines. This chapter tries to summarize some important results of scheduling research that are relevant to the designer of real-time systems. The chapter starts by introducing the
openaire +1 more source
Many thousands of research papers have been written about how to schedule a set of tasks in a system with a limited amount of resources such that all tasks will meet their deadlines. This chapter tries to summarize some important results of scheduling research that are relevant to the designer of real-time systems. The chapter starts by introducing the
openaire +1 more source
Open problems in real-time scheduling
Journal of Scheduling, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sanjoy K. Baruah, Kirk Pruhs
openaire +2 more sources
On real-time control tasks schedulability
2001 European Control Conference (ECC), 2001In general, characteristics of classical control theory and properties of real-time scheduling algorithms may cause unexpected control system responses in the implementation of real-time computer-controlled systems. Revising realtime scheduling properties, we analyse which are the main timing problems that current scheduling algorithms may introduce in
Pau Martí +3 more
openaire +1 more source
Real-time scheduling in video systems
Proceedings of 5th International Workshop on Parallel and Distributed Real-Time Systems and 3rd Workshop on Object-Oriented Real-Time Systems, 2002We consider the problem of mapping video algorithms onto systems of high-performance video signal processors with hard real-time constraints. The mapping problem under consideration is computationally hard due to the many constraints that need to be satisfied. We present a compact mathematical formulation which identifies the decision variables and the
de Kock, E.A., Aarts, E.H.L., Essink, G.
openaire +3 more sources