Loading...
Please wait, while we are loading the content...
Similar Documents
Probabilistic Job Scheduling for Distributed Real-time Applications (1993)
| Content Provider | CiteSeerX |
|---|---|
| Author | Bestavros, Azer Spartiotis, Dimitrios |
| Description | We describe a heuristic for dynamically scheduling timeconstrained tasks in a distributed environment. When a task is submitted to a node, the scheduling software tries to schedule the task locally so as to meet its deadline. If that is not feasible, it tries to locate another node where this could be done with a high probability of success. Nodes in the system inform each other about their state (viz-a-viz the availability of free cycles) using a combination of broadcasting and gossiping. The performance of the proposed protocol is evaluated both analytically and via simulation. Based on our findings, we argue that keeping a diverse availability profile and using passive bidding (through gossiping) are both advantageous to distributed scheduling for real-time systems. 1 Introduction Loosely coupled, time-critical distributed systems are used to control physical processes in complex applications, such as controllers in aviation systems and nuclear power plants. Most tasks in such syst... |
| File Format | |
| Language | English |
| Publisher Date | 1993-01-01 |
| Publisher Institution | In Proceedings of the First IEEE Workshop on Real-Time Applications |
| Access Restriction | Open |
| Subject Keyword | Real-time System Distributed Environment Passive Bidding Free Cycle Probabilistic Job Scheduling Physical Process Scheduling Software Aviation System High Probability Complex Application Distributed Real-time Application Nuclear Power Plant Diverse Availability Profile |
| Content Type | Text |
| Resource Type | Article |
