Guaranteed response times in a distributed hard-real-time environment
IEEE Transactions on Software Engineering
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
Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems
Journal of the ACM (JACM)
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Load balancing in homogeneous broadcast distributed systems
Proceedings of the Computer Network Performance Symposium
Distributed Scheduling of Tasks with Deadlines and Resource Requirements
Distributed Scheduling of Tasks with Deadlines and Resource Requirements
A semi distributed task allocation strategy for large hypercube supercomputers
Proceedings of the 1990 ACM/IEEE conference on Supercomputing
Intelligent mapping of communicating processes in distributed computing systems
Proceedings of the 1991 ACM/IEEE conference on Supercomputing
Performance prediction of distributed load balancing on multicomputer systems
Proceedings of the 1991 ACM/IEEE conference on Supercomputing
Semi-Distributed Load Balancing for Massively Parallel Multicomputer Systems
IEEE Transactions on Software Engineering
Fault-tolerant task management and load re-distribution on massively parallel hypercube systems
Proceedings of the 1992 ACM/IEEE conference on Supercomputing
A Simple Distributed Loop-Free Routing Strategy for Computer Communication Networks
IEEE Transactions on Parallel and Distributed Systems
Meet your destiny: a non-manipulable meeting scheduler
CSCW '94 Proceedings of the 1994 ACM conference on Computer supported cooperative work
NPSI adaptive synchronization algorithms for PDES
WSC '95 Proceedings of the 27th conference on Winter simulation
Object technologies and real-time scheduling
ACM SIGPLAN OOPS Messenger - Special issue: object-oriented real-time systems
Evaluation of Load Sharing in HARTS with Consideration of Its Communication Activities
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Computers
Analysis of Task Assignment Policies in Scalable Distributed Web-Server Systems
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
Resource Management Middleware for Dynamic, DependableReal-Time Systems
Real-Time Systems - Special issue on challenges in design and implementation of middlewares for real time systems
Static Analysis and Dynamic Steering of Time-Dependent Systems
IEEE Transactions on Software Engineering
IEEE Transactions on Software Engineering
Online Prediction of the Running Time of Tasks
Cluster Computing
The Spring Kernel: A New Paradigm for Real-Time Systems
IEEE Software
Incorporation of Optimal Timeouts into Distributed Real-Time Load Sharing
IEEE Transactions on Computers
IEEE Transactions on Computers
Closed Form Solutions for Bus and Tree Networks of Processors Load Sharing a Divisible Job
IEEE Transactions on Computers
Parametric Dispatching of Hard Real-Time Tasks
IEEE Transactions on Computers
A Reservation-Based Algorithm for Scheduling Both Periodic and Aperiodic Real-Time Tasks
IEEE Transactions on Computers
New Strategies for Assigning Real-Time Tasks to Multiprocessor Systems
IEEE Transactions on Computers
Load Sharing in Distributed Multimedia-on-Demand Systems
IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Knowledge and Data Engineering
Efficient Scheduling Algorithms for Real-Time Multiprocessor Systems
IEEE Transactions on Parallel and Distributed Systems
Analytic Models of Adaptive Load Sharing Schemes in Distributed Real-Time Systems
IEEE Transactions on Parallel and Distributed Systems
Strategies for Dynamic Load Balancing on Highly Parallel Computers
IEEE Transactions on Parallel and Distributed Systems
Design and Evaluation of Effective Load Sharing in Distributed Real-Time Systems
IEEE Transactions on Parallel and Distributed Systems
Adaptive resource management algorithms for periodic tasks in dynamic real-time distributed systems
Journal of Parallel and Distributed Computing
The group approach in cooperative work and in load balancing
Progress in computer research
Real-Time Performance Estimation for Dynamic, Distributed Real-Time Systems
ICCS '02 Proceedings of the International Conference on Computational Science-Part III
The Power of SIMDs in Real-Time Scheduling
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Fault-Tolerant Deadline-Monotonic Algorithm for Scheduling Hard-Real-Time Tasks
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
A Prediction-Based Real-Time Scheduling Advisor
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Real-Time and Active Databases: A Survey
ARTDB '97 Proceedings of the Second International Workshop on Active, Real-Time, and Temporal Database Systems
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
Quality of Service Management in Distributed Asynchronous Real-Time Systems
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
Adaptive Fault Tolerant Hospital Resource Scheduling
On the Move to Meaningful Internet Systems, 2002 - DOA/CoopIS/ODBASE 2002 Confederated International Conferences DOA, CoopIS and ODBASE 2002
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
Using system state information for adaptive state polling policy in distributed load balancing
PAS '97 Proceedings of the 2nd AIZU International Symposium on Parallel Algorithms / Architecture Synthesis
The many faces of multi-level real-time scheduling
RTCSA '95 Proceedings of the 2nd International Workshop on Real-Time Computing Systems and Applications
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
A Utilization Bound for Aperiodic Tasks and Priority Driven Scheduling
IEEE Transactions on Computers
The Dynamic Selection of Coordination Mechanisms
Autonomous Agents and Multi-Agent Systems
Real Time Scheduling Theory: A Historical Perspective
Real-Time Systems
Real-Time Systems
Resource Allocation for Periodic Applications in a Shipboard Environment
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 1 - Volume 02
Groups Partitioning Over CORBA for Cooperative Work
Cluster Computing
Adaptive resource management for dynamic distributed real-time applications
The Journal of Supercomputing
Dynamically mapping tasks with priorities and multiple deadlines in a heterogeneous environment
Journal of Parallel and Distributed Computing
Journal of Parallel and Distributed Computing
Scheduling real-time fork-join structures in cluster computing
International Journal of High Performance Computing and Networking
A dual-priority real-time multiprocessor system on FPGA for automotive applications
Proceedings of the conference on Design, automation and test in Europe
Resource Load Balancing Based on Multi-agent in ServiceBSP Model
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007
A multi-agent learning approach to online distributed resource allocation
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Enabling rich mobile applications: joint computation and communication scheduling
ACM SIGMOBILE Mobile Computing and Communications Review
Real-time scheduling of divisible loads in cluster computing environments
Journal of Parallel and Distributed Computing
Optimizing the fault tolerance capabilities of distributed real-time systems
ETFA'09 Proceedings of the 14th IEEE international conference on Emerging technologies & factory automation
Performance analysis for real-time grid systems on COTS operating systems
ICCS'03 Proceedings of the 2003 international conference on Computational science
An open computing resource management framework for real-time computing
HiPC'08 Proceedings of the 15th international conference on High performance computing
Coalition formation with spatial and temporal constraints
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 3 - Volume 3
Dynamic resource allocation of computer clusters with probabilistic workloads
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Non-cooperative, semi-cooperative, and cooperative games-based grid resource allocation
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
A Highly Scalable Decentralized Scheduler of Tasks with Deadlines
GRID '11 Proceedings of the 2011 IEEE/ACM 12th International Conference on Grid Computing
The design of the TAO real-time object request broker
Computer Communications
Efficient real-time divisible load scheduling
Journal of Parallel and Distributed Computing
A task routing approach to large-scale scheduling
Future Generation Computer Systems
Hi-index | 15.01 |
A set of four heuristic algorithms is presented to schedule tasks that have headlines and resource requirements in a distributed system. When a task arrives at a node, the local scheduler at that node attempts to guarantee that the task will complete execution on that node before its deadline. If the attempt fails, the scheduling components on individual nodes cooperate to determine which other node in the system has sufficient resource surplus to guarantee the task. Simulation studies are performed to compare the performance of these algorithms with respect to each other as well to two baselines. The first baseline is the noncooperative algorithm where a task that cannot be guaranteed locally is not sent to any other node. The second is an (ideal) algorithm that behaves exactly like the bidding algorithm but incurs no communication overheads. The simulation studies examine how communication delay, task laxity, load differences on the nodes, and task computation times affect the performance of the algorithms. The results show that distributed scheduling is effective even in a hard real-time environment and that the relative performance of these algorithms is a function of the system state.