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

Gomony, Manil Dev, Garside, Jamie, Akesson, Benny et al. (2 more authors) (2017) A Globally Arbitrated Memory Tree for Mixed-Time-Criticality Systems. IEEE Transactions on Computers. 7523935. pp. 212-225. ISSN 0018-9340

Abstract

Metadata

Authors/Creators:
Copyright, Publisher and Additional Information: Copyright © 2016 IEEE. This is an author-produced version of the published paper. Uploaded in accordance with the publisher’s self-archiving policy. Further copying may not be permitted; contact the publisher for details.
Keywords: GAMT,globally arbitrated memory tree,latency-rate servers,mixed-time-criticality,Real-time systems,scalability,shared memory,Theoretical Computer Science,Software,Hardware and Architecture,Computational Theory and Mathematics
Dates:
  • Published (online): 16 October 2016
  • Published: 1 February 2017
Institution: The University of York
Academic Units: The University of York > Faculty of Sciences (York) > Computer Science (York)
Depositing User: Pure (York)
Date Deposited: 06 Dec 2016 14:36
Last Modified: 24 Oct 2021 10:33
Published Version: https://doi.org/10.1109/TC.2016.2595581
Status: Published
Refereed: Yes
Identification Number: https://doi.org/10.1109/TC.2016.2595581
Related URLs:

Download

Filename: 2016_ieee_trans_comp_memory_tree.pdf

Description: 2016-ieee-trans-comp-memory-tree

Share / Export

Statistics