A heuristic approach to scheduling hard real-time tasks with resource requirements in distributed systems
Scheduling Multiprocessor Tasks to Minimize Schedule Length
IEEE Transactions on Computers
Scheduling Tasks with Resource Requirements in Hard Real-Time Systems
IEEE Transactions on Software Engineering
Simple and integrated heuristic algorithms for scheduling tasks with time and resource constraints
Journal of Systems and Software
Scheduling under Resource Constraints - Achievements and Prospects
Proceedings of the Third International Symposium on Modelling and Performance Evaluation of Computer Systems: Performance of Computer Systems
Guaranteed Response Times in a Hard-Real-Time Environment
IEEE Transactions on Software Engineering
The HiPAC project: combining active databases and timing constraints
ACM SIGMOD Record - Special Issue on Real-Time Database Systems
Decentralized Decision-Making for Task Reallocation in a Hard Real-Time System
IEEE Transactions on Computers
Scheduling Processes with Release Times, Deadlines, Precedence and Exclusion Relations
IEEE Transactions on Software Engineering
Scheduling real-time transactions with disk resident data
VLDB '89 Proceedings of the 15th international conference on Very large data bases
IEEE Transactions on Computers
Static Rate-Optimal Scheduling of Iterative Data-Flow Programs Via Optimum Unfolding
IEEE Transactions on Computers
On satisfying timing constraints in hard-real-time systems
SIGSOFT '91 Proceedings of the conference on Software for citical systems
IEEE Transactions on Computers
Dynamic Scheduling of Hard Real-Time Tasks and Real-Time Threads
IEEE Transactions on Software Engineering
Metascheduling for continuous media
ACM Transactions on Computer Systems (TOCS)
Real-time transaction scheduling: a cost conscious approach
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
How to Integrate Precedence Constraints and Shared Resources in Real-Time Scheduling
IEEE Transactions on Computers
Proceedings of the 6th international workshop on Hardware/software codesign
To Schedule or to Execute: Decision Support and PerformanceImplications
Real-Time Systems
Scheduling Real-Time Systems with End-to-End Timing Constraints Using the Distributed Pinwheel Model
IEEE Transactions on Computers
Dynamic Scheduling of Real-Time Tasks, by Assignment
IEEE Concurrency
Priority Inheritance Protocols: An Approach to Real-Time Synchronization
IEEE Transactions on Computers
Closed Form Solutions for Bus and Tree Networks of Processors Load Sharing a Divisible Job
IEEE Transactions on Computers
Prediction of Performance and Processor Requirements in Real-Time Data Flow Architectures
IEEE Transactions on Parallel and Distributed Systems
Optimizing Computing Costs Using Divisible Load Analysis
IEEE Transactions on Parallel and Distributed Systems
On Satisfying Timing Constraints in Hard-Real-Time Systems
IEEE Transactions on Software Engineering
IEEE Transactions on Software Engineering
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
VEST - A Toolset for Constructing and Analyzing Component Based Embedded Systems
EMSOFT '01 Proceedings of the First International Workshop on Embedded Software
A Nonpreemptive Real-Time Scheduler with Recovery from Transient Faults and Its Implementation
IEEE Transactions on Software Engineering
A Utilization Bound for Aperiodic Tasks and Priority Driven Scheduling
IEEE Transactions on Computers
Operating Systems for Reconfigurable Embedded Platforms: Online Scheduling of Real-Time Tasks
IEEE Transactions on Computers
Real Time Scheduling Theory: A Historical Perspective
Real-Time Systems
Adaptive Resource Utilization via Feedback Control for Streaming Applications
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
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
Dynamic workload management for very large data warehouses: juggling feathers and bowling balls
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Real-time scheduling with quality of security constraints
International Journal of High Performance Computing and Networking
CellSs: Scheduling techniques to better exploit memory hierarchy
Scientific Programming - High Performance Computing with the Cell Broadband Engine
Power saving and fault-tolerance in real-time critical embedded systems
Journal of Systems Architecture: the EUROMICRO Journal
Deadline compliance, predictability, and on-line optimization in real-time problem solving
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Rate admission control for hard real-time task scheduling
HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
Static scheduling with interruption costs for computer vision applications
VECPAR'02 Proceedings of the 5th international conference on High performance computing for computational science
Online algorithms for advance resource reservations
Journal of Parallel and Distributed Computing
Hi-index | 0.03 |
We consider the problem of scheduling a set of n preemptable tasks in a system having r resources. Each task has an arbitrary, but known, worst case processing time and a deadline, and may request simultaneous use of a number of resources. A resource can be used either in shared mode or exclusive mode. In this paper, we develop and evaluate algorithms for determining whether or not a set of preemptive tasks is schedulable in such a real-time system, and if so, determining a schedule for it. This scheduling problem is known to be computationally intensive. In many real-time application environments, tasks are scheduled dynamically, and hence the scheduling algorithms used must have low run-time costs. To keep run-time costs low, we propose the use of suboptimal but practical algorithms that employ computationally simple heuristics. The computational complexity of our algorithms for scheduling n tasks in a system having r resources is O(rn2), which is very much lower than that of known optimal algorithms. We report on the results of simulation studies performed on such heuristic preemptive scheduling algorithms and the sensitivity of the performance of the algorithms with respect to various scheduling parameters. These studies show that due to the complexity of the problem, straightforward heuristics do not perform satisfactorily. However, an algorithm that uses combinations of such heuristics in conjunction with limited backtracks works very well.