432 search results - page 20 / 87 » Internally deterministic parallel algorithms can be fast |
ICALP
2010
Springer
14 years 11 months ago
2010
Springer
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...
ICS
2009
Tsinghua U.
15 years 4 months ago
2009
Tsinghua U.
General purpose programming on the graphics processing units (GPGPU) has received a lot of attention in the parallel computing community as it promises to offer the highest perfo...
VLSID
2000
IEEE
15 years 1 months ago
2000
IEEE
Digital images are convenient media for describing and storing spatial, temporal, spectral, and physical components of information contained in a variety of domains(e.g. aerial/sa...
106
click to vote
TC
2002
14 years 9 months ago
2002
We investigate whether asynchronous computational models and asynchronous algorithms can be considered for designing real-time distributed fault-tolerant systems. A priori, the lac...
IPPS
2005
IEEE
15 years 3 months ago
2005
IEEE
In this paper, our contributions are two-fold: First, we enhance the Min-Min and Sufferage heuristics under three risk modes driven by security concerns. Second, we propose a new ...