Sciweavers

4759 search results - page 280 / 952
» Parallelizing the Phylogeny Problem
Sort
View
117
Voted
IPPS
2008
IEEE
15 years 9 months ago
Enhancing application robustness through adaptive fault tolerance
As the scale of high performance computing (HPC) continues to grow, application fault resilience becomes crucial. To address this problem, we are working on the design of an adapt...
Zhiling Lan, Yawei Li, Ziming Zheng, Prashasta Guj...
PACT
2005
Springer
15 years 8 months ago
Minimizing Hotspot Delay by Fully Utilizing the Link Bandwidth on 2D Mesh with Virtual Cut-Through Switching
Abstract. The hotspot seriously degrades the performance of a parallel algorithm but there have not been many methods proposed for this problem. Without modification of mesh topolo...
MinHwan Ok, Myong-Soon Park
IPPS
2000
IEEE
15 years 7 months ago
On Sorting an Intransitive Total Ordered Set Using Semi-Heap
1 The problem of sorting an intransitive total ordered set, a generalization of regular sorting, is considered. This generalized sorting is based on the fact that there exists a s...
Jie Wu
129
Voted
BMCBI
2010
135views more  BMCBI 2010»
15 years 2 months ago
MrsRF: an efficient MapReduce algorithm for analyzing large collections of evolutionary trees
Background: MapReduce is a parallel framework that has been used effectively to design largescale parallel applications for large computing clusters. In this paper, we evaluate th...
Suzanne Matthews, Tiffani L. Williams
106
Voted
TPDS
2002
80views more  TPDS 2002»
15 years 2 months ago
Analysis of Transposition-Table-Driven Work Scheduling in Distributed Search
This paper discusses a new work-scheduling algorithm for parallel search of single-agent state spaces, called Transposition-Table-Driven Work Scheduling, that places the transposit...
John W. Romein, Henri E. Bal, Jonathan Schaeffer, ...