On Increasing the Effective Blocking Factor of a Matrix for a Given Cache Organization

Abstract

Blocking (Tiling) techniques of iteration spaces to increase data reuse in the cache were reviewed. Results consistent with those previously published were experimentally obtained. The relation between the sizes of the declared matrix and the cache was studied. Based on this relation, two algorithms were presented. Both algorithms attempt to increase the critical blocking factor with no self-interference (Bc) by changing the declared matrix size. Furthermore, the execution time of the second algorithm is independent of the matrix size. Experiments based on these algorithms were performed which showed a consistent superior performance (in terms of Mflops) relative to the performance obtained using previously published algorithms for deriving Bc. Self-interference misses, Blocking, Tiling, Cache, Array size, Performance.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1992
Accession Number
ADA257342

Entities

People

  • Atilla N. Demirhan

Organizations

  • Naval Postgraduate School

Tags

Communities of Interest

  • C4I
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Applied Mathematics
  • Classification
  • Compilers
  • Computations
  • Computer Programming
  • Computer Programs
  • Computer Science
  • Computers
  • Information Transfer
  • Iterations
  • Language
  • Operating Systems
  • Parallel Computing
  • Parallel Processing
  • Schools
  • Security

Readers

  • Linear Algebra
  • Parallel and Distributed Computing.

Technology Areas

  • Space
  • Space - Space Objects