2011 Symposium on Application Accelerators in High-Performance Computing 2011
DOI: 10.1109/saahpc.2011.23
|View full text |Cite
|
Sign up to set email alerts
|

A First Analysis of a Dynamic Memory Allocation Controller (DMAC) Core

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2012
2012
2014
2014

Publication Types

Select...
1
1
1

Relationship

2
1

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 4 publications
0
2
0
Order By: Relevance
“…This led us to first investigate the simplest data structure, a binary tree. Previously, a memory system using an ordered binary tree structure was implemented in hardware called the Dynamic Memory Allocation Controller [9]. The results definitely proved that it was feasible to implement a data structure in hardware but several issues rendered this structure not optimal for use in hardware.…”
Section: Theory Of Operationmentioning
confidence: 98%
“…This led us to first investigate the simplest data structure, a binary tree. Previously, a memory system using an ordered binary tree structure was implemented in hardware called the Dynamic Memory Allocation Controller [9]. The results definitely proved that it was feasible to implement a data structure in hardware but several issues rendered this structure not optimal for use in hardware.…”
Section: Theory Of Operationmentioning
confidence: 98%
“…In an effort to address this issue, we began investigating ways to improve memory bandwidth and reduce memory latency. This led to the implementation of a Dynamic Memory Allocation Controller (DMAC) [22]. The DMAC is a message-store unit that can handle variable number of variable-sized memory segments, independent of any software process or OS involvement.…”
Section: B Proposed Exascale Research Toolsmentioning
confidence: 99%