6437 search results - page 240 / 1288 » Parallel Algorithms for Arrangements |
131
click to vote
IOPADS
1996
15 years 4 months ago
1996
The ability to perform permutations of large data sets in place reduces the amount of necessary available disk storage. The simplest way to perform a permutation often is to read ...
126
click to vote
IPPS
2007
IEEE
15 years 9 months ago
2007
IEEE
Quality of service (QoS) is becoming an attractive feature for high-performance networks and parallel machines because it could allow a more efficient use of resources. Deadline-...
142
click to vote
PODC
2010
ACM
15 years 5 months ago
2010
ACM
We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchroniz...
148
click to vote
ICPP
2008
IEEE
15 years 9 months ago
2008
IEEE
In this paper, we explore the use of hierarchically structured multiprocessor tasks (M-tasks) for programming multi-core cluster systems. These systems often have hierarchically s...
137
Voted
IEEEPACT
2009
IEEE
15 years 1 months ago
2009
IEEE
Efficiently using the hardware capabilities of the Cell processor, a heterogeneous chip multiprocessor that uses several levels of parallelism to deliver high performance, and bei...