Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1109/SFCS.1979.37guideproceedingsArticle/Chapter ViewAbstractPublication PagesConference Proceedingsacm-pubtype
Article

Resource allocation with immunity to limited process failure

Published: 29 October 1979 Publication History
  • Get Citation Alerts
  • Abstract

    Upper and lower bounds are proved for the shared space requirements for solution of several problems involving resource allocation among asynchronous processes. Controlling the degradation of performance when a limited number of processes fail is of particular interest.

    Cited By

    View all

    Index Terms

    1. Resource allocation with immunity to limited process failure
      Index terms have been assigned to the content through auto-classification.

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image Guide Proceedings
      SFCS '79: Proceedings of the 20th Annual Symposium on Foundations of Computer Science
      October 1979
      431 pages

      Publisher

      IEEE Computer Society

      United States

      Publication History

      Published: 29 October 1979

      Qualifiers

      • Article

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)0
      • Downloads (Last 6 weeks)0
      Reflects downloads up to 11 Aug 2024

      Other Metrics

      Citations

      Cited By

      View all
      • (2021)HemlockProceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3409964.3461805(173-183)Online publication date: 6-Jul-2021
      • (2019)The mutual exclusion problemConcurrency10.1145/3335772.3335938(247-276)Online publication date: 4-Oct-2019
      • (2017)Concurrency in snap-stabilizing local resource allocationJournal of Parallel and Distributed Computing10.1016/j.jpdc.2016.11.004102:C(42-56)Online publication date: 1-Apr-2017
      • (2016)Group mutual exclusion in linear time and spaceProceedings of the 17th International Conference on Distributed Computing and Networking10.1145/2833312.2833316(1-10)Online publication date: 4-Jan-2016
      • (2016)Fair synchronizationJournal of Parallel and Distributed Computing10.1016/j.jpdc.2016.06.00797:C(1-10)Online publication date: 1-Nov-2016
      • (2015)Self-Stabilizing ℓ-Exclusion RevisitedProceedings of the 16th International Conference on Distributed Computing and Networking10.1145/2684464.2684465(1-10)Online publication date: 4-Jan-2015
      • (2013)Fair SynchronizationProceedings of the 27th International Symposium on Distributed Computing - Volume 820510.1007/978-3-642-41527-2_13(179-193)Online publication date: 14-Oct-2013
      • (2013)Fast and Scalable Queue-Based Resource Allocation Lock on Shared-Memory MultiprocessorsProceedings of the 17th International Conference on Principles of Distributed Systems - Volume 830410.1007/978-3-319-03850-6_19(266-280)Online publication date: 16-Dec-2013
      • (2012)Abortable reader-writer locks are no more complex than abortable mutex locksProceedings of the 26th international conference on Distributed Computing10.1007/978-3-642-33651-5_20(282-296)Online publication date: 16-Oct-2012
      • (2011)Tight space bounds for l-exclusionProceedings of the 25th international conference on Distributed computing10.5555/2075029.2075040(110-124)Online publication date: 20-Sep-2011
      • Show More Cited By

      View Options

      View options

      Media

      Figures

      Other

      Tables

      Share

      Share

      Share this Publication link

      Share on social media