Performance prediction of paging workloads using lightweight tracing

A trace of a workload's system calls can be obtained with minimal interference, and can be used to drive repeatable experiments to evaluate system configuration alternatives. Replaying system call traces alone sometimes leads to inaccurate predictions because paging, and access to memory-mapped...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Burton, A.N., Kelly, P.H.J.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page 8 pp.
container_title
container_volume
creator Burton, A.N.
Kelly, P.H.J.
description A trace of a workload's system calls can be obtained with minimal interference, and can be used to drive repeatable experiments to evaluate system configuration alternatives. Replaying system call traces alone sometimes leads to inaccurate predictions because paging, and access to memory-mapped files, are not modelled. The paper extends tracing to handle such workloads. At trace capture time, the application's page-level virtual memory access is monitored. The size of the page access trace, and capture overheads, are reduced by excluding recently-accessed pages. This leads to a slight loss of accuracy. Using a suite of memory-intensive applications, we evaluate the capture overhead and measure the predictive accuracy of the approach.
doi_str_mv 10.1109/IPDPS.2003.1213499
format Conference Proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_1213499</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1213499</ieee_id><sourcerecordid>1213499</sourcerecordid><originalsourceid>FETCH-LOGICAL-i90t-c260f92ce3b9f5c9b5dec6e11eba33c7738eca362271ef7771df2f4b45554f0c3</originalsourceid><addsrcrecordid>eNotT0tOwzAUtARIlNILwMYXSHjPnxgvUcunUiUi0X3lOM_BkDaRE1Rxe1LRWcxoZjGaYewOIUcE-7AuV-VHLgBkjgKlsvaC3YAprEYrCrxkM9QSMgFGX7PFMHzBBKW1UjBjq5JS6NLeHTzxPlEd_Ri7A-8C710TDw0_dum77Vw98J_h5NvYfI5HOjEfk_NTdsuugmsHWpx1zrYvz9vlW7Z5f10vnzZZtDBmXhQQrPAkKxu0t5WuyReESJWT0hsjH8k7WQhhkIIxBusggqqmqVoF8HLO7v9rIxHt-hT3Lv3uzp_lH_YMTGY</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Performance prediction of paging workloads using lightweight tracing</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Burton, A.N. ; Kelly, P.H.J.</creator><creatorcontrib>Burton, A.N. ; Kelly, P.H.J.</creatorcontrib><description>A trace of a workload's system calls can be obtained with minimal interference, and can be used to drive repeatable experiments to evaluate system configuration alternatives. Replaying system call traces alone sometimes leads to inaccurate predictions because paging, and access to memory-mapped files, are not modelled. The paper extends tracing to handle such workloads. At trace capture time, the application's page-level virtual memory access is monitored. The size of the page access trace, and capture overheads, are reduced by excluding recently-accessed pages. This leads to a slight loss of accuracy. Using a suite of memory-intensive applications, we evaluate the capture overhead and measure the predictive accuracy of the approach.</description><identifier>ISSN: 1530-2075</identifier><identifier>ISBN: 0769519261</identifier><identifier>ISBN: 9780769519265</identifier><identifier>DOI: 10.1109/IPDPS.2003.1213499</identifier><language>eng</language><publisher>IEEE</publisher><subject>Accuracy ; Control systems ; Educational institutions ; Hardware ; Interference ; Monitoring ; Operating systems ; Predictive models ; Random access memory ; System performance</subject><ispartof>Proceedings International Parallel and Distributed Processing Symposium, 2003, p.8 pp.</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1213499$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2051,4035,4036,27904,54898</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1213499$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Burton, A.N.</creatorcontrib><creatorcontrib>Kelly, P.H.J.</creatorcontrib><title>Performance prediction of paging workloads using lightweight tracing</title><title>Proceedings International Parallel and Distributed Processing Symposium</title><addtitle>IPDPS</addtitle><description>A trace of a workload's system calls can be obtained with minimal interference, and can be used to drive repeatable experiments to evaluate system configuration alternatives. Replaying system call traces alone sometimes leads to inaccurate predictions because paging, and access to memory-mapped files, are not modelled. The paper extends tracing to handle such workloads. At trace capture time, the application's page-level virtual memory access is monitored. The size of the page access trace, and capture overheads, are reduced by excluding recently-accessed pages. This leads to a slight loss of accuracy. Using a suite of memory-intensive applications, we evaluate the capture overhead and measure the predictive accuracy of the approach.</description><subject>Accuracy</subject><subject>Control systems</subject><subject>Educational institutions</subject><subject>Hardware</subject><subject>Interference</subject><subject>Monitoring</subject><subject>Operating systems</subject><subject>Predictive models</subject><subject>Random access memory</subject><subject>System performance</subject><issn>1530-2075</issn><isbn>0769519261</isbn><isbn>9780769519265</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2003</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotT0tOwzAUtARIlNILwMYXSHjPnxgvUcunUiUi0X3lOM_BkDaRE1Rxe1LRWcxoZjGaYewOIUcE-7AuV-VHLgBkjgKlsvaC3YAprEYrCrxkM9QSMgFGX7PFMHzBBKW1UjBjq5JS6NLeHTzxPlEd_Ri7A-8C710TDw0_dum77Vw98J_h5NvYfI5HOjEfk_NTdsuugmsHWpx1zrYvz9vlW7Z5f10vnzZZtDBmXhQQrPAkKxu0t5WuyReESJWT0hsjH8k7WQhhkIIxBusggqqmqVoF8HLO7v9rIxHt-hT3Lv3uzp_lH_YMTGY</recordid><startdate>2003</startdate><enddate>2003</enddate><creator>Burton, A.N.</creator><creator>Kelly, P.H.J.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>2003</creationdate><title>Performance prediction of paging workloads using lightweight tracing</title><author>Burton, A.N. ; Kelly, P.H.J.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i90t-c260f92ce3b9f5c9b5dec6e11eba33c7738eca362271ef7771df2f4b45554f0c3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2003</creationdate><topic>Accuracy</topic><topic>Control systems</topic><topic>Educational institutions</topic><topic>Hardware</topic><topic>Interference</topic><topic>Monitoring</topic><topic>Operating systems</topic><topic>Predictive models</topic><topic>Random access memory</topic><topic>System performance</topic><toplevel>online_resources</toplevel><creatorcontrib>Burton, A.N.</creatorcontrib><creatorcontrib>Kelly, P.H.J.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Burton, A.N.</au><au>Kelly, P.H.J.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Performance prediction of paging workloads using lightweight tracing</atitle><btitle>Proceedings International Parallel and Distributed Processing Symposium</btitle><stitle>IPDPS</stitle><date>2003</date><risdate>2003</risdate><spage>8 pp.</spage><pages>8 pp.-</pages><issn>1530-2075</issn><isbn>0769519261</isbn><isbn>9780769519265</isbn><abstract>A trace of a workload's system calls can be obtained with minimal interference, and can be used to drive repeatable experiments to evaluate system configuration alternatives. Replaying system call traces alone sometimes leads to inaccurate predictions because paging, and access to memory-mapped files, are not modelled. The paper extends tracing to handle such workloads. At trace capture time, the application's page-level virtual memory access is monitored. The size of the page access trace, and capture overheads, are reduced by excluding recently-accessed pages. This leads to a slight loss of accuracy. Using a suite of memory-intensive applications, we evaluate the capture overhead and measure the predictive accuracy of the approach.</abstract><pub>IEEE</pub><doi>10.1109/IPDPS.2003.1213499</doi></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 1530-2075
ispartof Proceedings International Parallel and Distributed Processing Symposium, 2003, p.8 pp.
issn 1530-2075
language eng
recordid cdi_ieee_primary_1213499
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Accuracy
Control systems
Educational institutions
Hardware
Interference
Monitoring
Operating systems
Predictive models
Random access memory
System performance
title Performance prediction of paging workloads using lightweight tracing
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-25T07%3A22%3A01IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Performance%20prediction%20of%20paging%20workloads%20using%20lightweight%20tracing&rft.btitle=Proceedings%20International%20Parallel%20and%20Distributed%20Processing%20Symposium&rft.au=Burton,%20A.N.&rft.date=2003&rft.spage=8%20pp.&rft.pages=8%20pp.-&rft.issn=1530-2075&rft.isbn=0769519261&rft.isbn_list=9780769519265&rft_id=info:doi/10.1109/IPDPS.2003.1213499&rft_dat=%3Cieee_6IE%3E1213499%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=1213499&rfr_iscdi=true