BARRIER-BASED ACCESS TO A SHARED RESOURCE IN A MASSIVELY PARALLEL COMPUTER SYSTEM
An apparatus, program product and method utilize a barrier-based mechanism for arbitrating access to a shared resource in a massively parallel computer system. In a first processor among a plurality of processors in a massively parallel computer system, the number of times a barrier has been entered...
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 | INGLETT TODD ALAN TAUFERNER ANDREW THOMAS |
description | An apparatus, program product and method utilize a barrier-based mechanism for arbitrating access to a shared resource in a massively parallel computer system. In a first processor among a plurality of processors in a massively parallel computer system, the number of times a barrier has been entered by processors in the massively parallel computer system in association with attempting to access the shared resource may be monitored, and the shared resource may be accessed by the first processor once the number of times the barrier has been entered matches a priority value associated with the first processor. As such, on massively parallel computer systems where potentially thousands of processors may attempt to concurrently access the same shared resource, the access by such processors may be coordinated in a logical fashion to reduce the risk of overwhelming the shared resource due to an excessive number of concurrent access attempts to the shared resource. |
format | Patent |
fullrecord | <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US2008115139A1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US2008115139A1</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US2008115139A13</originalsourceid><addsrcrecordid>eNqNyrEKwjAQgOEsDqK-w4FzobEIOl7jSQOJqXeJ0KkUiZNoob4_dvABnH74-JfqWiOzJS5qFDoBGkMiEAMgSIM8E5OExIbAXmb0KGJv5DpokdE5cmCCb1MkBukkkl-rxWN4Tnnz60ptzxRNU-Tx3edpHO75lT99kl1ZHrTe6-qIuvrv-gIxFjAG</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>BARRIER-BASED ACCESS TO A SHARED RESOURCE IN A MASSIVELY PARALLEL COMPUTER SYSTEM</title><source>esp@cenet</source><creator>INGLETT TODD ALAN ; TAUFERNER ANDREW THOMAS</creator><creatorcontrib>INGLETT TODD ALAN ; TAUFERNER ANDREW THOMAS</creatorcontrib><description>An apparatus, program product and method utilize a barrier-based mechanism for arbitrating access to a shared resource in a massively parallel computer system. In a first processor among a plurality of processors in a massively parallel computer system, the number of times a barrier has been entered by processors in the massively parallel computer system in association with attempting to access the shared resource may be monitored, and the shared resource may be accessed by the first processor once the number of times the barrier has been entered matches a priority value associated with the first processor. As such, on massively parallel computer systems where potentially thousands of processors may attempt to concurrently access the same shared resource, the access by such processors may be coordinated in a logical fashion to reduce the risk of overwhelming the shared resource due to an excessive number of concurrent access attempts to the shared resource.</description><language>eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC DIGITAL DATA PROCESSING ; PHYSICS</subject><creationdate>2008</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=20080515&DB=EPODOC&CC=US&NR=2008115139A1$$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=20080515&DB=EPODOC&CC=US&NR=2008115139A1$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>INGLETT TODD ALAN</creatorcontrib><creatorcontrib>TAUFERNER ANDREW THOMAS</creatorcontrib><title>BARRIER-BASED ACCESS TO A SHARED RESOURCE IN A MASSIVELY PARALLEL COMPUTER SYSTEM</title><description>An apparatus, program product and method utilize a barrier-based mechanism for arbitrating access to a shared resource in a massively parallel computer system. In a first processor among a plurality of processors in a massively parallel computer system, the number of times a barrier has been entered by processors in the massively parallel computer system in association with attempting to access the shared resource may be monitored, and the shared resource may be accessed by the first processor once the number of times the barrier has been entered matches a priority value associated with the first processor. As such, on massively parallel computer systems where potentially thousands of processors may attempt to concurrently access the same shared resource, the access by such processors may be coordinated in a logical fashion to reduce the risk of overwhelming the shared resource due to an excessive number of concurrent access attempts to the shared resource.</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>2008</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNqNyrEKwjAQgOEsDqK-w4FzobEIOl7jSQOJqXeJ0KkUiZNoob4_dvABnH74-JfqWiOzJS5qFDoBGkMiEAMgSIM8E5OExIbAXmb0KGJv5DpokdE5cmCCb1MkBukkkl-rxWN4Tnnz60ptzxRNU-Tx3edpHO75lT99kl1ZHrTe6-qIuvrv-gIxFjAG</recordid><startdate>20080515</startdate><enddate>20080515</enddate><creator>INGLETT TODD ALAN</creator><creator>TAUFERNER ANDREW THOMAS</creator><scope>EVB</scope></search><sort><creationdate>20080515</creationdate><title>BARRIER-BASED ACCESS TO A SHARED RESOURCE IN A MASSIVELY PARALLEL COMPUTER SYSTEM</title><author>INGLETT TODD ALAN ; TAUFERNER ANDREW THOMAS</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US2008115139A13</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2008</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>PHYSICS</topic><toplevel>online_resources</toplevel><creatorcontrib>INGLETT TODD ALAN</creatorcontrib><creatorcontrib>TAUFERNER ANDREW THOMAS</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>INGLETT TODD ALAN</au><au>TAUFERNER ANDREW THOMAS</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>BARRIER-BASED ACCESS TO A SHARED RESOURCE IN A MASSIVELY PARALLEL COMPUTER SYSTEM</title><date>2008-05-15</date><risdate>2008</risdate><abstract>An apparatus, program product and method utilize a barrier-based mechanism for arbitrating access to a shared resource in a massively parallel computer system. In a first processor among a plurality of processors in a massively parallel computer system, the number of times a barrier has been entered by processors in the massively parallel computer system in association with attempting to access the shared resource may be monitored, and the shared resource may be accessed by the first processor once the number of times the barrier has been entered matches a priority value associated with the first processor. As such, on massively parallel computer systems where potentially thousands of processors may attempt to concurrently access the same shared resource, the access by such processors may be coordinated in a logical fashion to reduce the risk of overwhelming the shared resource due to an excessive number of concurrent access attempts to the shared resource.</abstract><oa>free_for_read</oa></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | |
ispartof | |
issn | |
language | eng |
recordid | cdi_epo_espacenet_US2008115139A1 |
source | esp@cenet |
subjects | CALCULATING COMPUTING COUNTING ELECTRIC DIGITAL DATA PROCESSING PHYSICS |
title | BARRIER-BASED ACCESS TO A SHARED RESOURCE IN A MASSIVELY PARALLEL COMPUTER SYSTEM |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-04T17%3A40%3A24IST&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=INGLETT%20TODD%20ALAN&rft.date=2008-05-15&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS2008115139A1%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 |