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

DOI10.1109/TC.2016.2595581zbMATH Open1364.68151MaRDI QIDQ2989508FDOQ2989508

Authors: Manil Dev Gomony, Jamie Garside, Benny Akesson, Kees Goossens, N. C. Audsley 

Publication date: 8 June 2017

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Recommendations

• Memory controllers for mixed-time-criticality systems. Architectures, methodologies and trade-offs
• Global Real-Time Memory-Centric Scheduling for Multicore Systems
• Memory-centric scheduling for multicore hard real-time systems
• Flexible scheduling of transactional memory on trees
• Flexible scheduling of transactional memory on trees
• Fault-tolerant and real-time scheduling for mixed-criticality systems
• scientific article; zbMATH DE number 1629959

Mathematics Subject Classification ID

Data structures (68P05)

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: A Globally Arbitrated Memory Tree for Mixed-Time-Criticality Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989508)