Software architecture optimization methods: A systematic literature review
Due to significant industrial demands toward software systems with increasing complexity
and challenging quality requirements, software architecture design has become an …
and challenging quality requirements, software architecture design has become an …
Real-time computing: A new discipline of computer science and engineering
Real-time computing: a new discipline of computer science and engineering Page 1 Real-Time
Computing: A New Discipline of Computer Science and Engineering KANG G. SHIN, FELLOW …
Computing: A New Discipline of Computer Science and Engineering KANG G. SHIN, FELLOW …
An improved hybrid swarm intelligence for scheduling iot application tasks in the cloud
The usage of cloud services is growing exponentially with the recent advancement of
Internet of Things (IoT)-based applications. Advanced scheduling approaches are needed to …
Internet of Things (IoT)-based applications. Advanced scheduling approaches are needed to …
Applying new scheduling theory to static priority pre-emptive scheduling
The paper presents exact schedulability analyses for real-time systems scheduled at runtime
with a static priority pre-emptive dispatcher. The tasks to be scheduled are allowed to …
with a static priority pre-emptive dispatcher. The tasks to be scheduled are allowed to …
Metaheuristics: A bibliography
Metaheuristics are the most exciting development in approximate optimization techniques of
the last two decades. They have had widespread successes in attacking a variety of difficult …
the last two decades. They have had widespread successes in attacking a variety of difficult …
Routing and scheduling of time-triggered traffic in time-sensitive networks
This article addresses the following research question: How to compute no-wait schedules
and multipath routings for large-scale time-sensitive networks (TSNs)? TSN must guarantee …
and multipath routings for large-scale time-sensitive networks (TSNs)? TSN must guarantee …
Holistic schedulability analysis for distributed hard real-time systems
K Tindell, J Clark - Microprocessing and microprogramming, 1994 - Elsevier
This paper extends the current analysis associated with static priority pre-emptive based
scheduling to address the wider problem of analysing schedulability of a distributed hard …
scheduling to address the wider problem of analysing schedulability of a distributed hard …
Real time scheduling theory: A historical perspective
In this 25th year anniversary paper for the IEEE Real Time Systems Symposium, we review
the key results in real-time scheduling theory and the historical events that led to the …
the key results in real-time scheduling theory and the historical events that led to the …
Hard real-time scheduling: The deadline-monotonic approach
The scheduling of processes to meet deadlines is a difficult problem often simplified by
placing severe restrictions upon the timing characteristics of individual processes. One …
placing severe restrictions upon the timing characteristics of individual processes. One …
An extendible approach for analyzing fixed priority hard real-time tasks
As the real-time computing industry moves away from static cyclic executive-based
scheduling towards more flexible process-based scheduling, so it is important for current …
scheduling towards more flexible process-based scheduling, so it is important for current …