search menu icon-carat-right cmu-wordmark

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

Presentation
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

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.