Sciweavers

6105 search results - page 200 / 1221
» A Parallel Algorithm for Bound-Smoothing
Sort
View
BMCBI
2010
135views more  BMCBI 2010»
15 years 6 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
WDAG
2010
Springer
182views Algorithms» more  WDAG 2010»
15 years 4 months ago
Scalable Flat-Combining Based Synchronous Queues
In a synchronous queue, producers and consumers handshake to exchange data. Recently, new scalable unfair synchronous queues were added to the Java JDK 6.0 to support high performa...
Danny Hendler, Itai Incze, Nir Shavit, Moran Tzafr...
147
Voted
ESA
2007
Springer
131views Algorithms» more  ESA 2007»
16 years 16 days 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...
SPAA
2003
ACM
15 years 11 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
EUROPAR
2008
Springer
15 years 8 months ago
Data Mining Algorithms on the Cell Broadband Engine
The Cell Broadband Engine (CBE) is a new heterogeneous multi-core processor from IBM, Sony and Toshiba, and provides the potential to achieve an impressive level of performance for...
Rubing Duan, Alfred Strey