Sciweavers

10213 search results - page 286 / 2043
» An Experimental Analysis of Parallel
Sort
View
CCGRID
2003
IEEE
15 years 9 months ago
A Parallel FPT Application For Clusters
Fixed-parameter tractability (FPT) techniques have recently been successful in solving NP-complete problem instances of practical importance which were too large to be solved with...
James Cheetham, Frank K. H. A. Dehne, Andrew Rau-C...
SIGMOD
1997
ACM
134views Database» more  SIGMOD 1997»
15 years 8 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
ASPLOS
2008
ACM
15 years 5 months ago
Optimistic parallelism benefits from data partitioning
Recent studies of irregular applications such as finite-element mesh generators and data-clustering codes have shown that these applications have a generalized data parallelism ar...
Milind Kulkarni, Keshav Pingali, Ganesh Ramanaraya...
171
Voted
DPD
2006
141views more  DPD 2006»
15 years 3 months ago
Efficient parallel processing of range queries through replicated declustering
A common technique used to minimize I/O in data intensive applications is data declustering over parallel servers. This technique involves distributing data among several disks so...
Hakan Ferhatosmanoglu, Ali Saman Tosun, Guadalupe ...
ICPP
2009
IEEE
15 years 1 months ago
Using Subfiling to Improve Programming Flexibility and Performance of Parallel Shared-file I/O
There are two popular parallel I/O programming styles used by modern scientific computational applications: unique-file and shared-file. Unique-file I/O usually gives satisfactory ...
Kui Gao, Wei-keng Liao, Arifa Nisar, Alok N. Choud...