Sciweavers

486 search results - page 16 / 98
» Parallel Algorithms for Relational Coarsest Partition Proble...
Sort
View
IPPS
2000
IEEE
14 years 1 days ago
Parallelizability of Some P-Complete Problems
Abstract. In this paper, we consider parallelizability of some Pcomplete problems. First we propose a parameter which indicates parallelizability for a convex layers problem. We pr...
Akihiro Fujiwara, Michiko Inoue, Toshimitsu Masuza...
IPPS
2009
IEEE
14 years 2 months ago
Compact graph representations and parallel connectivity algorithms for massive dynamic network analysis
Graph-theoretic abstractions are extensively used to analyze massive data sets. Temporal data streams from socioeconomic interactions, social networking web sites, communication t...
Kamesh Madduri, David A. Bader
KR
2000
Springer
13 years 11 months ago
Partition-Based Logical Reasoning
We investigate the problem of reasoning with partitions of related logical axioms. Our motivation is two-fold. First, we are concerned with how to reason effectively with multiple...
Eyal Amir, Sheila A. McIlraith
PC
2007
133views Management» more  PC 2007»
13 years 7 months ago
Data distribution for dense factorization on computers with memory heterogeneity
In this paper, we study the problem of optimal matrix partitioning for parallel dense factorization on heterogeneous processors. First, we outline existing algorithms solving the ...
Alexey L. Lastovetsky, Ravi Reddy
VLDB
1995
ACM
149views Database» more  VLDB 1995»
13 years 11 months ago
Managing Intra-operator Parallelism in Parallel Database Systems
Abstract: Intra-operator(or partitioned) parallelism is a well-established mechanism for achieving high performance in parallel database systems. However, the problem of how to exp...
Manish Mehta 0002, David J. DeWitt