Proceedings 12th Euromicro Conference on Real-Time Systems. Euromicro RTS 2000

19-21 June 2000

Filter Results

Displaying Results 1 - 25 of 32
  • Proceedings 12th Euromicro Conference on Real-Time Systems. Euromicro RTS 2000

    Publication Year: 2000
    Request permission for reuse | PDF file iconPDF (575 KB)
    Freely Available from IEEE
  • Scheduling periodic tasks on uniform multiprocessors

    Publication Year: 2000, Page(s):7 - 13
    Cited by:  Papers (10)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (269 KB)

    A uniform multiprocessor machine is comprised of an integer number of processors. Each processor P is characterized by a computing capacity P.c, with the interpretation that a job j executing on a processor P for t time units completes (P/sub j/.c/spl times/t) units of execution. The scheduling of systems of periodic tasks on uniform multiprocessor systems is considered. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Schedulability analysis of distributed hard real-time systems with multiple-event synchronization

    Publication Year: 2000, Page(s):15 - 24
    Cited by:  Papers (15)  |  Patents (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (684 KB)

    Presents a schedulability analysis technique for distributed hard real-time systems in which responses to different events may synchronize with each other. This technique uses a representation model for distributed systems that allows us to describe not only the task synchronization due to resource sharing, but also the activation due to combinations of events or the generation of several events b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Worst-case utilization bound for EDF scheduling on real-time multiprocessor systems

    Publication Year: 2000, Page(s):25 - 33
    Cited by:  Papers (79)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (270 KB)

    Presents the utilization bound for earliest deadline first (EDF) scheduling on homogeneous multiprocessor systems with partitioning strategies. Assuming that tasks are pre-emptively scheduled on each processor according to the EDF algorithm, and allocated according to the first-fit (FF) heuristic, we prove that the worst-case achievable utilization is 0.5(n+1), where n is the number of processors.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Early-release fair scheduling

    Publication Year: 2000, Page(s):35 - 43
    Cited by:  Papers (95)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (360 KB)

    Presents a variant of Pfair scheduling (S. Baruah et al., 1995, 1996), which we call early-release fair (ERfair) scheduling. Like conventional Pfair scheduling, ERfair scheduling algorithms can be applied to optimally schedule periodic tasks on a multiprocessor system in polynomial time. However, ERfair scheduling differs from Pfair scheduling in that it is work-conserving. As a result, average jo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Designing inter-class concurrency control strategies for real-time database systems with mixed transactions

    Publication Year: 2000, Page(s):47 - 54
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (217 KB)

    Although many efficient concurrency control protocols have been proposed for real-time database systems, they are mainly designed for those systems with a single type of real-time transaction. Due to the very different performance requirements of each type of real-time transaction, these proposed protocols may not be suitable for mixed real-time database systems (MRTDBSs), where different types of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Concurrency control in a multiprocessor real-time database system

    Publication Year: 2000, Page(s):55 - 62
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (356 KB)

    Although many high-performance computer systems are now multiprocessor-based, little work has been done in real-time concurrency control of transaction executions in a multiprocessor environment. A real-time concurrency control protocol designed for uniprocessor or distributed environments may not fit the needs of multiprocessor-based real-time database systems because of a lower degree of concurr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An adaptable security manager for real-time transactions

    Publication Year: 2000, Page(s):63 - 70
    Cited by:  Papers (16)  |  Patents (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (324 KB)

    The rising demand for real-time services over networks, such as Web-based information services, requires new approaches for balancing competing demands on limited resources. The BeeHive database system proposes a novel solution to this need by the use of adaptive real time, fault tolerance, quality of service and security services based on rules embedded in individual objects. These rules prescrib... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Worst-case execution times analysis of MPEG-2 decoding

    Publication Year: 2000, Page(s):73 - 80
    Cited by:  Papers (8)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (251 KB)

    Presents the first worst-case execution times (WCET) analysis of MPEG decoding. Solutions for two scenarios-video-on-demand (VoD) and live-are presented, serving as examples for a variety of real-world applications. A significant reduction of over-estimations (down to 17%, including overheads) during WCET analysis of the live scenario can be achieved by using our new two-phase decoder with built-i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Portable worst-case execution time analysis using Java Byte Code

    Publication Year: 2000, Page(s):81 - 88
    Cited by:  Papers (32)  |  Patents (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (245 KB)

    Addresses the problem of performing worst-case execution time (WCET) analysis of Java Byte Code (JBC), which may be generated from different compilers and from different source languages. The motivation for the framework presented is to provide WCET analysis which is portable and therefore more likely to be used in an industrial context. Two issues are addressed in this paper: how to extract data ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Predicting computation time for advanced processor architectures

    Publication Year: 2000, Page(s):89 - 96
    Cited by:  Papers (17)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (329 KB)

    Estimating computation times using analysis techniques is always safe but is becoming prohibitively complex or pessimistic with modern processors. The only alternative approach is to use measurement, but this has the significant disadvantage of optimism - the largest value seen during testing may not be the largest experienced during deployment. In this paper, we subject data obtained from measure... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Designing for schedulability: integrating schedulability analysis with object-oriented design

    Publication Year: 2000, Page(s):101 - 108
    Cited by:  Papers (27)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (256 KB)

    There is a growing interest in using the object paradigm for developing real time software. We believe that an approach that integrates the advancements in both object modeling and design methods, and real time scheduling theory is the key to successful use of object technology for real time software. Surprisingly many past approaches to integrate the two either restrict the object models, or do n... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • From design to implementation: tool support for the development of object-oriented distributed real-time systems

    Publication Year: 2000, Page(s):109 - 116
    Cited by:  Papers (4)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (233 KB)

    The increasing complexity in the development of real time systems leads designers to make use of techniques that help handle the complexity. One method to deal with complexity that became popular in the last years is the use of the object oriented paradigm. Some advances in hardware technology have made it possible to overcome the overhead problems that prevented its adoption in the past. The pape... View full abstract»

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

    Publication Year: 2000, Page(s):121 - 128
    Cited by:  Papers (30)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (313 KB)

    In many real time control applications, the task periods are typically fixed and worst case execution times are used in schedulability analysis. With the advancement of robotics, flexible visual sensing using cameras has become a popular alternative to the use of embedded sensors. Unfortunately, the execution time of visual tracking varies greatly. In such environments, control tasks have a normal... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On adaptive control techniques in real-time resource allocation

    Publication Year: 2000, Page(s):129 - 136
    Cited by:  Papers (11)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (363 KB)

    A remarkable class of soft real time applications exhibits a very dynamical behaviour due to the variations in the treated data. Moreover, such programs have to be able to run on hundreds of different platforms. As a consequence, classical real time scheduling algorithms are not flexible enough since they are based on the exact knowledge of the tasks' timing parameters. Some of the approaches prop... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Integration of off-line scheduling and optimal control

    Publication Year: 2000, Page(s):137 - 143
    Cited by:  Papers (27)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (239 KB)

    A novel method for offline scheduling is proposed where the periodic task model does not contain the usual task period parameter. This is possible because the scheduling is integrated with control theory. A slot length defines the granularity of schedule and the optimal control theory tells us what the best offline static cyclic schedule is with respect to the overall system performance. The optim... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Model-checking real-time control programs: verifying LEGO MINDSTORMSTM systems using UPPAAL

    Publication Year: 2000, Page(s):147 - 155
    Cited by:  Papers (16)  |  Patents (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (176 KB)

    The authors present a method for automatic verification of real time control programs running on LEGO(R) RCXTM bricks using the verification tool UPPAAL. The control programs, consisting of a number of tasks running concurrently, are automatically translated into the timed automata model of UPPAAL. The fixed scheduling algorithm used by the LEGO(R) RCXTM processor is modeled ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards validated real-time software

    Publication Year: 2000, Page(s):157 - 164
    Cited by:  Papers (11)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (325 KB)

    We present a tool for the design and validation of embedded real time applications. The tool integrates two approaches: the use of the synchronous programming language, ESTEREL for design, and the application of model checking techniques for validation of real time properties. Validation is carried out on a global formal model (timed automata) taking into account the effective implementation of th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modelling and analysis of a commercial field bus protocol

    Publication Year: 2000, Page(s):165 - 172
    Cited by:  Papers (15)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (233 KB)

    We report on an industrial application of UPPAAL, in which a commercial field bus protocol (AF100) is modelled and analysed using the tool. During the case study, a number of imperfections in the protocol logic and its implementation are found and the error sources are debugged based on abstract models of the protocol; respective improvements have been suggested. The authors summarize their experi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Harmonious internal clock synchronization

    Publication Year: 2000, Page(s):175 - 182
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (460 KB)

    Internal clock synchronization has been investigated, or employed for quite a number of years, under the requirement of good upper bounds for the deviation, or accuracy, between a predefined master node M and slaves S1, S2, etc. It has been tacitly assumed that the accuracy range between slaves SI and S2 was just the same as for the master/slave. In extensive experimental studies of unicast based ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Clock synchronization for wireless local area networks

    Publication Year: 2000, Page(s):183 - 189
    Cited by:  Papers (30)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (271 KB)

    High-precision clock synchronization is one of the most basic requirements in distributed real-time systems. This paper presents an enhanced clock synchronization protocol for wireless local area networks based on the IEEE 802.11 standard. Reducing the time-critical path of the protocol enhances the synchronization precision. As wireless communication links are inherently unreliable, special empha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Greedy reclamation of unused bandwidth in constant-bandwidth servers

    Publication Year: 2000, Page(s):193 - 200
    Cited by:  Papers (38)  |  Patents (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (321 KB)

    A framework for scheduling a number of different applications on a single shared pre-emptable processor is proposed, such that each application seems to be executing on a slower dedicated processor. A tradeoff is identified and evaluated between how precise a notion of real time (as measured by the granularity of its clock) an application needs to have supported on the one hand, and the added cont... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Schedulability analysis for systems with data and control dependencies

    Publication Year: 2000, Page(s):201 - 208
    Cited by:  Papers (15)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (200 KB)

    Presents an approach to schedulability analysis for hard real-time systems with control and data dependencies. We consider distributed architectures consisting of multiple programmable processors, and the scheduling policy is based on a static priority pre-emptive strategy. Our model of the system captures both data and control dependencies, and the schedulability approach is able to reduce the pe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Non pre-emptive scheduling of messages on SMTV token-passing networks

    Publication Year: 2000, Page(s):209 - 218
    Cited by:  Papers (8)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (483 KB)

    Fieldbus communication networks aim to interconnect sensors, actuators and controllers within distributed computer-controlled systems. Therefore, they constitute the foundation upon which real-time applications are to be implemented. A specific class of fieldbus communication networks is based on a simplified version of token-passing protocols, where each station may transfer, at most, a single me... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tolerating faults while maximizing reward

    Publication Year: 2000, Page(s):219 - 226
    Cited by:  Papers (17)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (308 KB)

    The imprecise computation (IC) model is a general scheduling framework that is capable of expressing the precision vs. timeliness tradeoff involved in many current real-time applications. In that model, each task comprises mandatory and optional parts. While allowing greater scheduling flexibility, the mandatory parts in the IC model still have hard deadlines, and hence they must be completed befo... View full abstract»

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