By Topic

2006 27th IEEE International Real-Time Systems Symposium (RTSS'06)

Date 5-8 Dec. 2006

Filter Results

Displaying Results 1 - 25 of 52
  • 27th IEEE International Real-Time Systems Symposium - Cover

    Publication Year: 2006, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (55 KB)
    Freely Available from IEEE
  • 27th IEEE International Real-Time Systems Symposium-Title

    Publication Year: 2006, Page(s):i - iii
    Request permission for commercial reuse | PDF file iconPDF (36 KB)
    Freely Available from IEEE
  • 27th IEEE International Real-Time Systems Symposium-Copyright

    Publication Year: 2006, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (43 KB)
    Freely Available from IEEE
  • 27th IEEE International Real-Time Systems Symposium - TOC

    Publication Year: 2006, Page(s):v - x
    Request permission for commercial reuse | PDF file iconPDF (76 KB)
    Freely Available from IEEE
  • Preface

    Publication Year: 2006, Page(s): xi
    Request permission for commercial reuse | PDF file iconPDF (36 KB) | HTML iconHTML
    Freely Available from IEEE
  • Conference Committees

    Publication Year: 2006, Page(s): xii
    Request permission for commercial reuse | PDF file iconPDF (46 KB)
    Freely Available from IEEE
  • Work in Progress Session [breaker page]

    Publication Year: 2006, Page(s): xv
    Request permission for commercial reuse | PDF file iconPDF (39 KB) | HTML iconHTML
    Freely Available from IEEE
  • Reviewers

    Publication Year: 2006, Page(s): xvii
    Request permission for commercial reuse | PDF file iconPDF (34 KB)
    Freely Available from IEEE
  • Sensornet 2.0: The New Frontier

    Publication Year: 2006, Page(s): xviii
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (39 KB) | HTML iconHTML

    Feng Zhao (http://research.microsoft.com/~zhao) is a Principal Researcher at Microsoft Research, where he manages the Networked Embedded Computing Group. He received his PhD in Electrical Engineering and Computer Science from MIT and has taught at Stanford University and Ohio State University. Dr. Zhao was a Principal Scientist at Xerox PARC and directed PARC¿s sensor network research effort. He ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Run-Time Services for Hybrid CPU/FPGA Systems on Chip

    Publication Year: 2006, Page(s):3 - 12
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (889 KB) | HTML iconHTML

    Modern FPGA devices, which include (multiple) processor core(s) as diffused IP on the silicon die, provide an excellent platform for developing custom multiprocessor systems-on-programmable chip (MPSoPC) architectures. As researchers are investigating new methods for migrating portions of applications into custom hardware circuits, it is also critical to develop new run-time service frameworks to ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • MCGREP--A Predictable Architecture for Embedded Real-Time Systems

    Publication Year: 2006, Page(s):13 - 24
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (179 KB) | HTML iconHTML

    Real-time systems design involves many important choices, including that of the processor. The fastest processors achieve performance by utilizing architectural features that make them unpredictable, leading to difficulties proving offline that application process deadlines will be met, in the worst-case. Utilizing slower, more predictable processors, may not provide sufficient instruction through... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Interface-Based Rate Analysis of Embedded Systems

    Publication Year: 2006, Page(s):25 - 34
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (230 KB) | HTML iconHTML

    Interface-based design is now considered to be one of the keys to tackling the increasing complexity of modern embedded systems. The central idea is that different components comprising such systems can be developed independently and a system designer can connect them together only if their interfaces match, without knowing the details of their internals. We use the concept of rate interfaces for ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Emprical Evaluation of Memory Management Alternatives for Real-Time Java

    Publication Year: 2006, Page(s):35 - 46
    Cited by:  Papers (2)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1914 KB) | HTML iconHTML

    Memory management is a critical issue for correctness and performance of hard-real time systems. Java environments usually incorporate high-throughput garbage collection algorithms, but these algorithms can induce pause times in excess of 100 milliseconds. This is not acceptable for a real-time system. Two approaches for remedying this problem are being investigated. The pause times can be bounded... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Programming Execution-Time Servers in Ada 2005

    Publication Year: 2006, Page(s):47 - 56
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (227 KB) | HTML iconHTML

    Much of the research on scheduling schemes is prevented from being used in practice by the lack of implementations that provide the necessary abstractions. An example of this is the support of execution-time servers. Apart for a single mechanism (the sporadic server), which is defined in the POSIX standard, these important building blocks are not available to the system developer. Over the last fe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automatic Derivation of Loop Bounds and Infeasible Paths for WCET Analysis Using Abstract Execution

    Publication Year: 2006, Page(s):57 - 66
    Cited by:  Papers (23)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (843 KB) | HTML iconHTML

    Static worst-case execution time (WCET) analysis is a technique to derive upper bounds for the execution times of programs. Such bounds are crucial when designing and verifying real-time systems. A key component for statically deriving safe and tight WCET bounds is information on the possible program flow through the program. Such flow information can be provided manually by user annotations, or a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Faster Verification of RTL-Specified Systems via Decomposition and Constraint Extension

    Publication Year: 2006, Page(s):67 - 76
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (491 KB) | HTML iconHTML

    Embedded and real-time systems are increasingly common and complex, requiring formal specification and verification in order to guarantee their satisfaction of desirable safety and timing requirements. Real-time logic (RTL) has been used to capture both the specification of a real-time system and the desirable safety assertions with respect to this system specification. A verification procedure th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hard Real-Time Hybrid Garbage Collection with Low Memory Requirements

    Publication Year: 2006, Page(s):77 - 88
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (614 KB) | HTML iconHTML

    Real-time garbage collection algorithms are usually criticised for their high memory requirements. Even when consuming nearly 50% of CPU time, some garbage collectors ask for at least twice the memory as really needed. This paper explores the fundamental reason for this problem and proposes a new performance indicator for the evaluation of real-time garbage collection algorithms. Use of this perfo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel Real-Time Task Scheduling on Multicore Platforms

    Publication Year: 2006, Page(s):89 - 100
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (257 KB) | HTML iconHTML

    We propose a scheduling method for real-time systems implemented on multicore platforms that encourages individual threads of multithreaded real-time tasks to be scheduled together. When such threads are cooperative and share a common working set, this method enables more effective use of on-chip shared caches View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Optimal Real-Time Scheduling Algorithm for Multiprocessors

    Publication Year: 2006, Page(s):101 - 110
    Cited by:  Papers (47)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (270 KB) | HTML iconHTML

    We present an optimal real-time scheduling algorithm for multiprocessors $one that satisfies all task deadlines, when the total utilization demand does not exceed the utilization capacity of the processors. The algorithm called LLREF, is designed based on a novel abstraction for reasoning about task execution behavior on multiprocessors: the time and local execution time domain plane (or T-L plane... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • LITMUS^RT : A Testbed for Empirically Comparing Real-Time Multiprocessor Schedulers

    Publication Year: 2006, Page(s):111 - 126
    Cited by:  Papers (45)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (461 KB) | HTML iconHTML

    We present a real-time, Linux-based testbed called LITMUS, which we have developed for empirically evaluating multiprocessor real-time scheduling algorithms. We also present the results from such an evaluation, in which partitioned earliest-deadline-first (EDF) scheduling, preemptive and nonpreemptive global EDF scheduling, and two variants of the global PD2 Pfair algorithm were considered. The te... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Pattern for Adaptive Behavior in Safety-Critical, Real-Time Middleware

    Publication Year: 2006, Page(s):127 - 136
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (268 KB) | HTML iconHTML

    Patterns are a valuable method for communicating software engineering expertise about proven solutions for common problems. This paper evaluates the use of domain-independent patterns in a case study of Etherware, a middleware for networked control with a real-time, safety-critical applications model. The case study illustrates the positive and negative impact that four existing patterns have on a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed Utilization Control for Real-Time Clusters with Load Balancing

    Publication Year: 2006, Page(s):137 - 146
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (259 KB) | HTML iconHTML

    Previous years have seen rapid growth of online services that rely on large-scale server clusters to handle high volume of requests. Such clusters must adaptively control the CPU utilizations of many processors in order to maintain desired soft real-time performance and prevent system overload in face of unpredictable workloads. This paper presents DUC-LB, a novel distributed utilization control a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • RTSAT-- An Optimal and Efficient Approach to the Task Allocation Problem in Distributed Architectures

    Publication Year: 2006, Page(s):147 - 158
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (326 KB) | HTML iconHTML

    We present an advanced SAT-based approach to the task and message allocation problem of distributed real-time systems. In contrast to the heuristic approaches usually applied to this problem, our approach is guaranteed to find an optimal allocation for realistic task systems running on complex target architectures. Our method is based on the transformation of such scheduling problems into nonlinea... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sustainable Scheduling Analysis

    Publication Year: 2006, Page(s):159 - 168
    Cited by:  Papers (32)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (199 KB) | HTML iconHTML

    A schedulability test is defined to be sustainable if any task system deemed schedulable by the test remains so if it behaves "better" than mandated by its system specifications. We provide a formal definition of sustainability, and subject the concept to systematic analysis in the context of the uniprocessor scheduling of periodic and sporadic task systems. We argue that it is in general good eng... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal Dimensioning of a Constant Bandwidth Server

    Publication Year: 2006, Page(s):169 - 177
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (498 KB) | HTML iconHTML

    The constant bandwidth server (CBS) is an effective scheduling technique frequently used to handle overruns and implement resource reservation in real-time systems where tasks have variable execution requirements. The behavior of the server is tuned by two parameters: the server bandwidth, which defines the fraction of the processor allocated to the task, and the server period, which defines the t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.