182 search results - page 5 / 37 » The cache complexity of multithreaded cache oblivious algori... |
157
Voted
ACMMSP
2006
ACM
15 years 8 months ago
2006
ACM
Stencil-based kernels constitute the core of many scientific applications on block-structured grids. Unfortunately, these codes achieve a low fraction of peak performance, due pr...
213
Voted
ISAAC
2010
Springer
15 years 20 days ago
2010
Springer
Abstract. In this paper we present an implicit dictionary with the working set property i.e. a dictionary supporting insert(e), delete(x) and predecessor(x) in O(log n) time and se...
191
Voted
MST
2010
14 years 9 months ago
2010
We consider triply-nested loops of the type that occur in the standard Gaussian elimination algorithm, which we denote by GEP (or the Gaussian Elimination Paradigm). We present tw...
114
Voted
SODA
2010
ACM
15 years 1 months ago
2010
ACM
Several existing cache-oblivious dynamic dictionaries achieve O(logB N) (or slightly better O(logB N M )) memory transfers per operation, where N is the number of items stored, M ...
100
Voted
IPPS
1998
IEEE
15 years 7 months ago
1998
IEEE
Several fast sequential algorithms have been proposed in the past to multiply sparse matrices. These algorithms do not explicitlyaddresstheimpactofcachingonperformance. We show th...