Sciweavers

6897 search results - page 255 / 1380
» Parallelization of Modular Algorithms
Sort
View
109
Voted
JPDC
2006
134views more  JPDC 2006»
15 years 2 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong
151
Voted
IPPS
1999
IEEE
15 years 7 months ago
Average-Case Analysis of Isospeed Scalability of Parallel Computations on Multiprocessors
We investigate the average-case speed and scalability of parallel algorithms executing on multiprocessors. Our performance metrics are average-speed and isospeed scalability. By m...
Keqin Li, Xian-He Sun
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
110
Voted
ESA
2007
Springer
131views Algorithms» more  ESA 2007»
15 years 8 months ago
Online Scheduling of Equal-Length Jobs on Parallel Machines
We study on-line scheduling of equal-length jobs on parallel machines. Our main result is an algorithm with competitive ratio de
Jihuan Ding, Tomás Ebenlendr, Jiri Sgall, G...
101
Voted
SPAA
2003
ACM
15 years 8 months ago
Asynchronous parallel disk sorting
We develop an algorithm for parallel disk sorting, whose I/O cost approaches the lower bound and that guarantees almost perfect overlap between I/O and computation. Previous algor...
Roman Dementiev, Peter Sanders