4759 search results - page 131 / 952 » Parallelizing the Phylogeny Problem |
IPPS
2009
IEEE
14 years 2 months ago
2009
IEEE
Multiple programming models are emerging to address an increased need for dynamic task parallelism in applications for multicore processors and shared-address-space parallel compu...
IPPS
2005
IEEE
14 years 1 months ago
2005
IEEE
We present an experimental study of parallel biconnected components algorithms employing several fundamental parallel primitives, e.g., prefix sum, list ranking, sorting, connect...
IFIPPACT
1994
13 years 9 months ago
1994
: We describe an approach to parallel compilation that seeks to harness the vast amount of ne-grain parallelism that is exposed through partial evaluation of numerically-intensive ...
HPCC
2007
Springer
13 years 12 months ago
2007
Springer
Effective and efficient mapping algorithms for multisite parallel applications are fundamental to exploit the potentials of grid computing. Since the problem of optimally mapping i...
PODS
1994
ACM
14 years 4 days ago
1994
ACM
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...