Message cache management for message queues

Message cache management for message queues

A method and apparatus for message cache management for message queues is provided. A plurality of messages from a plurality of enqueuers are enqueued in a queue comprising one or more shards, each shard comprising one or more subshards. A message cache is maintained in memory. Enqueuing a message i...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Stamos, James W, Singh, Devendra, Bose, Shubha, Downing, Alan R, Jaiswal, Mukesh
Format: Patent
Sprache:eng
Schlagworte:
CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
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 Stamos, James W
Singh, Devendra
Bose, Shubha
Downing, Alan R
Jaiswal, Mukesh
description A method and apparatus for message cache management for message queues is provided. A plurality of messages from a plurality of enqueuers are enqueued in a queue comprising one or more shards, each shard comprising one or more subshards. A message cache is maintained in memory. Enqueuing a message includes enqueuing the message in a current subshard of a particular shard, which includes storing the message in a cached subshard corresponding to the current subshard of the particular shard. For each dequeuer-shard pair, a dequeue rate is determined. Estimated access time data is generated that includes an earliest estimated access time for each of a plurality of subshards based on the dequeuer-shard pair dequeue rates. A set of subshards is determined for storing as cached subshards in the message cache based on the earliest estimated access times for the plurality of subshards.
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US9996404B2</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US9996404B2</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US9996404B23</originalsourceid><addsrcrecordid>eNrjZND2TS0uTkxPVUhOTM5IVchNzANyclPzShTS8osUcqGShaWppanFPAysaYk5xam8UJqbQcHNNcTZQze1ID8-tbggMTk1L7UkPjTY0tLSzMTAxMnImAglAAueKTA</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Message cache management for message queues</title><source>esp@cenet</source><creator>Stamos, James W ; Singh, Devendra ; Bose, Shubha ; Downing, Alan R ; Jaiswal, Mukesh</creator><creatorcontrib>Stamos, James W ; Singh, Devendra ; Bose, Shubha ; Downing, Alan R ; Jaiswal, Mukesh</creatorcontrib><description>A method and apparatus for message cache management for message queues is provided. A plurality of messages from a plurality of enqueuers are enqueued in a queue comprising one or more shards, each shard comprising one or more subshards. A message cache is maintained in memory. Enqueuing a message includes enqueuing the message in a current subshard of a particular shard, which includes storing the message in a cached subshard corresponding to the current subshard of the particular shard. For each dequeuer-shard pair, a dequeue rate is determined. Estimated access time data is generated that includes an earliest estimated access time for each of a plurality of subshards based on the dequeuer-shard pair dequeue rates. A set of subshards is determined for storing as cached subshards in the message cache based on the earliest estimated access times for the plurality of subshards.</description><language>eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC DIGITAL DATA PROCESSING ; PHYSICS</subject><creationdate>2018</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&amp;date=20180612&amp;DB=EPODOC&amp;CC=US&amp;NR=9996404B2$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,776,881,25542,76290</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20180612&amp;DB=EPODOC&amp;CC=US&amp;NR=9996404B2$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>Stamos, James W</creatorcontrib><creatorcontrib>Singh, Devendra</creatorcontrib><creatorcontrib>Bose, Shubha</creatorcontrib><creatorcontrib>Downing, Alan R</creatorcontrib><creatorcontrib>Jaiswal, Mukesh</creatorcontrib><title>Message cache management for message queues</title><description>A method and apparatus for message cache management for message queues is provided. A plurality of messages from a plurality of enqueuers are enqueued in a queue comprising one or more shards, each shard comprising one or more subshards. A message cache is maintained in memory. Enqueuing a message includes enqueuing the message in a current subshard of a particular shard, which includes storing the message in a cached subshard corresponding to the current subshard of the particular shard. For each dequeuer-shard pair, a dequeue rate is determined. Estimated access time data is generated that includes an earliest estimated access time for each of a plurality of subshards based on the dequeuer-shard pair dequeue rates. A set of subshards is determined for storing as cached subshards in the message cache based on the earliest estimated access times for the plurality of subshards.</description><subject>CALCULATING</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>ELECTRIC DIGITAL DATA PROCESSING</subject><subject>PHYSICS</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2018</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZND2TS0uTkxPVUhOTM5IVchNzANyclPzShTS8osUcqGShaWppanFPAysaYk5xam8UJqbQcHNNcTZQze1ID8-tbggMTk1L7UkPjTY0tLSzMTAxMnImAglAAueKTA</recordid><startdate>20180612</startdate><enddate>20180612</enddate><creator>Stamos, James W</creator><creator>Singh, Devendra</creator><creator>Bose, Shubha</creator><creator>Downing, Alan R</creator><creator>Jaiswal, Mukesh</creator><scope>EVB</scope></search><sort><creationdate>20180612</creationdate><title>Message cache management for message queues</title><author>Stamos, James W ; Singh, Devendra ; Bose, Shubha ; Downing, Alan R ; Jaiswal, Mukesh</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US9996404B23</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2018</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>PHYSICS</topic><toplevel>online_resources</toplevel><creatorcontrib>Stamos, James W</creatorcontrib><creatorcontrib>Singh, Devendra</creatorcontrib><creatorcontrib>Bose, Shubha</creatorcontrib><creatorcontrib>Downing, Alan R</creatorcontrib><creatorcontrib>Jaiswal, Mukesh</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Stamos, James W</au><au>Singh, Devendra</au><au>Bose, Shubha</au><au>Downing, Alan R</au><au>Jaiswal, Mukesh</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Message cache management for message queues</title><date>2018-06-12</date><risdate>2018</risdate><abstract>A method and apparatus for message cache management for message queues is provided. A plurality of messages from a plurality of enqueuers are enqueued in a queue comprising one or more shards, each shard comprising one or more subshards. A message cache is maintained in memory. Enqueuing a message includes enqueuing the message in a current subshard of a particular shard, which includes storing the message in a cached subshard corresponding to the current subshard of the particular shard. For each dequeuer-shard pair, a dequeue rate is determined. Estimated access time data is generated that includes an earliest estimated access time for each of a plurality of subshards based on the dequeuer-shard pair dequeue rates. A set of subshards is determined for storing as cached subshards in the message cache based on the earliest estimated access times for the plurality of subshards.</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng
recordid cdi_epo_espacenet_US9996404B2
source esp@cenet
subjects CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
title Message cache management for message queues
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-03T23%3A40%3A37IST&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=Stamos,%20James%20W&rft.date=2018-06-12&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS9996404B2%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