Skip to main content
SpringerLink
Log in

A resource allocation problem

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1980 (MFCS 1980)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 88))

Abstract

This paper deals with the following problems; we have a set of cyclic, deterministic processes, which progress by taking and later releasing a number of various kinds of resources, the system being represented by a place/transition net. We are given a technique for putting additional constraints on the system which, given certain assumptions about the pattern of resource usage by the processes, causes the system to execute only those of its original behaviours which do not lead to deadlock. The technique involves the introduction of additional places which have the effect of regulating the progression of the processes in relation to each other. These places act like semaphores.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Coffman E.G., Denning P.J., Operating systems theory, Prentice-Hall 1973.

    Google Scholar 

  2. Haberman A.N., Prevention of system deadlocks, Comm.ACM 12,7(1969),373–387.

    Google Scholar 

  3. Haberman A.N., Synchronization of communikating processes, Comm.ACM 15, 3(1972), 177–184.

    Google Scholar 

  4. Hack M., Analysis of production schemata by Petri nets, MAC TR-94, Project MAC, M.I.T. Cambridge, MA(1972).

    Google Scholar 

  5. Lautenbach K., Thiagarajan P.S., Analysis of resource allocation problem using Petri nets, 1st Europ.Confer. on Paral. and Distrib. Proc.,Toulouse, (1979).

    Google Scholar 

  6. Peterson J.L., Petri nets, ACM Computing Surveys 9,(1977), 223–252.

    Google Scholar 

  7. Skowron A., Teoria procesów współbieżnych, w przygotowaniu.

    Google Scholar 

  8. Skowron A., O efektywności w systemach iteracyjnych, PWN, Warszawa 1979.

    Google Scholar 

  9. Suraj Z., A resource allocation problem, ICS PAS REPORTS 404(1980).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Pedagogical College, 35-310, Rzeszow, Poland

    Zbigniew Suraj

Authors
  1. Zbigniew Suraj
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

P. Dembiński

Rights and permissions

Reprints and permissions

Copyright information

© 1980 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Suraj, Z. (1980). A resource allocation problem. In: Dembiński, P. (eds) Mathematical Foundations of Computer Science 1980. MFCS 1980. Lecture Notes in Computer Science, vol 88. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022538

Download citation

  • DOI: https://doi.org/10.1007/BFb0022538

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10027-0

  • Online ISBN: 978-3-540-38194-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation