Software has been evolving from pre-defined, monolithic, centralized architectures to decentralized, distributed, dynamically composed federations of components whose goal is to provide useful services. Software processes have been evolving along similar lines, from pre-specified sequential work- flows to decentralized and multi-organization endeavors. The organizations to which software solutions are targeted have also been evolving from highly structured to agile and networked enterprises. All this is affecting the way software is engineered (i.e., conceived, architected, and produced).Software applications increasingly live in an open world: They are embedded in dynamically evolvable environments and must adapt to continuous and even unpredictable change. Accordingly, software architectures need to evolve dynamically and must support reconfiguration and self-organizing features to respond to change requirements. Programming languages and their underlying support infrastructure, in turn, must provide specific features to support this level of dynamism. The traditional approaches followed to ensure software quality, which focus exclusively on pre-runtime validation, are inadequate in this new context. Continuous validation becomes necessary: validation must extend to after the system is deployed and running.The talk surveys the main architectural styles that support dynamic software compositions, the language and infrastructure requirements, and provides a view of the validation process for dynamically evolvable software systems.
{"title":"The challenges of open-world software","authors":"C. Ghezzi","doi":"10.1145/1216993.1216995","DOIUrl":"https://doi.org/10.1145/1216993.1216995","url":null,"abstract":"Software has been evolving from pre-defined, monolithic, centralized architectures to decentralized, distributed, dynamically composed federations of components whose goal is to provide useful services. Software processes have been evolving along similar lines, from pre-specified sequential work- flows to decentralized and multi-organization endeavors. The organizations to which software solutions are targeted have also been evolving from highly structured to agile and networked enterprises. All this is affecting the way software is engineered (i.e., conceived, architected, and produced).Software applications increasingly live in an open world: They are embedded in dynamically evolvable environments and must adapt to continuous and even unpredictable change. Accordingly, software architectures need to evolve dynamically and must support reconfiguration and self-organizing features to respond to change requirements. Programming languages and their underlying support infrastructure, in turn, must provide specific features to support this level of dynamism. The traditional approaches followed to ensure software quality, which focus exclusively on pre-runtime validation, are inadequate in this new context. Continuous validation becomes necessary: validation must extend to after the system is deployed and running.The talk surveys the main architectural styles that support dynamic software compositions, the language and infrastructure requirements, and provides a view of the validation process for dynamically evolvable software systems.","PeriodicalId":235512,"journal":{"name":"Workshop on Software and Performance","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128773213","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
D. Petriu, C. Woodside, D. Petriu, Jing Xu, Toqeer Israr, Geri Georg, R. France, J. Bieman, S. Houmb, J. Jürjens
The focus of the paper is on the analysis of performance effects of different security solutions modeled as aspects in UML. Aspect oriented modeling (AOM) allows software designers to isolate and separately address solutions for crosscutting concerns, which are defined as distinct UML aspect models, then are composed with the primary UML model of the system under development. For performance analysis we use techniques developed previously in the PUMA project, which take as input UML models annotated with the standard UML Profile for Schedulability, Performance and Time (SPT), and transform them first into Core Scenario Model (CSM) and then into different performance models. The contribution of this paper is in performing the composition of the aspects with the primary model at the CSM level. The input is represented by the primary model and a number of aspect models in UML+SPT, which are processed as follows: a) converted separately to CSM; b) composed into a single CSM model; c) transformed into a Layered Queueing Networks (LQN) model and d) analyzed. The proposed approach is illustrated with a case study based on two standards, TPC-W and SSL.
{"title":"Performance analysis of security aspects in UML models","authors":"D. Petriu, C. Woodside, D. Petriu, Jing Xu, Toqeer Israr, Geri Georg, R. France, J. Bieman, S. Houmb, J. Jürjens","doi":"10.1145/1216993.1217010","DOIUrl":"https://doi.org/10.1145/1216993.1217010","url":null,"abstract":"The focus of the paper is on the analysis of performance effects of different security solutions modeled as aspects in UML. Aspect oriented modeling (AOM) allows software designers to isolate and separately address solutions for crosscutting concerns, which are defined as distinct UML aspect models, then are composed with the primary UML model of the system under development. For performance analysis we use techniques developed previously in the PUMA project, which take as input UML models annotated with the standard UML Profile for Schedulability, Performance and Time (SPT), and transform them first into Core Scenario Model (CSM) and then into different performance models. The contribution of this paper is in performing the composition of the aspects with the primary model at the CSM level. The input is represented by the primary model and a number of aspect models in UML+SPT, which are processed as follows: a) converted separately to CSM; b) composed into a single CSM model; c) transformed into a Layered Queueing Networks (LQN) model and d) analyzed. The proposed approach is illustrated with a case study based on two standards, TPC-W and SSL.","PeriodicalId":235512,"journal":{"name":"Workshop on Software and Performance","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126899430","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Replication is a technique used in distributed systems to improve performance, availability, and reliability. In replication schemes, often a J out of $N$ voting pattern (also called quorum) is used in which the quorum waits for J replies to arrive. Integrating a quorum scheme into the Layered Queueing Network (LQN) performance modeling language necessitates the computation of the quorum response time as the Jth order statistic. To do so, we need the exact (or an accurate estimation of the) time distribution of individual replies. This distribution was estimated in previous work but only for the special case of (J=N) and yields large errors for J « N. This paper presents a new analytic approach for the derivation of the distributions. Under a number of assumptions, we derive closed form expressions for the probability distribution functions of the replies. The application of our new approach on a number of LQN models shows that, even for models that violate those assumptions, it is far more accurate than previous approaches and it yields an error less than 10% for most example models.
复制是一种在分布式系统中用于提高性能、可用性和可靠性的技术。在复制方案中，通常使用J out of $N$投票模式(也称为quorum)，其中quorum等待J个应答到达。将仲裁方案集成到分层排队网络(LQN)性能建模语言中，需要计算仲裁响应时间作为第j阶统计量。要做到这一点，我们需要准确(或准确估计)每个回复的时间分布。这种分布在以前的工作中估计过，但只适用于(J=N)的特殊情况，并且对J«N产生很大的误差。本文提出了一种新的分析方法来推导分布。在若干假设条件下，我们导出了回答的概率分布函数的封闭形式表达式。我们的新方法在许多LQN模型上的应用表明，即使对于违反这些假设的模型，它也比以前的方法准确得多，并且对大多数示例模型产生的误差小于10%。
{"title":"Deriving distribution of thread service time in layered queueing networks","authors":"T. Omari, Salem Derisavi, G. Franks","doi":"10.1145/1216993.1217007","DOIUrl":"https://doi.org/10.1145/1216993.1217007","url":null,"abstract":"Replication is a technique used in distributed systems to improve performance, availability, and reliability. In replication schemes, often a J out of $N$ voting pattern (also called quorum) is used in which the quorum waits for J replies to arrive. Integrating a quorum scheme into the Layered Queueing Network (LQN) performance modeling language necessitates the computation of the quorum response time as the Jth order statistic. To do so, we need the exact (or an accurate estimation of the) time distribution of individual replies. This distribution was estimated in previous work but only for the special case of (J=N) and yields large errors for J « N. This paper presents a new analytic approach for the derivation of the distributions. Under a number of assumptions, we derive closed form expressions for the probability distribution functions of the replies. The application of our new approach on a number of LQN models shows that, even for models that violate those assumptions, it is far more accurate than previous approaches and it yields an error less than 10% for most example models.","PeriodicalId":235512,"journal":{"name":"Workshop on Software and Performance","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121154537","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
One aim of component-based software engineering (CBSE) is to enable the prediction of extra-functional properties, such as performance and reliability, utilising a well-defined composition theory. Nowadays, such theories and their accompanying prediction methods are still in a maturation stage. Several factors influencing extra-functional properties need additional research to be understood. A special problem in CBSE stems from its specific development process: Software components should be specified and implemented independent from their later context to enable reuse. Thus, extra-functional properties of components need to be specified in a parametric way to take different influence factors like the hardware platform or the usage profile into account. In our approach, we use the Palladio Component Model (PCM) to specify component-based software architectures in a parametric way. This model offers direct support of the CBSE development process by dividing the model creation among the developer roles. In this paper, we present our model and a simulation tool based on it, which is capable of making performance predictions. Within a case study, we show that the resulting prediction accuracy can be sufficient to support the evaluation of architectural design decisions.
{"title":"Model-Based performance prediction with the palladio component model","authors":"Steffen Becker, H. Koziolek, Ralf H. Reussner","doi":"10.1145/1216993.1217006","DOIUrl":"https://doi.org/10.1145/1216993.1217006","url":null,"abstract":"One aim of component-based software engineering (CBSE) is to enable the prediction of extra-functional properties, such as performance and reliability, utilising a well-defined composition theory. Nowadays, such theories and their accompanying prediction methods are still in a maturation stage. Several factors influencing extra-functional properties need additional research to be understood. A special problem in CBSE stems from its specific development process: Software components should be specified and implemented independent from their later context to enable reuse. Thus, extra-functional properties of components need to be specified in a parametric way to take different influence factors like the hardware platform or the usage profile into account. In our approach, we use the Palladio Component Model (PCM) to specify component-based software architectures in a parametric way. This model offers direct support of the CBSE development process by dividing the model creation among the developer roles. In this paper, we present our model and a simulation tool based on it, which is capable of making performance predictions. Within a case study, we show that the resulting prediction accuracy can be sufficient to support the evaluation of architectural design decisions.","PeriodicalId":235512,"journal":{"name":"Workshop on Software and Performance","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133178673","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Meeting QoS objectives of applications while maintaining high system utilization is a challenging task in multi-institutional Grids. In this paper, we effectively engineer Grid applications and resource management middleware for achieving user satisfaction and high resource utilizations. The paper presents a complete framework based on advance reservations (ARs) for resource management in Grids. The framework is capable of providing QoS guarantees to applications while maintaining high resource utilizations. The paper focuses on the scheduling component of the framework and presents a novel heuristic-based algorithm, Grid Scheduling with Deadlines (GSD), for an NP-Complete problem of scheduling ARs with laxities on a shared resource. GSD can be configured with the help of pluggable strategies to adapt to various workload conditions and needs of the system. The paper studies with the aid of an extensive set of experiments the effect of various workload and system parameters on system performance. It is not always possible to accurately predict the runtimes of the jobs. The paper discusses the impact of error in user-estimated runtimes on system performance and investigates strategies to avoid substandard performance resulting from such inaccuracies. Experimental results demonstrate the efficacy of our methodology.
{"title":"Engineering grid applications and middleware for high performance","authors":"U. Farooq, S. Majumdar, E. Parsons","doi":"10.1145/1216993.1217019","DOIUrl":"https://doi.org/10.1145/1216993.1217019","url":null,"abstract":"Meeting QoS objectives of applications while maintaining high system utilization is a challenging task in multi-institutional Grids. In this paper, we effectively engineer Grid applications and resource management middleware for achieving user satisfaction and high resource utilizations. The paper presents a complete framework based on advance reservations (ARs) for resource management in Grids. The framework is capable of providing QoS guarantees to applications while maintaining high resource utilizations. The paper focuses on the scheduling component of the framework and presents a novel heuristic-based algorithm, Grid Scheduling with Deadlines (GSD), for an NP-Complete problem of scheduling ARs with laxities on a shared resource. GSD can be configured with the help of pluggable strategies to adapt to various workload conditions and needs of the system. The paper studies with the aid of an extensive set of experiments the effect of various workload and system parameters on system performance. It is not always possible to accurately predict the runtimes of the jobs. The paper discusses the impact of error in user-estimated runtimes on system performance and investigates strategies to avoid substandard performance resulting from such inaccuracies. Experimental results demonstrate the efficacy of our methodology.","PeriodicalId":235512,"journal":{"name":"Workshop on Software and Performance","volume":"149 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115545925","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Dynamic reconfiguration techniques appear promising to build component-based (C-B) systems for application domains that have strong adaptability requirements, like the mobile and the service-oriented computing domains. However, introducing dynamic reconfiguration features into a C-B application makes even more challenging the design and verification of functional and non functional requirements. Our goal is to support the model-based analysis of the effectiveness of reconfigurable C-B applications, with a focus on the assessment of the non-functional performance and reliability attributes. As a first step towards this end, we address the issue of selecting suitable analysis models for reconfigurable systems, suggesting to this end the use of joint performance and reliability (performability) models. Furthermore, we propose a model-driven approach to automatically transform a design model into an analysis model. For this purpose, we build on the existence of intermediate languages that have been proposed to facilitate this transformation and we extend one of them, to capture the core features (from a performance/reliability viewpoint) of a dynamically reconfigurable C-B system. Finally, we illustrate by a simple application example the main steps of the proposed approach.
{"title":"A model-driven approach to performability analysis of dynamically reconfigurable component-based systems","authors":"V. Grassi, R. Mirandola, A. Sabetta","doi":"10.1145/1216993.1217011","DOIUrl":"https://doi.org/10.1145/1216993.1217011","url":null,"abstract":"Dynamic reconfiguration techniques appear promising to build component-based (C-B) systems for application domains that have strong adaptability requirements, like the mobile and the service-oriented computing domains. However, introducing dynamic reconfiguration features into a C-B application makes even more challenging the design and verification of functional and non functional requirements. Our goal is to support the model-based analysis of the effectiveness of reconfigurable C-B applications, with a focus on the assessment of the non-functional performance and reliability attributes. As a first step towards this end, we address the issue of selecting suitable analysis models for reconfigurable systems, suggesting to this end the use of joint performance and reliability (performability) models. Furthermore, we propose a model-driven approach to automatically transform a design model into an analysis model. For this purpose, we build on the existence of intermediate languages that have been proposed to facilitate this transformation and we extend one of them, to capture the core features (from a performance/reliability viewpoint) of a dynamically reconfigurable C-B system. Finally, we illustrate by a simple application example the main steps of the proposed approach.","PeriodicalId":235512,"journal":{"name":"Workshop on Software and Performance","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121573606","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Software Performance Engineering (SPE) methods have been in use for over two decades as an approach to manage the risks of developing systems that fail to satisfy their performance requirements. In general, SPE advocates the use of performance oriented design principles to guide design decisions and predictive performance models to assess the performance impact of design alternatives. SPE methods have been used successfully to identify and overcome system design blunders early in the Information Technology (IT) project lifecycle before the blunders are built into a system and become expensive and time consuming to correct. While the methods have been used successfully in some IT project domains, they are not widely applied in the important domain of Enterprise Application (EA) systems. This experience paper considers the reasons for this and explores the role of SPE as new EA platform and data centre technologies become available.We find that many risks traditionally addressed by SPE have been mitigated by the nature of existing EA platforms, the nature of today's IT projects for EA, and an attention to business process modeling. Furthermore, the design and implementation of future EA systems will see some performance risks reduced even further by new EA and IT system management platforms for Next Generation Data Centres. However, we expect that the nature of EA systems to be built is becoming more complex. As a result some familiar performance risks will re-emerge along with new runtime risks. We believe that SPE methods can help to mitigate such risks and describe research challenges that must be addressed to make this a reality.
{"title":"Performance engineering for EA systems in next generation data centresPerformance engineering for EA systems in next generation data centres","authors":"J. Rolia, L. Cherkasova, R. Friedrich","doi":"10.1145/1216993.1217004","DOIUrl":"https://doi.org/10.1145/1216993.1217004","url":null,"abstract":"Software Performance Engineering (SPE) methods have been in use for over two decades as an approach to manage the risks of developing systems that fail to satisfy their performance requirements. In general, SPE advocates the use of performance oriented design principles to guide design decisions and predictive performance models to assess the performance impact of design alternatives. SPE methods have been used successfully to identify and overcome system design blunders early in the Information Technology (IT) project lifecycle before the blunders are built into a system and become expensive and time consuming to correct. While the methods have been used successfully in some IT project domains, they are not widely applied in the important domain of Enterprise Application (EA) systems. This experience paper considers the reasons for this and explores the role of SPE as new EA platform and data centre technologies become available.We find that many risks traditionally addressed by SPE have been mitigated by the nature of existing EA platforms, the nature of today's IT projects for EA, and an attention to business process modeling. Furthermore, the design and implementation of future EA systems will see some performance risks reduced even further by new EA and IT system management platforms for Next Generation Data Centres. However, we expect that the nature of EA systems to be built is becoming more complex. As a result some familiar performance risks will re-emerge along with new runtime risks. We believe that SPE methods can help to mitigate such risks and describe research challenges that must be addressed to make this a reality.","PeriodicalId":235512,"journal":{"name":"Workshop on Software and Performance","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122795020","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Mobile agents have arisen as an interesting paradigm to build distributed applications, due to the unparalleled advantages they offer. However, along with the advantages they also present new challenges. One of the most relevant is that it is not easy to ensure efficient communication among agents that move continually from one computer to another.In this paper, we apply SPE techniques to model and analyze, how a mobile agent tracking approach addresses the highly dynamic movement problem in a distributed computing environment.
{"title":"Performance analysis of mobile agents tracking","authors":"Elena Gómez-Martínez, S. Ilarri, J. Merseguer","doi":"10.1145/1216993.1217024","DOIUrl":"https://doi.org/10.1145/1216993.1217024","url":null,"abstract":"Mobile agents have arisen as an interesting paradigm to build distributed applications, due to the unparalleled advantages they offer. However, along with the advantages they also present new challenges. One of the most relevant is that it is not easy to ensure efficient communication among agents that move continually from one computer to another.In this paper, we apply SPE techniques to model and analyze, how a mobile agent tracking approach addresses the highly dynamic movement problem in a distributed computing environment.","PeriodicalId":235512,"journal":{"name":"Workshop on Software and Performance","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129726235","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, we propose a new approach for mitigation of worm propagation through tactical Mobile Ad-Hoc Networks (MANETs) which is based upon performance signatures and software rejuvenation. Three application performance signature and software rejuvenation algorithms are proposed and analyzed. These algorithms monitor critical applications' responsiveness and trigger actions for software rejuvenation when host resources degrade due to a co-resident worm competing for host resources. We analyze the effectiveness of our algorithms through analytic modeling and detailed, extensive simulation studies. The key performance metrics investigated are application response time, mean time between rejuvenations and the steady state probability of host infection. We also use simulation models to investigate several design and parameter tuning issues. We investigate the relationship between the rate at which the application performance monitors can detect out-of-specification applications and the rate of worm propagation in the network.
{"title":"Using performance signatures and software rejuvenation for worm mitigation in tactical MANETs","authors":"Alberto Avritzer, R. Cole, E. Weyuker","doi":"10.1145/1216993.1217023","DOIUrl":"https://doi.org/10.1145/1216993.1217023","url":null,"abstract":"In this paper, we propose a new approach for mitigation of worm propagation through tactical Mobile Ad-Hoc Networks (MANETs) which is based upon performance signatures and software rejuvenation. Three application performance signature and software rejuvenation algorithms are proposed and analyzed. These algorithms monitor critical applications' responsiveness and trigger actions for software rejuvenation when host resources degrade due to a co-resident worm competing for host resources. We analyze the effectiveness of our algorithms through analytic modeling and detailed, extensive simulation studies. The key performance metrics investigated are application response time, mean time between rejuvenations and the steady state probability of host infection. We also use simulation models to investigate several design and parameter tuning issues. We investigate the relationship between the rate at which the application performance monitors can detect out-of-specification applications and the rate of worm propagation in the network.","PeriodicalId":235512,"journal":{"name":"Workshop on Software and Performance","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129107276","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
When designing and evaluating software architectures and network facilities for hosting demanding distributed applications, taking performance considerations into account is essential. A key factor in assessing the performance of such a distributed system is the network latency and its relation to the application behaviour. In this respect, it is important to include the performance impact of the network into the performance models used during the entire design cycle of the system.A framework is proposed that allows to model both the software and the network components separately and extracts a single set of performance estimates for the entire system. This has the advantage of allowing the network and software aspects to be modeled separately using the modeling languages and tools most suited to those system aspects. A case study is presented to illustrate the use of the framework and its usefulness in predicting system performance.
{"title":"Hybrid performance modeling approach for network intensive distributed software","authors":"Tom Verdickt, B. Dhoedt, F. Turck, P. Demeester","doi":"10.1145/1216993.1217026","DOIUrl":"https://doi.org/10.1145/1216993.1217026","url":null,"abstract":"When designing and evaluating software architectures and network facilities for hosting demanding distributed applications, taking performance considerations into account is essential. A key factor in assessing the performance of such a distributed system is the network latency and its relation to the application behaviour. In this respect, it is important to include the performance impact of the network into the performance models used during the entire design cycle of the system.A framework is proposed that allows to model both the software and the network components separately and extracts a single set of performance estimates for the entire system. This has the advantage of allowing the network and software aspects to be modeled separately using the modeling languages and tools most suited to those system aspects. A case study is presented to illustrate the use of the framework and its usefulness in predicting system performance.","PeriodicalId":235512,"journal":{"name":"Workshop on Software and Performance","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132789897","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：