4759 search results - page 339 / 952 » Parallelizing the Phylogeny Problem |
167
click to vote
IPPS
1998
IEEE
15 years 11 months ago
1998
IEEE
Abstract. We give a high-level description of some fundamental randomized and deterministic techniques for routing and sorting on xedconnection networks such as meshes, hypercubes ...
134
click to vote
DEXAW
1997
IEEE
15 years 11 months ago
1997
IEEE
Existing concurrency control algorithms do not well conform to various environments, in the performance perspective. Each algorithm has some assumption on the conflict characteris...
180
click to vote
IPPS
1997
IEEE
15 years 11 months ago
1997
IEEE
The n-dimensional grid is one of the most representative patterns of data flow in parallel computation. The most frequently used scheduling models for grids is the unit execution ...
150
click to vote
ICIP
1994
IEEE
15 years 11 months ago
1994
IEEE
Efforts to build high-speed hardware for many different entropy coders are limited by fundamental feedback loops. Here is a method that allows for parallel compression in hardware...
151
click to vote
ICS
1989
Tsinghua U.
15 years 10 months ago
1989
Tsinghua U.
We consider iterative algorithms of the form z := f(z), executed by a parallel or distributed computing system. We focus on asynchronous implementations whereby each processor ite...