Sciweavers

5640 search results - page 65 / 1128
» Parallelizing the Data Cube
Sort
View
PPOPP
2012
ACM
12 years 4 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
JSS
2002
107views more  JSS 2002»
13 years 8 months ago
On the attractiveness of the star network
In defiance of the tremendous research the star network had attracted during the last decade, no parallel machine based on this network has yet been built. In this paper, we explo...
Abdel Elah Al-Ayyoub, Khaled Day, Abdullah Al-Dhel...
NPC
2004
Springer
14 years 2 months ago
A Data-Aware Resource Broker for Data Grids
Huy Le, Paul D. Coddington, Andrew L. Wendelborn
HPCA
2012
IEEE
12 years 4 months ago
Pacman: Tolerating asymmetric data races with unintrusive hardware
Data races are a major contributor to parallel software unreliability. A type of race that is both common and typically harmful is the Asymmetric data race. It occurs when at leas...
Shanxiang Qi, Norimasa Otsuki, Lois Orosa Nogueira...
PLDI
1993
ACM
14 years 29 days ago
Global Optimizations for Parallelism and Locality on Scalable Parallel Machines
Data locality is critical to achievinghigh performance on large-scale parallel machines. Non-local data accesses result in communication that can greatly impact performance. Thus ...
Jennifer-Ann M. Anderson, Monica S. Lam