Allocation sequences of two processes sharing a resource

Author

Gaujal, Bruno ; Jafari, Mohsen ; Baykal-Gürsoy, Melike ; Alpan, Gülgün

Author_Institution

Dimacs Center, Rutgers Univ., Piscataway, NJ, USA

Volume

11

Issue

5

fYear

1995

fDate

10/1/1995 12:00:00 AM

Firstpage

748

Lastpage

753

Abstract

We study a Petri net model of a system composed of two processes sharing a resource. Conflicts may occur over the usage of the shared resource, thus making the system nondeterministic. Therefore, in the context of minimax algebra, it cannot be formulated as a linear system in order to compute its performance measures. However, if the sequence by which the resource is allocated to the two processes is known, we can transform the system into a decision-free net. For this system with an imposed constraint on the resource allocation frequencies, we show that the optimal allocation sequence is the most regular integer sequence satisfying that constraint. We also discuss the periodic behavior of this system under no constraints on the resource allocation frequencies

Keywords

Petri nets; discrete event systems; minimax techniques; operations research; resource allocation; Petri net model; decision-free net; minimax algebra; nondeterministic systems; optimal allocation sequence; resource allocation; resource sharing; Algebra; Computer numerical control; Frequency; Linear systems; Manufacturing processes; Minimax techniques; Petri nets; Radio spectrum management; Resource management; Workstations;

fLanguage

English

Journal_Title

Robotics and Automation, IEEE Transactions on

Publisher

ieee

ISSN

1042-296X

Type

jour

DOI

10.1109/70.466609

Filename

466609