Sciweavers

4541 search results - page 554 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
EUROSYS
2011
ACM
14 years 10 months ago
Finding complex concurrency bugs in large multi-threaded applications
Parallel software is increasingly necessary to take advantage of multi-core architectures, but it is also prone to concurrency bugs which are particularly hard to avoid, find, an...
Pedro Fonseca, Cheng Li, Rodrigo Rodrigues
DAC
2002
ACM
16 years 8 months ago
Exploiting shared scratch pad memory space in embedded multiprocessor systems
In this paper, we present a compiler strategy to optimize data accesses in regular array-intensive applications running on embedded multiprocessor environments. Specifically, we p...
Mahmut T. Kandemir, J. Ramanujam, Alok N. Choudhar...
ICDM
2009
IEEE
132views Data Mining» more  ICDM 2009»
16 years 1 months ago
Bayesian Overlapping Subspace Clustering
Given a data matrix, the problem of finding dense/uniform sub-blocks in the matrix is becoming important in several applications. The problem is inherently combinatorial since th...
Qiang Fu, Arindam Banerjee
ICDM
2006
IEEE
130views Data Mining» more  ICDM 2006»
16 years 1 months ago
Efficient Clustering for Orders
Lists of ordered objects are widely used as representational forms. Such ordered objects include Web search results or best-seller lists. Clustering is a useful data analysis tech...
Toshihiro Kamishima, Shotaro Akaho
PLDI
2006
ACM
16 years 1 months ago
LOCKSMITH: context-sensitive correlation analysis for race detection
One common technique for preventing data races in multi-threaded programs is to ensure that all accesses to shared locations are consistently protected by a lock. We present a too...
Polyvios Pratikakis, Jeffrey S. Foster, Michael W....