29 search results - page 1 / 6 » Toward a Universal Mapping Algorithm for Accessing Trees in ... |
IPPS
1998
IEEE
13 years 9 months ago
1998
IEEE
We study the problem of mapping the N nodes of a complete t-ary tree on M memory modules so that they can be accessed in parallel by templates, i.e. distinct sets of nodes. Typica...
EUROPAR
2009
Springer
13 years 9 months ago
2009
Springer
We demonstrate that the performance of commodity parallel systems significantly depends on low-level details, such as storage layout and iteration space mapping, which motivates t...
HPCA
2012
IEEE
12 years 17 days ago
2012
IEEE
Modern memory systems rely on spatial locality to provide high bandwidth while minimizing memory device power and cost. The trend of increasing the number of cores that share memo...
CNIS
2006
13 years 6 months ago
2006
A variety of network security services, such as access control in firewalls and protocol analysis in intrusion detection systems, require the discrimination of packets based on th...
SPAA
2010
ACM
13 years 9 months ago
2010
ACM
Energy consumption by computer systems has emerged as an important concern. However, the energy consumed in executing an algorithm cannot be inferred from its performance alone: i...