By Topic

Real-Time Systems Symposium (RTSS), 2012 IEEE 33rd

Date 4-7 Dec. 2012

Filter Results

Displaying Results 1 - 25 of 46
  • [Front cover]

    Publication Year: 2012, Page(s): C4
    Request permission for commercial reuse | PDF file iconPDF (61 KB)
    Freely Available from IEEE
  • [Title page i]

    Publication Year: 2012, Page(s): i
    Request permission for commercial reuse | PDF file iconPDF (39 KB)
    Freely Available from IEEE
  • [Title page iii]

    Publication Year: 2012, Page(s): iii
    Request permission for commercial reuse | PDF file iconPDF (124 KB)
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2012, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (118 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2012, Page(s):v - vii
    Request permission for commercial reuse | PDF file iconPDF (150 KB)
    Freely Available from IEEE
  • Message from the Chairs

    Publication Year: 2012, Page(s): viii
    Request permission for commercial reuse | PDF file iconPDF (76 KB) | HTML iconHTML
    Freely Available from IEEE
  • Conference Committee

    Publication Year: 2012, Page(s):ix - xi
    Request permission for commercial reuse | PDF file iconPDF (93 KB)
    Freely Available from IEEE
  • Reviewers

    Publication Year: 2012, Page(s): xii
    Request permission for commercial reuse | PDF file iconPDF (68 KB)
    Freely Available from IEEE
  • Keynote

    Publication Year: 2012, Page(s): xiii
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (73 KB)

    Summary form only given. All widely used software and networking abstractions lack temporal semantics. The notion of correct execution of a program written in every widely-used programming language, in nearly every processor instruction-set, and the most widely used networking protocols today does not depend on timing. Timing properties emerge from an implementation, rather than being part of the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Investigation of Scratchpad Memory for Preemptive Multitasking

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

    We present a multitasking scratchpad memory reuse scheme (MSRS) for the dynamic partitioning of scratchpad memory between tasks in a preemptive multitasking system. We specify a means to compute the worst-case response time (WCRT) and schedulability of task sets executed using MSRS. Our scratchpad-related preemption delay (SRPD) is an analog of cache-related preemption delay (CRPD), proposed in pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Curbing Aggregate Member Flow Burstiness to Bound End-to-End Delay in Networks of TDMA Crossbar Real-Time Switches

    Publication Year: 2012, Page(s):14 - 25
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1277 KB) | HTML iconHTML

    To integrate the nowadays rapidly expanding distributed real-time systems, we need multi-hop real-time switched networks. A (if not "the") widely recognized/adopted real-time switch architecture is the TDMA crossbar real-time (TCRT) switch architecture. However, the original TCRT switch architecture assumes per-flow queueing. To support scalability, however, queue sharing (i.e. flow aggregation), ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Controlling Preemption for Better Schedulability in Multi-Core Systems

    Publication Year: 2012, Page(s):29 - 38
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (315 KB) | HTML iconHTML

    Interest in real-time multiprocessor scheduling has been rekindled as multi-core chips are increasingly used for embedded real-time systems. While tasks may be preemptive or non-preemptive (due to their transactional operations), deadline guarantees are usually made only for those task sets in each of which all tasks are preemptive or non-preemptive, not a mixture thereof, i.e., all or nothing. In... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal Fixed Priority Scheduling with Deferred Pre-emption

    Publication Year: 2012, Page(s):39 - 50
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (707 KB) | HTML iconHTML

    The schedulability of systems using fixed priority pre-emptive scheduling can be improved by the use of non-pre-emptive regions at the end of each task's execution, an approach referred to as deferred pre-emption. Choosing the appropriate length for the final non-pre-emptive region of each task is a trade-off between improving the worst-case response time of the task itself and increasing the amou... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extending Task-level to Job-level Fixed Priority Assignment and Schedulability Analysis Using Pseudo-deadlines

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

    In global real-time multiprocessor scheduling, a recent analysis technique for Task-level Fixed-Priority (TFP) scheduling has been shown to outperform many of the analyses for Job-level Fixed-Priority (JFP) scheduling on average. Since JFP is a generalization of TFP scheduling, and the TFP analysis technique itself has been adapted from an earlier JFP analysis, this result is counter-intuitive and... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Generalized Parallel Task Model for Recurrent Real-time Processes

    Publication Year: 2012, Page(s):63 - 72
    Cited by:  Papers (30)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (266 KB) | HTML iconHTML

    A model is considered for representing recurrent precedence-constrained tasks that are to execute on multiprocessor platforms. A recurrent task is specified as a directed a cyclic graph (DAG), a period, and a relative deadline. Each vertex of the DAG represents a sequential job, while the edges of the DAG represent precedence constraints between these jobs. All the jobs of the DAG are released sim... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed Sensing for High Quality Structural Health Monitoring Using Wireless Sensor Networks

    Publication Year: 2012, Page(s):75 - 84
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (369 KB) | HTML iconHTML

    In recent years, using wireless sensor networks (WSNs) for structural health monitoring (SHM) has attracted increasing attention. Traditional centralized SHM algorithms developed by civil engineers can achieve the highest damage detection quality since they have the raw data from all the sensor nodes. However, directly implementing these algorithms in a typical WSN is impractical considering the l... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • pCruise: Reducing Cruising Miles for Taxicab Networks

    Publication Year: 2012, Page(s):85 - 94
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (631 KB) | HTML iconHTML

    In taxicab industry, a long standing challenge is how to reduce taxicab's mileage spent without a fare, i.e., cruising mile. The current solution for this challenge usually requires the participation of the passengers. To solve the issue without the passengers involved, in this paper, we propose a cruising system, pCruise, for taxicab drivers to maximize theirs profits by finding the optimal route... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • RadioSense: Exploiting Wireless Communication Patterns for Body Sensor Network Activity Recognition

    Publication Year: 2012, Page(s):95 - 104
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (613 KB) | HTML iconHTML

    Automatically recognizing human activities in a body sensor network (BSN) enables many human-centric applications. Many current works recognize human activities through collecting and analyzing sensor readings from on-body sensor nodes. These sensing-based solutions face a dilemma. On one hand, to guarantee data availability and recognition accuracy, sensing-based solutions have to either utilize ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • RASS: A Portable Real-time Automatic Sleep Scoring System

    Publication Year: 2012, Page(s):105 - 114
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (358 KB) | HTML iconHTML

    It is a well known fact that the quality of sleep is an important factor in health-related quality of life (HRQoL), and people could prevent potential problems by tracking the quality of their sleep. Unfortunately sleep scoring, which is a systematic way to address the sleep staging as well as the scoring of arousals, respiratory, cardiac, and movement events, is usually conducted with specialized... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A PTAS for Assigning Sporadic Tasks on Two-type Heterogeneous Multiprocessors

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

    Consider the problem of determining a task-to-processor assignment for a given collection of implicit-deadline sporadic tasks upon a multiprocessor platform in which there are two distinct kinds of processors. We propose a polynomial-time approximation scheme (PTAS) for this problem. It offers the following guarantee: for a given task set and a given platform, if there exists a feasible task-to-pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient Admission Control for Enforcing Arbitrary Real-Time Demand-Curve Interfaces

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

    Server-based resource reservation protocols (e.g., periodic and bandwidth-sharing servers) have the advantage of providing temporal isolation between subsystems co-executing upon a shared processing platform. For many of these protocols, temporal isolation is often obtained at the price of over-provisioned reservations. Other more fine-grained approaches such as real-time calculus permit a precise... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Static Approximation Algorithms for Regularity-based Resource Partitioning

    Publication Year: 2012, Page(s):137 - 148
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (534 KB) | HTML iconHTML

    As a hierarchical real-time system framework, the Regularity-based Resource Partition Model allocates physical resources in time intervals determined by integral numbers of a time unit to tasks in different applications. A Regularity-based Resource Partition is characterized by its regularity and availability factor. An important problem is how to schedule a group of resource partitions with the s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quantifying the Effect of Rare Timing Events with Settling-Time and Overshoot

    Publication Year: 2012, Page(s):149 - 160
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (277 KB) | HTML iconHTML

    For hard real-time systems, worst-case timing models are employed to validate whether timeliness properties, such as meeting deadlines, are always satisfied. We argue that such a deadline-interface should be generalised in view of two separate motivations: (a) applications can tolerate bounded non-satisfaction of timeliness properties due to inherent robustness or relaxed quality requirements, and... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • QoS-Based Resource Allocation for Next-Generation Spacecraft Networks

    Publication Year: 2012, Page(s):163 - 172
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1147 KB) | HTML iconHTML

    Current spacecraft systems generally have monolithic structures, but a "fractionated" architecture is being considered for next generation spacecrafts. A fractionated spacecraft system is a cluster of independent modules that communicate wirelessly to maintain cluster flight formations and realize the functions usually performed by a monolithic satellite. The envisioned benefits of the fractionate... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Static and Dynamic Analysis of Timed Distributed Traces

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

    This paper presents an algorithm for checking global predicates from distributed traces of cyber-physical systems. For an individual agent, such as a mobile phone or a robot, a trace is a finite sequence of state observations and message histories. Each observation has a possibly inaccurate timestamp from the agent's local clock. The challenge is to symbolically over approximate the reachable stat... View full abstract»

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