26th IEEE International Real-Time Systems Symposium (RTSS'05)

5-8 Dec. 2005

Filter Results

Displaying Results 1 - 25 of 45
  • Proceedings. RTSS. 26th IEEE International Real-Time Systems Symposium

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

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

    Publication Year: 2005, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (42 KB)
    Freely Available from IEEE
  • 26th IEEE International Real-Time Systems Symposium - Table of contents

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

    Publication Year: 2005, Page(s):ix - x
    Request permission for commercial reuse | PDF file iconPDF (41 KB) | HTML iconHTML
    Freely Available from IEEE
  • Committees

    Publication Year: 2005, Page(s):xi - xiii
    Request permission for commercial reuse | PDF file iconPDF (49 KB)
    Freely Available from IEEE
  • list-reviewer

    Publication Year: 2005, Page(s): xiv
    Request permission for commercial reuse | PDF file iconPDF (26 KB)
    Freely Available from IEEE
  • Building robust wireless LAN for industrial control with DSSS-CDMA cellphone network paradigm

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

    Deploying wireless LAN for industrial control (IC-WLAN) has many benefits, such as mobility, low deployment cost and ease of reconfiguration. However, the top concern is robustness of wireless communications. Wireless control loops must be maintained under persistent adverse channel conditions, such as noise, large-scale path loss and fading. Many electro-magnetic interference sources in industria... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysing TDMA with slot skipping

    Publication Year: 2005, Page(s):10 pp. - 24
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (366 KB) | HTML iconHTML

    We propose a schedulability analysis for a particular class of time division multiple access (TDMA) networks, which we label as TDMA/SS. SS stands for slot skipping, reflecting the fact that a slot is skipped whenever it is not used. Hence, the next slot can start earlier in benefit of hard real-time traffic. In the proposed schedulability analysis, we assume knowledge of all message streams in th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A deferrable scheduling algorithm for real-time transactions maintaining data freshness

    Publication Year: 2005, Page(s):11 pp. - 37
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (599 KB) | HTML iconHTML

    Periodic update transaction model has been used to maintain freshness (or temporal validity) of real-time data. Period and deadline assignment has been the main focus in the past studies such as the more-less scheme by Xiong and Ramamrithan (2004) in which update transactions are guaranteed by the deadline monotonic scheduling algorithm by Leung and Whitehead (1982) to complete by their deadlines.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generalized performance management of multi-class real-time imprecise data services

    Publication Year: 2005, Page(s):12 pp. - 49
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (424 KB) | HTML iconHTML

    The intricacy of real-time data service management increases mainly due to the emergence of applications operating in open and unpredictable environments, increases in software complexity, and need for performance guarantees. In this paper we propose an approach for managing the quality of service of real-time databases that provide imprecise and differentiated services, and that operate in unpred... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Load balancing in bounded-latency content distribution

    Publication Year: 2005, Page(s):12 pp. - 61
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (458 KB) | HTML iconHTML

    In this paper we present a balanced data replication scheme that provides real-time latency bounds on content retrieval in content distribution networks. Many network applications have ever-increasing requirements on latency sensitive data services. Data replication services have been widely used as an important performance enhancement mechanism to reduce data access latency and throughput. We inv... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Preemptible atomic regions for real-time Java

    Publication Year: 2005, Page(s):10 pp. - 71
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (614 KB) | HTML iconHTML

    We present a new concurrency control abstraction for real-time systems called preemptible atomic regions (PARs). PARs a transactional mechanism that improves upon lock-based mutual exclusion in several ways. First, and foremost, PARs provide strong correctness guarantees. Any sequence of operations declared atomic will not suffer interference from other threads, even in the presence of programmer ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards feasible region calculus: an end-to-end schedulability analysis of real-time multistage execution

    Publication Year: 2005, Page(s):12 pp. - 86
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (369 KB) | HTML iconHTML

    Efficient schedulability analysis of aperiodic distributed task systems has received much less attention in real-time computing literature than its periodic counterpart. As systems become larger and more complex and as workloads become less regular, simple aperiodic task analysis techniques are needed to accommodate unpredictability and scale, while erring on the safe side. This paper presents a s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Event count automata: a state-based model for stream processing systems

    Publication Year: 2005, Page(s):12 pp. - 98
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (463 KB) | HTML iconHTML

    Recently there has been a growing interest in models and methods targeted towards the (co)design of stream processing applications; e.g. those for audio/video processing. Streams processed by such applications tend to be highly bursty and exhibit a high data-dependent variability in their processing requirements. As a result, classical event and service models such as periodic, sporadic, etc. can ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Trading end-to-end latency for composability

    Publication Year: 2005, Page(s):12 pp. - 110
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (423 KB) | HTML iconHTML

    The periodic resource model for hierarchical, compositional scheduling abstracts task groups by resource requirements. We study this model in the presence of dataflow constraints between the tasks within a group (intragroup dependencies), and between tasks in different groups (inter-group dependencies). We consider two natural semantics for dataflow constraints, namely, RTW (real-time workshop) se... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quantifying the gap between embedded control models and time-triggered implementations

    Publication Year: 2005, Page(s):10 pp. - 120
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (344 KB) | HTML iconHTML

    Mapping a set of feedback control components to executable code introduces errors due to a variety of factors such as discretization, computational delays, and scheduling policies. We argue that the gap between the model and the implementation can be rigorously quantified leading to predictability if the implementation is viewed as a sequence of control blocks executed in statically allocated time... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Enhanced EDF scheduling algorithms for orchestrating network-wide active measurements

    Publication Year: 2005, Page(s):10 pp. - 132
    Cited by:  Papers (7)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (631 KB) | HTML iconHTML

    Monitoring network status such as end-to-end delay, jitter, and available bandwidth is important to support QoS-sensitive applications and timely detection of network anomalies like denial of service attacks. For this purpose, Internet service providers (ISPs) have started to instrument their networks with network measurement infrastructures (NMIs) that periodically run active measurement tasks us... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decentralized utilization control in distributed real-time systems

    Publication Year: 2005, Page(s):10 pp. - 142
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (431 KB) | HTML iconHTML

    Many real-time systems must control their CPU utilizations in order to meet end-to-end deadlines and prevent overload. Utilization control is particularly challenging in distributed real-time systems with highly unpredictable workloads and a large number of end-to-end tasks and processors. This paper presents the decentralized end-to-end utilization control (DEUCON) algorithm that can dynamically ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multi-granularity resource reservations

    Publication Year: 2005, Page(s):11 pp. - 153
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (490 KB) | HTML iconHTML

    Resource reservation has been recently supported by many real-time operating systems to provide applications with guaranteed and timely access to system resources. Typically, reservations are based on the worst-case requirements, and therefore can inflate resource demands unnecessarily. Many multimedia applications such as MPEG video streams (1) have high worst-case to average-case demand ratio an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast on-the-fly parametric real-time model checking

    Publication Year: 2005, Page(s):10 pp. - 166
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (341 KB) | HTML iconHTML

    This paper presents a local algorithm for solving the universal parametric real-time model-checking problem. The problem may be phrased as follows: given a real-time system and temporal formula, both of which may contain parameters, and a constraint over the parameters, does every allowed parameter assignment ensure that the real-time system satisfies the formula? Our approach relies on translatin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Synthesis of real-time implementations from component-based software models

    Publication Year: 2005, Page(s):10 pp. - 176
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (364 KB) | HTML iconHTML

    Component-based software development is an effective technique for tackling the increasing complexity of large-scale embedded software systems. After building a logical software model, the designer must make design decisions, including choosing a multi-threading strategy and assigning priorities to threads, to ensure that the final implementation on the target execution platform satisfies non-func... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cost monitoring and enforcement in the real-time specification for Java $a formal evaluation

    Publication Year: 2005, Page(s):10 pp. - 186
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (544 KB) | HTML iconHTML

    The real-time specification for Java (RTSJ) provides an integrated approach to scheduling periodic threads and monitoring their CPU execution time. It defines a cost enforcement model whereby a periodic thread is suspended when it consumes more CPU time (budget) than it requested. However, the support for this model is optional and it is generally not given by most implementations. Consequently, t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Enhancing the robustness of distributed real-time middleware via end-to-end utilization control

    Publication Year: 2005, Page(s):11 pp. - 199
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (427 KB) | HTML iconHTML

    A key challenge for distributed real-time and embedded (DRE) middleware is maintaining both system reliability and desired real-time performance in unpredictable environments where system workload and resources may fluctuate significantly. This paper presents FC-ORB, a realtime object request broker (ORB) middleware that employs end-to-end utilization control to handle fluctuations in application ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Non-preemptive robustness under reduced system load

    Publication Year: 2005, Page(s):10 pp. - 209
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (351 KB) | HTML iconHTML

    Unlike preemptive scheduling policies, non-preemptive real-time scheduling policies can exhibit anomalies even for the single-processor case. In particular, a task set that is schedulable by a non-preemptive scheduler may become unschedulable when the utilization of the task set decreases relative to the CPU speed, e.g., when a faster CPU is used to run the same task set. In this paper, we define ... View full abstract»

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