| 1. |
- Pop, Paul, 1974-, et al.
(författare)
-
Schedulability-Driven Frame Packing for Multi-Cluster Distributed Embedded Systems
- 2003
-
Ingår i: LCTES '03 Proceedings of the 2003 ACM SIGPLAN conference on Language, compiler, and tool for embedded systems. - New York, NY, United States : Association for Computing Machinery (ACM). - 1581136471 ; , s. 113-122
-
Konferensbidrag (övrigt vetenskapligt/konstnärligt)abstract
- We present an approach to frame packing for multi-cluster distributed embedded systems consisting of time-triggered and event-triggered clusters, interconnected via gateways. In our approach, the application messages are packed into frames such that the application is schedulable. Thus, we have also proposed a schedulability analysis for applications consisting of mixed event-triggered and time-triggered processes and messages, and a worst case queuing delay analysis for the gateways, responsible for routing inter-cluster traffic. Optimization heuristics for frame packing aiming at producing a schedulable system have been proposed. Extensive experiments and a real-life example show the efficiency of our frame-packing approach.
|
|
| 2. |
- Robertz, Sven, et al.
(författare)
-
Time-triggered garbage collection - Robust and adaptive real-time GC scheduling for embedded systems
- 2003
-
Ingår i: ACM SIGPLAN Notices (Proceedings of the 2003 ACM SIGPLAN conference on Language, compiler, and tool support for embedded systems). - : Association for Computing Machinery (ACM). - 0362-1340 .- 1558-1160. - 1581136471 ; 38:7, s. 93-102
-
Konferensbidrag (refereegranskat)abstract
- The advent of Java and similar languages on the real-time system scene necessitates the development of efficient strategies for scheduling the work of a garbage collector in a non-intrusive way. We propose a scheduling strategy, time-triggered garbage collection, based on assigning the collector a deadline for when it must complete its current cycle. We show that a time-triggered CC with fixed deadline can have equal or better real-time performance than an allocation-triggered CC, which is the standard approach to real-time CC. Also, by using a deadline-based approach, the CC scheduling and, consequently, real-time performance, is independent of a complex and error-prone CC work metric. Time-triggered CC allows a more high-level view on CC scheduling; we look at the CC cycle level rather than at the individual work increments. This makes it possible to schedule CC as any other thread. It is also suitable for making the CC auto-tuning by dynamically adjusting its deadline as necessary. We have implemented our approach in a run-time system for Java and present experimental data to support the practical feasibility of the approach.
|
|
