Sciweavers

1720 search results - page 163 / 344
» Unranking Combinations in Parallel
Sort
View
IPPS
2010
IEEE
15 years 2 months ago
Performance modeling of heterogeneous systems
Predicting how well applications may run on modern systems is becoming increasingly challenging. It is no longer sufficient to look at number of floating point operations and commu...
Jan Christian Meyer, Anne C. Elster
HPCA
2011
IEEE
14 years 7 months ago
MOPED: Orchestrating interprocess message data on CMPs
Future CMPs will combine many simple cores with deep cache hierarchies. With more cores, cache resources per core are fewer, and must be shared carefully to avoid poor utilization...
Junli Gu, Steven S. Lumetta, Rakesh Kumar, Yihe Su...
ICCV
2009
IEEE
1035views Computer Vision» more  ICCV 2009»
16 years 9 months ago
Efficient High-Quality Image Contour Detection
Image contour detection is fundamental to many image analysis applications, including image segmentation, object recognition and classification. However, highly accurate image c...
Bryan Catanzaro, Bor-Yiing Su, Narayanan Sundaram,...
HPCA
2003
IEEE
16 years 4 months ago
Tradeoffs in Buffering Memory State for Thread-Level Speculation in Multiprocessors
Thread-level speculation provides architectural support to aggressively run hard-to-analyze code in parallel. As speculative tasks run concurrently, they generate unsafe or specul...
María Jesús Garzarán, Milos P...
WEA
2010
Springer
311views Algorithms» more  WEA 2010»
15 years 11 months ago
Geometric Minimum Spanning Trees with GeoFilterKruskal
Let P be a set of points in Rd . We propose GEOFILTERKRUSKAL, an algorithm that computes the minimum spanning tree of P using well separated pair decomposition in combination with ...
Samidh Chatterjee, Michael Connor, Piyush Kumar