1519 search results - page 50 / 304 » Network Partitioning of Data Parallel Computations |
145
click to vote
PODC
2010
ACM
15 years 5 months ago
2010
ACM
We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...
100
click to vote
EUROPAR
2004
Springer
15 years 7 months ago
2004
Springer
OLAP queries are typically heavy-weight and ad-hoc thus requiring high storage capacity and processing power. In this paper, we address this problem using a database cluster which...
115
click to vote
JSAC
2007
15 years 1 months ago
2007
—The availability of optical network infrastructure and appropriate user control software has recently made it possible for scientists to establish end-to-end circuits across mul...
112
Voted
ICPP
2005
IEEE
15 years 7 months ago
2005
IEEE
This paper evaluates the performance of a novel View-Oriented Parallel Programming style for parallel programming on cluster computers. View-Oriented Parallel Programming is based...
125
click to vote
ICDCS
2002
IEEE
15 years 7 months ago
2002
IEEE
We consider efficient communication schemes based on both network-supported and application-level multicast techniques for content-based publication-subscription systems. We show...