Sciweavers

1256 search results - page 118 / 252
» Compositional Memory Systems for Data Intensive Applications
Sort
View
123
Voted
PPOPP
2012
ACM
13 years 8 months ago
Massively parallel breadth first search using a tree-structured memory model
Analysis of massive graphs has emerged as an important area for massively parallel computation. In this paper, it is shown how the Fresh Breeze trees-of-chunks memory model may be...
Tom St. John, Jack B. Dennis, Guang R. Gao
ISCA
2005
IEEE
154views Hardware» more  ISCA 2005»
15 years 6 months ago
Temporal Streaming of Shared Memory
Coherent read misses in shared-memory multiprocessors account for a substantial fraction of execution time in many important scientific and commercial workloads. We propose Tempor...
Thomas F. Wenisch, Stephen Somogyi, Nikolaos Harda...
MM
2004
ACM
124views Multimedia» more  MM 2004»
15 years 6 months ago
Towards an integrated multimedia service hosting overlay
With the proliferation of multimedia data sources on the Internet, we envision an increasing demand for value-added and functionrich multimedia services that transport, process, a...
Dongyan Xu, Xuxian Jiang
127
Voted
ECCB
2005
IEEE
15 years 6 months ago
A query language for biological networks
Many areas of modern biology are concerned with the management, storage, visualization, comparison, and analysis of networks. For instance, networks are used to model signal trans...
Ulf Leser
107
Voted
LCTRTS
2007
Springer
15 years 6 months ago
Scratchpad allocation for data aggregates in superperfect graphs
Existing methods place data or code in scratchpad memory, i.e., SPM by either relying on heuristics or resorting to integer programming or mapping it to a graph coloring problem. ...
Lian Li 0002, Quan Hoang Nguyen, Jingling Xue