{"title":"Controlled dynamic performance analysis","authors":"S. Reiss","doi":"10.1145/1383559.1383566","DOIUrl":"https://doi.org/10.1145/1383559.1383566","url":null,"abstract":"We are interested in obtaining detailed performance information on-the-fly from long-running systems without adversely affecting the performance of the systems. We have developed a methodology consisting of a framework, DYPER, and a number of specialized agents called proflets each of which analyzes a different performance aspect. DYPER gathers performance information with a guaranteed maximum overhead that is dynamically settable by the programmer using priorities set by the proflets. Moreover, the type of information that the system can provide is generally only available for tools that generally have too much overhead to be usable in production or long-running systems. DYPER includes the ability to control and display performance data as the program is run.","PeriodicalId":235512,"journal":{"name":"Workshop on Software and Performance","volume":"2001 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128275414","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}
J. Happe, Holger Friedrich, Steffen Becker, Ralf H. Reussner
{"title":"A pattern-based performance completion for Message-oriented Middleware","authors":"J. Happe, Holger Friedrich, Steffen Becker, Ralf H. Reussner","doi":"10.1145/1383559.1383581","DOIUrl":"https://doi.org/10.1145/1383559.1383581","url":null,"abstract":"Details about the underlying Message-oriented Middleware (MOM) are essential for accurate performance predictions of software systems using message-based communication. The MOM's configuration and usage strongly influence its throughput, resource utilisation and timing behaviour. Prediction models need to reflect these effects and allow software architects to evaluate the performance influence of MOM configured for their needs. Performance completions [31, 32] provide the general concept to include low-level details of execution environments in abstract performance models. In this paper, we extend the Palladio Component Model (PCM) [4] by a performance completion for Message-oriented Middleware. With our extension to the model, software architects can specify and configure message-based communication using a language based on messaging patterns. For performance evaluation, a model-to-model transformation integrates the low-level details of a MOM into the high-level software architecture model. A case study based on the SPECjms2007 Benchmark [1] predicts the performance of message-based communication with an error less than 20%.","PeriodicalId":235512,"journal":{"name":"Workshop on Software and Performance","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128703041","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}
{"title":"Towards automatic derivation of a product performance model from a UML software product line model","authors":"Rasha Tawhid, D. Petriu","doi":"10.1145/1383559.1383571","DOIUrl":"https://doi.org/10.1145/1383559.1383571","url":null,"abstract":"Software Product Line (SPL) engineering is a software development approach that takes advantage of the commonality and variability between products from a family, and supports the generation of specific products by reusing a set of core family assets. This paper proposes a UML model transformation approach for software product lines to derive a performance model for a specific product. The input to the proposed technique, the \"source model\", is a UML model of a SPL with performance annotations, which uses two separate profiles: a \"product line\" profile from literature for specifying the commonality and variability between products, and the MARTE profile recently standardized by OMG for performance annotations. The source model is generic and therefore its performance annotations must be parameterized. The proposed derivation of a performance model for a concrete product requires two steps: a) the transformation of a SPL model to a UML model with performance annotations for a given product, and b) the transformation of the outcome of the first step into a performance model. This paper focuses on the first step, whereas the second step will use the PUMA transformation approach of annotated UML models to performance models, developed in previous work. The output of the first step, named \"target model\", is a UML model with MARTE annotations, where the variability expressed in the SPL model has been analyzed and bound to a specific product, and the generic performance annotations have been bound to concrete values for the product. The proposed technique is illustrated with an e-commerce case study.","PeriodicalId":235512,"journal":{"name":"Workshop on Software and Performance","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126029554","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}
{"title":"Run-time software configuration for mobile devices using an evolutionary quantifiable deployment model","authors":"Jakob Sverre Lovstad, P. H. Hughes","doi":"10.1145/1383559.1383584","DOIUrl":"https://doi.org/10.1145/1383559.1383584","url":null,"abstract":"Current proposals for performance evaluation during development of computer systems rely on the capture of performance information from various software development models such as UML diagrams. The requirements for performance are taken into consideration at some point in the development process and evaluated using a performance model.\u0000 We propose an enhanced approach using a separate, quantifiable deployment model that evolves in step with system development. This helps keep performance requirements in focus from beginning to end of the life-cycle.\u0000 The system implemented to demonstrate this approach is a computer game for mobile devices that is configured dynamically for different target devices. The development process must provide for deferred, automatic performance testing and configuration of the application on a variety of devices, after the design and implementation stages are complete. The evolutionary deployment model, culminating in a run-time performance evaluation, is based on the Structure and Performance modelling paradigm SP.","PeriodicalId":235512,"journal":{"name":"Workshop on Software and Performance","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130407546","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}
{"title":"SciSim: a software performance estimation framework using source code instrumentation","authors":"Zhonglei Wang, Antonio Sánchez, A. Herkersdorf","doi":"10.1145/1383559.1383565","DOIUrl":"https://doi.org/10.1145/1383559.1383565","url":null,"abstract":"Recently, software performance estimation based on source code instrumentation shows promising results in the literature. It achieves significant speedup without compromising accuracy, compared with cycle-accurate simulations. However, much work still remains to be done to make this technique flexible and accurate enough to estimate software on complex processors. To the best of our knowledge, we are the first to propose ways to tackle microarchitecture related issues in the source code instrumentation approach. We perform static instruction scheduling for superscalar architectures at instrumentation time and combine instrumented code and microarchitecture simulators to model runtime interactions between software and microarchitecture. We have developed a new framework, SciSim, to provide a common infrastructure for the proposed approach. It is designed to be easily extendable and retargetable to different instruction set architectures and processors. Using SciSim SystemC modules may be automatically generated to integrate software into system-level simulation. We will present the applicability of SciSim in system-level design exploration of multiprocessor systems. At last, experiments with standard benchmarks are presented to validate the speed and accuracy of SciSim.","PeriodicalId":235512,"journal":{"name":"Workshop on Software and Performance","volume":"40 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130848986","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}
{"title":"Performance of resource management algorithms for \"Processable Bulk Data Transfer\" Tasks in Grid Environments","authors":"I. Ahmad, S. Majumdar","doi":"10.1145/1383559.1383583","DOIUrl":"https://doi.org/10.1145/1383559.1383583","url":null,"abstract":"Processable Bulk Data Transfer (PBDT) tasks are resource intensive concurrent tasks which involve transfer of a very large amount of data that has to be processed in some way before it can be used at a remote set of destination nodes called the sink nodes. A distributed computing environment, such as the Grid is a popular way to perform these tasks. Focusing on the execution of PBDT tasks in a Grid computing environment, this paper presents an efficient resource allocation mechanism. Due to the resource thirsty nature of these tasks, an efficient resource allocation is essential to perform these tasks while achieving satisfactory performance. The time-complexity of the resource allocation algorithm rises sharply as the available number of resources in the given Grid computing environment is increased making efficient resource allocation a challenge. To meet this challenge, this paper investigates the use of approximate algorithms for the resource allocation. The benefits obtained by using the reduced complexity of the algorithm are weighed against the increased costs incurred during the task execution (due to the inaccuracies in resource allocation introduced by the approximations). This paper describes a number of approximations and discusses under which circumstances such approximations are to be used. The techniques presented in this research can be extended to non-PBDT tasks and other distributed computing environments.","PeriodicalId":235512,"journal":{"name":"Workshop on Software and Performance","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128026981","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}
{"title":"Towards a library of composable models to estimate the performance of security solutions","authors":"V. Cortellessa, Catia Trubiani","doi":"10.1145/1383559.1383579","DOIUrl":"https://doi.org/10.1145/1383559.1383579","url":null,"abstract":"Complex distributed dependable systems, such as web-based applications that contain sensitive data and are exposed to many users, have to meet different, and sometimes conflicting, non functional requirements, such as security and performance requirements. A typical example of this trade-off is the performance degradation introduced in a system by the raising of security solutions. Several proposals have been made to estimate the performance of security methodologies, but they are often grounded to existing standards such as IPsec and SSL.\u0000 In this paper we tackle the problem from a model-based viewpoint: we introduce basic performance models for security mechanisms, which can be considered as building bricks to compose in order to model security services. To this goal, we introduce rules that drive the composition. Security service models can then be integrated with functional models of critical applications to estimate the performance of the adopted security solutions. We represent models as Generalized Stochastic Petri Nets (GSPNs).\u0000 This is a first step towards a Security Library containing composable performance models of security mechanisms and services and representing an instrument to support designers in decisions related to the security vs performance trade-off. We show how to use our models on an example of banking system.","PeriodicalId":235512,"journal":{"name":"Workshop on Software and Performance","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128788539","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}
{"title":"Exploring performance trade-offs of a JPEG decoder using the deepcompass framework","authors":"E. Bondarev, M. Chaudron, E. Kock","doi":"10.1145/1216993.1217020","DOIUrl":"https://doi.org/10.1145/1216993.1217020","url":null,"abstract":"Designing embedded systems for multiprocessor platforms requires early prediction and balancing of multiple system quality attributes. We present a design space exploration framework for component-based software systems that allows an architect to get insight into a space of possible design alternatives with further evaluation and comparison of these alternatives. The framework provides (a) tool-guided design of multiple alternatives of software and hardware architectures, (b) early design-time predictions of performance properties and identification of bottlenecks for each architectural alternative, and (c) evaluation of each alternative with respect to multi-objective trade-offs. The performance prediction technique employs modeling of individual components and composition of the models into a system model representing the system behaviour and resource usage. We illustrate the framework by a case study of a JPEG decoder application. For this system, we consider architectural alternatives, show their specification, and explore their trade-offs with respect to task latencies, resource utilization and system cost.","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":"129885321","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}
{"title":"A UML profile for dependability analysis of real-time embedded systems","authors":"Simona Bernardi, J. Merseguer","doi":"10.1145/1216993.1217012","DOIUrl":"https://doi.org/10.1145/1216993.1217012","url":null,"abstract":"In this paper, we aim at giving a contribution toward the definition of a UML profile supporting the dependability analysis of real-time and embedded systems (RTES) that conforms to the upcoming profile named \"Modeling and Analysis of Real-Time and Embedded Systems\" (MARTE), for which a Request For Proposal has been issued by the Object Management Group (OMG).A set of basic dependability and fault-tolerance concepts need to be included in the profile to support the dependability analysis of RTES. We have exploited the best practices, proposed in the literature, on extending UML with dependability modeling capabilities in order to draw up a check list of requirements to be used as guideline for the definition of a dependability analysis profile. The proposed profile is then applied to the UML design of a case study: a gas turbine control system.","PeriodicalId":235512,"journal":{"name":"Workshop on Software and Performance","volume":"68 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":"132368292","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}
{"title":"Modeling contention of sparse-matrix-vector multiplication (SMV) in three parallel programming paradigms","authors":"A. Sameh, T. El-Ghazawi, Y. Yesha","doi":"10.1145/1216993.1217003","DOIUrl":"https://doi.org/10.1145/1216993.1217003","url":null,"abstract":"We makes use of the LoPC model, which is inspired by both the LogP/PG and BSP models but accounts for contention for message processing resources in parallel programming models to derive a general estimate of execution cost. We carry out this cost estimate analysis for three dominate programming models: message passing, shared memory and distributed shared memory. We analyze a typical application SMV multiplication written in these programming models with irregular receiver-initiated synchronous communication. The LoPC estimate for this application is shown to be reasonably accurate when compared against measured values of runtime of actual empirical computations on an SGI O2000 multiprocessor machine.","PeriodicalId":235512,"journal":{"name":"Workshop on Software and Performance","volume":"64 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":"114805029","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}