DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Baik, Jong-moon | - |
dc.contributor.advisor | 백종문 | - |
dc.contributor.author | Lee, Hun-Jae | - |
dc.contributor.author | 이훈재 | - |
dc.date.accessioned | 2011-12-14T02:29:54Z | - |
dc.date.available | 2011-12-14T02:29:54Z | - |
dc.date.issued | 2010 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=455181&flag=dissertation | - |
dc.identifier.uri | http://hdl.handle.net/10203/40127 | - |
dc.description | 학위논문(석사) - 한국과학기술원 : 소프트웨어공학 프로그램, 2010.08, [ ix, 65 p. ] | - |
dc.description.abstract | Generalized Stochastic Petri Nets (GSPN) has gained much attention in software performance modeling because it provides not only performance quantities, but also qualitative analysis power by means of the underlying Petri nets. However, GSPN-based performance modeling has two well-known drawbacks. The one is its computation difficulty for models of large systems. The other is the inefficiency in model constructions. For the latter drawback, it is related to model size and inconvenient notations. This thesis is to tackle the inefficiency. As a software system grows, the size of its corresponding model also grows. It may be true for any graphical modeling language. In the point of view of performance modeling, GSPN is weaker than other modeling language; e.g. Queueing Networks. The major reason of the relative weakness is because the graphical notation of GSPN is too general; coincidence of its generality. In the software performance modeling, however, a well defined modeling pattern exists; modeling of resource constraints. Furthermore, the resource constraints cannot be omitted in software performance models. Therefore the size of software performance models can be reduced by simplifying the well known pattern as a set of convenient notations. By using the simplified notation, a software performance model can be reduced in its size while conveying the same meaning more intuitively. The reduction may also lead to less effort in creating a software performance models. On the other hand, the performance quantities of the model must not be changed from the original model. Thus, a systematic unfolding mechanism or process has to be provided to obtain the corresponding GSPN models from the simplified models. The systematic unfolding process is about to be implemented on GSPN tools. Then, modelers can construct a software performance model with convenient notations and retrieve performance quantities by means of a capable tool. Therefore, this thesis provides a ... | eng |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.subject | Generalized Stochastic Petri Nets | - |
dc.subject | Software Performance Model | - |
dc.subject | Performance Modeling | - |
dc.subject | 성능 모델링 | - |
dc.subject | Generalized Stochastic Petri Nets | - |
dc.subject | 소프트웨어 성능 모델 | - |
dc.title | Simplicafication of resource constraints in generalized stochastic petri net-based software performance models | - |
dc.title.alternative | Generalized Stochastic Petri Net 기반 소프트웨어 성능 모델에서의 자원제약 표현의 간소화 | - |
dc.type | Thesis(Master) | - |
dc.identifier.CNRN | 455181/325007 | - |
dc.description.department | 한국과학기술원 : 소프트웨어공학 프로그램, | - |
dc.identifier.uid | 020084311 | - |
dc.contributor.localauthor | Baik, Jong-moon | - |
dc.contributor.localauthor | 백종문 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.