Show simple item record

dc.contributorMühendislik Fakültesi / Faculty of Engineering Bilgisayar Mühendisliği / Computer Engineeringtr_TR
dc.contributor.authorSwim, B. R.
dc.contributor.authorBenmaiza, M.
dc.contributor.authorTaylı, Murat
dc.contributor.authorWoodward, M. C.
dc.date.accessioned2018-12-18T13:30:38Z
dc.date.available2018-12-18T13:30:38Z
dc.date.issuedMayıs 1997
dc.identifier.issn1350-2387
dc.identifier.urihttps://hdl.handle.net/11413/4023
dc.identifier.urihttps://doi.org/10.1049/ip-cdt:19970825
dc.description.abstractFuture dynamic distributed hard real-time systems may control unpredictable environments, and will need predictable and flexible runtime systems that can handle unknown and changing task populations. In this extreme case not only is task scheduling dynamic, but the system topology and architecture might be adapted to unforeseen configurations. The paper addresses the difficult problem of dynamic distributed task scheduling. A new predictable dynamic deadline guarantee scheme has been designed and implemented in the authors' real-time distributed operating system (RTDOS). The algorithms have been proven to guarantee task deadlines even during transient overloads. RTDOS is designed to tackle unpredictable and highly dynamic environments; therefore its task model is quite unrestrictive, supporting periodic and aperiodic tasks both with arbitrary release times and deadlines. The authors place no restriction on the inter-arrival times between and aperiodic task instances. Moreover, their resource scheduling considers precedence constraints, device allocation and communication requirements. As a consequence, the results can be generalised and applied to many real-time domains. Furthermore, the complexity of the authors' schedulability test has been proved to be O(n). A domain-wide scheduler is described, which maintains its predicted maximum response time even when local nodes are under heavy load. Experimental results confirm the proven expectations of our scheduling scheme.
dc.language.isoen_UStr_TR
dc.publisherIET
dc.relationIEE Proceedings Computer and Digital Techniquestr_TR
dc.subjectComplexity Theory
dc.subjectComputational Complexity
dc.subjectPredictable Distributed Dynamic Scheduling
dc.subjectRTDOS
dc.subjectDynamic Distributed Hard Real-time Systems
dc.subjectFlexible Runtime Systems
dc.subjectSystem Topology
dc.subjectDynamic Distributed Task Scheduling
dc.subjectReal-Time Distributed Operating System
dc.subjectHighly Dynamic Environments
dc.subjectArbitrary Release Times
dc.subjectDeadlines
dc.subjectDevice Allocation
dc.subjectCommunication Requirements
dc.subjectSchedulability Tst
dc.subjectDomain-Wide Scheduler
dc.titlePredictable distributed Dynamic Scheduling in RTDOStr_TR
dc.typeconferenceObjecttr_TR
dc.contributor.authorID9351tr_TR


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record