Fault-tolerant distributed real-time scheduling
| dc.contributor.author | Srinivasan, Anand | en_US |
| dc.date.accessioned | 2024-08-15T18:24:48Z | |
| dc.date.available | 2024-08-15T18:24:48Z | |
| dc.date.copyright | 1991 | en_US |
| dc.date.issued | 1991 | |
| dc.degree.department | Department of Computer Science | |
| dc.degree.level | Master of Science M.Sc. | en |
| dc.description.abstract | Hard Real-Time Systems are employed in highly complex and time-critical applications where a high degree of fault-tolerance is a mandatory feature. A distributed algorithm for providing fault-tolerant optimal schedule in a simply periodic distributed real-time system is proposed. Each job is serviced by a primary or an alternate algorithm. The primary algorithm provides a desirable service that may not satisfy the timing constraints, whereas the alternate algorithm provides an acceptable service that always satisfies the timing constraints. After invoking an optimal scheduler in each individual node, the algorithm tries to schedule additional primaries on other nodes. Since primaries provide more accurate results, the distributed scheduling algorithm achieves better result accuracy without sacrificing the timing accuracy. The algorithm is first introduced and then applied to virtual ring network and binary n-cube interconnection network. A dynamic scheduler which enhances the run-time performance of the previously scheduled jobs, is also described. The results of performance tests for various randomly generated data are also given. | |
| dc.format.extent | 121 pages | |
| dc.identifier.uri | https://hdl.handle.net/1828/19770 | |
| dc.rights | Available to the World Wide Web | en_US |
| dc.title | Fault-tolerant distributed real-time scheduling | en_US |
| dc.type | Thesis | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- SRINIVAASAN_ANAND_MSc_1991_525011.pdf
- Size:
- 1.99 MB
- Format:
- Adobe Portable Document Format