Association Rule Learning in Hybrid Memory Systems
Feng, Kevin
This item is only available for download by members of the University of Illinois community. Students, faculty, and staff at the U of I may log in with your NetID and password to view the item. If you are trying to access an Illinois-restricted dissertation or thesis, you can request a copy through your library's Inter-Library Loan office or purchase a copy directly from ProQuest.
Permalink
https://hdl.handle.net/2142/97852
Description
Title
Association Rule Learning in Hybrid Memory Systems
Author(s)
Feng, Kevin
Issue Date
2017-05
Keyword(s)
Hybrid memory
Machine learning
Association
Memory management
Abstract
One of the recent computing problems to emerge is the balance between low latency dynamic random
access memory (DRAM) and inexpensive storage of non-volatile memory (NVM). NVM technologies are
more desirable than DRAM in the respect that they have higher memory density and lower idle power
consumption making them useful for storing a bulk of the memory for a program at any given time.
However, the sole use of NVM technologies cannot meet the low latency expectation that we have for
fast computations. For this reason, researchers explore hybrid memory system designs that combine
DRAM and NVM technology to get the benefits from each side of the spectrum. The main topic of
research in this field is the page placement policy that decides when to move memory from NVM to
DRAM. The difficulty in deciding a policy is to come up with a model or strategy that can effectively
predict the next memory access. Due to the nature of memory accesses, it is very difficult to come up
with a model that can accurately represent this. Recently, techniques in machine learning can estimate
models over training datasets. Through the use of machine learning, it may be possible to accurately
learn the model through training over past memory traces. The nature of our research in this paper is to
test the practicality association rule learning algorithm for page prediction. The test setting for
experimentation was the page ranking program executed on a non-uniform memory access (NUMA)
system. We find that the implementation we propose is less efficient than program execution without a
page migration policy.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.
