Subject: IEEE-CS TC-RTS Newsletter for Tue Aug 18, 1998 _______________________________________________________________________________ __ _ __ ___ ___ __ __ I E E E Technical Committee |\ | |_ | | (_' | |_ | | |_ |_) C S on Real-Time Systems | \| |__ |/\| ,_) |__ |__ | | |__ | \ _______________________________________________________________________________ Table of Contents Line ----------------- ---- 1. Azer Bestavros (145 lines) Statistical Rate Monotonic Scheduling: TRs Available............... 3 2. Lisa Cingiser DiPippo [SMTP:cingiser@cs.uri.edu] (134 lines) Fifth IEEE Real-Time Technology and Applications Symposium......... 148 3. Frank Mueller (121 lines) CFP Workshop w/ RTSS'98: Prog. Lang. for RT Industrial Apps........ 282 4. Diego Latella (112 lines) ARTS'99 Call for Papers............................................ 403 5. Janusz Zalewski [mailto:jza@ece.engr.ucf.edu] (114 lines) Third IEEE Real-Time Systems Education Workshop.................... 515 6. "Azer Bestavros" (134 lines) Call for papers for DART 98........................................ 629 7. Ellie Kerrissey (54 lines) DEADLINE SCHEDULING FOR REAL-TIME SYSTEMS, EDF and Related Algori.. 763 ------------------------------------------------------------------------------ <<<<<<<<<<<<<<<<<<* START OF THE IEEE-CS TC-RTS NEWSLETTER *>>>>>>>>>>>>>>>>>> ------------------------------------------------------------------------------ Message 1; Postmarked Tue Jun 18 10:57:05 1998 From: Azer Bestavros Subject: Statistical Rate Monotonic Scheduling: TRs Available Content-Length: 6662 The following Technical Reports on Statistical Rate Monotonic Scheduling are now available from http://www.cs.bu.edu/techreports/. --Azer ---------------------------------------------- Computer Science Dept, CAS Tel: (617)353.9726 Boston University MA 02215 Fax: (617)353.6457 Http://www.cs.bu.edu/~best MailTo:best@bu.edu --------------------------------------------------------------------- Title: Statistical Rate Monotonic Scheduling (BUCS-TR-98-010) Authors: Alia Atlas and Azer Bestavros Abstract: In this paper we present Statistical Rate Monotonic Scheduling (SRMS), a generalization of the classical RMS results of Liu and Layland that allows scheduling periodic tasks with highly variable execution times and statistical QoS requirements. Similar to RMS, SRMS has two components: a feasibility test and a scheduling algorithm. The feasibility test for SRMS ensures that using SRMS' scheduling algorithms, it is possible for a given periodic task set to share a given resource (e.g. a processor, communication medium, switching device, etc.) in such a way that such sharing does not result in the violation of any of the periodic tasks QoS constraints. The SRMS scheduling algorithm incorporates a number of unique features. First, it allows for fixed priority scheduling that keeps the tasks' value (or importance) independent of their periods. Second, it allows for job admission control, which allows the rejection of jobs that are not guaranteed to finish by their deadlines as soon as they are released, thus enabling the system to take necessary compensating actions. Also, admission control allows the preservation of resources since no time is spent on jobs that will miss their deadlines anyway. Third, SRMS integrates reservation-based and best-effort resource scheduling seamlessly. Reservation-based scheduling ensures the delivery of the minimal requested QoS; best-effort scheduling ensures that unused, reserved bandwidth is not wasted, but rather used to improve QoS further. Fourth, SRMS allows a system to deal gracefully with overload conditions by ensuring a fair deterioration in QoS across all tasks---as opposed to penalizing tasks with longer periods, for example. Finally, SRMS has the added advantage that its schedulability test is simple and its scheduling algorithm has a constant overhead in the sense that the complexity of the scheduler is not dependent on the number of the tasks in the system. We have evaluated SRMS against a number of alternative scheduling algorithms suggested in the literature (e.g. RMS and slack stealing), as well as refinements thereof, which we describe in this paper. Consistently throughout our experiments, SRMS provided the best performance. In addition, to evaluate the optimality of SRMS, we have compared it to an inefficient, yet optimal scheduler for task sets with harmonic periods. ----------------------------------------------------------------------- Title: Multiplexing VBR Traffic Flows with Guaranteed Application-level QoS Using Statistical Rate Monotonic Scheduling (BUCS-TR-98-011) Authors: Alia Atlas and Azer Bestavros Abstract: Quality of Service (QoS) guarantees are required by an increasing number of applications to ensure a minimal level of fidelity in the delivery of application data units through the network. Application-level QoS does not necessarily follow from any transport-level QoS guarantees regarding the delivery of the individual cells (e.g. ATM cells) which comprise the application's data units. The distinction between application-level and transport-level QoS guarantees is due primarily to the fragmentation that occurs when transmitting large application data units (e.g. IP packets, or video frames) using much smaller network cells, whereby the partial delivery of a data unit is useless; and, bandwidth spent to partially transmit the data unit is wasted. The data units transmitted by an application may vary in size while being constant in rate, which results in a variable bit rate (VBR) data flow. That data flow requires QoS guarantees. Statistical multiplexing is inadequate, because no guarantees can be made and no firewall property exists between different data flows. In this paper, we present a novel resource management paradigm for the maintenance of application-level QoS for VBR flows. Our paradigm is based on Statistical Rate Monotonic Scheduling (SRMS), in which (1) each application generates its variable-size data units at a fixed rate, (2) the partial delivery of data units is of no value to the application, and (3) the QoS guarantee extended to the application is the probability that an arbitrary data unit will be successfully transmitted through the network to/from the application. ----------------------------------------------------------------------- Title: The Statistical Rate Monotonic Scheduling Workbench (BUCS-TR-98-012) Authors: Alia Atlas and Azer Bestavros Abstract: The SRMS Workbench is a software system developed to demonstrate the notion of Statistical QoS employed in SRMS [AtlasBestavros:1998]. The SRMS Workbench includes: (1) the SRMS schedulability analyzer (QoS negotiator), and (2) a SRMS simulator (Basic SRMS + all extensions). These two components are packaged into a Java Applet that can be executed remotely on any Java-capable Internet browser. For comparison, other scheduling algorithms, including RMS [LiuLayland:1973] and SSJAC [AtlasBestavros:1998] are included. Through a simple GUI, the SRMS Workbench allows users to specify a set of periodic tasks, each with (a) its own period, (b) the distributional characteristics of its periodic resource requirements (e.g. Poisson, Pareto, Normal, Exponential, Gamma, etc.), (c) its desired QoS as a lower bound on the percentage of deadlines to be met, and (d) a criticality/importance index indicating the value of the task (relative to other tasks in the task set). Once the task set is specified, the SRMS Workbench allows the user to check for schedulability under SRMS. If the task set is schedulable, the SRMS Workbench generates the appropriate allowance for each task and allows the user to create an animated simulation of the task system, which can be executed and profiled. If the task set is not schedulable, the SRMS Workbench informs the user of that fact and suggests (as part of the QoS negotiation) an alternative set of feasible QoS requirements that reflects the specified criticality/importance index of the tasks in the task set. The SRMS Workbench is available on the Web at http://www.cs.bu.edu/groups/realtime/SRMSworkbench ------------------------------------------------------------------------------ Message 2; Postmarked Mon Aug 10 11:36:21 1998 From: Lisa Cingiser DiPippo [SMTP:cingiser@cs.uri.edu] Subject: Fifth IEEE Real-Time Technology and Applications Symposium Content-Length: 4704 Fifth IEEE Real-Time Technology and Applications Symposium Vancover, Canada June 2-4, 1999 Sponsored by The IEEE Computer Society Technical Committee on Real-Time Systems Preliminary Call For Papers Objectives and Scope The IEEE Real-Time Technology and Applications Symposium brings together real-time system developers and researchers from academia, industry and government to present the latest advances in real-time systems research, and discuss the practical challenges encountered and the solutions adopted. An exciting program that fosters discussions and technical exchanges is planned, including tutorials, panel discussions, full-paper presentations and work-in-progress sessions. Full-length papers, work-in-progress abstracts and tutorial proposals on various aspects of real-time computing and communication are sought, ranging from multimedia applications, case studies, systems integration, application requirements, scheduling, operating systems, middleware, software engineering, dependability, databases, programming languages, system development tools, communications, and performance modeling. Of particular interest are papers detailing experiments, implementations, and experiences in application domains such as multimedia, internet and wireless appliances, communications, process control, automated manufacturing, avionics, advanced highway systems and robotics. As in previous years, the best papers presented at the symposium will be selected for publication in respected IEEE journals. Submission Guidelines Manuscripts to be considered as full papers should be limited to 20 double-spaced pages. Work-in-progress abstracts to be considered for an "Ongoing Work" session should be limited to 6 double-spaced pages. Submissions should reach the program chair by December 7, 1998. Both hard-copy and electronic submissions will be accepted (electronic submission is preferred) as explained below. In addition, a 150-word abstract (in ASCII) must be e-mailed to the Program Chair at by December 7, 1998. Any paper submitted to the Symposium must not have been published in or submitted to other technical conferences/journals. Electronic Manuscript Submission: The preferred format for electronic submission is PDF suitable for Acrobat Reader. Postscript with US Letter size pages will also be accepted. Papers should be emailed as attachments to to rtas99@cs.uri.edu by the indicated deadlines. Hard-copy Manuscript Submission: If electronic submission is not possible, then six copies of each full-paper manuscript or work-in-progress abstracts should be mailed to the program chair Prof. Victor Fay Wolfe Computer Science Department Email: wolfe@cs.uri.edu 258 Tyler Hall Phone: 401-874-2499 University of Rhode Island Fax: 401-874-4617 Kingston, RI 02881 USA Tutorial Proposals Submission: Proposals for half-day tutorials in technically appealing areas of the Symposium are also solicited. Tutorial proposals should be submitted to the program chair by December 14, 1998. Inquiries and Questions: For more information about the Symposium, send e-mail to the General Chair Azer Bestravos at best@cs.bu.edu. For questions regarding conference submissions, send e-mail to the Program Committee Chair Victor Fay Wolfe at wolfe@cs.uri.edu. The Web page for the conference can be accessed at http://www.cs.uri.edu/rtas99. ------------------------------------------------------------------------ Important Dates: December 7, 1998 -> Deadline for Email-submission of paper abstract December 7, 1998 -> Deadline for submission of full/short paper December 14, 1998 -> Deadline for tutorial proposal submission February 22, 1999 -> Notification of acceptance of papers and tutorials April 12, 1999 -> Deadline for camera-ready of accepted manuscripts June 2, 1999 -> Symposium begins June 4, 1999 -> Symposium ends ------------------------------------------------------------------------ Organizing Committee: General Chair * Azer Bestavros, Boston University Program Committee Chair *Victor Fay Wolfe, University of Rhode Island Local Arrangements Chair * TBD Publicity Chair * Lisa Cingiser DiPippo, University of Rhode Island (dipippo@cs.uri.edu) * Others TBD Program Committee Members * TBD ------------------------------------------------------------------------ For more information check RTAS'99 Home Page at http://www.cs.uri.edu/rtas99 ------------------------------------------------------------------------------ Message 3; Postmarked Wed Jul 29 03:46:44 1998 From: Frank Mueller Subject: CFP Workshop w/ RTSS'98: Prog. Lang. for RT Industrial Apps Content-Length: 4692 ============================================================================= Call for Papers IEEE Workshop on Programming Languages for Real-Time Industrial Applications -- Is Java the Future? -- Madrid, Spain, December 1, 1998 (in conjunction with RTSS'98) http://www.informatik.hu-berlin.de/~mueller/plrtia98 ============================================================================= IMPORTANT DATES: Papers due: Oct 10, 1998 Author notification: Oct 31, 1998 Final papers due: Nov 14, 1998 DESCRIPTION: Over the last 30 years there has been a plethora of languages used for the implementation of industrial and military real-time and embedded systems. Early languages such as Jovial, Coral 66, and RTL/2 have been replaced by C/C++, Pearl, Ada and Esterel. Whilst Ada has a niche in the safety critical systems market, there has been wide-spead use of C/C++. This dominance has been reinforced by the developement of the real-time POSIX standards. However, all these languages have their critics. For some, Ada and POSIX are too complicated, for others C/C++ are too insecure. More recently, Java has emerged as a candiate language which claims a compromise between the safety and security of Ada, and yet the flexibility and popularity of C/C++. However, Java lacks some of the facilities required to program hard real-time systems, and its implementation lacks the predictablity needed for safety critical applications. This workshop will give the opportunity to researchers, developers, and practitioners working in related areas to exchange experience on the design, implementation and use of programming language in industrial and military applications. Topics of submissions include but are not limited to: * progress reports on the developement and use of Java * real-time java virtual machines * evaluation of Java for real-time * Ada 95 real-time profiles (subsets) * lessons learned from the use of current (C/C++, Pearl, Ada and Esterel) languages * meeting the demands of real-time distributed programming * the impact of future systems requirements on programming languages * the role of real-time POSIX SUBMITTING PAPERS: Authors are invited to submit regular workshop papers as well as proposals for panel discussions. Paper submissions should be limited to 10 pages, double space, including figures. The title page should include a maximum 150-word abstract, five keywords, full mailing address, e-mail address, phone number, fax number, and a designated contact author. All submissions must be electronic (postscript) and sent to: Alan.Burns@cs.york.ac.uk. GENERAL CHAIR: M. Gonzalez Harbour Universidad de Cantabria Departamento de Electronica y Computadores Avda. de Los Castros s/n 39005 Santander, Spain phone: +34-942-2014-83, fax: -02
mgh@ctr.unican.es CO-PC-CHAIRS: Alan Burns Frank Mueller University of York Humboldt University Berlin Department of Computer Science Institut fuer Informatik Heslington Unter den Linden 6 York, YO10 5DD, U.K. 10099 Berlin, Germany phone: +44 (1904) 4327-79, fax: -67 phone: (+49) (30) 2093-3011, fax: -3010 Alan.Burns@cs.york.ac.uk mueller@informatik.hu-berlin.de PROGRAM COMMITTEE: Ted Baker, Florida State Univeristy, USA Brad Balfour, SEI, USA Riccardo Bettai, Texas A&M Univeristy, USA Greg Bollella, IBM, USA Giorgio Butazzio, University of Pisa, Italy David E. Emery, Mitre, France Franco Gasperoni, Ada Core Technologies, USA Richard Gerber, University of Maryland, USA Hans Hansson, Mälardalens Högskola, Sweden M. Gonzalez Harbour, Universidad de Cantabria, Spain Farnam Jahanian, University of Michigan, USA Andy Johnson, Mercury Computer Systems, USA Jochen Liedtke, IBM Watson, USA Jane W.-S. Liu, University of Illinois at Urbana-Champaign, USA Sang Lyul Min, Seoul National University, Korea Frank Mueller, Humboldt Universty Berlin, Germany Kelvin Nilsen, NewMonics, USA Lynne Rosenthal, NIST, USA Manas Saksena, Concordia University, Canada Lui Sha, SEI, USA Daniel Simon, INRIA, France Sanjay Sjinturkar, Lucent, USA Tucker Taft, Intermetrics, USA Hideyuko Tokuda, Keio University, Japan Serdar Uckun, Rockwell Science Center, USA Vic Wolfe, University of Rhode Island, USA ------------------------------------------------------------------------------ Message 4; Postmarked Mon May 11 11:02:57 1998 From: Diego Latella Subject: ARTS'99 Call for Papers Content-Length: 4309 ________________________________________________________ | | | Preliminary Call for Papers -- ARTS'99 | | | | 5th International AMAST Workshop on | | Real-Time and Probabilistic Systems | | | | May 26 -- 28, 1999, Bamberg, Germany | | | | http://www7.informatik.uni-erlangen.de/arts99/ | |______________________________________________________| SCOPE AND AIMS The aim of the ARTS'99 workshop is to bring together researchers and practitioners interested in the design of real-time and probabilistic systems. The topics of interest include the whole spectrum of development and application of specification, verification, analysis and construction of real-time and probabilistic systems. In the spirit of the AMAST movement, the workshop is intended to provide a forum for the presentation of approaches that are based on a clear mathematical basis. Aspects of real-time and probabilistic systems for the workshop include (but are not limited to): & Compositional construction and verification techniques & Automatic and machine-supported verification & Case studies & Formal methods for performance analysis & Semantics & Algorithms and tools & Hybrid systems Previous editions of ARTS workshops have been organized by the University of Iowa, USA (1993), University of Bordeaux, France (1995), Brigham Young University, USA (1996), and the University of the Balearic Islands, Spain (1997). In 1999 the workshop takes place in Bamberg, a beautiful historic city 25 miles north of Erlangen/Nurnberg. IMPORTANT DATES: Deadline for Submission: 30 October 1998 Notification to Authors: 29 January 1999 Final Version due: 26 February 1999 INVITED SPEAKERS: Two speakers (to be filled in) SUBMISSIONS Authors are invited to submit a paper not exceeding 6000 words (approx. 15 pages) preferably by e-mail to arts99@informatik.uni-erlangen.de Format: encapsulated Postscript that can be printed by any postscript device. E-mail address and fax number of the contact author should be included. Alternatively, submissions may be sent by ordinary mail (four copies required) to Joost-Pieter Katoen (ARTS'99), Dept. of Computer Science/IMMD 7, University of Erlangen-Nurnberg, Martenstrasse 3, D-91058 Erlangen, Germany. PROCEEDINGS It is our intention to publish the proceedings in the series Lecture Notes in Computer Science (LNCS) -- Springer-Verlag, and to have it available at the workshop. Previous proceedings appeared as LNCS 1231 or as volumes in the AMAST Series of Computing. Based on the quality of the submissions, it will be considered to publish selected papers in a special issue of a journal. PROGRAM COMMITTEE Rajeev Alur (U. of Pennsylvania, USA) Jos Baeten (Eindhoven U., NL) Christel Baier (U. Mannheim, D) Miquel Bertran (General Systems Development, ES) Antonio Cerone (U. South Australia, AUS) Rance Cleaveland (North Carolina State U., USA) Jim Davies (U. Oxford, UK) Colin Fidge (U. Queensland, AUS) David de Frutos (U. Madrid, ES) Hubert Garavel (INRIA Rhone-Alpes, F) Constance Heitmeyer (Naval Research Laboratory, USA) Tom Henzinger (U. Berkeley, USA) Jane Hillston (U. Edinburgh, UK) Joost-Pieter Katoen (U. Erlangen, D, Chair) Rom Langerak (U. Twente, NL) Kim G. Larsen (Aalborg U., DK) Diego Latella (CNR-CNUCE, I) Jonathan Ostroff (U. York, CAN) Steve Schneider (Royal Holloway, UK) Roberto Segala (U. Bologna, I) Walter Vogler (U. Augsburg, D) STEERING COMMITTEE Manfred Broy (U. Munich, D) Edmund Clarke (Carnegie-Mellon, USA) Ulrich Herzog (U. Erlangen, D) Zohar Manna (U. of Stanford, USA) Maurice Nivat (U. Paris 6, F) Amir Pnueli (Weizmann Institute, ISR) Teodor Rus (U. of Iowa, Chair, USA) ------------------------------------------------------------------------------ Message 5; Postmarked Mon Jul 6 13:22:14 1998 From: Janusz Zalewski [mailto:jza@ece.engr.ucf.edu] Subject: Third IEEE Real-Time Systems Education Workshop Content-Length: 3665 ---------------------------------------------------------------------------- An updated version of this CFP will be available via the following web page: http://www-ece.engr.ucf.edu/~jza ---------------------------------------------------------------------------- Final Call For Papers Third IEEE Real-Time Systems Education Workshop Saturday, November 21, 1998 (after Software Engineering Education Symposium) Scientific Center of the Polish Academy of Sciences Poznan, Poland Sponsored by The IEEE Computer Society Technical Committee on Real-Time Systems* in cooperation with Poznan University of Technology Co-sponsored by IFAC TC on Real-Time Software Engineering* IFIP WG 5.4 Industrial Software Quality* Aim and Scope The objective of the Workshop is to convene educators active in real-time systems, teachers and practitioners, from academic, governmental, and industrial institutions, and discuss the latest techniques, methodologies, requirements, and advances of real-time systems education, as well as exchange views on future directions. We are seeking submissions that include educational aspects of real-time systems and real-time computing, including but not limited to: - curriculum development - student projects - course descriptions and contents - development of course materials - textbook selection - prerequisite knowledge - cooperation with industry - formal vs. practical approach - role of complex distributed systems - full real-time systems tracks - including most recent research - embedded hardware laboratories - software tools and environments for teaching - experiences with labs. Contents of the Proceedings of the First and Second Workshops, published by IEEE Computer Society Press are available from http://www-ece.engr.ucf.edu/~jza. Manuscripts should be limited to 15 double-spaced pages and submitted electronically in Postscript format to: Dr. Janusz Zalewski RTS Education Workshop Dept. of Electrical and Computer Engineering University of Central Florida Orlando, FL 32816-2450, USA Phone: +1 (407) 823-6171 Fax: +1 (407) 823-5835 Email: jza@ece.engr.ucf.edu Important Dates Draft paper submission August 15, 1998 Acceptance notification September 15, 1998 Camera-ready manuscript November 1, 1998 International Program Committee Maarten Boasson, The Netherlands Alan Burns, UK Jean Paul Calvez, France Richard Eckhouse, USA Wolfgang Halang, Germany Andrzej Jaszkiewicz, Poland (Organizing Co-Chair) Malgorzata Kalinowska-Iszkowska, Poland Jan van Katwijk, The Netherlands Andrew Kornecki, USA Phil Laplante, USA Doug Locke, USA (ex-officio, TC Chair) Boleslaw Mikolajczak, USA Al Mok, USA Daniel Mosse, USA Gilles Motet, France Leo Motus, Estonia Jerzy Nawrocki, Poland (Organizing Co-Chair) Marcin Paprzycki, USA Juan de la Puente, Spain Thomas Piatkowski, USA Ian Pyle, UK Bo Sanden, USA Jean-Jacques Schwarz, France (Program Chair) Alan Shaw, USA Terry Shepard, Canada Bruce Shriver, USA Janusz Sosnowski, Poland Alfred Strohmeier, Switzerland Alexander Stoyen, USA Janusz Zalewski, USA (General Chair) *Final Approvals Pending ---------------------------------------------------------------------------- ------------------------------------------------------------------------------ Message 6; Postmarked Tue Jul 21 12:03:42 1998 From: "Azer Bestavros" Subject: Call for papers for DART 98 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: 7bit Content-Length: 4439 CALL FOR PAPERS Event: Workshop on Databases: Active & Real-Time (Concepts meet Practice) (DART'98) Location: Washington, DC, USA Date: November 7, 1998. (Overlapping the last day of CIKM'98) Association: 7th Int'l Conference on Information & Knowledge Management 1998. CIKM'98 is sponsored by ACM SIGIR & SIGMIS. Contacts: Prof. Anindya Datta Prof. Le Gruenwald (Program Co-Chair) (Program Co-Chair) MIS Dept. School of Computer Science University of Arizona University of Oklahoma McClelland Hall 200 Felgar Street, Room 114 EL Tucson, AZ 85721 USA Norman, OK 73019 USA adatta@loochi.bpa.arizona.edu gruenwal@cs.ou.edu (520)621-7472 (405) 325-3498 Prof. Nandit Soparkar (General Chair) EECS Department University of Michigan Ann Arbor, MI 48109-2122 soparkar@eecs.umich.edu (734) 647-4849 Web: http://www.eecs.umich.edu/~soparkar/Dart98/ Scope: Applications such as manufacturing automation, automated stock-trading, avionics, medical informatics, intelligent transportation systems, telecommunications, multimedia systems, workflow systems, etc. make substantial use of databases but require support beyond that provided by traditional databases. These include support for timeliness and for rule-based activiation of tasks --- issues that are being investigated by researchers working on active and real-time database technologies. However, the understanding of the application requirements, the available technology, and the nexus between research and practice, are still nascent. This one-day workshop is a sequel to the successful DART'96 workshop (http://www.eecs.umich.edu/~soparkar/Dart96). DART'98 is a forum for practitioners and researchers to exchange ideas with a special focus on data management issues in applications with active and real-time requirements. Rather than creating a venue where only new research results are reported, this workshop is intended to provide a context for researchers to understand the needs that application developers have, and for developers to learn about solutions available today. This should assist in the discussion of specific issues, problem areas, and potential solutions, and provide impetus for further research as well as the transition of available technology. In order to facilitate these exchanges, we solicit brief papers (up to 5 single-spaced pages, submitted electronically in postscript format to one of the Program Co-Chairs) that describe technical contributions in the area w.r.t. research, on-going work, implementation efforts etc. The selected papers will be provided to the participants at the Workshop, and is likely to be published subsequently in a proceedings by ACM. The workshop will consist of brief invited and paper presentations in the first half of the day, followed by in-depth discussions during the latter half of the day. The suggested topics include, but are not limited to: Practice - Research - Manufacturing technology Triggers and constraints Multimedia applications Real-time concurrency control Avionics systems Quality of service Process control Distributed data management Telecommunications Scheduling for data accesses Intelligent transportation Object-oriented paradigms Medical informatics Specifications and tools Real-time Web applications Interactions with OS & network Program stock-trading Reliability and dependability Synchronous collaboration Monitoring and activation Dates: Submission deadline - Aug 31, 1998 Notification of review results - Sep 30, 1998 Final versions due - Oct 15, 1998 Workshop date - Nov 7, 1998 Program Committee: Sanjoy Baruah (U. of Vermont) Elisa Bertino (U. of Milan) Azer Bestavros (Boston U.) Alex Biliris (AT&T Labs-Research) Maggie Dunham (Southern Methodist U.) Christoph Freytag (Humboldt U.) H.V. Jagadish (AT&T Labs-Research) Madhur Kohli (Bell Labs) Vijay Kumar (U. of Missori-Kansas City) Kam-Yiu Lam (Hong Kong U.) Doug Locke (Lockheed Martin) Bongki Moon (U. of Arizona) Susan Nagy (The Open Group) Banu Ozden (Bell Labs) Gultekin Ozsoyoglu (Case Western Reserve U.) Krithi Ramamritham (IIT Bombay) Claudia Roncancio (U. of Grenoble/ENSIMAG) S. Seshadri (IIT Bombay) Sang H. Son (U. of Virginia) John A. Stankovic (U. of Virginia) Bhavani Thuraisingham (Mitre Corp.) Ozgur Ulusoy (Bilkent U.) ------------------------------------------------------------------------------ Message 7; Postmarked Thu Aug 13 15:11:28 1998 From: Ellie Kerrissey Subject: DEADLINE SCHEDULING FOR REAL-TIME SYSTEMS, EDF and Related Algori thms - NEW BOOK ANNOUNCEMENT Content-Type: text/plain; charset="iso-8859-1" Content-Length: 1947 KLUWER ACADEMIC PUBLISHERS IS PROUD TO ANNOUNCE THE PUBLICATION OF DEADLINE SCHEDULING FOR REAL-TIME SYSTEMS EDF and Related Algorithms by John A. Stankovic, Marco Spuri, Krithi Ramamritham and Georgio C. Buttazzo This book presents a significant body of knowledge on EDF scheduling for real-time systems. The book primarily presents the algorithms and associated analysis, but guidelines, rules and implementation considerations are also discussed, especially for the more complicated situations where mathematical analysis is difficult. DEADLINE SCHEDULING FOR REAL-TIME SYSTEMS, EDF and Related Algorithms should be of interest to researchers, real-time system designers, and instructors and students, either as a focussed course on deadline based scheduling for real-time systems, or, more likely, as part of a more general course on real-time computing. The book serves as an invaluable reference in this fast-moving field. TABLE OF CONTENTS 1. INTRODUCTION 2. TERMINOLOGY AND ASSUMPTIONS 3. FUNDAMENTALS OF EDF SCHEDULING 4. RESPONSE TIMES UNDER EDF SCHEDULING 5. PLANNING-BASED SCHEDULING 6. EDF SCHEDULING FOR SHARED RESOURCES 7. PRECEDENCE CONSTRAINTS AND SHARED RESOURCES 8. APERIODIC TASK SCHEDULING 9. DISTRIBUTED SCHEDULING - PART 1 10. DISTRIBUTED SCHEDULING - PART II 11. SUMMARY AND OPEN QUESTIONS DEADLINE SCHEDULING FOR REAL-TIME SYSTEMS: EDF And Related Algorithms should be of interest to researchers, real-time system designers, and instructors and students, either as a focused course on deadline based scheduling for real-time systems, or more likely as part of a more general course on real-time computing. 1998 288 pages ISBN 0-7923-8269-2 $79.00 Order your copy today! Phone customer service at (781) 871-6600. Orders by FAX to (781)871-6528 Please visit our on-line catalogue for ordering, or for information about all our publications: http://www.wkap.nl ------------------------------------------------------------------------------ <<<<<<<<<<<<<<<<<<<* END OF THE IEEE-CS TC-RTS NEWSLETTER *>>>>>>>>>>>>>>>>>>> ------------------------------------------------------------------------------ The TC-RTS repository is maintained by Azer Bestavros at Boston University WWW Home Page of the TC-RTS is at: http://cs-www.bu.edu/pub/ieee-rts/Home.html Internet address for anonymous FTP to the TC-RTS repository is: cs-ftp.bu.edu Contributions to this forum should be sent via E-mail to: IEEE-RTTC@cs.bu.edu Requests / inquiries should be sent via E-mail to: IEEE-RTTC-request@cs.bu.edu ------------------------------------------------------------------------------