Composability and Predictability for Independent Application Development, Verification, and Execution


Akesson, Benny and Molnos, Anca and Hansson, Andreas and Ambrose Angelo, Jude and Goossens, Kees (2010) Composability and Predictability for Independent Application Development, Verification, and Execution. In: Michael Hübner & Jürgen Becker (Eds.), Multiprocessor System-on-Chip: Hardware Design and Tool Integration. Springer Verlag, London, pp. 25-56. ISBN 9781441964595

[img] PDF
Restricted to UT campus only

Abstract:System-on-chip (soc) design gets increasingly complex, as a growing number of applications are integrated in modern systems. Some of these applications have real-time requirements, such as a minimum throughput or a maximum latency. To reduce cost, system resources are shared between applications, making their timing behavior inter-dependent. Real-time requirements must hence e verified for all possible combinations of concurrently executing applications, which is not feasible with commonly used simulation-based techniques. This chapter addresses this problem using two complexity-reducing concepts: composability and predictability. Applications in a composable system are completely isolated and cannot affect each other's behaviors, enabling them to be independently verified. Predictable systems, on the other hand, provide lower bounds on performance, allowing applications to be verified using formal performance analysis. Five techniques to achieve composability and/or predictability in soc resources are presented and we explain their implementation for processors, interconnect, and memories in our platform.
Item Type:Book Section
Copyright:© 2010 Springer
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:
Official URL:
Export this item as:BibTeX
HTML Citation
Reference Manager


Repository Staff Only: item control page