: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems
Consider a real-time system in which every task has a value that it obtains only if it
completes by its deadline. The problem is to design an on-line scheduling algorithm (ie, the …
completes by its deadline. The problem is to design an on-line scheduling algorithm (ie, the …
The scheduling techniques in the Hadoop and Spark of smart cities environment: a systematic review
Processing extensive and diverse data in real-time is a significant challenge in the context of
smart cities. Timely access to information and efficient analytics is essential for smart city …
smart cities. Timely access to information and efficient analytics is essential for smart city …
[HTML][HTML] An adaptive emergency first intelligent scheduling algorithm for efficient task management and scheduling in hybrid of hard real-time and soft real-time …
Industrial revolution is advancing, and the augmented role of autonomous technology and
embedded Internet of Things (IoT) systems is at its vanguard. In autonomous technology …
embedded Internet of Things (IoT) systems is at its vanguard. In autonomous technology …
MOCA: A multiprocessor on-line competitive algorithm for real-time system scheduling
G Koren, D Shasha - Theoretical Computer Science, 1994 - Elsevier
We study competitive on-line scheduling in multiprocessor real-time environments. In our
model, every task has a deadline and a value that it obtains only if it completes by its …
model, every task has a deadline and a value that it obtains only if it completes by its …
Real-time schedulability tests for preemptive multitasking
CJ Fidge - Real-Time Systems, 1998 - Springer
When developing multitasking real-time systems, schedulability tests are used to formally
prove that a given task set will meet its deadlines. A wide range of such tests have appeared …
prove that a given task set will meet its deadlines. A wide range of such tests have appeared …
Real-time load balancing scheduling algorithm for periodic simulation models
Y Wu, X Song, G Gong - Simulation modelling practice and theory, 2015 - Elsevier
A scheduling algorithm is crucial for real-time simulations because it guarantees that each
model meets its deadline. Traditional online real-time scheduling algorithms such as Earliest …
model meets its deadline. Traditional online real-time scheduling algorithms such as Earliest …
FASA: a scalable software framework for distributed control systems
Building a distributed control application is currently performed ad hoc: it consists of building
each application part as an independent program and connecting them through a …
each application part as an independent program and connecting them through a …
[PDF][PDF] Scheduling of hard real-time periodic systems with various kinds of deadline and offset constraints
J Goossens - 1999 - Citeseer
Scheduling of Hard Real-Time Periodic Systems with Various Kinds of Deadline and Offset
Constraints Page 1 UNIVERSITÉ LIBRE DE BRUXELLES Faculté des Sciences Scheduling of …
Constraints Page 1 UNIVERSITÉ LIBRE DE BRUXELLES Faculté des Sciences Scheduling of …
Quartz: A QoS architecture for open systems
F Siqueira, V Cahill - Proceedings 20th IEEE International …, 2000 - ieeexplore.ieee.org
This paper describes an architecture that provides support for quality of service (QoS)
specification and enforcement in heterogeneous distributed computing systems. The Quartz …
specification and enforcement in heterogeneous distributed computing systems. The Quartz …