A resource allocation problem
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.
KeywordsLinear System Resource Allocation Problem Maximal Transition Control Place Initial Marking
Unable to display preview. Download preview PDF.
- Coffman E.G., Denning P.J., Operating systems theory, Prentice-Hall 1973.Google Scholar
- Haberman A.N., Prevention of system deadlocks, Comm.ACM 12,7(1969),373–387.Google Scholar
- Haberman A.N., Synchronization of communikating processes, Comm.ACM 15, 3(1972), 177–184.Google Scholar
- Hack M., Analysis of production schemata by Petri nets, MAC TR-94, Project MAC, M.I.T. Cambridge, MA(1972).Google Scholar
- 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
- Peterson J.L., Petri nets, ACM Computing Surveys 9,(1977), 223–252.Google Scholar
- Skowron A., Teoria procesów współbieżnych, w przygotowaniu.Google Scholar
- Skowron A., O efektywności w systemach iteracyjnych, PWN, Warszawa 1979.Google Scholar
- Suraj Z., A resource allocation problem, ICS PAS REPORTS 404(1980).Google Scholar