Recovering from Distributable Thread Failures with Assured Timeliness in Real-Time Distributed Systems

Curley, Edward; Anderson, Jonathan; Ravindran, Binoy; Jensen, E. Douglas

doi:10.1109/srds.2006.38

Cited by 18 publications

(14 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Binoy Ravindran, Edward Curley, Jonathan Anderson, and E. Douglas Jensen who considered the problem of recovering from failures of distributable threads in distributed real-time systems. They presented a scheduling algorithm called HUA and two thread integrity protocols called D-TPR and W-TPR [5].…”

Section: Related Workmentioning

confidence: 99%

Developing Fault Tolerance Integrity Protocol for Distributed Real Time Systems

Abdullah¹,

Sallow²

2013

AL-Rafidain Journal of Computer Sciences and Mathematics

View full text Add to dashboard Cite

In the distributed real time systems, tasks must meet their deadline even in the presence of hardware/software faults. Fault tolerance in distributed real time systems refers to the ability of the system to meet the tasks deadline and to detect their failure and recover them. In this paper, we considered the problem of fault tolerance and developed a fault tolerance protocol called DRT-FTIP (Distributed Real Time -Fault Tolerance Integrity Protocol).This protocol increases the integrity of the scheduling in distributed real time systems. ‫متكامل‬ ‫بروتكول‬ ‫تطوير‬‫الموزعة‬ ‫الحقيقي‬ ‫الزمن‬ ‫أنظمة‬ ‫في‬ ‫لألخطاء‬ ‫كاشف‬ ‫عبد‬ ‫بشير‬ ‫ضحى‬ ‫هللا‬ ‫سلو‬ ‫اميرة‬ ‫ياضيات‬ ‫الر‬ ‫و‬ ‫الحاسوب‬ ‫علوم‬ ‫كلية‬ ، ‫الموصل‬ ‫جامعة‬ ‫ت‬ ‫ا‬ ‫البحث:‬ ‫استالم‬ ‫ريخ‬ 21 \ 10 \ 2012 ‫ت‬ ‫ا‬ ‫البحث‬ ‫قبول‬ ‫ريخ‬ : 30 \ 01 \ 2013 ‫ا‬ ‫لمل‬ ‫خص‬ ‫الحقيقي‬ ‫الوقت‬ ‫أنظمة‬ ‫في‬ ‫الموزعة‬ ‫هنالك‬ ‫كان‬ ‫ان‬ ‫و‬ ‫حتى‬ ‫المحدد‬ ‫وقتها‬ ‫في‬ ‫تنجز‬ ‫أن‬ ‫الضروري‬ ‫من‬ ‫المهام‬ ‫بعض‬ ‫ا‬ ‫على‬ ‫النظام‬ ‫ة‬ ‫قدر‬ ‫يعني‬ ‫الموزعة‬ ‫الحقيقي‬ ‫الزمن‬ ‫أنظمة‬ ‫في‬ ‫بالخطأ‬ ‫التحكم‬ ‫البرمجية.‬ ‫أو‬ ‫المادية‬ ‫األخطاء‬ ‫من‬ ‫في‬ ‫وتجاوزها.‬ ‫األخطاء‬ ‫اكتشاف‬ ‫و‬ ‫للمهام‬ ‫النهائية‬ ‫الحدود‬ ‫تحقيق‬ ‫التحكم‬ ‫مشكلة‬ ‫االعتبار‬ ‫بنظر‬ ‫األخذ‬ ‫تم‬ ‫البحث‬ ‫هذا‬ ‫ب‬ ‫سمي‬ ‫بالخطأ‬ ‫التحكم‬ ‫بروتوكول‬ ‫تطوير‬ ‫وتم‬ ‫باألخطاء‬ ‫ـ‬ ‫الحقيقي‬ ‫الزمن‬ ‫ألنظمة‬ ‫المتكامل‬ ‫بالخطأ‬ ‫التحكم‬ ‫(بروتوكول‬ ‫الموزعة).‬ ‫عمل‬ ‫الموزعة.‬ ‫الحقيقي‬ ‫الزمن‬ ‫ألنظمة‬ ‫الجدولة‬ ‫تكامل‬ ‫يادة‬ ‫ز‬ ‫على‬ ‫المقترح‬ ‫البروتوكول‬ ‫المفتاحية:‬ ‫الكلمات‬ ‫ال‬ ‫بروتكول‬ ‫الجدولة،‬ ‫بالخطأ،‬ ‫التحكم‬ ‫الحقيقي،‬ ‫زمن‬

show abstract

Section: Related Workmentioning

confidence: 99%

Developing Fault Tolerance Integrity Protocol for Distributed Real Time Systems

Abdullah¹,

Sallow²

2013

AL-Rafidain Journal of Computer Sciences and Mathematics

View full text Add to dashboard Cite

show abstract

“…This abort model differs from previous authors in two points [39], [42], [75]. First, we do not assume immediate invocation of the abort handler upon resumption of execution.…”

Section: Abort Modelmentioning

confidence: 99%

An experimental evaluation of the scalability of real-time scheduling algorithms on large-scale multicore platforms

Dellinger

Lindsay

Ravindran

2012

ACM J. Exp. Algorithmics

Self Cite

View full text Add to dashboard Cite

This thesis studies the problem of experimentally evaluating the scaling behaviors of existing multicore real-time task scheduling algorithms on large-scale multicore platforms. As chip manufacturers rapidly increase the core count of processors, it becomes imperative that multicore real-time scheduling algorithms keep pace. Thus, it must be determined if existing algorithms can scale to these new high core-count platforms. Significant research exists on the theoretical performance of multicore real-time scheduling algorithms, but the vast majority of this research ignores the effects of scalability. It has been demonstrated that multicore real-time scheduling algorithms are feasible for small core-count systems (e.g. 8-core or less), but thus far the majority of the algorithmic research has never been tested on high core-count systems (e.g. 48-core or more).We present an experimental analysis of the scalability of 16 multicore real-time scheduling algorithms. These algorithms include global, clustered, and partitioned algorithms. We cover a broad range of algorithms, including deadline-based and utility accrual scheduling algorithms. These algorithms are compared under metrics including schedulability, tardiness, deadline satisfaction ratio, and utility accrual ratio. We consider multicore platforms ranging from 8 to 48 cores. The algorithms are implemented in a real-time Linux kernel we create called ChronOS. ChronOS is based on the Linux kernel's PREEMPT RT patch, which provides the underlying operating system kernel with real-time capabilities such as full kernel preemptibility and priority inheritance for kernel locking primitives. ChronOS extends these capabilities with a flexible, scalable real-time scheduling framework.Our study shows that it is possible to implement global fixed and dynamic priority and simple global utility accrual real-time scheduling algorithms which will scale to large-scale multicore platforms. Interestingly, and in contrast to the conclusion of prior research, our results reveal that some global scheduling algorithms (e.g. G-NP-EDF) is actually scalable on large core counts (e.g. 48). In our implementation, scalability is restricted by lock contention over the global schedule and the cost of inter-processor communication, rather than the global task queue implementation. We also demonstrate that certain classes of utility accrual algorithms such as the GUA class are inherently not scalable. We show that algorithms implemented with scalability as a first-order implementation goal are able to provide real-time guarantees on our 48-core platform.

show abstract

“…In this paper, we consider the problem of scheduling threads in the presence of the previously mentioned uncertainties, focusing particularly on (arbitrary) node failures. Past efforts on thread scheduling (e.g., [2,12,13]) consider a paradigm broadly called independent node scheduling, where threads are scheduled at nodes using propagated thread scheduling parameters and without any interaction with other nodes (thereby not considering node failures during scheduling). Fault-management is separately addressed by thread integrity protocols [14] that run concurrent to thread execution.…”

Section: Contributions: Assured Thread Timeliness In the Presence Of mentioning

confidence: 99%

“…Fault-management is separately addressed by thread integrity protocols [14] that run concurrent to thread execution. Thread integrity protocols detect failures of the thread abstraction, delivering failure-exception notifications [2,13]. This approach avoids the overhead of inter-node communication, and is therefore message-efficient and tractable (solely from the thread scheduling standpoint).…”

Section: Contributions: Assured Thread Timeliness In the Presence Of mentioning

confidence: 99%

On Distributed Real-Time Scheduling in Networked Embedded Systems in the Presence of Crash Failures

Ravindran

Anderson

Jensen

2007

Software Technologies for Embedded and Ubiquitous Systems

Self Cite

View full text Add to dashboard Cite

We consider the problem of scheduling distributable realtime threads in networked embedded systems that operate under runtime uncertainties including those on thread execution times, thread arrivals, and node failure occurrences. We present a distributed scheduling algorithm called CUA. We show that CUA satisfies thread time constraints in the presence of crash failures, is early-deciding, has an efficient message complexity of O(fn) (where f is the number of crashes that actually occur and n is the number of nodes), and is time-optimal with a time lower bound of O(D + fd + nk) (where D is the message delay upper bound, d is the failure detection bound, and k is the maximum number of threads). In crash-free runs, the algorithm constructs schedules within O(D + nk), and yields optimal total utility if nodes are also not overloaded. The algorithm is also "best-effort" in that a high importance thread that may arrive at any time has a very high likelihood for feasible completion (in contrast to classical admission control algorithms which favor feasible completion of admitted threads over admitting new ones, irrespective of thread importance).

show abstract

Recovering from Distributable Thread Failures with Assured Timeliness in Real-Time Distributed Systems

Cited by 18 publications

References 13 publications

Developing Fault Tolerance Integrity Protocol for Distributed Real Time Systems

Developing Fault Tolerance Integrity Protocol for Distributed Real Time Systems

An experimental evaluation of the scalability of real-time scheduling algorithms on large-scale multicore platforms

On Distributed Real-Time Scheduling in Networked Embedded Systems in the Presence of Crash Failures

Contact Info

Product

Resources

About