Scheduling Processes with Release Times, Deadlines, Precedence and Exclusion Relations
IEEE Transactions on Software Engineering
Dynamic scheduling of real-time tasks under precedence constraints
Real-Time Systems
A Pre-Run-Time Scheduling Algorithm for Hard Real-Time Systems
IEEE Transactions on Software Engineering
Assignment and Scheduling Communicating Periodic Tasks in Distributed Real-Time Systems
IEEE Transactions on Software Engineering
Comment on "A Pre-Run-Time Scheduling Algorithm for Hard Real-Time Systems"
IEEE Transactions on Software Engineering
Real-Time Communication in Multihop Networks
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Software Engineering
Optimal Scheduling of Cooperative Tasks in a Distributed System Using an Enumerative Method
IEEE Transactions on Software Engineering
Planning and Resource Allocation for Hard Real-time, Fault-Tolerant Plan Execution
Autonomous Agents and Multi-Agent Systems
Journal of Systems and Software
A Time Petri Net Approach for Finding Pre-Runtime Schedules in Embedded Hard Real-Time Systems
ICDCSW '04 Proceedings of the 24th International Conference on Distributed Computing Systems Workshops - W7: EC (ICDCSW'04) - Volume 7
Dynamic Task Scheduling with Security Awareness in Real-Time Systems
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 15 - Volume 16
PARM: a power-aware message scheduling algorithm for real-time wireless networks
WMuNeP '05 Proceedings of the 1st ACM workshop on Wireless multimedia networking and performance modeling
Journal of Parallel and Distributed Computing
Scheduling Security-Critical Real-Time Applications on Clusters
IEEE Transactions on Computers
Software synthesis for hard real-time embedded systems with multiple processors
ACM SIGSOFT Software Engineering Notes
Improving security for periodic tasks in embedded systems through scheduling
ACM Transactions on Embedded Computing Systems (TECS)
Real-time scheduling with quality of security constraints
International Journal of High Performance Computing and Networking
Dynamic, capability-driven scheduling of DAG-based real-time jobs in heterogeneous clusters
International Journal of High Performance Computing and Networking
Analysis and optimisation of hierarchically scheduled multiprocessor embedded systems
International Journal of Parallel Programming - Special Issue on Multiprocessor-based embedded systems
SAL-Based Symbolic Scheduling in Time-Triggered Networks
IFM '09 Proceedings of the 7th International Conference on Integrated Formal Methods
Deadlock free specification based on local process properties
ICCS'03 Proceedings of the 2003 international conference on Computational science: PartIII
Integrating real-time inter-task communication channels into hardware-software codesign
Microprocessors & Microsystems
ACO approach with learning for preemptive scheduling of real-time tasks
International Journal of Bio-Inspired Computation
THE RTSC: MIGRATING EVENT-TRIGGERED SYSTEMS TO TIME-TRIGGERED SYSTEMS
Software—Practice & Experience
A methodology for software synthesis of embedded real-time systems based on TPN and LSC
ICESS'05 Proceedings of the Second international conference on Embedded Software and Systems
Resource Management in Real Time Distributed System with Security Constraints: A Review
International Journal of Distributed Systems and Technologies
Expert Systems with Applications: An International Journal
Hi-index | 0.01 |
This paper presents an algorithm for off-line scheduling of communicating tasks with precedence and exclusion constraints in distributed hard real-time systems. Tasks are assumed to communicate via message passing based on a time-bounded communication paradigm, such as the real-time channel [1]. The algorithm uses a branch-and-bound (B&B) technique to search for a task schedule by minimizing maximum task lateness (defined as the difference between task completion time and task deadline), and exploits the interplay between task and message scheduling to improve the quality of solution. It generates a complete schedule at each vertex in the search tree, and can be made to yield a feasible schedule (found before reaching an optimal solution), or proceed until an optimal task schedule is found. We have conducted an extensive simulation study to evaluate the performance of the proposed algorithm. The algorithm is shown to scale well with respect to system size and degree of intertask interactions. It also offers good performance for workloads with a wide range of CPU utilizations and application concurrency. For larger systems and higher loads, we introduce a greedy heuristic that is faster but has no optimality properties. We have also extended the algorithm to a more general resource-constraint model, thus widening its application domain.