Sciweavers

5005 search results - page 149 / 1001
» The Design and Analysis of Parallel Algorithms
Sort
View
SIGMOD
1997
ACM
134views Database» more  SIGMOD 1997»
15 years 5 months ago
Scalable Parallel Data Mining for Association Rules
One of the important problems in data mining is discovering association rules from databases of transactions where each transaction consists of a set of items. The most time consu...
Eui-Hong Han, George Karypis, Vipin Kumar
93
Voted
CLUSTER
2006
IEEE
15 years 6 months ago
Energy-Aware Duplication Strategies for Scheduling Precedence-Constrained Parallel Tasks on Clusters
Optimizing energy consumption has become a major concern in designing economical clusters. Scheduling precedence-constrained parallel tasks on clusters is challenging because of h...
Ziliang Zong, Adam Manzanares, Brian Stinar, Xiao ...
102
Voted
SIGCOMM
2009
ACM
15 years 7 months ago
Optimizing the BSD routing system for parallel processing
The routing architecture of the original 4.4BSD [3] kernel has been deployed successfully without major design modification for over 15 years. In the unified routing architectur...
Qing Li, Kip Macy
119
Voted
FPGA
2005
ACM
195views FPGA» more  FPGA 2005»
15 years 6 months ago
Sparse Matrix-Vector multiplication on FPGAs
Floating-point Sparse Matrix-Vector Multiplication (SpMXV) is a key computational kernel in scientific and engineering applications. The poor data locality of sparse matrices sig...
Ling Zhuo, Viktor K. Prasanna
134
Voted
IPPS
2010
IEEE
14 years 10 months ago
Tile QR factorization with parallel panel processing for multicore architectures
To exploit the potential of multicore architectures, recent dense linear algebra libraries have used tile algorithms, which consist in scheduling a Directed Acyclic Graph (DAG) of...
Bilel Hadri, Hatem Ltaief, Emmanuel Agullo, Jack D...