Sciweavers

1519 search results - page 50 / 304
» Network Partitioning of Data Parallel Computations
Sort
View
PODC
2010
ACM
14 years 29 days ago
Brief announcement: tree decomposition for faster concurrent data structures
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 ...
Johannes Schneider, Roger Wattenhofer
EUROPAR
2004
Springer
14 years 2 months ago
OLAP Query Processing in a Database Cluster
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...
Alexandre A. B. Lima, Marta Mattoso, Patrick Valdu...
JSAC
2007
107views more  JSAC 2007»
13 years 9 months ago
Admission control in data transfers over lightpaths
—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...
Wojciech M. Golab, Raouf Boutaba
ICPP
2005
IEEE
14 years 2 months ago
Performance Evaluation of View-Oriented Parallel Programming
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...
Zhiyi Huang, Martin K. Purvis, Paul Werstein
ICDCS
2002
IEEE
14 years 2 months ago
Clustering Algorithms for Content-Based Publication-Subscription Systems
We consider efficient communication schemes based on both network-supported and application-level multicast techniques for content-based publication-subscription systems. We show...
Anton Riabov, Zhen Liu, Joel L. Wolf, Philip S. Yu...