Improving cache performance in dynamic applications through data and computation reorganization at run time

Ding, Chen; Kennedy, Ken

doi:10.1145/301618.301670

Cited by 169 publications

(98 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This approach claims to deliver execution time reductions averaging 20% in a multiprocessor and 30% in a uniprocessor due to significant increases in memory parallelism. A runtime approach to improve computation and data locality in irregular programs based on the inspector-executor method used by Saltz has been proposed in [13]. This work improves computation and data locality, and also eliminates most of the runtime overhead.…”

Section: Code Transformation and Compiler-based Solutionsmentioning

confidence: 99%

Dynamic Data Shapers Optimize Performance in Dynamic Binary Optimization (DBO) Environment

Venkatesan

Ponpandi

Tyagi

2015

2015 IEEE International Symposium on Nanoelectronic and Information Systems

View full text Add to dashboard Cite

Section: Code Transformation and Compiler-based Solutionsmentioning

confidence: 99%

Dynamic Data Shapers Optimize Performance in Dynamic Binary Optimization (DBO) Environment

Venkatesan

Ponpandi

Tyagi

2015

2015 IEEE International Symposium on Nanoelectronic and Information Systems

View full text Add to dashboard Cite

“…For N-body simulation, irregular mesh, and sparse matrix computations, a number of studies have showed that run-time reordering can improve sequential running time despite its cost. Ding and Kennedy used lexicographic grouping [6]. Han and Tseng used lexicographic sorting [7].…”

Section: Related Workmentioning

confidence: 99%

A Key-based Adaptive Transactional Memory Executor

Bai

Shen

Zhang

et al. 2007

2007 IEEE International Parallel and Distributed Processing Symposium

Self Cite

View full text Add to dashboard Cite

Software transactional memory systems enable a programmer to easily write concurrent data structures such as lists, trees, hashtables, and graphs, where non-conflicting operations proceed in parallel. Many of these structures take the abstract form of a dictionary, in which each transaction is associated with a search key. By regrouping transactions based on their keys, one may improve locality and reduce conflicts among parallel transactions.In this paper, we present an executor that partitions transactions among available processors. Our key-based adaptive partitioning monitors incoming transactions, estimates the probability distribution of their keys, and adaptively determines the (usually nonuniform) partitions. By comparing the adaptive partitioning with uniform partitioning and round-robin keyless partitioning on a 16-processor SunFire 6800 machine, we demonstrate that key-based adaptive partitioning significantly improves the throughput of fine-grained parallel operations on concurrent data structures.

show abstract

“…Section 4 discusses the inexact Newton method implemented and the computational techniques used to improve performance. One technique is to reorder the input data to obtain better locality of reference and cache performance [12,21]. This modification results in a 40% reduction in the overall solution time for the largest meshes tested.…”

Section: Introductionmentioning

confidence: 99%

Mesh shape-quality optimization using the inverse mean-ratio metric

Munson

2006

Math. Program.

View full text Add to dashboard Cite

Meshes containing elements with bad quality can result in poorly conditioned systems of equations that must be solved when using a discretization method, such as the finite-element method, for solving a partial differential equation. Moreover, such meshes can lead to poor accuracy in the approximate solution computed. In this paper, we present a nonlinear fractional program that relocates the vertices of a given mesh to optimize the average element shape quality as measured by the inverse mean-ratio metric. To solve the resulting large-scale optimization problems, we apply an efficient implementation of an inexact Newton algorithm using the conjugate gradient method with a block Jacobi preconditioner to compute the direction. We show that the block Jacobi preconditioner is positive definite by proving a general theorem concerning the convexity of fractional functions, applying this result to components of the inverse meanratio metric, and showing that each block in the preconditioner is invertible. Numerical results obtained with this special-purpose code on several test meshes are presented and used to quantify the impact on solution time and memory requirements of using a modeling language and general-purpose algorithm to solve these problems.

show abstract

Improving cache performance in dynamic applications through data and computation reorganization at run time

Cited by 169 publications

References 16 publications

Dynamic Data Shapers Optimize Performance in Dynamic Binary Optimization (DBO) Environment

Dynamic Data Shapers Optimize Performance in Dynamic Binary Optimization (DBO) Environment

A Key-based Adaptive Transactional Memory Executor

Mesh shape-quality optimization using the inverse mean-ratio metric

Contact Info

Product

Resources

About