search menu icon-carat-right cmu-wordmark
Carnegie Mellon University

Software Engineering Institute

  1. SEI
  2. Publications
  3. Digital Library
  4. Deriving the Average-case Performance of Bandwidth-like Interfaces for Tasksets with Infinite Minimum Inter-Arrival Time, Equal Task Density, Uniformly Distributed Deadlines, and Infinite Number of Tasks

Deriving the Average-case Performance of Bandwidth-like Interfaces for Tasksets with Infinite Minimum Inter-Arrival Time, Equal Task Density, Uniformly Distributed Deadlines, and Infinite Number of Tasks

November 2016 • Presentation
Bjorn Andersson, Hyoseung Kim (Carnegie Mellon University), J. Lehoczky, Dionisio de Niz

This presentation was presented at the 9th International Workshop on Compositional Theory and Technology for Real-Time Embedded Systems (CRTS 2016).

Publisher:

Software Engineering Institute
DOI (Digital Object Identifier):
10.1145/3166227.3166229
Subjects

Abstract

This presentation was presented at the 9th International Workshop on Compositional Theory and Technology for Real-Time Embedded Systems (CRTS 2016).

The CRTS workshop provides a forum for researchers and technologists to discuss the state-of-the-art, present their works and contributions, and set future directions in compositional technology for real-time embedded systems.