Skip to main content
SpringerLink
Log in

Optimal Allocation Sequences of Two Processes Sharing a Resource

  • Published:
Discrete Event Dynamic Systems Aims and scope Submit manuscript

Abstract

In this paper, we show that the “most regular” word in the language formed by all the words containing a fixed number of each letter of an alphabet gives the optimal resource allocation policy of the generic system composed by two processes sharing a resource. This system will be modeled as a Petri net to derive the proof of this result which is partially generalized to non periodic allocation sequences and non rational frequencies. For N processes sharing a resource, we show that a strongly optimal sequence may not exist. In this case, we give an heuristic to find a good allocation sequence which relates to regular words in higher dimensions.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Chaouiya, C. 1992. Outils pour l'analyse de systèmes sychronisés. PhD thesis, University of Nice Sophia Antipolis, France.

    Google Scholar 

  • Baccelli, F., Cohen, G., Oldser, G.J., and Quadrat, J.-P. 1992. Synchronization and Linearity. New York: Springer Verlag.

    Google Scholar 

  • Berstel, J. 1990. Tracé de droites, fractions continues et morphismes itérés. Mots, M. Lothaire (Ed). Paris: Hermès, 298–309.

    Google Scholar 

  • Hajek, B. 1985. Extremal splittings of point processes. Mathematics of Operation Research 10: 543–556.

    Google Scholar 

  • Gaujal, B., Jafari, M., Gursöy-Baykal, M., and Alpan, G. 1995. Allocation sequence of two processes sharing a resource. IEEE Transactions on Robotics and Automation 11,5: 748–753.

    Google Scholar 

  • Hofri, Rosberg. 1987. IEEE Transactions on Information Sciences 33: 341–349.

    Google Scholar 

  • Hordijk, A., Koole, G., and Loeve, J. A. 1994. Analysis of a customer assignment model with no state information. Probabilty in the Engineering and Informational Sciences 8: 419–429.

    Google Scholar 

  • Loeve, J.A. 1995. Markov decision chains with partial information. PhD Thesis, University of Leiden.

  • Morse, M. and Hedlund, G. A. 1940. Symbolic dynamics II — Sturmian trajectories. Amer. J. Math. 62: 1–42.

    Google Scholar 

  • Murata, T. 1989. Petri nets: Properties, analysis and applications. Proceeedings of IEEE 77,4: 541–580.

    Google Scholar 

  • Ramamoorthy, C. V. and Ho, G.S. 1980. Performance evaluation os asynchronous concurrent systems using Petri nets. IEEE Trans. Software Eng. SE-6: 440–449.

    Google Scholar 

  • Rauzy, G. 1985. Mots infinis en arithmétique. Automata of infinite words. Nivat, Perrin (Eds). LNCS 192, Springer-Verlag, 165–171.

  • Sha, L., Rajkumar, R., and Sathaye, S.S. 1994. Generalized rate-monotonic sheduling theory: A framework for developing real-time systems. Proceedings of the IEEE Vol. 82,No. 1.

Download references

Author information

Authors and Affiliations

  1. INRIA Sophia Antipolis, BP 93, 06902, Sophia-Antipolis, France

    Bruno Gaujal

Authors
  1. Bruno Gaujal
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gaujal, B. Optimal Allocation Sequences of Two Processes Sharing a Resource. Discrete Event Dynamic Systems 7, 327–354 (1997). https://doi.org/10.1023/A:1008256825451

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008256825451

Search

Navigation