4889 search results - page 245 / 978 » A Refactoring Approach to Parallelism |
138
click to vote
CCGRID
2003
IEEE
15 years 9 months ago
2003
IEEE
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...
133
click to vote
SC
2003
ACM
15 years 9 months ago
2003
ACM
Many applications of parallel I/O perform non-contiguous file accesses: instead of accessing a single (large) block of data in a file, a number of (smaller) blocks of data scatt...
152
click to vote
ICDT
2001
ACM
15 years 8 months ago
2001
ACM
This paper presents a general methodology for the efficient parallelization of existing data cube construction algorithms. We describe two different partitioning strategies, one f...
102
click to vote
SNPD
2008
15 years 5 months ago
2008
As processing power becomes cheaper and more available in cluster of computers, the need for parallel algorithm that can harness this computing potentials will increase. One applic...
145
Voted
CCGRID
2010
IEEE
15 years 5 months ago
2010
IEEE
Idle desktops have been successfully used to run sequential and master-slave task parallel codes on a large scale in the context of volunteer computing. However, execution of messa...