Optimal mappings of \(q\)-ary and binomial trees into parallel memory modules for fast and conflict-free access to path and subtree templates (Q1581284)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal mappings of \(q\)-ary and binomial trees into parallel memory modules for fast and conflict-free access to path and subtree templates |
scientific article |
Statements
Optimal mappings of \(q\)-ary and binomial trees into parallel memory modules for fast and conflict-free access to path and subtree templates (English)
0 references
13 June 2001
0 references
conflict-free access
0 references
memory bandwidth
0 references
binomial trees
0 references
