4759 search results - page 425 / 952 » Parallelizing the Phylogeny Problem |
189
click to vote
IPPS
1998
IEEE
15 years 11 months ago
1998
IEEE
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
153
click to vote
IPPS
1998
IEEE
15 years 11 months ago
1998
IEEE
Current practice in the design of application software for high-performance embedded computing systems is characterized by long development times, lack of interoperability with ot...
165
click to vote
IPPS
1998
IEEE
15 years 11 months ago
1998
IEEE
Passing messages through shared memory plays an important role on symmetric multiprocessors and on Clumps. The management of concurrent access to message queues is an important as...
154
Voted
IPPS
1998
IEEE
15 years 11 months ago
1998
IEEE
List-based priority schedulers have long been one of the dominant classes of static scheduling algorithms. Such heuristics have been predominantly based around the "critical ...
161
click to vote
IPPS
1998
IEEE
15 years 11 months ago
1998
IEEE
This paper presents our work on the static task scheduling model using the mean-field annealing (MFA) technique. Mean-field annealing is a technique of thermostatic annealing that...