Analysis of Hard Real-Time Systems
| dc.contributor.author | Moitra, Abha | en_US |
| dc.date.accessioned | 2007-04-23T17:10:20Z | |
| dc.date.available | 2007-04-23T17:10:20Z | |
| dc.date.issued | 1985-07 | en_US |
| dc.description.abstract | In this paper we study hard real-time systems: systems where strict time deadlines have to be met. We analyze a special case as well as a general model for hard real-time systems and study pre-emptive, static, scheduling policies for a single processor. The analysis is exact and can handle any arbitrary choice of strict deadlines. For any specification of a hard real-time system, a feasible priority assignment is one where all deadlines are met. An optimal scheduling algorithm is an algorithm that always produces a feasibile priority assignment if one exists. For both the special and general model we present an optimal scheduling algorithm. | en_US |
| dc.format.extent | 1519369 bytes | |
| dc.format.extent | 318480 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR85-693 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/6533 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Cornell University | en_US |
| dc.subject | computer science | en_US |
| dc.subject | technical report | en_US |
| dc.title | Analysis of Hard Real-Time Systems | en_US |
| dc.type | technical report | en_US |