A Globally Arbitrated Memory Tree for Mixed-Time-Criticality Systems

Gomony, Manil Dev; Garside, Jamie; Åkesson, Benny; Audsley, Neil; Goossens, Kees

http://hdl.handle.net/10400.22/8975

Use this identifier to reference this record.

Name:	Description:	Size:	Format:
ART_CISTER_2016.pdf		637.38 KB	Adobe PDF	Download

Send Feedback

Authors

Abstract(s)

Embedded systems are increasingly based on multi-core platforms to accommodate a growing number of applications, some of which have real-time requirements. Resources, such as off-chip DRAM, are typically shared between the applications using memory interconnects with different arbitration polices to cater to diverse bandwidth and latency requirements. However, traditional centralized interconnects are not scalable as the number of clients increase. Similarly, current distributed interconnects either cannot satisfy the diverse requirements or have decoupled arbitration stages, resulting in larger area, power and worst-case latency. The four main contributions of this article are: 1) a Globally Arbitrated Memory Tree (GAMT) with a distributed architecture that scales well with the number of cores, 2) an RTL-level implementation that can be configured with five arbitration policies (three distinct and two as special cases), 3) the concept of mixed arbitration policies that allows the policy to be selected individually per core, and 4) a worst-case analysis for a mixed arbitration policy that combines TDM and FBSP arbitration. We compare the performance of GAMT with centralized implementations and show that it can run up to four times faster and have over 51% and 37% reduction in area and power consumption, respectively, for a given bandwidth.