Method and system for allocating cache memory for a network database service
A method is provided for estimating the size of cache memory required for optimal performance of a network database service, such as a directory service, by means of an iterative process. In the estimation process, the memory size N for best-case performance (i.e., the memory size that avoids any di...
Gespeichert in:
Hauptverfasser: | , , |
---|---|
Format: | Patent |
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 | |
container_title | |
container_volume | |
creator | TAY YONG CHIANG PANG JEE FUNG RAGHURAMAN MELUR K |
description | A method is provided for estimating the size of cache memory required for optimal performance of a network database service, such as a directory service, by means of an iterative process. In the estimation process, the memory size N for best-case performance (i.e., the memory size that avoids any disk I/O operation) is first determined. The allocated memory size is then given a starting value. The probability (p) of cache-miss is then estimated for that memory size. Another probability (q), which is the probability that a record requested by a frequent user of the service is not in the cache, is also estimated for the memory size. The performance impact of the disk I/O rate indicated by p and q is then evaluated. If the performance is not adequate, the cache memory size is adjusted to a different value. The miss probabilities p and q are again estimated, and the performance impact is estimated. This iterative process is continued until the cache memory size is found to provide adequate estimated performance. |
format | Patent |
fullrecord | <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US6493810B1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US6493810B1</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US6493810B13</originalsourceid><addsrcrecordid>eNrjZPDxTS3JyE9RSMxLUSiuLC5JzVVIyy9SSMzJyU9OLMnMS1dITkzOSFXITc3NL6qEyCnkpZaU5xdlK6QkliQmJRanKhSnFpVlJqfyMLCmJeYUp_JCaW4GBTfXEGcP3dSC_PjU4oLE5FSg1vjQYDMTS2MLQwMnQ2MilAAAGPI1ZA</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Method and system for allocating cache memory for a network database service</title><source>esp@cenet</source><creator>TAY YONG CHIANG ; PANG JEE FUNG ; RAGHURAMAN MELUR K</creator><creatorcontrib>TAY YONG CHIANG ; PANG JEE FUNG ; RAGHURAMAN MELUR K</creatorcontrib><description>A method is provided for estimating the size of cache memory required for optimal performance of a network database service, such as a directory service, by means of an iterative process. In the estimation process, the memory size N for best-case performance (i.e., the memory size that avoids any disk I/O operation) is first determined. The allocated memory size is then given a starting value. The probability (p) of cache-miss is then estimated for that memory size. Another probability (q), which is the probability that a record requested by a frequent user of the service is not in the cache, is also estimated for the memory size. The performance impact of the disk I/O rate indicated by p and q is then evaluated. If the performance is not adequate, the cache memory size is adjusted to a different value. The miss probabilities p and q are again estimated, and the performance impact is estimated. This iterative process is continued until the cache memory size is found to provide adequate estimated performance.</description><edition>7</edition><language>eng</language><subject>ELECTRIC COMMUNICATION TECHNIQUE ; ELECTRICITY ; TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</subject><creationdate>2002</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20021210&DB=EPODOC&CC=US&NR=6493810B1$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,780,885,25564,76547</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20021210&DB=EPODOC&CC=US&NR=6493810B1$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>TAY YONG CHIANG</creatorcontrib><creatorcontrib>PANG JEE FUNG</creatorcontrib><creatorcontrib>RAGHURAMAN MELUR K</creatorcontrib><title>Method and system for allocating cache memory for a network database service</title><description>A method is provided for estimating the size of cache memory required for optimal performance of a network database service, such as a directory service, by means of an iterative process. In the estimation process, the memory size N for best-case performance (i.e., the memory size that avoids any disk I/O operation) is first determined. The allocated memory size is then given a starting value. The probability (p) of cache-miss is then estimated for that memory size. Another probability (q), which is the probability that a record requested by a frequent user of the service is not in the cache, is also estimated for the memory size. The performance impact of the disk I/O rate indicated by p and q is then evaluated. If the performance is not adequate, the cache memory size is adjusted to a different value. The miss probabilities p and q are again estimated, and the performance impact is estimated. This iterative process is continued until the cache memory size is found to provide adequate estimated performance.</description><subject>ELECTRIC COMMUNICATION TECHNIQUE</subject><subject>ELECTRICITY</subject><subject>TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2002</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZPDxTS3JyE9RSMxLUSiuLC5JzVVIyy9SSMzJyU9OLMnMS1dITkzOSFXITc3NL6qEyCnkpZaU5xdlK6QkliQmJRanKhSnFpVlJqfyMLCmJeYUp_JCaW4GBTfXEGcP3dSC_PjU4oLE5FSg1vjQYDMTS2MLQwMnQ2MilAAAGPI1ZA</recordid><startdate>20021210</startdate><enddate>20021210</enddate><creator>TAY YONG CHIANG</creator><creator>PANG JEE FUNG</creator><creator>RAGHURAMAN MELUR K</creator><scope>EVB</scope></search><sort><creationdate>20021210</creationdate><title>Method and system for allocating cache memory for a network database service</title><author>TAY YONG CHIANG ; PANG JEE FUNG ; RAGHURAMAN MELUR K</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US6493810B13</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2002</creationdate><topic>ELECTRIC COMMUNICATION TECHNIQUE</topic><topic>ELECTRICITY</topic><topic>TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</topic><toplevel>online_resources</toplevel><creatorcontrib>TAY YONG CHIANG</creatorcontrib><creatorcontrib>PANG JEE FUNG</creatorcontrib><creatorcontrib>RAGHURAMAN MELUR K</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>TAY YONG CHIANG</au><au>PANG JEE FUNG</au><au>RAGHURAMAN MELUR K</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Method and system for allocating cache memory for a network database service</title><date>2002-12-10</date><risdate>2002</risdate><abstract>A method is provided for estimating the size of cache memory required for optimal performance of a network database service, such as a directory service, by means of an iterative process. In the estimation process, the memory size N for best-case performance (i.e., the memory size that avoids any disk I/O operation) is first determined. The allocated memory size is then given a starting value. The probability (p) of cache-miss is then estimated for that memory size. Another probability (q), which is the probability that a record requested by a frequent user of the service is not in the cache, is also estimated for the memory size. The performance impact of the disk I/O rate indicated by p and q is then evaluated. If the performance is not adequate, the cache memory size is adjusted to a different value. The miss probabilities p and q are again estimated, and the performance impact is estimated. This iterative process is continued until the cache memory size is found to provide adequate estimated performance.</abstract><edition>7</edition><oa>free_for_read</oa></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | |
ispartof | |
issn | |
language | eng |
recordid | cdi_epo_espacenet_US6493810B1 |
source | esp@cenet |
subjects | ELECTRIC COMMUNICATION TECHNIQUE ELECTRICITY TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION |
title | Method and system for allocating cache memory for a network database service |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-19T16%3A39%3A21IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=TAY%20YONG%20CHIANG&rft.date=2002-12-10&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS6493810B1%3C/epo_EVB%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |