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
Distributed Scheduling of Tasks with Deadlines and Resource Requirements
IEEE Transactions on Computers
Some Results of the Earliest Deadline Scheduling Algorithm
IEEE Transactions on Software Engineering
Preemptive Scheduling with Release Times, Deadlines, and Due Times
Journal of the ACM (JACM)
Polynomial complete scheduling problems
SOSP '73 Proceedings of the fourth ACM symposium on Operating system principles
Proceedings of the 1992 ACM/IEEE conference on Supercomputing
Models of machines and computation for mapping in multicomputers
ACM Computing Surveys (CSUR)
Allocation and Scheduling of Precedence-Related Periodic Tasks
IEEE Transactions on Parallel and Distributed Systems
Sensitivity-driven co-synthesis of distributed embedded systems
ISSS '95 Proceedings of the 8th international symposium on System synthesis
A modular approach to real-time synchronization
ACM SIGPLAN OOPS Messenger - Special issue: object-oriented real-time systems
Scheduling Soft Real-Time Jobs Over Dual Non-Real-Time Servers
IEEE Transactions on Parallel and Distributed Systems
Object-oriented cosynthesis of distributed embedded systems
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Static timing analysis of embedded software
DAC '97 Proceedings of the 34th annual Design Automation Conference
Scheduling policies to support distributed 3D multimedia applications
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
A Fault-Tolerant Dynamic Scheduling Algorithm for Multiprocessor Real-Time Systems and Its Analysis
IEEE Transactions on Parallel and Distributed Systems
Predictable Threads for Dynamic, Hard Real-Time Environments
IEEE Transactions on Parallel and Distributed Systems
The Spring System: Integrated Support for Complex Real-TimeSystems
Real-Time Systems
To Schedule or to Execute: Decision Support and PerformanceImplications
Real-Time Systems
Scheduling Distributed Real-Time Tasks with Minimum Jitter
IEEE Transactions on Computers
Proceedings of the conference on Design, automation and test in Europe
Teaching students to use genetic algorithms to solve optimization problems
Proceedings of the seventh annual consortium for computing in small colleges central plains conference on The journal of computing in small colleges
Scheduling best-effort and real-time pipelined applications on time-shared clusters
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Real-Time Processing in Client-Server Databases
IEEE Transactions on Computers
An architectural co-synthesis algorithm for distributed, embedded computing systems
Readings in hardware/software co-design
Containment units: a hierarchically composable architecture for adaptive systems
Proceedings of the 10th ACM SIGSOFT symposium on Foundations of software engineering
Containment units: a hierarchically composable architecture for adaptive systems
ACM SIGSOFT Software Engineering Notes
Parallel Processing for Real-Time Simulation: A Case Study
IEEE Parallel & Distributed Technology: Systems & Technology
The Spring Kernel: A New Paradigm for Real-Time Systems
IEEE Software
Resource Reclaiming in Multiprocessor Real-Time Systems
IEEE Transactions on Parallel and Distributed Systems
Optimizing Computing Costs Using Divisible Load Analysis
IEEE Transactions on Parallel and Distributed Systems
An Efficient Dynamic Scheduling Algorithm for Multiprocessor Real-Time Systems
IEEE Transactions on Parallel and Distributed Systems
Engineering and Analysis of Fixed Priority Schedulers
IEEE Transactions on Software Engineering
A real-time parallel scheduler for the imprecise computation model
Parallel and distributed real-time systems
An Adaptive Value-Based Scheduler andIts RT-Linux Implementation
HiPC '02 Proceedings of the 9th International Conference on High Performance Computing
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
A Reliability-Aware Value-Based Scheduler for Dynamic Multiprocessor Real-Time Systems
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Dynamic Task Scheduling with Precedence Constraints and Communication Delays
PaCT '999 Proceedings of the 5th International Conference on Parallel Computing Technologies
BeeHive: Global Multimedia Database Support for Dependable, Real-Time Applications
ARTDB '97 Proceedings of the Second International Workshop on Active, Real-Time, and Temporal Database Systems
Applying Real-Time Scheduling Techniques to Software Processes: A Position Paper
EWSPT '01 Proceedings of the 8th European Workshop on Software Process Technology
Scheduling Fault-Tolerant Programs on Multiple Processors to Maximize Schedule Reliability
SAFECOMP '99 Proceedings of the 18th International Conference on Computer Computer Safety, Reliability and Security
Integrated scheduling of tasks and messages in distributed real-time systems
Engineering of distributed control systems
Evaluation of Process Scheduling Mechanism for a Web Server Based on Its Behavior while Executing
APSEC '99 Proceedings of the Sixth Asia Pacific Software Engineering Conference
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
On-line scheduling of scalable real-time tasks on multiprocessor systems
Journal of Parallel and Distributed Computing
Multimedia Wireless Interactive and Collaborative Telecom Services
ICDCSW '04 Proceedings of the 24th International Conference on Distributed Computing Systems Workshops - W7: EC (ICDCSW'04) - Volume 7
Efficient overloading techniques for primary-backup scheduling in real-time systems
Journal of Parallel and Distributed Computing
Real Time Scheduling Theory: A Historical Perspective
Real-Time Systems
Real-Time Systems
Efficient processing of client transactions in real-time
Distributed and Parallel Databases
Efficient Assignment and Scheduling for Heterogeneous DSP Systems
IEEE Transactions on Parallel and Distributed Systems
Addressing Sporadic Contention on Shared Computing Clusters
HPCASIA '05 Proceedings of the Eighth International Conference on High-Performance Computing in Asia-Pacific Region
Engineering grid applications and middleware for high performance
WOSP '07 Proceedings of the 6th international workshop on Software and performance
Practical algorithms for scheduling video data in a local area network environment
The Journal of Supercomputing
Efficient task replication and management for adaptive fault tolerance in mobile Grid environments
Future Generation Computer Systems - Special section: Information engineering and enterprise architecture in distributed computing environments
Fair Scheduling Algorithms in Grids
IEEE Transactions on Parallel and Distributed Systems
The utilization bound of uniprocessor preemptive slack-monotonic scheduling is 50%
Proceedings of the 2008 ACM symposium on Applied computing
Resource management using multiple feedback loops in soft real-time distributed object systems
Journal of Systems and Software
Coordination Mechanism for optimized provision of services in an area
AIKED'08 Proceedings of the 7th WSEAS International Conference on Artificial intelligence, knowledge engineering and data bases
Achieving efficiency, quality of service and robustness in multi-organizational Grids
Journal of Systems and Software
Cost minimization while satisfying hard/soft timing constraints for heterogeneous embedded systems
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Future Generation Computer Systems
Real-time scheduling of divisible loads in cluster computing environments
Journal of Parallel and Distributed Computing
Independent tasks scheduling based on genetic algorithm in cloud computing
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
An open computing resource management framework for real-time computing
HiPC'08 Proceedings of the 15th international conference on High performance computing
Early schedulability analysis with timed use case maps
SDL'09 Proceedings of the 14th international SDL conference on Design for motes and mobiles
Managing irregular workloads of cooperatively shared computing clusters
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
A task replication and fair resource management scheme for fault tolerant grids
EGC'05 Proceedings of the 2005 European conference on Advances in Grid Computing
Adaptive management framework for scientific workflow applications
Proceedings of the 6th International Conference on Ubiquitous Information Management and Communication
Scheduling real-time divisible loads with advance reservations
Real-Time Systems
Efficient real-time divisible load scheduling
Journal of Parallel and Distributed Computing
Requirement-aware strategies for scheduling real-time divisible loads on clusters
Journal of Parallel and Distributed Computing
Hi-index | 0.01 |
Efficient scheduling algorithms based on heuristic functions are developed for scheduling a set of tasks on a multiprocessor system. The tasks are characterized by worst-case computation times, deadlines, and resources requirements. Starting with an empty partial schedule, each step of the search extends the current partial schedule by including one of the tasks yet to be scheduled. The heuristic functions used in the algorithm actively direct the search for a feasible schedule, i.e. they help choose the task that extends the current partial schedule. Two scheduling algorithms are evaluated by simulation. To extend the current partial schedule, one of the algorithms considers, at each step of the search, all the tasks that are yet to be scheduled as candidates. The second focuses its attention on a small subset of tasks with the shortest deadlines. The second algorithm is shown to be very effective when the maximum allowable scheduling overhead is fixed. This algorithm is hence appropriate for dynamic scheduling in real-time systems.