Sciweavers

416 search results - page 30 / 84
» A Paradigm for Parallel Matrix Algorithms:
Sort
View
ALGORITHMICA
2006
86views more  ALGORITHMICA 2006»
15 years 4 months ago
Slabpose Columnsort: A New Oblivious Algorithm for Out-of-Core Sorting on Distributed-Memory Clusters
Our goal is to develop a robust out-of-core sorting program for a distributed-memory cluster. The literature contains two dominant paradigms for out-of-core sorting algorithms: me...
Geeta Chaudhry, Thomas H. Cormen
145
Voted
BMCBI
2008
108views more  BMCBI 2008»
15 years 4 months ago
SPRINT: A new parallel framework for R
Background: Microarray analysis allows the simultaneous measurement of thousands to millions of genes or sequences across tens to thousands of different samples. The analysis of t...
Jon Hill, Matthew Hambley, Thorsten Forster, Murie...
IPPS
1997
IEEE
15 years 8 months ago
Nearly Optimal One-To-Many Parallel Routing in Star Networks
Star networks were proposedrecently as an attractive alternative to the well-known hypercube models for interconnection networks. Extensive research has been performed that shows ...
Chi-Chang Chen, Jianer Chen
191
Voted
SPAA
1993
ACM
15 years 8 months ago
Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems
d Abstract) Thomas H. Cormen Leonard F. Wisniewski Department of Mathematics and Computer Science Dartmouth College We give asymptotically equal lower and upper bounds for the num...
Thomas H. Cormen, Leonard F. Wisniewski
113
Voted
MOC
2000
173views more  MOC 2000»
15 years 4 months ago
Computation of Gauss-Kronrod quadrature rules
Recently Laurie presented a new algorithm for the computation of (2n+1)-point Gauss-Kronrod quadrature rules with real nodes and positive weights. This algorithm first determines a...
Daniela Calvetti, Gene H. Golub, William B. Gragg,...