Empirical study of parallel trace-driven LRU cache simulators

David Nicol, Eric Carr

Research output: Contribution to conferencePaper

Abstract

This paper reports on the performance of four parallel algorithms for simulating an associative cache operating under the LRU (Least-Recently-Used) replacement policy. Three of the algorithms are implemented on the MasPar MP-2. Another algorithm is a parallelization of an efficient serial algorithm on the Intel Paragon. We assess the strengths and weaknesses of these algorithms as a function of problem size and characteristics, and compare their performance on traces derived from execution of three SPEC92 benchmark programs.

Original languageEnglish (US)
Pages166-169
Number of pages4
DOIs
StatePublished - 1995
EventProceedings of the 9th Workshop on Parallel and Distributed Simulation (PADS'95) - Lake Placid, NY, USA
Duration: Jun 14 1995Jun 16 1995

Other

OtherProceedings of the 9th Workshop on Parallel and Distributed Simulation (PADS'95)
CityLake Placid, NY, USA
Period6/14/956/16/95

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'Empirical study of parallel trace-driven LRU cache simulators'. Together they form a unique fingerprint.

  • Cite this

    Nicol, D., & Carr, E. (1995). Empirical study of parallel trace-driven LRU cache simulators. 166-169. Paper presented at Proceedings of the 9th Workshop on Parallel and Distributed Simulation (PADS'95), Lake Placid, NY, USA, . https://doi.org/10.1145/214283.214333