Composable Resource Sharing Based on Latency-Rate Servers

Benny Akesson, A. Hansson, Kees Goossens

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

22 Citations (Scopus)
123 Downloads (Pure)

Abstract

Verification of application requirements is becoming a bottleneck in system-on-chip design, as the number of applications grows. Traditionally, the verification complexity increases exponentially with the number of applications and must be repeated if an application is added, removed, or modified. Predictable systems offering lower bounds on performance have been proposed to manage the increasing verification complexity, although this approach is only applicable to a restricted set of applications and systems. Composable systems, on the other hand, completely isolate applications in both the value and time domains, allowing them to be independently verified. However, existing approaches to composable system design are either restricted to applications that can be statically scheduled, or share resources using time-division multiplexing, which cannot efficiently satisfy tight latency requirements. In this paper, we present an approach to composable resource sharing based on latency-rate servers that supports any arbiter belonging to the class, providing a larger solution space for a given set of requirements. The approach can be combined with formal performance analysis using a variety of well-known modeling frame works. We furthermore propose an architecture for a resource front end that implements our concepts and provides composable service for any resource with bounded service time. The architecture supports both systems with buffers dimensioned to prevent overflow and systems with smaller buffers, where overflow is prevented with flow control. Finally, we experimentally demonstrate the usefulness of our approach with a simple use case sharing an SRAM memory.
Original languageUndefined
Title of host publicationProceedings of the EUROMICRO Conference on Digital System Design
Place of PublicationLos Alamitos
PublisherIEEE Computer Society
Pages547-555
Number of pages9
ISBN (Print)978-0-7695-3782-5
DOIs
Publication statusPublished - 27 Aug 2009
Event12th EUROMICRO Conference on Digital System Design, DSD 2009: Architectures, Methods and Tools - Conference and Cultural Centre of the University of Patras, Patras, Greece
Duration: 27 Aug 200929 Aug 2009
Conference number: 12
http://www.iuma.ulpgc.es/dsd09/

Publication series

Name
PublisherIEEE Computer Society Press

Conference

Conference12th EUROMICRO Conference on Digital System Design, DSD 2009
Abbreviated titleDSD
CountryGreece
CityPatras
Period27/08/0929/08/09
Internet address

Keywords

  • METIS-264475
  • IR-69774
  • Verification
  • EWI-17194
  • Composability
  • resource sharing
  • latency-rate servers
  • Real Time

Cite this

Akesson, B., Hansson, A., & Goossens, K. (2009). Composable Resource Sharing Based on Latency-Rate Servers. In Proceedings of the EUROMICRO Conference on Digital System Design (pp. 547-555). Los Alamitos: IEEE Computer Society. https://doi.org/10.1109/DSD.2009.167
Akesson, Benny ; Hansson, A. ; Goossens, Kees. / Composable Resource Sharing Based on Latency-Rate Servers. Proceedings of the EUROMICRO Conference on Digital System Design. Los Alamitos : IEEE Computer Society, 2009. pp. 547-555
@inproceedings{9ee98178655e4b5fb76d6d91095c5dd0,
title = "Composable Resource Sharing Based on Latency-Rate Servers",
abstract = "Verification of application requirements is becoming a bottleneck in system-on-chip design, as the number of applications grows. Traditionally, the verification complexity increases exponentially with the number of applications and must be repeated if an application is added, removed, or modified. Predictable systems offering lower bounds on performance have been proposed to manage the increasing verification complexity, although this approach is only applicable to a restricted set of applications and systems. Composable systems, on the other hand, completely isolate applications in both the value and time domains, allowing them to be independently verified. However, existing approaches to composable system design are either restricted to applications that can be statically scheduled, or share resources using time-division multiplexing, which cannot efficiently satisfy tight latency requirements. In this paper, we present an approach to composable resource sharing based on latency-rate servers that supports any arbiter belonging to the class, providing a larger solution space for a given set of requirements. The approach can be combined with formal performance analysis using a variety of well-known modeling frame works. We furthermore propose an architecture for a resource front end that implements our concepts and provides composable service for any resource with bounded service time. The architecture supports both systems with buffers dimensioned to prevent overflow and systems with smaller buffers, where overflow is prevented with flow control. Finally, we experimentally demonstrate the usefulness of our approach with a simple use case sharing an SRAM memory.",
keywords = "METIS-264475, IR-69774, Verification, EWI-17194, Composability, resource sharing, latency-rate servers, Real Time",
author = "Benny Akesson and A. Hansson and Kees Goossens",
year = "2009",
month = "8",
day = "27",
doi = "10.1109/DSD.2009.167",
language = "Undefined",
isbn = "978-0-7695-3782-5",
publisher = "IEEE Computer Society",
pages = "547--555",
booktitle = "Proceedings of the EUROMICRO Conference on Digital System Design",
address = "United States",

}

Akesson, B, Hansson, A & Goossens, K 2009, Composable Resource Sharing Based on Latency-Rate Servers. in Proceedings of the EUROMICRO Conference on Digital System Design. IEEE Computer Society, Los Alamitos, pp. 547-555, 12th EUROMICRO Conference on Digital System Design, DSD 2009, Patras, Greece, 27/08/09. https://doi.org/10.1109/DSD.2009.167

Composable Resource Sharing Based on Latency-Rate Servers. / Akesson, Benny; Hansson, A.; Goossens, Kees.

Proceedings of the EUROMICRO Conference on Digital System Design. Los Alamitos : IEEE Computer Society, 2009. p. 547-555.

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

TY - GEN

T1 - Composable Resource Sharing Based on Latency-Rate Servers

AU - Akesson, Benny

AU - Hansson, A.

AU - Goossens, Kees

PY - 2009/8/27

Y1 - 2009/8/27

N2 - Verification of application requirements is becoming a bottleneck in system-on-chip design, as the number of applications grows. Traditionally, the verification complexity increases exponentially with the number of applications and must be repeated if an application is added, removed, or modified. Predictable systems offering lower bounds on performance have been proposed to manage the increasing verification complexity, although this approach is only applicable to a restricted set of applications and systems. Composable systems, on the other hand, completely isolate applications in both the value and time domains, allowing them to be independently verified. However, existing approaches to composable system design are either restricted to applications that can be statically scheduled, or share resources using time-division multiplexing, which cannot efficiently satisfy tight latency requirements. In this paper, we present an approach to composable resource sharing based on latency-rate servers that supports any arbiter belonging to the class, providing a larger solution space for a given set of requirements. The approach can be combined with formal performance analysis using a variety of well-known modeling frame works. We furthermore propose an architecture for a resource front end that implements our concepts and provides composable service for any resource with bounded service time. The architecture supports both systems with buffers dimensioned to prevent overflow and systems with smaller buffers, where overflow is prevented with flow control. Finally, we experimentally demonstrate the usefulness of our approach with a simple use case sharing an SRAM memory.

AB - Verification of application requirements is becoming a bottleneck in system-on-chip design, as the number of applications grows. Traditionally, the verification complexity increases exponentially with the number of applications and must be repeated if an application is added, removed, or modified. Predictable systems offering lower bounds on performance have been proposed to manage the increasing verification complexity, although this approach is only applicable to a restricted set of applications and systems. Composable systems, on the other hand, completely isolate applications in both the value and time domains, allowing them to be independently verified. However, existing approaches to composable system design are either restricted to applications that can be statically scheduled, or share resources using time-division multiplexing, which cannot efficiently satisfy tight latency requirements. In this paper, we present an approach to composable resource sharing based on latency-rate servers that supports any arbiter belonging to the class, providing a larger solution space for a given set of requirements. The approach can be combined with formal performance analysis using a variety of well-known modeling frame works. We furthermore propose an architecture for a resource front end that implements our concepts and provides composable service for any resource with bounded service time. The architecture supports both systems with buffers dimensioned to prevent overflow and systems with smaller buffers, where overflow is prevented with flow control. Finally, we experimentally demonstrate the usefulness of our approach with a simple use case sharing an SRAM memory.

KW - METIS-264475

KW - IR-69774

KW - Verification

KW - EWI-17194

KW - Composability

KW - resource sharing

KW - latency-rate servers

KW - Real Time

U2 - 10.1109/DSD.2009.167

DO - 10.1109/DSD.2009.167

M3 - Conference contribution

SN - 978-0-7695-3782-5

SP - 547

EP - 555

BT - Proceedings of the EUROMICRO Conference on Digital System Design

PB - IEEE Computer Society

CY - Los Alamitos

ER -

Akesson B, Hansson A, Goossens K. Composable Resource Sharing Based on Latency-Rate Servers. In Proceedings of the EUROMICRO Conference on Digital System Design. Los Alamitos: IEEE Computer Society. 2009. p. 547-555 https://doi.org/10.1109/DSD.2009.167