Multiprocessor Online Scheduling of Hard-Real-Time Tasks
IEEE Transactions on Software Engineering
A Pre-Run-Time Scheduling Algorithm for Hard Real-Time Systems
IEEE Transactions on Software Engineering
Allocating hard real-time tasks: an NP-hard problem made easy
Real-Time Systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Combined Task and Message Scheduling in Distributed Real-Time Systems
IEEE Transactions on Parallel and Distributed Systems
Priority Scheduling Versus Pre-Run-Time Scheduling
Real-Time Systems - Selected papers from IFAC/IFIP workshops on real-time programming
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On Satisfying Timing Constraints in Hard-Real-Time Systems
IEEE Transactions on Software Engineering
IEEE Transactions on Software Engineering
A Modified Least-Laxity-First Scheduling Algorithm for Real-Time Tasks
RTCSA '98 Proceedings of the 5th International Conference on Real-Time Computing Systems and Applications
Scheduling Fixed-Priority Tasks with Preemption Threshold
RTCSA '99 Proceedings of the Sixth International Conference on Real-Time Computing Systems and Applications
Applicability of simulated annealing methods to real-time scheduling and jitter control
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
Handbook of Scheduling: Algorithms, Models, and Performance Analysis
Handbook of Scheduling: Algorithms, Models, and Performance Analysis
Rate monotonic vs. EDF: judgment day
Real-Time Systems
ACM SIGBED Review - Special issue: IEEE RTAS 2005 work-in-progress
ANTS '08 Proceedings of the 6th international conference on Ant Colony Optimization and Swarm Intelligence
Cooperative ant colonies for solving the maximum weighted satisfiability problem
IWANN'03 Proceedings of the Artificial and natural neural networks 7th international conference on Computational methods in neural modeling - Volume 1
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
International Journal of Wireless and Mobile Computing
Population-based dynamic scheduling optimisation for complex production process
International Journal of Computer Applications in Technology
International Journal of Computer Applications in Technology
Using QIGSO with steepest gradient descent strategy to direct orbits of chaotic systems
International Journal of Computational Science and Engineering
Modified Adaptive Cuckoo Search (MACS) algorithm and formal description for global optimisation
International Journal of Computer Applications in Technology
Expert Systems with Applications: An International Journal
Bio-inspired computation: success and challenges of IJBIC
International Journal of Bio-Inspired Computation
| Hi-index | 0.00 |
This paper presents an ACO algorithm to search for feasible schedules of n real-time tasks on M identical processors. Unlike existing works, the proposed algorithm addresses the problem of preemptive scheduling rather than non-preemptive scheduling. A learning technique is integrated to detect and postpone possible preemptions between tasks. The proposed learning technique is also used to develop a necessary condition for the schedulability of the input task set. Experimental results show a significant success ratio improvement of the proposed scheduling algorithm.