Sciweavers

120 search results - page 13 / 24
» Minimum-cost load-balancing partitions
Sort
View
IPPS
1999
IEEE
15 years 1 months ago
Self-Avoiding Walks over Adaptive Unstructured Grids
Abstract. In this paper, we present self-avoiding walks as a novel technique to linearize" a triangular mesh. Unlike space- lling curves which are based on a geometric embeddi...
Gerd Heber, Rupak Biswas, Guang R. Gao
SI3D
1995
ACM
15 years 1 months ago
Interactive Volume Visualization on a Heterogeneous Message-Passing Multicomputer
This paper describes VOL2, an interactive general-purpose volume renderer based on ray casting and implemented on Pixel-Planes 5, a distributed-memory, message-passing multicomput...
Andrei State, Jonathan McAllister, Ulrich Neumann,...
57
Voted
PVLDB
2008
77views more  PVLDB 2008»
14 years 9 months ago
Community-driven data grids
Beyond already existing huge data volumes, e-science communities face major challenges in managing the anticipated data deluge of forthcoming projects. Community-driven data grids...
Tobias Scholl, Alfons Kemper
ICDE
2010
IEEE
201views Database» more  ICDE 2010»
14 years 9 months ago
Vertical partitioning of relational OLTP databases using integer programming
A way to optimize performance of relational row store databases is to reduce the row widths by vertically partitioning tables into table fractions in order to minimize the number ...
Rasmus Resen Amossen
ISCA
2002
IEEE
174views Hardware» more  ISCA 2002»
14 years 9 months ago
Efficient Task Partitioning Algorithms for Distributed Shared Memory Systems
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
Sibabrata Ray, Hong Jiang