Extensions on performance evaluation techniques for concurrent systems

Y. Yaw, Belle W Y Wei, C. V. Ramamoorthy, W. T. Tsai

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

The authors present a procedure for computing the cycle time of concurrent systems modeled by a restricted class of Petri nets, i.e., decision-free and safe persistent nets. The procedure is based on formulating the cycle time computation as a minimal cost-to-time ratio cycle problem. The result is an efficient algorithm with a computational complexity of O(n3log2 n). By using an example with a stochastic counterpart, it is shown that the results are consistent with those obtained by more complex Markov analysis.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE Computer Society's International Computer Software & Applications Conference
EditorsGeorge J. Knafl
Place of PublicationPiscataway, NJ, United States
PublisherPubl by IEEE
Pages480-484
Number of pages5
ISBN (Print)0818608730
StatePublished - 1988
Externally publishedYes

Fingerprint

Petri nets
Computational complexity
Costs

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Yaw, Y., Wei, B. W. Y., Ramamoorthy, C. V., & Tsai, W. T. (1988). Extensions on performance evaluation techniques for concurrent systems. In G. J. Knafl (Ed.), Proceedings - IEEE Computer Society's International Computer Software & Applications Conference (pp. 480-484). Piscataway, NJ, United States: Publ by IEEE.

Extensions on performance evaluation techniques for concurrent systems. / Yaw, Y.; Wei, Belle W Y; Ramamoorthy, C. V.; Tsai, W. T.

Proceedings - IEEE Computer Society's International Computer Software & Applications Conference. ed. / George J. Knafl. Piscataway, NJ, United States : Publ by IEEE, 1988. p. 480-484.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Yaw, Y, Wei, BWY, Ramamoorthy, CV & Tsai, WT 1988, Extensions on performance evaluation techniques for concurrent systems. in GJ Knafl (ed.), Proceedings - IEEE Computer Society's International Computer Software & Applications Conference. Publ by IEEE, Piscataway, NJ, United States, pp. 480-484.
Yaw Y, Wei BWY, Ramamoorthy CV, Tsai WT. Extensions on performance evaluation techniques for concurrent systems. In Knafl GJ, editor, Proceedings - IEEE Computer Society's International Computer Software & Applications Conference. Piscataway, NJ, United States: Publ by IEEE. 1988. p. 480-484
Yaw, Y. ; Wei, Belle W Y ; Ramamoorthy, C. V. ; Tsai, W. T. / Extensions on performance evaluation techniques for concurrent systems. Proceedings - IEEE Computer Society's International Computer Software & Applications Conference. editor / George J. Knafl. Piscataway, NJ, United States : Publ by IEEE, 1988. pp. 480-484
@inproceedings{e318e192cda140778954efaca5b38ac9,
title = "Extensions on performance evaluation techniques for concurrent systems",
abstract = "The authors present a procedure for computing the cycle time of concurrent systems modeled by a restricted class of Petri nets, i.e., decision-free and safe persistent nets. The procedure is based on formulating the cycle time computation as a minimal cost-to-time ratio cycle problem. The result is an efficient algorithm with a computational complexity of O(n3log2 n). By using an example with a stochastic counterpart, it is shown that the results are consistent with those obtained by more complex Markov analysis.",
author = "Y. Yaw and Wei, {Belle W Y} and Ramamoorthy, {C. V.} and Tsai, {W. T.}",
year = "1988",
language = "English (US)",
isbn = "0818608730",
pages = "480--484",
editor = "Knafl, {George J.}",
booktitle = "Proceedings - IEEE Computer Society's International Computer Software & Applications Conference",
publisher = "Publ by IEEE",

}

TY - GEN

T1 - Extensions on performance evaluation techniques for concurrent systems

AU - Yaw, Y.

AU - Wei, Belle W Y

AU - Ramamoorthy, C. V.

AU - Tsai, W. T.

PY - 1988

Y1 - 1988

N2 - The authors present a procedure for computing the cycle time of concurrent systems modeled by a restricted class of Petri nets, i.e., decision-free and safe persistent nets. The procedure is based on formulating the cycle time computation as a minimal cost-to-time ratio cycle problem. The result is an efficient algorithm with a computational complexity of O(n3log2 n). By using an example with a stochastic counterpart, it is shown that the results are consistent with those obtained by more complex Markov analysis.

AB - The authors present a procedure for computing the cycle time of concurrent systems modeled by a restricted class of Petri nets, i.e., decision-free and safe persistent nets. The procedure is based on formulating the cycle time computation as a minimal cost-to-time ratio cycle problem. The result is an efficient algorithm with a computational complexity of O(n3log2 n). By using an example with a stochastic counterpart, it is shown that the results are consistent with those obtained by more complex Markov analysis.

UR - http://www.scopus.com/inward/record.url?scp=0024143416&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0024143416&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0024143416

SN - 0818608730

SP - 480

EP - 484

BT - Proceedings - IEEE Computer Society's International Computer Software & Applications Conference

A2 - Knafl, George J.

PB - Publ by IEEE

CY - Piscataway, NJ, United States

ER -