Sciweavers

5553 search results - page 428 / 1111
» Parallel Implementation of Sch
Sort
View
TVCG
2010
141views more  TVCG 2010»
15 years 4 months ago
Fast Construction of k-Nearest Neighbor Graphs for Point Clouds
—We present a parallel algorithm for k-nearest neighbor graph construction that uses Morton ordering. Experiments show that our approach has the following advantages over existin...
Michael Connor, Piyush Kumar
ICDCS
2012
IEEE
13 years 8 months ago
Scaling Down Off-the-Shelf Data Compression: Backwards-Compatible Fine-Grain Mixing
—Pu and Singaravelu presented Fine-Grain Mixing, an adaptive compression system which aimed to maximize CPU and network utilization simultaneously by splitting a network stream i...
Michael Gray, Peter Peterson, Peter L. Reiher
218
Voted
ICDCS
2012
IEEE
13 years 8 months ago
Combining Partial Redundancy and Checkpointing for HPC
Today’s largest High Performance Computing (HPC) systems exceed one Petaflops (1015 floating point operations per second) and exascale systems are projected within seven years...
James Elliott, Kishor Kharbas, David Fiala, Frank ...
232
Voted
HPDC
2012
IEEE
13 years 8 months ago
Dynamic adaptive virtual core mapping to improve power, energy, and performance in multi-socket multicores
Consider a multithreaded parallel application running inside a multicore virtual machine context that is itself hosted on a multi-socket multicore physical machine. How should the...
Chang Bae, Lei Xia, Peter A. Dinda, John R. Lange
ICS
2007
Tsinghua U.
16 years 9 days ago
Scheduling FFT computation on SMP and multicore systems
Increased complexity of memory systems to ameliorate the gap between the speed of processors and memory has made it increasingly harder for compilers to optimize an arbitrary code...
Ayaz Ali, S. Lennart Johnsson, Jaspal Subhlok