Sciweavers

3171 search results - page 18 / 635
» Application of Reduce Order Modeling to Time Parallelization
Sort
View
BMCBI
2004
196views more  BMCBI 2004»
13 years 7 months ago
MUSCLE: a multiple sequence alignment method with reduced time and space complexity
Background: In a previous paper, we introduced MUSCLE, a new program for creating multiple alignments of protein sequences, giving a brief summary of the algorithm and showing MUS...
Robert C. Edgar
PVM
2010
Springer
13 years 6 months ago
Toward Performance Models of MPI Implementations for Understanding Application Scaling Issues
Abstract. Designing and tuning parallel applications with MPI, particularly at large scale, requires understanding the performance implications of different choices of algorithms ...
Torsten Hoefler, William Gropp, Rajeev Thakur, Jes...
IPPS
1994
IEEE
13 years 11 months ago
Efficient Matrix Chain Ordering in Polylog Time
The matrix chain ordering problem is to find the cheapest way to multiply a chain of n matrices, where the matrices are pairwise compatible but of varying dimensions. Here we give ...
Phillip G. Bradford, Gregory J. E. Rawlins, Gregor...
APPROX
2009
Springer
163views Algorithms» more  APPROX 2009»
14 years 2 months ago
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
Abstract. Scheduling jobs on unrelated parallel machines so as to minimize the makespan is one of the basic, well-studied problems in the area of machine scheduling. In the first ...
José R. Correa, Martin Skutella, José...
IPPS
2000
IEEE
14 years 2 days ago
On Optimal Fill-Preserving Orderings of Sparse Matrices for Parallel Cholesky Factorizations
In this paper, we consider the problem of nding llpreserving ordering of a sparse symmetric and positive de nite matrix such that the reordered matrix is suitable for parallel fac...
Wen-Yang Lin, Chuen-Liang Chen