Resource control allocation

In a system where a single resource in the form of a data bus BS is shared among a plurality of users in the form of Modules M, control of the bus is restricted to not more than one module M at a time. Each module is assigned a different n-digit binary identity number, all the identity numbers conta...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: DANIEL MATTHEW TAUB
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 DANIEL MATTHEW TAUB
description In a system where a single resource in the form of a data bus BS is shared among a plurality of users in the form of Modules M, control of the bus is restricted to not more than one module M at a time. Each module is assigned a different n-digit binary identity number, all the identity numbers containing the same number m of ones, and associated with BS there are n lines AB which perform the wired-OR function. When a request for the control of BS is made, the module or modules making that request apply their identity numbers to AB, and a decoder in each module, or one common to all modules, determines whether the resulting number carried by AB contains exactly m, or more than m, ones. If it contains more than m ones, indicating two or more requestors, arbitration between them takes place in a known manner to determine which of them shall control BS first. But if the number on AB contains exactly m ones there can be only one requestor and so arbitration is dispensed-with, allowing the requestor to obtain control with less delay. In an alternative form of the invention, an additional set of bus lines allows the arbitration means to be used concurrently with the determination of the OR-function of the requestors' identity numbers, and if this shows that only one requestor is present, the arbitration process is abandoned.
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_GB2230166A</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>GB2230166A</sourcerecordid><originalsourceid>FETCH-epo_espacenet_GB2230166A3</originalsourceid><addsrcrecordid>eNrjZJAOSi3OLy1KTlVIzs8rKcrPUUjMyclPTizJzM_jYWBNS8wpTuWF0twM8m6uIc4euqkF-fGpxQWJyal5qSXx7k5GRsYGhmZmjsaEVQAACeAixQ</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Resource control allocation</title><source>esp@cenet</source><creator>DANIEL MATTHEW TAUB</creator><creatorcontrib>DANIEL MATTHEW TAUB</creatorcontrib><description>In a system where a single resource in the form of a data bus BS is shared among a plurality of users in the form of Modules M, control of the bus is restricted to not more than one module M at a time. Each module is assigned a different n-digit binary identity number, all the identity numbers containing the same number m of ones, and associated with BS there are n lines AB which perform the wired-OR function. When a request for the control of BS is made, the module or modules making that request apply their identity numbers to AB, and a decoder in each module, or one common to all modules, determines whether the resulting number carried by AB contains exactly m, or more than m, ones. If it contains more than m ones, indicating two or more requestors, arbitration between them takes place in a known manner to determine which of them shall control BS first. But if the number on AB contains exactly m ones there can be only one requestor and so arbitration is dispensed-with, allowing the requestor to obtain control with less delay. In an alternative form of the invention, an additional set of bus lines allows the arbitration means to be used concurrently with the determination of the OR-function of the requestors' identity numbers, and if this shows that only one requestor is present, the arbitration process is abandoned.</description><language>eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC COMMUNICATION TECHNIQUE ; ELECTRIC DIGITAL DATA PROCESSING ; ELECTRICITY ; PHYSICS ; TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</subject><creationdate>1990</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=19901010&amp;DB=EPODOC&amp;CC=GB&amp;NR=2230166A$$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=19901010&amp;DB=EPODOC&amp;CC=GB&amp;NR=2230166A$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>DANIEL MATTHEW TAUB</creatorcontrib><title>Resource control allocation</title><description>In a system where a single resource in the form of a data bus BS is shared among a plurality of users in the form of Modules M, control of the bus is restricted to not more than one module M at a time. Each module is assigned a different n-digit binary identity number, all the identity numbers containing the same number m of ones, and associated with BS there are n lines AB which perform the wired-OR function. When a request for the control of BS is made, the module or modules making that request apply their identity numbers to AB, and a decoder in each module, or one common to all modules, determines whether the resulting number carried by AB contains exactly m, or more than m, ones. If it contains more than m ones, indicating two or more requestors, arbitration between them takes place in a known manner to determine which of them shall control BS first. But if the number on AB contains exactly m ones there can be only one requestor and so arbitration is dispensed-with, allowing the requestor to obtain control with less delay. In an alternative form of the invention, an additional set of bus lines allows the arbitration means to be used concurrently with the determination of the OR-function of the requestors' identity numbers, and if this shows that only one requestor is present, the arbitration process is abandoned.</description><subject>CALCULATING</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>ELECTRIC COMMUNICATION TECHNIQUE</subject><subject>ELECTRIC DIGITAL DATA PROCESSING</subject><subject>ELECTRICITY</subject><subject>PHYSICS</subject><subject>TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>1990</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZJAOSi3OLy1KTlVIzs8rKcrPUUjMyclPTizJzM_jYWBNS8wpTuWF0twM8m6uIc4euqkF-fGpxQWJyal5qSXx7k5GRsYGhmZmjsaEVQAACeAixQ</recordid><startdate>19901010</startdate><enddate>19901010</enddate><creator>DANIEL MATTHEW TAUB</creator><scope>EVB</scope></search><sort><creationdate>19901010</creationdate><title>Resource control allocation</title><author>DANIEL MATTHEW TAUB</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_GB2230166A3</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>1990</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC COMMUNICATION TECHNIQUE</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>ELECTRICITY</topic><topic>PHYSICS</topic><topic>TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</topic><toplevel>online_resources</toplevel><creatorcontrib>DANIEL MATTHEW TAUB</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>DANIEL MATTHEW TAUB</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Resource control allocation</title><date>1990-10-10</date><risdate>1990</risdate><abstract>In a system where a single resource in the form of a data bus BS is shared among a plurality of users in the form of Modules M, control of the bus is restricted to not more than one module M at a time. Each module is assigned a different n-digit binary identity number, all the identity numbers containing the same number m of ones, and associated with BS there are n lines AB which perform the wired-OR function. When a request for the control of BS is made, the module or modules making that request apply their identity numbers to AB, and a decoder in each module, or one common to all modules, determines whether the resulting number carried by AB contains exactly m, or more than m, ones. If it contains more than m ones, indicating two or more requestors, arbitration between them takes place in a known manner to determine which of them shall control BS first. But if the number on AB contains exactly m ones there can be only one requestor and so arbitration is dispensed-with, allowing the requestor to obtain control with less delay. In an alternative form of the invention, an additional set of bus lines allows the arbitration means to be used concurrently with the determination of the OR-function of the requestors' identity numbers, and if this shows that only one requestor is present, the arbitration process is abandoned.</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng
recordid cdi_epo_espacenet_GB2230166A
source esp@cenet
subjects CALCULATING
COMPUTING
COUNTING
ELECTRIC COMMUNICATION TECHNIQUE
ELECTRIC DIGITAL DATA PROCESSING
ELECTRICITY
PHYSICS
TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION
title Resource control allocation
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-07T04%3A40%3A56IST&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=DANIEL%20MATTHEW%20TAUB&rft.date=1990-10-10&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EGB2230166A%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