Technical Report CS0794

TR#:CS0794
Class:CS
Title: ON THE COMPLEXITY OF DIRECT CACHING.
Authors: Y. Hollander and A. Itai
PDFCS0794.pdf
Abstract:

In this paper we study positioning strategies for improving the performance of a memory system with a direct mapped cache. A positioning technique determines for every program item, instruction or data, its address in main memory. We break the general positioning problem into two, the collision minimization and the grouping problems. We show that both the mapping and the grouping problems are NP-complete and that the mapping problem is also hard to approximate. In addition, we look at probabilistic models. While in the Independent Reference Model (IRM), the optimal strategies can be found by simple polynomial algorithms [2], in the more realistic Markov model we show that the grouping problem is NP-complete.

CopyrightThe above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information

Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1993/CS/CS0794), rather than to the URL of the PDF files directly. The latter URLs may change without notice.

To the list of the CS technical reports of 1993
To the main CS technical reports page

Computer science department, Technion
admin