Scheduling Tasks with Resource Requirements in Hard Real-Time Systems
IEEE Transactions on Software Engineering
Multiprocessor Online Scheduling of Hard-Real-Time Tasks
IEEE Transactions on Software Engineering
Scheduling Processes with Release Times, Deadlines, Precedence and Exclusion Relations
IEEE Transactions on Software Engineering
Algorithms for Scheduling Imprecise Computations
Computer - Special issue on real-time systems
A heuristic of scheduling parallel tasks and its analysis
SIAM Journal on Computing
Allocation and Scheduling of Precedence-Related Periodic Tasks
IEEE Transactions on Parallel and Distributed Systems
Journal of Parallel and Distributed Computing
Parallel Processing for Real-Time Simulation: A Case Study
IEEE Parallel & Distributed Technology: Systems & Technology
IEEE Transactions on Computers
Efficient Scheduling Algorithms for Real-Time Multiprocessor Systems
IEEE Transactions on Parallel and Distributed Systems
Resource Reclaiming in Multiprocessor Real-Time Systems
IEEE Transactions on Parallel and Distributed Systems
A Fault-Tolerant Dynamic Scheduling Algorithm for Multiprocessor Real-Time Systems and Its Analysis
IEEE Transactions on Parallel and Distributed Systems
A Reliability-Aware Value-Based Scheduler for Dynamic Multiprocessor Real-Time Systems
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Integrated scheduling of tasks and messages in distributed real-time systems
Engineering of distributed control systems
On-line scheduling of scalable real-time tasks on multiprocessor systems
Journal of Parallel and Distributed Computing
Efficient overloading techniques for primary-backup scheduling in real-time systems
Journal of Parallel and Distributed Computing
Adaptive Resource Management in Peer-to-Peer Middleware
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 2 - Volume 03
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
IEEE Transactions on Parallel and Distributed Systems
Fair Scheduling Algorithms in Grids
IEEE Transactions on Parallel and Distributed Systems
Real-time Task Scheduling Using Extended Overloading Technique for Multiprocessor Systems
DS-RT '07 Proceedings of the 11th IEEE International Symposium on Distributed Simulation and Real-Time Applications
Real-time scheduling with quality of security constraints
International Journal of High Performance Computing and Networking
Resource management using multiple feedback loops in soft real-time distributed object systems
Journal of Systems and Software
A decentralized strategy for genetic scheduling in heterogeneous environments
Multiagent and Grid Systems - Grid Computing, high performance and distributed applications
CellSs: Scheduling techniques to better exploit memory hierarchy
Scientific Programming - High Performance Computing with the Cell Broadband Engine
IEICE - Transactions on Information and Systems
Grid resource management policies for load-balancing and energy-saving by vacation queuing theory
Computers and Electrical Engineering
Computers and Electrical Engineering
Real-time scheduling of divisible loads in cluster computing environments
Journal of Parallel and Distributed Computing
Multi-round real-time divisible load scheduling for clusters
HiPC'08 Proceedings of the 15th international conference on High performance computing
Novel adaptive scheduling algorithm for computational grid
IMSAA'09 Proceedings of the 3rd IEEE international conference on Internet multimedia services architecture and applications
Dynamic resource allocation of computer clusters with probabilistic workloads
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Parallelized K-Means clustering algorithm for self aware mobile ad-hoc networks
Proceedings of the 2011 International Conference on Communication, Computing & Security
Utilization of map-reduce for parallelization of resource scheduling using MPI: PRS
Proceedings of the 2011 International Conference on Communication, Computing & Security
A decentralized strategy for genetic scheduling in heterogeneous environments
ODBASE'06/OTM'06 Proceedings of the 2006 Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, DOA, GADA, and ODBASE - Volume Part II
Towards self-managing qos-enabled peer-to-peer systems
Self-star Properties in Complex Information Systems
Work stealing strategies for parallel stream processing in soft real-time systems
ARCS'12 Proceedings of the 25th international conference on Architecture of Computing Systems
Scheduling real-time divisible loads with advance reservations
Real-Time Systems
Policy based resource allocation in IaaS cloud
Future Generation Computer Systems
Efficient real-time divisible load scheduling
Journal of Parallel and Distributed Computing
Resource Management in Real Time Distributed System with Security Constraints: A Review
International Journal of Distributed Systems and Technologies
Requirement-aware strategies for scheduling real-time divisible loads on clusters
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
Many time-critical applications require predictable performance and tasks in these applications have deadlines to be met. In this paper, we propose an efficient algorithm for nonpreemptive scheduling of dynamically arriving real-time tasks (aperiodic tasks) in multiprocessor systems. A real-time task is characterized by its deadline, resource requirements, and worst case computation time on p processors, where p is the degree of parallelization of the task. We use this parallelism in tasks to meet their deadlines and, thus, obtain better schedulability compared to nonparallelizable task scheduling algorithms. To study the effectiveness of the proposed scheduling algorithm, we have conducted extensive simulation studies and compared its performance with the myopic [8] scheduling algorithm. The simulation studies show that the schedulability of the proposed algorithm is always higher than that of the myopic algorithm for a wide variety of task parameters.