68 search results - page 12 / 14 » Memory Hierarchy Management for Iterative Graph Structures |
ISCA
2009
IEEE
15 years 6 months ago
2009
IEEE
While microprocessor designers turn to multicore architectures to sustain performance expectations, the dramatic increase in parallelism of such architectures will put substantial...
100
click to vote
IWMM
2009
Springer
15 years 6 months ago
2009
Springer
Tracing algorithms visit reachable nodes in a graph and are central to activities such as garbage collection, marshalling etc. Traditional sequential algorithms use a worklist, re...
116
click to vote
KDD
2008
ACM
16 years 13 hour ago
2008
ACM
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
148
click to vote
EDBT
2012
ACM
13 years 2 months ago
2012
ACM
We present some architectural and technological insights on SAP’s HANA database and derive research challenges for future enterprise application development. The HANA database m...
171
click to vote
SIGMOD
2009
ACM
15 years 11 months ago
2009
ACM
Wikipedia is an example of the large, collaborative, semi-structured data sets emerging on the Web. Typically, before these data sets can be used, they must transformed into struc...