Name
Abstract | ||
|---|---|---|
In most cooperating teams of robots each robot has about the same set of sensors. Distributed sensor fusion is a technique that enables a team to take advantage of this redundancy to get a more complete view of the world with a better quality of the provided information. This paper sketches a fusion algorithm for laser-scanner data and derives the requirements that the execution of this algorithm has on the underlying system infrastructure, especially CPU-scheduling. It shows that a scheduling algorithm is needed that fulfills timing guarantees without using worst case execution times (WCET). The time-aware fault-tolerant (TAFT) scheduler provides this feature: each execution entity is divided into a MainPart, with possibly unknown timing behavior, and in an ExceptionPart, with known execution time. The integrated scheduling of both parts is done by a combination of two earliest deadline scheduling strategies. One focuses on enhancing the CPU utilization and the other on guaranteeing the timely execution. The paper discusses the proposed scheduling strategy, briefly describes its implementation in a real-time OS and presents results that show the achieved real-time behavior with an increased acceptance rate, a higher throughput, and a graceful degradation in transient overload situations compared to standard schedulers. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1109/IPDPS.2003.1213232 | IPDPS |
Keywords | Field | DocType |
timely execution,scheduling algorithm,integrated scheduling,fusion algorithm,fulfills timing guarantee,proposed scheduling strategy,earliest deadline scheduling strategy,execution entity,real-time os,robust scheduling,known execution time,fault tolerance,laser scanner,laser fusion,resource allocation,graceful degradation,throughput,worst case execution time,robots,degradation,real time,sensor fusion,fault tolerant,redundancy,robustness,cpu scheduling,resource manager | Fair-share scheduling,Computer science,Scheduling (computing),Parallel computing,Resource allocation,Rate-monotonic scheduling,Foreground-background,Dynamic priority scheduling,Earliest deadline first scheduling,Round-robin scheduling,Embedded system,Distributed computing | Conference |
ISSN | ISBN | Citations |
1530-2075 | 0-7695-1926-1 | 5 |
PageRank | References | Authors |
0.48 | 11 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Martin Gergeleit | 1 | 20 | 4.39 |
| Leandro Buss Becker | 2 | 113 | 22.52 |
| Edgar Nett | 3 | 345 | 54.29 |