Distributed Scheduling of Tasks with Deadlines and Resource Requirements
IEEE Transactions on Computers
| Hi-index | 0.01 |
IN THE DESIGN OF DISTRIBUTED COMPUTER SYSTEMS, THE SCHEDULING PROBLEM IS CONSIDERED TO BE AN IMPORTANT ONE AND HAS BEEN ADDRESSED BY MANY RESEARCH- ERS. HOWEVER, MOST APPROACHES HAVE NOT DEALT WITH TASKS'' `TIMING AND RE- SOURCE REQUIREMENTS''. IN THIS PAPER, WE DESCRIBE A SET OF HEURISTIC ALGOR- ITHMS TO SCHEDULE TASKS THAT HAVE DEADLINES AND RESOURCE REQUIREMENTS, IN A DISTRIBUTED SYSTEM. THESE ALGORITHMS ARE DYNAMIC AND FUNCTION IN A DECENT- RALIZED MANNER. WHEN A TASK ARRIVES AT A NODE, THE LOCAL SCHEDULER AT THAT NODE ATTEMPTS TO GUARANTEE THAT THE TASK WILL COMPLETE EXECUTION BEFORE ITS DEADLINE, ON THAT NODE. 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. IN THIS PAPER, FOUR ALGORITHMS FOR COOPERATION ARE EVALUATED. THEY DIFFER IN THE WAY A NODE TREATS A TASK THAT CAN NOT BE GUARANTEED LOCALLY: -THE RANDOM SCHEDULING ALGORITHM: THE TASK IS SENT TO A RANDOMLY SELECTED NODE. -THE FOCUSSED ADDRESSING ALGORITHM: THE TASK IS SENT TO A NODE THAT IS ESTIMATED TO HAVE SUFFICIENT SURPLUS TO COMPLETE THE TASK BEFORE ITS DEADLINE. -THE BIDDING ALGORITHM: THE TASK IS SENT TO A NODE BASED ON THE BIDS RE- CEIVED FOR THE TASK FROM NODES IN THE SYSTEM.