By Topic

Link-Fit and Lazy-Fit Algorithms in Compressed Memory System

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

6 Author(s)
Md Yusof, Z. ; Fac. of Electr. Eng., Univ. Teknol. Malaysia, Johor Bahru, Malaysia ; Tan, C.-Y. ; Wong, A.-N. ; Ibrahim, Z.
more authors

Compressed memory system is a high performance memory system that is capable to reduce memory size and improve memory performance. This project focuses on the memory management of compressed memory and a secondlevel memory and compares different compress memory allocation algorithms. Two dynamic memory allocation algorithms, which are lazy-fit and link-fit algorithms are analyzed to determine their impacts on memory compression and memory access time. In this work, systemC design approach is used to design the compressed memory system. The compressed memory system is designed from C modeling and refined to systemC register-transfer level abstraction. The simulation results show the lazy-fit system has better allocation speed compared to the one based on link-fit algorithm.

Published in:

Mathematical/Analytical Modelling and Computer Simulation (AMS), 2010 Fourth Asia International Conference on

Date of Conference:

26-28 May 2010