By Topic

Embedded and Real-Time Computing Systems and Applications, 2006. Proceedings. 12th IEEE International Conference on

Date 16-18 Aug. 2006

Filter Results

Displaying Results 1 - 25 of 65
  • 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications - Cover

    Publication Year: 2006 , Page(s): c1
    Request Permissions | PDF file iconPDF (63 KB)  
    Freely Available from IEEE
  • 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications - Title

    Publication Year: 2006 , Page(s): i - iii
    Request Permissions | PDF file iconPDF (61 KB)  
    Freely Available from IEEE
  • 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications - Copyright

    Publication Year: 2006 , Page(s): iv
    Request Permissions | PDF file iconPDF (78 KB)  
    Freely Available from IEEE
  • 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications - TOC

    Publication Year: 2006 , Page(s): v - ix
    Request Permissions | PDF file iconPDF (114 KB)  
    Freely Available from IEEE
  • Foreward

    Publication Year: 2006 , Page(s): x
    Request Permissions | PDF file iconPDF (21 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • Conference organization

    Publication Year: 2006 , Page(s): xi - xiii
    Request Permissions | PDF file iconPDF (81 KB)  
    Freely Available from IEEE
  • Reviewers

    Publication Year: 2006 , Page(s): xiv
    Request Permissions | PDF file iconPDF (50 KB)  
    Freely Available from IEEE
  • Rate Monotonic Schedulability Conditions Using Relative Period Ratios

    Publication Year: 2006 , Page(s): 3 - 9
    Cited by:  Papers (5)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (173 KB) |  | HTML iconHTML  

    Feasibility and schedulability problems have received considerable attention from the real-time systems research community in recent decades. Since the publication of the Liu and Layland bound, many researchers have tried to improve the schedulability bound of the RM scheduling. The LL bound does not make any assumption on the relationship between any of the task periods. In this paper we consider... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Characterization and Analysis of Tasks with Offsets: Monotonic Transactions

    Publication Year: 2006 , Page(s): 10 - 16
    Cited by:  Papers (2)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (179 KB) |  | HTML iconHTML  

    This article introduces the concept of monotonic transactions. A monotonic transaction is a particular case of transactions for which the load arrival pattern is (or can be by rotation) localized at the beginning of the transaction. In the general context of tasks with offsets (general transactions) only exponential methods are known to calculate the worst-case response time. The pseudo-polynomial... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Probabilistic Timing Join over Uncertain Event Streams

    Publication Year: 2006 , Page(s): 17 - 26
    Cited by:  Papers (2)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (270 KB) |  | HTML iconHTML  

    This paper addresses the problem of processing event-timing queries over event streams where the uncertainty in the values of the timestamps is characterizable by histograms. We describe a stream-partitioning technique for checking the satisfaction of a probabilistic timing constraint upon event arrivals in a systematic way in order to delimit the "probing range" in event streams. This technique c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Software Infrastructure for Wearable Sensor Networks

    Publication Year: 2006 , Page(s): 27 - 35
    Cited by:  Papers (1)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (624 KB) |  | HTML iconHTML  

    In ubiquitous computing environments, context-awareness is one of the most important research topics. Computers embedded in our surrounding can extract information about a user, and the information makes it possible to offer personalized services according to the user's preference. To extract a large amount of context information, wearable sensor devices become more important in the near future. H... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • objSampler: A Ubiquitous Logging Tool for Recording Encounters with Real World Objects

    Publication Year: 2006 , Page(s): 36 - 41
    Request Permissions | Click to expandAbstract | PDF file iconPDF (1122 KB) |  | HTML iconHTML  

    We propose a novel tool, called objSampler, with which users can record and recall "encounters" with objects in ubiquitous computing environments. We encounter various things, individuals, and places in the real world either consciously, meaning encounters that we are aware of, or unconsciously, meaning those we are unaware of but physically close to them. While some of those encounters are partic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algorithm Selectors for Providing Location Estimation Services within a Cellular Radio Network

    Publication Year: 2006 , Page(s): 42 - 50
    Request Permissions | Click to expandAbstract | PDF file iconPDF (147 KB) |  | HTML iconHTML  

    Mobile location estimation is becoming an important value-added service for mobile phone operators. Many mobile location estimation algorithms based on the cellular radio networks have been proposed but there exists no general solution since each algorithm has its own advantage depending on specific terrain and environmental factors. In this paper, we propose and investigate three algorithm select... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Instruction Scheduling with Release Times and Deadlines on ILP Processors

    Publication Year: 2006 , Page(s): 51 - 60
    Cited by:  Papers (1)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (199 KB) |  | HTML iconHTML  

    ILP (instruction level parallelism) processors are being increasingly used in embedded systems. In embedded systems, instructions may be subject to timing constraints. An optimising compiler for ILP processors needs to find a feasible schedule for a set of time-constrained instructions. In this paper, we present a fast algorithm for scheduling instructions with precedence-latency constraints, indi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling Instruction-Level Parallelism for WCET Evaluation

    Publication Year: 2006 , Page(s): 61 - 67
    Request Permissions | Click to expandAbstract | PDF file iconPDF (142 KB) |  | HTML iconHTML  

    The estimation of the worst-case execution time of hard real-time applications becomes very hard as more and more complex processors are used in real-time systems. In modern architectures, estimating the execution time of a single basic block is not trivial due to possible timing anomalies linked to out-of-order execution. The influence of preceding basic blocks on the pipeline state also has to b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimization of Real-Time Systems Timing Specifications

    Publication Year: 2006 , Page(s): 68 - 76
    Cited by:  Papers (4)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (169 KB) |  | HTML iconHTML  

    Real-time logic (RTL) is useful for the verification of a safety assertion SA with respect to the specification SP of a real-time system. Since the satisfiability problem for RTL is undecidable, there were many efforts to find proper heuristics for proving that SPrarrSA holds. However, none of such heuristics necessarily finds an "optimal implication". After verifying SPrarrSA, and the system impl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic Adaptation of Stability Periods for Service Level Agreements

    Publication Year: 2006 , Page(s): 77 - 81
    Cited by:  Papers (1)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (169 KB) |  | HTML iconHTML  

    A QoS adaptation to dynamically changing system conditions that takes into consideration the user's constraints on the stability of service provisioning is presented. The goal is to allow the system to make QoS adaptation decisions in response to fluctuations in task traffic flow, under the control of the user. We pay special attention to the case where monitoring the stability period and resource... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Relaxed Correctness for Firm Real-Time Databases

    Publication Year: 2006 , Page(s): 82 - 86
    Cited by:  Papers (1)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (140 KB) |  | HTML iconHTML  

    Real-time database system must meet time constraints in addition to the integrity constraints. Concurrency control is one of the main issues in the studies of real-time database systems. Traditional concurrency control methods use serializability as the correctness criterion when transactions are executed concurrently. However, strict serializability as the correctness criterion is not always suit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mapping Task-Graphs on Distributed ECU Networks: Efficient Algorithms for Feasibility and Optimality

    Publication Year: 2006 , Page(s): 87 - 90
    Cited by:  Papers (1)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (126 KB) |  | HTML iconHTML  

    This mapping problem has to be solved in many application scenarios. In the automotive industry, for example, the implementation of car functions involves distributed task sets running on multiple electronic control units (ECU) with bus-based inter-task communication, a problem we consider in this paper. Our approach is based on mixed integer linear programming (MILP). MILP is concerned with optim... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Framework for Compositional and Hierarchical Real-Time Scheduling

    Publication Year: 2006 , Page(s): 91 - 96
    Cited by:  Papers (7)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (237 KB) |  | HTML iconHTML  

    Hierarchical scheduling frameworks have lately received a lot of attention for component-based design of complex real-time systems. The specification of the resource reservation policy play a dominant role in such frameworks. In this context, the notion of real-time virtual resources results a very flexible representation of resource reservation schemes. We intend to combine the advantages offered... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards an Analysis of Garbage Collection Techniques for Embedded Real-Time Java Systems

    Publication Year: 2006 , Page(s): 97 - 100
    Request Permissions | Click to expandAbstract | PDF file iconPDF (107 KB) |  | HTML iconHTML  

    From a real-time perspective, the garbage collector (GC) introduces unpredictable pauses that are not tolerated by real-time tasks. Real-time collectors eliminate this problem but introduce a high overhead. Another approach is to use memory regions (MR) within which allocation and deallocation are customized. This facility is supported by the memory model of the real-time specification for Java (R... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Garbage Collector Scheduling in Dynamic, Multiprocessor Real-Time Systems

    Publication Year: 2006 , Page(s): 101 - 105
    Cited by:  Papers (2)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (271 KB) |  | HTML iconHTML  

    We present a garbage collector scheduling algorithm for dynamic multiprocessor real-time systems called GCMUA. The algorithm considers mutator activities that are subject to time/utility function time constraints, stochastic execution-time and memory demands, and overloads. We prove that GCMUA probabilistically lower bounds each mutator's accrued utility, lower bounds the total accrued utility, an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Strengthening Property Preservation in Concurrent Real-Time Systems

    Publication Year: 2006 , Page(s): 106 - 109
    Cited by:  Papers (1)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (171 KB) |  | HTML iconHTML  

    To build a "correct" implementation from a model of a concurrent real-time system, it is important to understand the relation between the properties of the model and of its corresponding implementation. In this paper, the behaviour of a system is described with timed action sequences. Based on a notion of distance that expresses the observable property preservation between timed action sequences, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Security for Ubiquitous Computing: Problems and Proposed Solutionl

    Publication Year: 2006 , Page(s): 110 - 116
    Cited by:  Papers (1)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (196 KB) |  | HTML iconHTML  

    Traditional authentication and access control are no longer suitable for ubiquitous computing paradigm. They are only effective if the system knows in advance which users are going to access and what their access rights are. Therefore, it calls for a novel security model. In this paper, we outline major security problems in ubiquitous computing and propose a new architecture, TBSI (trust-based sec... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Deferrable Scheduling for Temporal Consistency: Schedulability Analysis and Overhead Reduction

    Publication Year: 2006 , Page(s): 117 - 124
    Cited by:  Papers (3)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (349 KB) |  | HTML iconHTML  

    The deferrable scheduling algorithm for fixed priority transactions (DS-FP) is demonstrated to be a very effective approach for minimizing real-time update transaction workload while maintaining temporal validity of real-time data. This paper examines the schedulability of deferrable scheduling and presents a sufficient condition. While its online scheduling overhead is a concern, we propose a hyp... View full abstract»

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