<p><span>This book constitutes the refereed proceedings of the 17th European Workshop on Computer Performance Engineering, EPEW 2021, and the 26</span><span><sup>th</sup></span><span> International Conference, on Analytical and Stochastic Modelling Techniques and Applications, ASMTA 2021, held in De
Computer Performance Engineering and Stochastic Modelling: 19th European Workshop, EPEW 2023, and 27th International Conference, ASMTA 2023, Florence, ... (Lecture Notes in Computer Science)
β Scribed by Mauro Iacono (editor), Marco Scarpa (editor), Enrico Barbierato (editor), Salvatore Serrano (editor), Davide Cerotti (editor), Francesco Longo (editor)
- Publisher
- Springer
- Year
- 2023
- Tongue
- English
- Leaves
- 411
- Category
- Library
No coin nor oath required. For personal study only.
β¦ Synopsis
This book constitutes the refereed proceedings of the 19th European Workshop on Computer Performance Engineering, EPEW 2023, and 27th International Conference on Analytical and Stochastic Modelling Techniques and Applications, ASMTA 2023, held in Florence, Italy, in June 2023.
The 26 papers presented in this volume were carefully reviewed and selected from 35 submissions. The papers presented at the workshop reflect the diversity of modern performance engineering. The sessions covered a wide range of topics including robustness analysis, machine learning, edge and cloud computing, as well as more traditional topics on stochastic modelling, techniques and tools.
β¦ Table of Contents
Preface
Organization ASMTA 2023
Organization EPEW 2023
Contents
ASMTA 2023
Strategic Revenue Management for Discriminatory Processor Sharing Queues
1 Introduction
2 Revenue Management Without Balking
2.1 Queueing Model
2.2 Revenue Management
3 Heterogenous Customers
3.1 Exponentially Distributed Weights
3.2 Numerical Example
4 Heterogeneous Customers and Balking
4.1 Numerical Example
5 Conclusion
References
Performance and Energy Evaluation for Solving a SchrΓΆdinger-Poisson System on Multicore Processors
1 Introduction
2 Related Work
3 Numerical Approximation Method
3.1 Fourier-Galerkin Problem
3.2 Runge-Kutta Solution Method
3.3 Accuracy of the Numerical Solution
3.4 Multi-threaded Implementation
4 Performance and Energy Behavior
4.1 Metrics and Parameters
4.2 Experimental Setup
4.3 Dependence on the Number of Threads
4.4 Increasing Number of Base Functions
4.5 Pareto Analysis of Frequency Scaling
5 Conclusions
References
Stochastic Analysis of Rumor Spreading with Multiple Pull Operations in Presence of Non-cooperative Nodes
1 Introduction
2 The k-Pull Protocol in Presence of Non-cooperative Nodes
2.1 The k-Pull Protocol in Absence of Non-cooperative Nodes
2.2 The k-Pull Protocol in Presence of nf Non-cooperative Nodes
3 Analysis of the Rumor Spreading Time When k=2
3.1 Asymptotic Mean and Variance of the Rumor Spreading Time
3.2 Asymptotic Distribution of the Rumor Spreading Time
4 General Case
5 Discussion
References
Analysis of a Two-State Markov Fluid Model with 2 Buffers
1 Introduction
2 Model Description
3 Performance Analysis of the Fluid Model
3.1 Utilization of the Buffers and Stability Condition
3.2 Analysis of Embedded Time Points
4 Time Stationary Behaviour
4.1 Analysis of C1)
4.2 Analysis of C2)
4.3 Analysis of Case C3) and C4)
4.4 Steps of the Numerical Procedure
5 Numerical Example
6 Conclusion
References
A Variable-Cycle Traffic Light Queue
1 Introduction
2 Mathematical Model
3 System Content Analysis
4 Delay Analysis
5 Numerical Example
References
M/G/1 Queue with State Dependent Service Times
1 Introduction
2 Model Description
3 General M/Gn/1 System
3.1 Relation for the PGF of the Steady-State Number of Customers
3.2 The Steady-State Distribution of the Number of Customers
4 M/Gn/1 System with a Finite Number of Different Service Time Distributions
4.1 The PGF of the Steady-State Number of Customers
4.2 The Mean Steady-State Number of Customers
5 M/Gn/1 System with State Dependent Linear Interpolation of Two Service Times
5.1 The PGF of the Steady-State Number of Customers in the System
5.2 Stability
References
Sojourn Time in a Markov Driven Fluid Queue with Finite Buffer
1 Model and Problem Statement
1.1 The Finite Buffer Model
1.2 The Stationary Distribution of the Buffer Content at Any Time
2 Stationary Distribution at Arrival Time
2.1 New Clock Principle
2.2 Regenerative Approach for the Process with New Clock
3 Time to Leave the Buffer
4 Numerical Illustration
5 Conclusion
References
Performance Analysis of Multi-server Queueing Systems with Batch Services and Setup Times
1 Introduction
2 Model and Markov Chain
2.1 Model Description
2.2 Markov Chain
3 Analysis
4 Numerical Examples and Simulation
4.1 Effect of the Setup Time Distribution
4.2 Effect of the Batching Policy
4.3 Effect of the Capacity
5 Conclusions
References
On a Stochastic Epidemic Model with Limited Number of Hospital Beds
1 Introduction
1.1 An Epidemic Model in a Resource-Limited Environment
1.2 Related Literature
1.3 Organization of the Paper
2 The Epidemic Model as a Finite QBD Process
3 The Time While the Hospital Ward Is Funtionally Full
3.1 The Discrete Contribution of (0,1,1)(C)
3.2 The Continuous Contribution of (0,1,1)(C)
4 Numerical Work
5 Discussion and Conclusions
References
Pricing Models for Digital Renting Platforms
1 Introduction
1.1 Contributions
1.2 System Model
1.3 Global Optimum
2 Non Cooperative Game
2.1 Characterizing the Nash Equilibrium
2.2 An Iterative Pricing Scheme
2.3 Stackelberg Pricing
3 Cooperative Pricing
3.1 Case a
3.2 Case B
3.3 Revenue Division and Shapley Value
4 Quality of Service/Experience
4.1 Maximizing the Renter's Utility
4.2 Case 1: c=f
4.3 Case 2: c
5 Conclusion and Future Directions
References
Decision Analysis in Stochastic Sociocultural Systems
1 Introduction
2 Modeling Food Security in Gambella, Ethiopia
2.1 Model Implementation
3 Baseline Decision Analysis
3.1 Optimal Course of Action
4 Sensitivity Analysis for Uncertainty Quantification
4.1 Standard Tornado Analysis
4.2 Generalized Tornado Analysis
4.3 Expected Value of Perfect Information
5 Conclusions and Future Work
References
EPEW 2023
Evaluating the Performance Impact of No-Wait Approach to Resolving Write Conflicts in Databases
1 Introduction
1.1 Related Literature
2 Conflict Model
3 Queueing Model
4 Numerical and Simulation Experiments
5 Conclusions
References
Stochastic Matching Model with Returning Items
1 Introduction
2 Notation and Assumptions
3 The Stop Protocol
4 Product Form for the Steady State Distribution
5 Several Types of Item and Networks
6 Matching Graph IS1 -3muG
7 Conclusions and Remarks
References
Construction of Phase Type Distributions by Bernstein Exponentials
1 Introduction
2 Bernstein Polynomials
2.1 Properties of Bernstein Polynomials
2.2 Drawback of Bernstein Polynomials
3 Bernstein Exponentials
3.1 Properties Bernstein Exponentials
4 M/PH/1 Queue with BE Service Time
5 Application
6 Conclusions
References
Bayesian Networks as Approximations of Biochemical Networks
1 Introduction
2 Problem Setting
2.1 ODE Based Continuous-Valued Deterministic Models
2.2 Discrete-Valued Probabilistic Models
2.3 Probabilistic Approximation of ODE Based Models
3 Construction of the Probabilistic Approximation
3.1 Computation of the BN Model
3.2 Structure of the Bayesian Network
3.3 Time and Space Discretization Discussion
4 Application to Biochemical Networks
4.1 The Enzyme Catalyzed Reaction
4.2 The EGF-NGF Model
5 Conclusions and Future Work
References
Performance of Genetic Algorithms in the Context of Software Model Refactoring
1 Introduction
2 Related Work
3 Algorithms
4 Case Study
5 Results
5.1 RQ1: How Do NSGAII, SPEA2, and PESA2 Compare in Terms of Execution Time?
5.2 RQ2: How Do NSGAII, SPEA2, and PESA2 Compare in Terms of Memory Usage?
5.3 RQ3: How Do NSGAII, SPEA2, and PESA2 Compare in Terms of Multi-objective Optimization Indicators?
6 Lesson Learned
7 Threats to Validity
8 Conclusion
References
An Approach Using Performance Models for Supporting Energy Analysis of Software Systems
1 Introduction
2 Background
2.1 Software Energy Measurement
2.2 Layered Queuing Network
3 Our Approach
4 Evaluation
5 Threats to Validity
6 Related Work
7 Conclusions
References
An Implementation Study of the Impact of Batching on Replication Protocols Performance
1 Introduction
2 System Description
3 Clients Connecting only to Leader
3.1 Stability Conditions
3.2 Summary
3.3 Experimental Results
4 Clients Connect to All Servers
4.1 Stability Conditions
4.2 Experimental Results
5 Discussion
6 Conclusion
References
Workflow Characterization of a Big Data System Model for Healthcare Through Multiformalism
1 Introduction
2 Related Work
2.1 Synthetic Generators
2.2 Workflow Characterization by Multiformalism
3 MIMIC-III
3.1 Design Decisions
3.2 Stages of Interaction with the Hospital
3.3 Classification
3.4 Distribution Fitting
4 Development of the Generator
4.1 Configuration Module
4.2 Classification Module
4.3 Generation Module
5 Experimental Evaluation
6 Conclusions
References
MONCHi: MONitoring for Cloud-native Hyperconnected Islands
1 Introduction
2 Background
3 Design of the Solution
3.1 Implementation
4 Practical Validation
4.1 Performance Tests
4.2 Compatibility with Traditional Metrics
5 Conclusions
References
A Quantitative Approach to Coordinated Scaling of Resources in Complex Cloud Computing Workflows
1 Introduction
2 Background: Workflow Modeling and Evaluation
3 Coordinated Resource Scaling Heuristics
3.1 Heuristics Overview
3.2 Scaling Decisions
4 Experimental Evaluation
4.1 Heuristics Sensitivity to Parameter
4.2 Heuristics Ability to Achieve SLO Guarantees
5 Conclusions
References
A State-Size Inclusive Approach to Optimizing Stream Processing Applications
1 Introduction
2 Background and Related Work
2.1 Evaluate the Impact of System Resources on Operator Throughput
2.2 Evaluating the Impact of Window Selectivity Across Various Deployments
3 System Design
3.1 Nexmark Workload
3.2 Nexmark Query 3
3.3 Nexmark Query 5
4 Experimental Setup
4.1 Experiment One (State Size Impact on Capacity Using NexMark Query 5)
4.2 Experiment Two (State Size Impact on Capacity Using NexMark Query 3)
4.3 Experiment Three (Relationship Between Parameters of Streaming Window and State Accumulation)
5 Results
6 Conclusion and Future Work
References
Execution Time Prediction Model that Considers Dynamic Allocation of Spark Executors
1 Introduction
2 Apache Spark Architecture
2.1 Dynamic Allocation
3 Background β An Existing Static Allocation Model (SAM)
4 Proposed Model β The Dynamic Allocation Model (DAM)
5 Result and Analysis
5.1 Model Validation Using a Big Data Query Query-52 and K-Means
6 Related Work
7 Conclusion and Future Work
References
Exploiting Structural Dependency Relations for Efficient Agent Based Model Simulation
1 Introduction
2 Extended Stochastic Symmetric Net Formalism
3 Optimizing ABMs Simulation Times by Exploiting Net Structure Properties
4 Structural Relations Derived from the SSN Model
5 Results
6 Conclusions
References
Stability Analysis and Simulation of a Cellular Network with Retransmissions Policy
1 Introduction
1.1 Related Work
2 System Model
3 Stability Analysis
4 Simulation Results
5 Further Development and Concluding Remarks
6 Conclusion
References
Performance Evaluation of Global Trust Management in MANETs Routing Protocols
1 Introduction
1.1 Classification of MANET Routing Protocols
1.2 Applications and Uses of Mobile Ad-hoc Networks (MANETs)
1.3 Ad-hoc On-Demand Distance Vector (AODV) Protocol
2 Trust Management Mechanisms and Related Work
3 Vulnerabilities and Security Issues in MANETs
4 Proposed Global Trust Management Mechanisms for AODV Protocol
4.1 Global Trust and Overview of Proposed Protocol
4.2 Proposed Global Trust Mechanism in the AODV Protocol
4.3 Calculating a Node's rnu using Direct Observations (dt_rnui)
4.4 Calculating a Node's rnu using Indirect Observations (it_rnui)
4.5 Calculating a Node's rnu Using Global Trust Observations (gt_rnui)
4.6 Integration of Global Trust in the AODV Protocol
5 Performance Evaluation of AODV and GTAODV in the Presence of a Black Hole Attack
5.1 Experimental Set-Up and Performance Metrics
5.2 Evaluation of Packet Delivery Ratio and Throughput When Varying the Number of Malicious Nodes
5.3 Evaluation of End-to-End Delay and Routing Overheads When Varying the Number of Malicious Nodes
6 Conclusion
References
Author Index
π SIMILAR VOLUMES
<span>The idea to establish a European forum for academic and industrial researchers working on various aspects of performance modeling and analysis of manuf- toring and information systems gave rise to an annual series of workshops, - ferred to as European Performance Engineering Workshop (EPEW). T
<p>This book constitutes the refereed proceedings of the 14th EuropeanWorkshop on Computer Performance Engineering, EPEW 2017, held in Berlin,Germany, in September 2017.<br/>The 18 papers presented together with the abstracts of two invited talks in this volume were carefully reviewed and selected f
<span>The book is a collection of best selected research papers presented at the Fourth International Conference on Communication, Devices and Computing (ICCDC 2023). The book covers new ideas, applications and experiences of research engineers, scientists, industrialists, scholars and students from
<p><span>This volume LNCS 14396 constitutes the refereed proceedings of the 12th International Conference, MEDI 2023,in November 2023 ,held in Sousse, Tunisia.</span></p><p><span>The 27 full papers were carefully peer reviewed and selected from 99 submissions. </span></p><p><span>The Annual Internat
<span>This volume contains the proceedings of two international workshops EPEW and WS-FM held atthe UniversitΒ΄ ede VersaillesSaint-Quentin-en-Yvelines, V- sailles, France, 1-3 September 2005. EPEW (European Performance Engineering Workshop) and WS-FM (Int- national Workshop on Web Services and Forma