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 base...

• Type: Conference
• Year: 2009
• Where: DSD
• Authors: Benny Akesson, Andreas Hansson, Kees Goossens
• Keywords: Composable Systems, DSD 2009, Hardware, Verification Complexity, Verification Complexity Increases