Sciweavers

133 search results - page 6 / 27
» Sorting on Clusters of SMPs
Sort
View
ISPASS
2003
IEEE
14 years 3 months ago
Performance study of a cluster runtime system for dynamic interactive stream-oriented applications
Emerging application domains such as interactive vision, animation, and multimedia collaboration display dynamic scalable parallelism, and high computational requirements, making ...
Arnab Paul, Nissim Harel, Sameer Adhikari, Bikash ...
SOSP
1997
ACM
13 years 11 months ago
Cashmere-2L: Software Coherent Shared Memory on a Clustered Remote-Write Network
Low-latency remote-write networks, such as DEC’s Memory Channel, provide the possibility of transparent, inexpensive, large-scale shared-memory parallel computing on clusters of...
Robert Stets, Sandhya Dwarkadas, Nikos Hardavellas...
CONCURRENCY
2007
101views more  CONCURRENCY 2007»
13 years 9 months ago
OpenUH: an optimizing, portable OpenMP compiler
OpenMP has gained wide popularity as an API for parallel programming on shared memory and distributed shared memory platforms. Despite its broad availability, there remains a need ...
Chunhua Liao, Oscar Hernandez, Barbara M. Chapman,...
NIPS
1998
13 years 11 months ago
Multi-Electrode Spike Sorting by Clustering Transfer Functions
A new paradigm is proposed for sorting spikes in multi-electrode data using ratios of transfer functions between cells and electrodes. It is assumed that for every cell and electr...
Dmitry Rinberg, Hanan Davidowitz, Naftali Tishby
ALGORITHMICA
2006
86views more  ALGORITHMICA 2006»
13 years 9 months ago
Slabpose Columnsort: A New Oblivious Algorithm for Out-of-Core Sorting on Distributed-Memory Clusters
Our goal is to develop a robust out-of-core sorting program for a distributed-memory cluster. The literature contains two dominant paradigms for out-of-core sorting algorithms: me...
Geeta Chaudhry, Thomas H. Cormen