Sciweavers

57 search results - page 5 / 12
» An Optimal Parallel Algorithm for Sorting Multisets
Sort
View
DAM
2007
105views more  DAM 2007»
13 years 7 months ago
Recognizing and representing proper interval graphs in parallel using merging and sorting
We present a parallel algorithm for recognizing and representing a proper interval graph in O(log2 n) time with O(m + n) processors on the CREW PRAM, where m and n are the number ...
Jørgen Bang-Jensen, Jing Huang, Louis Ibarr...
IPPS
2007
IEEE
14 years 1 months ago
Optimizing Sorting with Machine Learning Algorithms
The growing complexity of modern processors has made the development of highly efficient code increasingly difficult. Manually developing highly efficient code is usually expen...
Xiaoming Li, María Jesús Garzar&aacu...
STACS
1995
Springer
13 years 11 months ago
Optimal Average Case Sorting on Arrays
Abstract. We present algorithms for sorting and routing on two-dimensional mesh-connected parallel architectures that are optimal on average. If one processor has many packets then...
Manfred Kunde, Rolf Niedermeier, Klaus Reinhardt, ...
SPAA
1995
ACM
13 years 11 months ago
Parallel Sorting with Limited Bandwidth
We study the problem of sorting on a parallel computer with limited communication bandwidth. By using the PRAM(m) model, where p processors communicate through a globally shared me...
Micah Adler, John W. Byers, Richard M. Karp
ICALP
2010
Springer
13 years 9 months ago
Resource Oblivious Sorting on Multicores
We present a new deterministic sorting algorithm that interleaves the partitioning of a sample sort with merging. Sequentially, it sorts n elements in O(n log n) time cache-oblivi...
Richard Cole, Vijaya Ramachandran