10. ECRTS 1998: Berlin, Germany

• Jing Chen, Alan Burns:
  Asynchronous data sharing in multiprocessor real-time systems using process consensus. 2-9
  
• Petri Pulli, Tino Pyssysalo, Jukka-Pekka Metsävainio, Olli Komulainen:
  CyPhone-experimenting mobile real-time telepresence. 10-17
  
• Horst F. Wedde, Jon A. Lind:
  Integration of task scheduling and file services in the safety-critical system MELODY. 18-25
  
• Tei-Wei Kuo, Wang-Ru Yang, Kwei-Jay Lin:
  EGPS: a class of real-time scheduling algorithms based on processor sharing. 27-34
  
• José C. Palencia Gutiérrez, J. J. Gutiérrez García, Michael González Harbour:
  Best-case analysis for improving the worst-case schedulability test for distributed hard real-time systems. 35-44
  
• Taewoong Kim, Heonshik Shin, Naehyuck Chang:
  Scheduling algorithm for hard real-time communication in demand priority network. 45-52
  
• Sergio Saez, Joan Vila i Carbó, Alfons Crespo:
  Using exact feasibility tests for allocating real-time tasks in multiprocessor systems. 53-60
  
• Christian Ebner:
  Efficiency evaluation of a time-triggered architecture for vehicle body-electronics. 62-70
  
• Jyrki Leskela:
  Deterministic multihop radio on the top of 802.11 MAC. 71-78
  
• Eduardo Tovar, Francisco Vasques:
  Guaranteeing real-time message deadlines in PROFIBUS networks. 79-86
  
• Marcel Ammerlaan, R. F. Lutje Spelberg, W. J. Toetenel:
  XTG-an engineering approach to modelling and analysis of real-time systems. 88-97
  
• Partha S. Roop, Arcot Sowmya:
  Hidden time model for specification and verification of embedded systems. 98-105
  
• Iain Bate, Alan Burns:
  Investigation of the pessimism in distributed systems timing analysis. 107-114
  
• Ramesh Yerraballi, Ravi Mukkamala:
  Routing and admission control of real-time channels. 115-122
  
• Ricardo Cayssials, Jorge Santos, Javier Orozco, Edgardo Ferro:
  On the scheduling of real-time multihop packet-switching networks. 123-128
  
• Peter P. Puschner:
  A tool for high-level language analysis of worst-case execution times. 130-137
  
• Sanjoy K. Baruah:
  Feasibility analysis of recurring branching tasks. 138-145
  
• Jakob Engblom, Andreas Ermedahl, Peter Altenbernd:
  Facilitating worst-case execution times analysis for optimized code. 146-153
  
• Francesco Calzolari, Mauro Pezzè:
  A non-temporized approach for temporized analysis. 154-161
  
• Marco Di Natale, Antonio Meschi:
  Guaranteeing end-to-end deadlines in distributed client-server applications. 163-171
  
• Paulo Pedro, Alan Burns:
  Schedulability analysis for mode changes in flexible real-time systems. 172-179
  
• Chih-wen Hsueh, Kwei-Jay Lin:
  On-line schedulers for pinwheel tasks using the time-driven approach. 180-187
  
• Sylvain Lauzac, Rami G. Melhem, Daniel Mossé:
  Comparison of global and partitioning schemes for scheduling rate monotonic tasks on a multiprocessor. 188-195
  
• M. P. Bodlaender, P. D. V. van der Stok:
  A transaction-based temporal data model that supports prediction in real-time databases. 197-203
  
• Anastasio Molano, Ragunathan Rajkumar, Kanaka Juvva:
  Dynamic disk bandwidth management and metadata pre-fetching in a real-time file system. 204-213
  
• Victor C. S. Lee, Kam-yiu Lam, Wai-Hung Tsang:
  Transaction processing in wireless distributed real-time databases. 214-220
  
• Henning Dierks, Josef Tapken:
  Tool-supported hierarchical design of distributed real-time systems. 222-229
  
• Adil Al-Yasiri, C. Bambord:
  DOOR-an approach for reusing and retrieving domain-oriented components. 230-237
  
• Maurizio Piaggio:
  ETHNOS-a real time programming environment for robotic systems. 238-244
  
• Tony Savor, Rudolph E. Seviora:
  Automatic detection of software failures: issues and experience. 245-252
  
• Ernst-Rüdiger Olderog:
  Formal methods in real-time systems. 254-263