Sciweavers

3047 search results - page 265 / 610
» Randomized Parallel Selection
Sort
View
CORR
2008
Springer
131views Education» more  CORR 2008»
14 years 11 months ago
Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs
We present a deterministic way of assigning small (log bit) weights to the edges of a bipartite planar graph so that the minimum weight perfect matching becomes unique. The isolati...
Samir Datta, Raghav Kulkarni, Sambuddha Roy
SIGMETRICS
2011
ACM
178views Hardware» more  SIGMETRICS 2011»
14 years 6 months ago
Should we worry about memory loss?
In recent years the High Performance Computing (HPC) industry has benefited from the development of higher density multi-core processors. With recent chips capable of executing u...
O. Perks, Simon D. Hammond, S. J. Pennycook, Steph...
DCOSS
2011
Springer
13 years 11 months ago
Distributed local broadcasting algorithms in the physical interference model
—Given a set of sensor nodes V where each node wants to broadcast a message to all its neighbors that are within a certain broadcasting range, the local broadcasting problem is t...
Dongxiao Yu, Yuexuan Wang, Qiang-Sheng Hua, Franci...
HPCA
2012
IEEE
13 years 7 months ago
Decoupled dynamic cache segmentation
The least recently used (LRU) replacement policy performs poorly in the last-level cache (LLC) because temporal locality of memory accesses is filtered by first and second level...
Samira Manabi Khan, Zhe Wang, Daniel A. Jimé...
IPPS
2008
IEEE
15 years 5 months ago
Evaluation of dynamic scheduling methods in simulations of storm-time ion acceleration
In this paper we investigate the applicability of classic dynamic loop scheduling methods on a numerical simulation code that calculates the trajectories of charged particles in t...
Ioannis Riakiotakis, Georgios I. Goumas, Nectarios...