4759 search results - page 398 / 952 » Parallelizing the Phylogeny Problem |
190
click to vote
EUROPAR
2005
Springer
16 years 10 days ago
2005
Springer
The model of moldable task (MT) was introduced some years ago and has been proved to be an efficient way for implementing parallel applications. It considers a target application ...
211
click to vote
IPPS
2000
IEEE
15 years 11 months ago
2000
IEEE
Abstract. Many parallel scienti c applications have dynamic and irregular computational structure. However, most such applications exhibit persistence of computational load and com...
188
click to vote
IEEEPACT
1998
IEEE
15 years 11 months ago
1998
IEEE
Compile-time scheduling is one approach to extract parallelism which has proved effective when the execution behavior is predictable. Unfortunately, the performance of most priori...
183
click to vote
SPAA
1997
ACM
15 years 11 months ago
1997
ACM
Pipelining has been used in the design of many PRAM algorithms to reduce their asymptotic running time. Paul, Vishkin, and Wagener (PVW) used the approach in a parallel implementat...
213
click to vote
EUROPAR
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. Traditional parallel programming methodologies for improving performance assume cache-based parallel systems. However, new architectures, like the IBM Cyclops-64 (C64), b...