Sciweavers

120 search results - page 8 / 24
» Minimum-cost load-balancing partitions
Sort
View
FOCS
2000
IEEE
15 years 2 months ago
A polylogarithmic approximation of the minimum bisection
A bisection of a graph with n vertices is a partition of its vertices into two sets, each of size n/2. The bisection cost is the number of edges connecting the two sets. The proble...
Uriel Feige, Robert Krauthgamer
84
Voted
AINA
2006
IEEE
15 years 3 months ago
SENS: A Scalable and Expressive Naming System using CAN Routing Algorithm
Abstract— We design a scalable and expressive naming system called SENS, which can retrieve information of computing and content resources distributed widely on the Internet by e...
Hoaison Nguyen, Toshio Oka, Hiroyuki Morikawa, Tom...
CLUSTER
2002
IEEE
14 years 9 months ago
Adaptive System Sensitive Partitioning of AMR Applications on Heterogeneous Clusters
This paper presents the design and evaluation of an adaptive system sensitive partitioning and load balancing framework for distributed adaptive mesh re nement applications on het...
Shweta Sinha, Manish Parashar
SIGMOD
2012
ACM
253views Database» more  SIGMOD 2012»
13 years 3 days ago
Skew-aware automatic database partitioning in shared-nothing, parallel OLTP systems
The advent of affordable, shared-nothing computing systems portends a new class of parallel database management systems (DBMS) for on-line transaction processing (OLTP) applicatio...
Andrew Pavlo, Carlo Curino, Stanley B. Zdonik
86
Voted
DOLAP
1998
ACM
15 years 1 months ago
Dynamic Maintenance of Multidimensional Range Data Partitioning for Parallel Data Processing
Star schema has been a typical model for both online transaction processing in traditional databases and online analytical processing in large data warehouses. In the star schema,...
Junping Sun, William I. Grosky