IMPROVING PAGING PERFORMANCE OF MEMORY-INTENSIVE APPLICATIONS WITH MEMORY ACCESS PATTERN GUIDED PAGE REPLACEMENT

Bibliographic Details
Main Author: ALI, NAWAB
Language:English
Published: University of Cincinnati / OhioLINK 2004
Online Access:http://rave.ohiolink.edu/etdc/view?acc_num=ucin1092701375
id ndltd-OhioLink-oai-etd.ohiolink.edu-ucin1092701375
record_format oai_dc
spelling ndltd-OhioLink-oai-etd.ohiolink.edu-ucin10927013752021-08-03T06:09:46Z IMPROVING PAGING PERFORMANCE OF MEMORY-INTENSIVE APPLICATIONS WITH MEMORY ACCESS PATTERN GUIDED PAGE REPLACEMENT ALI, NAWAB Memory-intensive applications have large data sets which cannot be accommodated in the available main memory. The Virtual Memory (VM) sub-system frequently moves parts of their data sets between the main memory and the secondary storage (swap disk). This results in a significant increase in the paging I/O traffic of the applications. Since the disk sub-system is orders of magnitude slower than the main memory, this increase in I/O traffic severely degrades the applications' performance. In this research, we reduce the paging I/O traffic of memory-intensive applications by exploiting the patterns in their memory access behavior. Most out-of-core applications exhibit clear patterns in the manner in which they access their virtual address space. We collect and analyze the memory access patterns of these applications and use this information to guide the page replacement algorithm. This technique, when coupled with memory prefetching and page clustering results in a substantial performance improvement for large, memory-intensive applications. We conducted trace-driven simulations on the NAS Parallel Benchmarks (NPB) to evaluate our paging optimization algorithms. The simulation results show a considerable improvement in the performance of our benchmarks. Our page replacement strategy reduced the average paging I/O traffic by 52%. On combining memory prefetching with our pattern guided page replacement algorithm, we observed an average performance improvement of up to 69%. These results are encouraging, and we hope to further improve the VM performance of memory-intensive applications by adding hardware support to our strategy. 2004-08-20 English text University of Cincinnati / OhioLINK http://rave.ohiolink.edu/etdc/view?acc_num=ucin1092701375 http://rave.ohiolink.edu/etdc/view?acc_num=ucin1092701375 unrestricted This thesis or dissertation is protected by copyright: all rights reserved. It may not be copied or redistributed beyond the terms of applicable copyright laws.
collection NDLTD
language English
sources NDLTD
author ALI, NAWAB
spellingShingle ALI, NAWAB
IMPROVING PAGING PERFORMANCE OF MEMORY-INTENSIVE APPLICATIONS WITH MEMORY ACCESS PATTERN GUIDED PAGE REPLACEMENT
author_facet ALI, NAWAB
author_sort ALI, NAWAB
title IMPROVING PAGING PERFORMANCE OF MEMORY-INTENSIVE APPLICATIONS WITH MEMORY ACCESS PATTERN GUIDED PAGE REPLACEMENT
title_short IMPROVING PAGING PERFORMANCE OF MEMORY-INTENSIVE APPLICATIONS WITH MEMORY ACCESS PATTERN GUIDED PAGE REPLACEMENT
title_full IMPROVING PAGING PERFORMANCE OF MEMORY-INTENSIVE APPLICATIONS WITH MEMORY ACCESS PATTERN GUIDED PAGE REPLACEMENT
title_fullStr IMPROVING PAGING PERFORMANCE OF MEMORY-INTENSIVE APPLICATIONS WITH MEMORY ACCESS PATTERN GUIDED PAGE REPLACEMENT
title_full_unstemmed IMPROVING PAGING PERFORMANCE OF MEMORY-INTENSIVE APPLICATIONS WITH MEMORY ACCESS PATTERN GUIDED PAGE REPLACEMENT
title_sort improving paging performance of memory-intensive applications with memory access pattern guided page replacement
publisher University of Cincinnati / OhioLINK
publishDate 2004
url http://rave.ohiolink.edu/etdc/view?acc_num=ucin1092701375
work_keys_str_mv AT alinawab improvingpagingperformanceofmemoryintensiveapplicationswithmemoryaccesspatternguidedpagereplacement
_version_ 1719431970844311552