Sciweavers

455 search results - page 72 / 91
» Application analysis using memory pressure
Sort
View
ACMMSP
2005
ACM
101views Hardware» more  ACMMSP 2005»
14 years 3 months ago
Transparent pointer compression for linked data structures
64-bit address spaces are increasingly important for modern applications, but they come at a price: pointers use twice as much memory, reducing the effective cache capacity and m...
Chris Lattner, Vikram S. Adve
IPPS
2010
IEEE
13 years 7 months ago
Highly scalable parallel sorting
Sorting is a commonly used process with a wide breadth of applications in the high performance computing field. Early research in parallel processing has provided us with comprehen...
Edgar Solomonik, Laxmikant V. Kalé
CIVR
2009
Springer
174views Image Analysis» more  CIVR 2009»
14 years 4 months ago
Evaluation of GIST descriptors for web-scale image search
The GIST descriptor has recently received increasing attention in the context of scene recognition. In this paper we evaluate the search accuracy and complexity of the global GIST...
Matthijs Douze, Herve Jegou, Harsimrat Sandhawalia...
ISCA
2008
IEEE
170views Hardware» more  ISCA 2008»
14 years 4 months ago
Polymorphic On-Chip Networks
As the number of cores per die increases, be they processors, memory blocks, or custom accelerators, the on-chip interconnect the cores use to communicate gains importance. We beg...
Martha Mercaldi Kim, John D. Davis, Mark Oskin, To...
FMCAD
2006
Springer
14 years 1 months ago
Liveness and Boundedness of Synchronous Data Flow Graphs
Synchronous Data Flow Graphs (SDFGs) have proven to be suitable for specifying and analyzing streaming applications that run on single- or multi-processor platforms. Streaming appl...
Amir Hossein Ghamarian, Marc Geilen, Twan Basten, ...