Performance Modeling and Benchmarking of Event-Based ... - DVS

More documents

Recommendations

Info

72 CHAPTER 4. PERFORMANCE ENGINEERING OF EVENT-BASED SYSTEMS Each Consumer is reflected by an own place. Available resources of the consumer are represented by Ready tokens which are stored at the consumer place. The pull attempt of the Consumer is implemented by transistion T1 : if an Event is available at the Load Balancer and the Consumer is ready (symbolized by a Ready token) to process the next Event token, the Event is forwarded to the Consumer. If multiple Consumers are ready, an Event is randomly assigned to one Consumer. After an Event is processed by the Consumer, the resources are released by creating a Ready token, which is done by transition T2. The number of available resources of a Consumer can be modeled by the initial number of Ready tokens at a Consumer place. QPN Definition Places: Place Type Description Load Balancer S Receives incoming events. Consumer i S Consumes incoming events. One place for each of the n consumers. Colors: Color Event Ready Description Represents the published event. Represents that the Consumer is ready to process an Event. Init No. of Colors: Color Place Count Description Ready Consumer i j Specifies for each Consumer i the number of Events, which can be processed in parallel. Transitions: Id Input Output FW Description T1 1 Event (Load Balancer) 1 Event (Consumer i) 1 Forwards event 1 Ready (Consumer i) T2 1 Event (Consumer i) 1 Ready (Consumer i) 1 After an event is processed, the resources are released. Note: n is the count of Consumers.
4.3. EXTENSIONS OF QPNS 73 ,-).$%&'(!&)*+( !"#$%&'(!&)*+( 4.3 Extensions of QPNs Figure 4.21: Physical and Logical Layers In this section we discuss how QPNs can be conceptually extended to solve the mentioned shortcomings and limitations and to increase modeling simplicity and flexibility without increasing complexity. We propose three extensions for standard QPNs: 1. Mapping of logical to physical resources • QPNs are extended to support multiple queueing places that share the same physical queue. • A flexible mapping of logical to physical resources that makes it easy to customize the model to a specific deployment of the application is introduced. 2. Non-constant cardinalities of transitions 3. Priority support for transitions • With transition priorities we introduce a firing hierarchy and can control the firing order of transitions effectively. Our target implementation platform is the SimQPN simulation engine of QPME [127, 129, 128]. The concept of mappings of logical to physical resources is already available in the current version of QPME while both the others are planned for future release. 4.3.1 Mapping of Logical to Physical Resources In traditional QPNs, the physical resources of an application in a specific setup are modeled. In our approach, we introduce a new level of indirection to increase flexibility and reusability of the models by distinguishing between logical layer and physical layer (see Figure 4.21). In our approach the first step is to model the logical relations of an application and to focus on the interactions of logic entities such as components instead on physical resources such as CPU. By using subnet places to represent these logical entities, we provide flexibility in choosing the level of detail at which the system components are modeled. Each subnet place is bound to a nested QPN that may contain multiple queueing places representing logical system resources available to the respective client or server components, e.g., CPUs, disk subsystems and
Page 1:
Performance Modeling and Benchmarki
Page 4 and 5:
priorities. Finally, we validated o
Page 6 and 7:
4.3.4 Tool Extension . . . . . . .
Page 8 and 9:
5.7 Proportions of the Interactions
Page 11 and 12:
List of Acronyms Acronym λ t,k j A
Page 13 and 14:
Acronym SPEC-OSG SPE SPN SQL ST SUT
Page 15 and 16:
Chapter 1 Introduction 1.1 Motivati
Page 17 and 18:
PC Server 310 PC Server 310 PC Serv
Page 19 and 20:
1.3. APPROACH AND CONTRIBUTIONS OF
Page 21 and 22:
1.4. THESIS ORGANIZATION 7 • Stan
Page 23 and 24:
Chapter 2 Background In this chapte
Page 25 and 26:
2.1. EVENT-BASED SYSTEMS 11 is gene
Page 27 and 28:
2.2. TECHNOLOGY PLATFORMS OF EVENT-
Page 29 and 30:
Page 31 and 32:
Page 33 and 34:
Page 35 and 36: 2.3. INTRODUCTION TO QUEUEING PETRI
Page 37 and 38: 2.3. INTRODUCTION TO QUEUEING PETRI
Page 39 and 40: Chapter 3 Related Work In this chap
Page 41 and 42: 3.2. BENCHMARKING OF EVENT-BASED SY
Page 43 and 44: 3.2. BENCHMARKING OF EVENT-BASED SY
Page 45 and 46: 3.4. CONCLUDING REMARKS 31 hierarch
Page 47 and 48: Chapter 4 Performance Engineering o
Page 49 and 50: 4.1. MODELING METHODOLOGY FOR EBS 3
Page 57 and 58: 4.2. PERFORMANCE MODELING PATTERN 4
Page 85: 4.2. PERFORMANCE MODELING PATTERN 7
Page 89 and 90: 4.4. CONCLUDING REMARKS 75 Without
Page 91 and 92: Chapter 5 Benchmarking of Event-Bas
Page 93 and 94: 5.1. SPECJMS2007 - A STANDARD BENCH
Page 115 and 116: 5.2. CASE STUDY I: SPECJMS2007 101
Page 125 and 126: 5.3. JMS2009-PS - A PUBLISH /SUBSCR
Page 127 and 128: 5.3. JMS2009-PS - A PUBLISH /SUBSCR
Page 129 and 130: 5.4. CASE STUDY II: JMS2009-PS 115
Page 131 and 132: 5.4. CASE STUDY II: JMS2009-PS 117
Page 133 and 134: Chapter 6 Performance Modeling of E
Page 135 and 136: 6.2. MODELING SPECJMS2007 121 Scena
Page 137 and 138:
6.2. MODELING SPECJMS2007 123 BASE*
Page 139 and 140:
6.2. MODELING SPECJMS2007 125 1‘O
Page 141 and 142:
6.2. MODELING SPECJMS2007 127 Sc. 1
Page 143 and 144:
6.2. MODELING SPECJMS2007 129 Perce
Page 145 and 146:
6.2. MODELING SPECJMS2007 131 Serve
Page 147 and 148:
6.3. CONCLUDING REMARKS 133 the mod
Page 149 and 150:
Chapter 7 Conclusions and Outlook W
Page 151 and 152:
7.1. ONGOING AND FUTURE WORK 137 JA
Page 153 and 154:
7.1. ONGOING AND FUTURE WORK 139 th
Page 155 and 156:
Bibliography [1] J. Abbott, K. B. M
Page 157 and 158:
BIBLIOGRAPHY 143 [29] BiCEP Researc
Page 159 and 160:
BIBLIOGRAPHY 145 [61] G. Cugola and
Page 161 and 162:
BIBLIOGRAPHY 147 [92] R. Henjes, M.
Page 163 and 164:
BIBLIOGRAPHY 149 [128] S. Kounev an
Page 165 and 166:
BIBLIOGRAPHY 151 [162] Object Compu
Page 167 and 168:
BIBLIOGRAPHY 153 [197] K. Sachs, S.
Page 169 and 170:
BIBLIOGRAPHY 155 [228] P. Tran, P.
Page 171:
Erklärung Hiermit erkläre ich, di
show all

Performance Modeling and Benchmarking of Event-Based ... - DVS

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?