Sciweavers

543 search results - page 8 / 109
» A Randomized Parallel Sorting Algorithm with an Experimental...
Sort
View
ESA
2006
Springer
82views Algorithms» more  ESA 2006»
13 years 11 months ago
The Price of Resiliency: A Case Study on Sorting with Memory Faults
We address the problem of sorting in the presence of faults that may arbitrarily corrupt memory locations, and investigate the impact of memory faults both on the correctness and ...
Umberto Ferraro Petrillo, Irene Finocchi, Giuseppe...
ISCAPDCS
2004
13 years 9 months ago
Randomized Sorting on the POPS Network
Partitioned Optical Passive Stars (POPS) network has been presented recently as a desirable model of parallel computation. Several papers have been published that address fundamen...
Jaime Davila, Sanguthevar Rajasekaran
FUIN
2008
103views more  FUIN 2008»
13 years 7 months ago
Implementing Sorting Networks with Spiking Neural P Systems
Spiking neural P systems simulate the behavior of neurons sending signals through axons. Recently, some applications concerning Boolean circuits and sorting algorithms have been pr...
Rodica Ceterchi, Alexandru Ioan Tomescu

Publication
189views
13 years 11 months ago
Direct Send Compositing for Parallel Sort-Last Rendering
In contrast to sort-first, sort-last parallel rendering has the distinct advantage that the task division for parallel geometry processing and rasterization is simple, and can eas...
Stefan Eilemann, Renato Pajarola
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