Sciweavers

120 search results - page 9 / 24
» Minimum-cost load-balancing partitions
Sort
View
DELTA
2002
IEEE
15 years 2 months ago
Minimization and Partitioning Method Reducing Input Sets
The article describes a new Boolean minimization and single-level partitioning method based on the BOOM minimization system [6]. The minimization is performed with respect to the ...
Jan Hlavicka, Petr Fiser
ICPP
1998
IEEE
15 years 1 months ago
A memory-layout oriented run-time technique for locality optimization
Exploiting locality at run-time is a complementary approach to a compiler approach for those applications with dynamic memory access patterns. This paper proposes a memory-layout ...
Yong Yan, Xiaodong Zhang, Zhao Zhang
WWW
2007
ACM
15 years 10 months ago
SRing: a structured non dht p2p overlay supporting string range queries
This paper presents SRing, a structured non DHT P2P overlay that efficiently supports exact and range queries on multiple attribute values. In SRing, all attribute values are inte...
Xiaoping Sun, Xue Chen
PDP
2010
IEEE
15 years 4 months ago
On the Scalability of Hypergraph Models for Sparse Matrix Partitioning
Abstract—We investigate the scalability of the hypergraphbased sparse matrix partitioning methods with respect to the increasing sizes of matrices and number of nonzeros. We prop...
Bora Ucar, Ümit V. Çatalyürek
EUROPAR
2008
Springer
14 years 11 months ago
Scheduling Intersection Queries in Term Partitioned Inverted Files
Abstract. This paper proposes and presents a comparison of scheduling algorithms applied to the context of load balancing the query traffic on distributed inverted files. We put em...
Mauricio Marín, Carlos Gomez-Pantoja, Senen...