Skip to main content
SpringerLink
Log in
Book cover

Models for Parallel and Distributed Computation pp 27–52Cite as

The Combinatorics of Resource Sharing

  • Chapter

Part of the book series: Applied Optimization ((APOP,volume 67))

Abstract

We discuss general models of resource-sharing computations, with emphasis on the combinatorial structures and concepts that underlie the various deadlock models that have been proposed, the design of algorithms and deadlock-handling policies, and concurrency issues. These structures are mostly graph-theoretic in nature, or partially ordered sets for the establishment of priorities among processes and acquisition orders on resources. We also discuss graph-coloring concepts as they relate to resource sharing.

This author is supported by the Brazilian agencies CNPq and CAPES, the PRONEX initiative of Brazil’s MCT under contract 41.96.0857.00, and by a FAPERJ BBP grant.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. V. C. Barbosa. Concurrency in Systems with Neighborhood Constraints. PhD thesis, Computer Science Department, University of California, Los Angeles, CA, 1986.

    Google Scholar 

  2. V. C. Barbosa. An Introduction to Distributed Algorithms. The MIT Press, Cambridge, MA, 1996.

    Google Scholar 

  3. V. C. Barbosa and M. R. F. Benevides. A graph-theoretic characterization of AND-OR deadlocks. Technical Report COPPE-ES-472/98, Federal University of Rio de Janeiro, Rio de Janeiro, Brazil, July 1998.

    Google Scholar 

  4. V. C. Barbosa, M. R. F. Benevides, and F. M. G. França. Sharing resources at nonuniform access rates. Theory of Computing Systems, 34:13–26, 2001.

    Article  MathSciNet  MATH  Google Scholar 

  5. V. C. Barbosa and E. Gafni. Concurrency in heavily loaded neighborhoodconstrained systems. ACM Trans. on Programming Languages and Systems, 11:562–584, 1989.

    Article  Google Scholar 

  6. J. A. Bondy and U. S. R. Murty. Graph Theory with Applications. NorthHolland, New York, NY, 1976.

    MATH  Google Scholar 

  7. G. Bracha and S. Toueg. Distributed deadlock detection. Distributed Computing, 2:127–138, 1987.

    Article  MATH  Google Scholar 

  8. J. Brzezinski, J.-M. Hélary, M. Raynal, and M. Singhal. Deadlock models and a general algorithm for distributed deadlock detection. J. of Parallel and Distributed Computing, 31:112–125, 1995.

    Article  Google Scholar 

  9. K. M. Chandy and L. Lamport. Distributed snapshots: Determining global states of distributed systems. ACM Trans. on Computer Systems, 3:63–75, 1985.

    Article  Google Scholar 

  10. K. M. Chandy and J. Misra. The drinking philosophers problem. ACM Trans. on Programming Languages and Systems, 6:632–646, 1984.

    Article  Google Scholar 

  11. K. M. Chandy, J. Misra, and L. M. Haas. Distributed deadlock detection. ACM Trans. on Computer Systems, 1:144–156, 1983.

    Article  Google Scholar 

  12. R. W. Deming. Acyclic orientations of a graph and chromatic and independence numbers. J. of Combinatorial Theory B, 26:101–110, 1979.

    Article  MathSciNet  MATH  Google Scholar 

  13. E. W. Dijkstra. Hierarchical ordering of sequential processes. Acta Informatica, 1:115–138, 1971.

    Article  MathSciNet  Google Scholar 

  14. F. M. G. França. Neural Networks as Neighbourhood-Constrained Systems. PhD thesis, Imperial College, London, UK, 1994.

    Google Scholar 

  15. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York, NY, 1979.

    MATH  Google Scholar 

  16. R. C. Holt. Some deadlock properties of computer systems. ACM Computing Surveys, 4:179–196, 1972.

    Article  MathSciNet  Google Scholar 

  17. E. Knapp. Deadlock detection in distributed databases. ACM Computing Surveys, 19:303–328, 1987.

    Article  Google Scholar 

  18. A. D. Kshemkalyani and M. Singhal. Efficient detection and resolution of generalized distributed deadlocks. IEEE Trans. on Software Engineering, 20:43–54, 1994.

    Article  Google Scholar 

  19. N. A. Lynch. Upper bounds for static resource allocation in a distributed system. J. of Computer and System Sciences, 23:254–278, 1981.

    Article  MathSciNet  MATH  Google Scholar 

  20. J. Misra and K. M. Chandy. A distributed graph algorithm: Knot detection. ACM Trans. on Programming Languages and Systems, 4:678–686, 1982.

    Article  MATH  Google Scholar 

  21. D.-S. Ryang and K. H. Park. A two-level distributed detection algorithm of AND/OR deadlocks. J. ofParallel and Distributed Computing, 28:149– 161, 1995.

    Article  MATH  Google Scholar 

  22. E. R. Scheinerman and D. H. Ullman. Fractional Graph Theory: A Rational Approach to the Theory of Graphs. Wiley, New York, NY, 1997.

    MATH  Google Scholar 

  23. M. Singhal. Deadlock detection in distributed systems. IEEE Computer, 22:37–48, 1989.

    Article  Google Scholar 

  24. S. Stahl. n-tuple colorings and associated graphs. J. of Combinatorial Theory B, 20:185–203, 1976.

    Article  MathSciNet  MATH  Google Scholar 

  25. J. L. Welch and N. A. Lynch. A modular drinking philosophers algorithm. Distributed Computing, 6:233–244, 1993.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Programa de Engenharia de Sistemas e Computação, COPPE, Caixa Postal 68511, 21945-970, Rio de Janeiro, RJ, Brazil

    Valmir C. Barbosa

Authors
  1. Valmir C. Barbosa
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Universidade Federal do Ceará, Brazil

    Ricardo Corrêa , Mario Fiallos  & Fernando Gomes ,  & 

  2. Universidade Federal do Rio de Janeiro, Brazil

    Inês Dutra

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Barbosa, V.C. (2002). The Combinatorics of Resource Sharing. In: Corrêa, R., Dutra, I., Fiallos, M., Gomes, F. (eds) Models for Parallel and Distributed Computation. Applied Optimization, vol 67. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3609-0_2

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-3609-0_2

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4419-5219-6

  • Online ISBN: 978-1-4757-3609-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation