Avoiding Register Overflow in the Bakery Algorithm
Computer systems are designed to make resources available to users and users may be interested in some resources more than others, therefore, a coordination scheme is required to satisfy the users' requirements. This scheme may implement certain policies such as "never allocate more than X...
Uloženo v:
| Vydáno v: | arXiv.org |
|---|---|
| Hlavní autoři: | , |
| Médium: | Paper |
| Jazyk: | angličtina |
| Vydáno: |
Ithaca
Cornell University Library, arXiv.org
04.07.2020
|
| Témata: | |
| ISSN: | 2331-8422 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | Computer systems are designed to make resources available to users and users may be interested in some resources more than others, therefore, a coordination scheme is required to satisfy the users' requirements. This scheme may implement certain policies such as "never allocate more than X units of resource Z". One policy that is of particular interest is the inability of users to access a single resource at the same time, which is called the problem of mutual exclusion. Resource management concerns the coordination and collaboration of users, and it is usually based on making a decision. In the case of mutual exclusion, that decision is about granting access to a resource. Therefore, mutual exclusion is useful for supporting resource access management. The first true solution to the mutual exclusion problem is known as the Bakery algorithm that does not rely on any lower-lever mutual exclusion. We examine the problem of register overflow in real-world implementations of the Bakery algorithm and present a variant algorithm named Bakery++ that prevents overflows from ever happening. Bakery++ avoids overflows without allowing a process to write into other processes' memory and without using additional memory or complex arithmetic or redefining the operations and functions used in Bakery. Bakery++ is almost as simple as Bakery and it is straightforward to implement in real systems. With Bakery++, there is no reason to keep implementing Bakery in real computers because Bakery++ eliminates the probability of overflows and hence it is more practical than Bakery. Previous approaches to circumvent the problem of register overflow included introducing new variables or redefining the operations or functions used in the original Bakery algorithm, while Bakery++ avoids overflows by using simple conditional statements. (the abstract does not end here.) |
|---|---|
| AbstractList | Computer systems are designed to make resources available to users and users may be interested in some resources more than others, therefore, a coordination scheme is required to satisfy the users' requirements. This scheme may implement certain policies such as "never allocate more than X units of resource Z". One policy that is of particular interest is the inability of users to access a single resource at the same time, which is called the problem of mutual exclusion. Resource management concerns the coordination and collaboration of users, and it is usually based on making a decision. In the case of mutual exclusion, that decision is about granting access to a resource. Therefore, mutual exclusion is useful for supporting resource access management. The first true solution to the mutual exclusion problem is known as the Bakery algorithm that does not rely on any lower-lever mutual exclusion. We examine the problem of register overflow in real-world implementations of the Bakery algorithm and present a variant algorithm named Bakery++ that prevents overflows from ever happening. Bakery++ avoids overflows without allowing a process to write into other processes' memory and without using additional memory or complex arithmetic or redefining the operations and functions used in Bakery. Bakery++ is almost as simple as Bakery and it is straightforward to implement in real systems. With Bakery++, there is no reason to keep implementing Bakery in real computers because Bakery++ eliminates the probability of overflows and hence it is more practical than Bakery. Previous approaches to circumvent the problem of register overflow included introducing new variables or redefining the operations or functions used in the original Bakery algorithm, while Bakery++ avoids overflows by using simple conditional statements. (the abstract does not end here.) |
| Author | Sayyadabdi, Amirhossein Sharifi, Mohsen |
| Author_xml | – sequence: 1 givenname: Amirhossein surname: Sayyadabdi fullname: Sayyadabdi, Amirhossein – sequence: 2 givenname: Mohsen surname: Sharifi fullname: Sharifi, Mohsen |
| BookMark | eNotzUFLwzAYgOEgCs65H-At4Lnzy5ekSY516BQGA9l9NGnSZdZG067qv1fQ03t73ity3qfeE3LDYCm0lHBX5684LRFALQFBszMyQ85ZoQXiJVkMwxEAsFQoJZ8RrKYUm9i39MW3cRh9ptvJ59ClTxp7Oh48va9fff6mVdemHMfD2zW5CHU3-MV_52T3-LBbPRWb7fp5VW2KWqIppFLOSqOsDUE7VKJsQunBN4wFHoyTNqB0jtUKnWq0brxBJ4QqGQ_WWcHn5PaPfc_p4-SHcX9Mp9z_HvcoEAxIJQz_AYt4R-8 |
| ContentType | Paper |
| Copyright | 2020. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| Copyright_xml | – notice: 2020. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| DBID | 8FE 8FG ABJCF ABUWG AFKRA AZQEC BENPR BGLVJ CCPQU DWQXO HCIFZ L6V M7S PHGZM PHGZT PIMPY PKEHL PQEST PQGLB PQQKQ PQUKI PRINS PTHSS |
| DOI | 10.48550/arxiv.2007.02081 |
| DatabaseName | ProQuest SciTech Collection ProQuest Technology Collection Materials Science & Engineering Collection ProQuest Central (Alumni) ProQuest Central UK/Ireland ProQuest Central Essentials - QC ProQuest Central ProQuest Technology Collection ProQuest One ProQuest Central Korea SciTech Premium Collection ProQuest Engineering Collection Engineering Database Proquest Central Premium ProQuest One Academic (New) Publicly Available Content Database ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China Engineering Collection |
| DatabaseTitle | Publicly Available Content Database Engineering Database Technology Collection ProQuest One Academic Middle East (New) ProQuest Central Essentials ProQuest One Academic Eastern Edition ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ProQuest Technology Collection ProQuest SciTech Collection ProQuest Central China ProQuest Central ProQuest One Applied & Life Sciences ProQuest Engineering Collection ProQuest One Academic UKI Edition ProQuest Central Korea Materials Science & Engineering Collection ProQuest Central (New) ProQuest One Academic ProQuest One Academic (New) Engineering Collection |
| DatabaseTitleList | Publicly Available Content Database |
| Database_xml | – sequence: 1 dbid: PIMPY name: ProQuest Publicly Available Content Database url: http://search.proquest.com/publiccontent sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Physics |
| EISSN | 2331-8422 |
| Genre | Working Paper/Pre-Print |
| GroupedDBID | 8FE 8FG ABJCF ABUWG AFKRA ALMA_UNASSIGNED_HOLDINGS AZQEC BENPR BGLVJ CCPQU DWQXO FRJ HCIFZ L6V M7S M~E PHGZM PHGZT PIMPY PKEHL PQEST PQGLB PQQKQ PQUKI PRINS PTHSS |
| ID | FETCH-LOGICAL-a529-577cb597bbff8c2746df6e0ed11f3f9c5bf25cc1a72c7d88de92c447613fbcb43 |
| IEDL.DBID | M7S |
| IngestDate | Mon Jun 30 09:30:56 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-a529-577cb597bbff8c2746df6e0ed11f3f9c5bf25cc1a72c7d88de92c447613fbcb43 |
| Notes | SourceType-Working Papers-1 ObjectType-Working Paper/Pre-Print-1 content type line 50 |
| OpenAccessLink | https://www.proquest.com/docview/2420905749?pq-origsite=%requestingapplication% |
| PQID | 2420905749 |
| PQPubID | 2050157 |
| ParticipantIDs | proquest_journals_2420905749 |
| PublicationCentury | 2000 |
| PublicationDate | 20200704 |
| PublicationDateYYYYMMDD | 2020-07-04 |
| PublicationDate_xml | – month: 07 year: 2020 text: 20200704 day: 04 |
| PublicationDecade | 2020 |
| PublicationPlace | Ithaca |
| PublicationPlace_xml | – name: Ithaca |
| PublicationTitle | arXiv.org |
| PublicationYear | 2020 |
| Publisher | Cornell University Library, arXiv.org |
| Publisher_xml | – name: Cornell University Library, arXiv.org |
| SSID | ssj0002672553 |
| Score | 1.7274957 |
| SecondaryResourceType | preprint |
| Snippet | Computer systems are designed to make resources available to users and users may be interested in some resources more than others, therefore, a coordination... |
| SourceID | proquest |
| SourceType | Aggregation Database |
| SubjectTerms | Access control Algorithms Bakeries Coordination Overflow Resource management User requirements User satisfaction |
| Title | Avoiding Register Overflow in the Bakery Algorithm |
| URI | https://www.proquest.com/docview/2420905749 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV09T8MwELWgBYmJb_FRqgysURPHiZMJtagVDJSodChTZV9siChJSUqBf885pDAgsTBaka3Yse_eO1_uEXJOAXEFSzzbKFrZLIDAFpwjVYk8KQPBJBdfYhN8OAwnkyiuA25lnVa5somVoU5yMDHyDroSJ0JwwaKL-YttVKPM7WotobFOmqZKglul7t19x1howBExe1-XmVXpro4o3tNlXbmQOqH7ywRXfmWw_d832iHNWMxVsUvWVLZHNqt8Tij3Ce0u89S4JWukzC8-qrBucdPqWf5mpZmFqM_qiSdVfFjd2QMOunh8PiDjQX98eWXX8gi28Glk-5yDRDogpdYhILkMEh0oRyWuqz0dgS819QFcwSnwJAwTFVFgjKP_1hIk8w5JI8szdUQs5EggteMq7MkiqULl47F2HB26gHAPjklrtQLTeouX05_pn_z9-JRsUUNSTUyUtUhjUbyqM7IBy0VaFm3S7PWH8ahdfTlsxdc38f0n3vCjHg |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LTwIxEJ4gaPTkOz5Q96DHDbvd7nZ7MAYfBAIiUQ7cyLbbKhEBFwT5Uf5HpwvowcSbB8-bbtppO_N902k_gFMiEVfQ2LONopVNAxnYEWNIVbgnRBBRwaKZ2ASr18NWizcy8LG4C2PKKhc-MXXUcV-aHHkBQ4nDEVxQfjF4tY1qlDldXUhozJZFVU0nSNmG55VrnN8zQko3zauyPVcVsCOfcNtnTApE0UJoHUrkZEGsA-Wo2HW1p7n0hSa-lG7EiGRxGMaKE0kpsn1PCymoh79dghyiCMLTSsGHr5QOCRgCdG92dpq-FFaIkvfOeP5QInFC94fHT8NYaf2fGWADco1ooJJNyKjeFqyk1apyuA2kOO53TNC17pW5wKQS6w63pO72J1anZyGmtS6jZ5VMrWL3EccwenrZgeZf9HIXsr1-T-2BhQxQCu24CltSLlSofHRajqNDVyKYlfuQXxi8Pd_Aw_a3tQ9-_3wCq-Xmba1dq9Srh7BGDB032V-ah-woeVNHsCzHo84wOU4XiwXtP56bT6al_is |
| 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%3Ajournal&rft.genre=article&rft.atitle=Avoiding+Register+Overflow+in+the+Bakery+Algorithm&rft.jtitle=arXiv.org&rft.au=Sayyadabdi%2C+Amirhossein&rft.au=Sharifi%2C+Mohsen&rft.date=2020-07-04&rft.pub=Cornell+University+Library%2C+arXiv.org&rft.eissn=2331-8422&rft_id=info:doi/10.48550%2Farxiv.2007.02081 |