SYSTEM AND METHOD FOR INCREASING ADDRESS GENERATION OPERATIONS PER CYCLE

A system and method for increasing address generation operations per cycle is described. In particular, a unified address generation scheduler queue (AGSQ) is a single queue structure which is accessed by first and second pickers in a picking cycle. Picking collisions are avoided by assigning a firs...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Liu, Hanbing, Oliver, Christopher Spence, Burke, Christopher James, Achenbach, Michael D
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 Liu, Hanbing
Oliver, Christopher Spence
Burke, Christopher James
Achenbach, Michael D
description A system and method for increasing address generation operations per cycle is described. In particular, a unified address generation scheduler queue (AGSQ) is a single queue structure which is accessed by first and second pickers in a picking cycle. Picking collisions are avoided by assigning a first set of entries to the first picker and a second set of entries to the second picker. The unified AGSQ uses a shifting, collapsing queue structure to shift other micro-operations into issued entries, which in turn collapses the queue and re-balances the unified AGSQ. A second level and delayed picker picks a third micro-operation that is ready for issue in the picking cycle. The third micro-operation is picked from the remaining entries across the first set of entries and the second set of entries. The third micro-operation issues in a next picking cycle.
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US2019196839A1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US2019196839A1</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US2019196839A13</originalsourceid><addsrcrecordid>eNrjZPAIjgwOcfVVcPRzUfB1DfHwd1Fw8w9S8PRzDnJ1DPb0c1dwdHEJcg0OVnB39XMNcgzx9PdT8A-AsoIVgCwF50hnH1ceBta0xJziVF4ozc2g7OYa4uyhm1qQH59aXJCYnJqXWhIfGmxkYGhpaGlmYWzpaGhMnCoAwPst8w</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>SYSTEM AND METHOD FOR INCREASING ADDRESS GENERATION OPERATIONS PER CYCLE</title><source>esp@cenet</source><creator>Liu, Hanbing ; Oliver, Christopher Spence ; Burke, Christopher James ; Achenbach, Michael D</creator><creatorcontrib>Liu, Hanbing ; Oliver, Christopher Spence ; Burke, Christopher James ; Achenbach, Michael D</creatorcontrib><description>A system and method for increasing address generation operations per cycle is described. In particular, a unified address generation scheduler queue (AGSQ) is a single queue structure which is accessed by first and second pickers in a picking cycle. Picking collisions are avoided by assigning a first set of entries to the first picker and a second set of entries to the second picker. The unified AGSQ uses a shifting, collapsing queue structure to shift other micro-operations into issued entries, which in turn collapses the queue and re-balances the unified AGSQ. A second level and delayed picker picks a third micro-operation that is ready for issue in the picking cycle. The third micro-operation is picked from the remaining entries across the first set of entries and the second set of entries. The third micro-operation issues in a next picking cycle.</description><language>eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC DIGITAL DATA PROCESSING ; PHYSICS</subject><creationdate>2019</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=20190627&amp;DB=EPODOC&amp;CC=US&amp;NR=2019196839A1$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,776,881,25542,76289</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20190627&amp;DB=EPODOC&amp;CC=US&amp;NR=2019196839A1$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>Liu, Hanbing</creatorcontrib><creatorcontrib>Oliver, Christopher Spence</creatorcontrib><creatorcontrib>Burke, Christopher James</creatorcontrib><creatorcontrib>Achenbach, Michael D</creatorcontrib><title>SYSTEM AND METHOD FOR INCREASING ADDRESS GENERATION OPERATIONS PER CYCLE</title><description>A system and method for increasing address generation operations per cycle is described. In particular, a unified address generation scheduler queue (AGSQ) is a single queue structure which is accessed by first and second pickers in a picking cycle. Picking collisions are avoided by assigning a first set of entries to the first picker and a second set of entries to the second picker. The unified AGSQ uses a shifting, collapsing queue structure to shift other micro-operations into issued entries, which in turn collapses the queue and re-balances the unified AGSQ. A second level and delayed picker picks a third micro-operation that is ready for issue in the picking cycle. The third micro-operation is picked from the remaining entries across the first set of entries and the second set of entries. The third micro-operation issues in a next picking cycle.</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>2019</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZPAIjgwOcfVVcPRzUfB1DfHwd1Fw8w9S8PRzDnJ1DPb0c1dwdHEJcg0OVnB39XMNcgzx9PdT8A-AsoIVgCwF50hnH1ceBta0xJziVF4ozc2g7OYa4uyhm1qQH59aXJCYnJqXWhIfGmxkYGhpaGlmYWzpaGhMnCoAwPst8w</recordid><startdate>20190627</startdate><enddate>20190627</enddate><creator>Liu, Hanbing</creator><creator>Oliver, Christopher Spence</creator><creator>Burke, Christopher James</creator><creator>Achenbach, Michael D</creator><scope>EVB</scope></search><sort><creationdate>20190627</creationdate><title>SYSTEM AND METHOD FOR INCREASING ADDRESS GENERATION OPERATIONS PER CYCLE</title><author>Liu, Hanbing ; Oliver, Christopher Spence ; Burke, Christopher James ; Achenbach, Michael D</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US2019196839A13</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2019</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>PHYSICS</topic><toplevel>online_resources</toplevel><creatorcontrib>Liu, Hanbing</creatorcontrib><creatorcontrib>Oliver, Christopher Spence</creatorcontrib><creatorcontrib>Burke, Christopher James</creatorcontrib><creatorcontrib>Achenbach, Michael D</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Liu, Hanbing</au><au>Oliver, Christopher Spence</au><au>Burke, Christopher James</au><au>Achenbach, Michael D</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>SYSTEM AND METHOD FOR INCREASING ADDRESS GENERATION OPERATIONS PER CYCLE</title><date>2019-06-27</date><risdate>2019</risdate><abstract>A system and method for increasing address generation operations per cycle is described. In particular, a unified address generation scheduler queue (AGSQ) is a single queue structure which is accessed by first and second pickers in a picking cycle. Picking collisions are avoided by assigning a first set of entries to the first picker and a second set of entries to the second picker. The unified AGSQ uses a shifting, collapsing queue structure to shift other micro-operations into issued entries, which in turn collapses the queue and re-balances the unified AGSQ. A second level and delayed picker picks a third micro-operation that is ready for issue in the picking cycle. The third micro-operation is picked from the remaining entries across the first set of entries and the second set of entries. The third micro-operation issues in a next picking cycle.</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng
recordid cdi_epo_espacenet_US2019196839A1
source esp@cenet
subjects CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
title SYSTEM AND METHOD FOR INCREASING ADDRESS GENERATION OPERATIONS PER CYCLE
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-05T18%3A49%3A10IST&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=Liu,%20Hanbing&rft.date=2019-06-27&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS2019196839A1%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