Extensions on performance evaluation techniques for concurrent systems

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

Extensions on performance evaluation techniques for concurrent systems

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

^*Corresponding author for this work

University of California at Berkeley

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

5 Scopus citations

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(n³log₂ 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 language	English
Title of host publication	Proceedings - IEEE Computer Society's International Computer Software & Applications Conference
Editors	George J. Knafl
Publisher	Publ by IEEE
Pages	480-484
Number of pages	5
ISBN (Print)	0818608730
State	Published - 1988
Externally published	Yes

Publication series

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

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). (Proceedings - IEEE Computer Society's International Computer Software & Applications Conference). Publ by IEEE.

Yaw, Y. ; Wei, Belle W.Y. ; Ramamoorthy, C. V. et al. / Extensions on performance evaluation techniques for concurrent systems. Proceedings - IEEE Computer Society's International Computer Software & Applications Conference. editor / George J. Knafl. Publ by IEEE, 1988. pp. 480-484 (Proceedings - IEEE Computer Society's International Computer Software & Applications Conference).

@inproceedings{8de2a118efcd4551afbb0e3d7232f7b9,

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 = "英语",

isbn = "0818608730",

series = "Proceedings - IEEE Computer Society's International Computer Software \& Applications Conference",

publisher = "Publ by IEEE",

pages = "480--484",

editor = "Knafl, \{George J.\}",

booktitle = "Proceedings - IEEE Computer Society's International Computer Software \& Applications Conference",

}

Extensions on performance evaluation techniques for concurrent systems. / Yaw, Y.; Wei, Belle W.Y.; Ramamoorthy, C. V. et al.
Proceedings - IEEE Computer Society's International Computer Software & Applications Conference. ed. / George J. Knafl. Publ by IEEE, 1988. p. 480-484 (Proceedings - IEEE Computer Society's International Computer Software & Applications Conference).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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 - https://www.scopus.com/pages/publications/0024143416

M3 - 会议稿件

AN - SCOPUS:0024143416

SN - 0818608730

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

SP - 480

EP - 484

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

A2 - Knafl, George J.

PB - Publ by IEEE

ER -

Extensions on performance evaluation techniques for concurrent systems

Abstract

Publication series

Other files and links

Fingerprint

Cite this