A GENERAL DISTRIBUTED GRAPH ALGORITHM FOR FAIR ACCESS TO CRITICAL SECTIONS
We deal with the following problems: Given an arbitrary undirected graph where each node is understood to represent a sequential process. Each such process has just onecritical section, and two neighbors cannot use their critical sections but mutually exclusively. Direct communication between neighb...
Gespeichert in:
| Veröffentlicht in: | Distributed Algorithms on Graphs S. 153 - 159 |
|---|---|
| Hauptverfasser: | , |
| Format: | Buchkapitel |
| Sprache: | Englisch |
| Veröffentlicht: |
Canada
MQUP
1986
McGill-Queen's University Press |
| Schlagworte: | |
| ISBN: | 9780886290542, 0886290546 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | We deal with the following problems:
Given an arbitrary undirected graph where each node is understood to represent a sequential process. Each such process has just onecritical section, and two neighbors cannot use their critical sections but mutually exclusively. Direct communication between neighbors may occur in both directions, even simultaneously.
There is no way to establish any kind of centralized control. No assumption on relative speeds, on fixed priorities, on shared memory etc. is allowed.
An algorithm has then to be designed which does not deadlock and which is fair in the sense that any node process when interested |
|---|---|
| AbstractList | We deal with the following problems:
Given an arbitrary undirected graph where each node is understood to represent a sequential process. Each such process has just onecritical section, and two neighbors cannot use their critical sections but mutually exclusively. Direct communication between neighbors may occur in both directions, even simultaneously.
There is no way to establish any kind of centralized control. No assumption on relative speeds, on fixed priorities, on shared memory etc. is allowed.
An algorithm has then to be designed which does not deadlock and which is fair in the sense that any node process when interested |
| Author | Horst F. Wedde |
| Author_xml | – sequence: 1 fullname: Santoro, Nicola – sequence: 2 fullname: Gafni, Eli |
| BookMark | eNpVkNtOg0AQhtd4iG3tA3i3PgC6B_Z0iZRSTC0GaOLdhsKiwaa0QGN8e5dUTZybmczM98_kH4OLXbMzANxidI8ZZg9KSCQEZYK6gjkIkzMw_mu8noPpsCAlJwoxl1yBkSIKE8wovgbTrquRDSKkYGoEnjwYBqsg8ZZwFqVZEj2us2AGw8R7WUBvGcZJlC2e4TxO4NyLEuj5fpCmMIuhbyeRb7k08LMoXqU34LLKt52Z_uQJWM-DzF84yzgcFp0aY0EcY1wkOJVcSkSpIZWxX9ISb0osGCFujjgvWKUIltTNlXALg420_5fIbKjM6QTwk-5nvu1NW5q39vhlC71pmo9OY6QHl_Q_l7R1yYL0BO7b5nA0Xa_NgBRm17f5tnjP91al05RSTIRVkRpzbqm7E1V3ffN7pNZF36tD5YraXqPftlZuSg |
| ContentType | Book Chapter |
| Copyright | 1986 Carleton University Press Inc. Carleton University Press Inc. |
| Copyright_xml | – notice: 1986 Carleton University Press Inc. – notice: Carleton University Press Inc. |
| DBID | FFUUA |
| DEWEY | 004/.36 |
| DOI | 10.1515/9780773573475-012 |
| DatabaseName | ProQuest Ebook Central - Book Chapters - Demo use only |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Applied Sciences Computer Science |
| EISBN | 077357347X 9780773573475 |
| Editor | Nicola Santoro Eli Gafni |
| Editor_xml | – sequence: 1 givenname: Eli surname: Gafni fullname: Gafni, Eli – sequence: 2 givenname: Nicola surname: Santoro fullname: Santoro, Nicola |
| EndPage | 159 |
| ExternalDocumentID | 10_1515_9780773573475_012 EBC3331270_18_166 j.ctt9qf47j.15 |
| GroupedDBID | 089 38. 3AN 4R. A4J AABBV AAJPT AAZEP ABARN ABCYY ABIAV ABMRC ABQPQ ABVPU ACLGV ACYOQ ADVEM AERYV AFOJC AHWGJ AJFER AKHYG ALMA_UNASSIGNED_HOLDINGS AMYDA AZXWJ AZZ B1C BBABE CDNBK CGZOQ CZZ EBSCA EOBUG GEOUK HELXT HF4 JIW JJU JLPMJ PQQKQ QD8 ~I6 FFUUA IVK |
| ID | FETCH-LOGICAL-j1172-ee407638688033e2fe0543d1bd175224a066c5f921834a974ce1e8121d0eb38a3 |
| ISBN | 9780886290542 0886290546 |
| IngestDate | Fri Jan 12 00:48:45 EST 2024 Tue Oct 21 06:17:26 EDT 2025 Sun Jun 29 13:30:42 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | false |
| LCCallNum | QA76.9.D5 I67 1986 |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-j1172-ee407638688033e2fe0543d1bd175224a066c5f921834a974ce1e8121d0eb38a3 |
| OCLC | 929121531 |
| PQID | EBC3331270_18_166 |
| PageCount | 7 |
| ParticipantIDs | walterdegruyter_books_10_1515_9780773573475_012 proquest_ebookcentralchapters_3331270_18_166 jstor_books_j_ctt9qf47j_15 |
| PublicationCentury | 1900 |
| PublicationDate | 19860115 1986 |
| PublicationDateYYYYMMDD | 1986-01-15 1986-01-01 |
| PublicationDate_xml | – year: 1986 text: 1986 |
| PublicationDecade | 1980 |
| PublicationPlace | Canada |
| PublicationPlace_xml | – name: Canada – name: Montreal |
| PublicationTitle | Distributed Algorithms on Graphs |
| PublicationYear | 1986 |
| Publisher | MQUP McGill-Queen's University Press |
| Publisher_xml | – name: MQUP – name: McGill-Queen's University Press |
| SSID | ssj0000278759 |
| Score | 1.1787282 |
| Snippet | We deal with the following problems:
Given an arbitrary undirected graph where each node is understood to represent a sequential process. Each such process has... |
| SourceID | walterdegruyter proquest jstor |
| SourceType | Publisher |
| StartPage | 153 |
| SubjectTerms | Acknowledgments Algorithms Applied sciences Behavioral sciences Board games Communications Communicative content Computer engineering Computer science Computer software Games Human geography Leisure studies Neighborhoods Operating systems Recreation Social geography Social sciences |
| Title | A GENERAL DISTRIBUTED GRAPH ALGORITHM FOR FAIR ACCESS TO CRITICAL SECTIONS |
| URI | https://www.jstor.org/stable/j.ctt9qf47j.15 http://ebookcentral.proquest.com/lib/SITE_ID/reader.action?docID=3331270&ppg=166&c=UERG http://www.degruyter.com/doi/10.1515/9780773573475-012 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3Pb9MwFLZQxwEh8RutGyAfuEG0Ok7i5DihrROIAWITu0WpY4-iLoUmY-O_57Njp00mDjtwiapUfq38OS_f8_v8HiGvtWn4XpRJIEMdB1Emo2AmwiQQShca_BUPoLTNJsTxcXp2ln12XVFr205AVFV6fZ39_K9Q4x7ANkdnbwF3ZxQ38Bmg4wrYcR0w4v7eqxO41G0LK_DI_cX5EqH_9wubEZiaytQdgf6myrbe7tES9M_Le51u2deifrNpzY5f27TyxMNibhT25qSB4bBd24SvVt9VbWwpsCwdbil8lNP5YhF8MZG0zRoMDy32YtCJEDwWPBLxhh9kbQVg90plbdHvG946toUtejbwP8L1q8mn4wdvrE5HaCIYGMl7JvKJ6Tq9ZVLK6YhsTQ8-nX7ott1MolXEmctvY-zejZ_3ytRezPHgyqoXSnW-uvzT-Gy5JSEnj8h9czCFmhMj-OoxuaOqJ-Shb8tBnZd-St7vUwcg3QCQWgBpByAFgNQASFsAabOkHkDqAXxGTg8PTt4dBa5lRvCDgYoGSiFAh0tN4JY5V6FWoOS8ZLMSNBFsrQDDlLHODDGOCjyLUjEFjsfKiZrxtODPyahaVmqbUPDCJBEzLbkC68SchekkLgQ8uC45z9iY7Nhpys1irxFEyqbJfulIIJyMx-Stn7vcZv2d1Fi2U1TnnHOjechZmrMkGZO9wfw6q_8EeOfWI3bJvfVaf0FGzepSvSR35e9mXq9euXXyF9qTdHc |
| linkProvider | ProQuest Ebooks |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=bookitem&rft.title=Distributed+Algorithms+on+Graphs&rft.au=Wedde%2C+Horst+F&rft.atitle=A+General+Distributed+Graph+Algorithm+for+Fair+Access+to+Critical+Sections&rft.date=1986-01-01&rft.pub=McGill-Queen%27s+University+Press&rft.isbn=9780773573475&rft.spage=153&rft.epage=159&rft_id=info:doi/10.1515%2F9780773573475-012&rft.externalDBID=n%2Fa&rft.externalDocID=10_1515_9780773573475_012 |
| thumbnail_s | http://cvtisr.summon.serialssolutions.com/2.0.0/image/custom?url=https%3A%2F%2Febookcentral.proquest.com%2Fcovers%2F3331270-l.jpg |