PerformancePub Date : 2004-10-04DOI: 10.1109/MASCOT.2004.1348313
C. Bellettini, L. Capra
{"title":"A quotient graph for asymmetric distributed systems","authors":"C. Bellettini, L. Capra","doi":"10.1109/MASCOT.2004.1348313","DOIUrl":"https://doi.org/10.1109/MASCOT.2004.1348313","url":null,"abstract":"Most analysis techniques for discrete-event systems rely on building the system state-transition graphs. A known critical issue is represented by the state-space explosion. One way to face this problem is the exploitation of behavioral symmetries. Well-formed coloured Petri nets (WN) (thanks to their particular syntax) allow the automatic building of a quotient graph, called a symbolic reachability graph (SRG), able to exploit the structural symmetries of systems. The SRG reduction power vanishes when the modeled system evolves in an asymmetric way. Some proposals to enhance the SRG have been shown to be effective only when applied to nearly symmetric systems. A quotient graph, still relying on the WN formalism, is semi-formally introduced; it tries to exploit local symmetries, rather diffuse in real systems. The model of an asymmetric distributed algorithm is used as a running example, a preliminary benchmark for the technique being presented.","PeriodicalId":32394,"journal":{"name":"Performance","volume":"98 1","pages":"560-568"},"PeriodicalIF":0.0,"publicationDate":"2004-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85795585","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}
PerformancePub Date : 2004-10-04DOI: 10.1109/MASCOT.2004.1348305
Rogier P. J. Pinkers, P. Knijnenburg, M. Haneda, H. Wijshoff
{"title":"Statistical selection of compiler options","authors":"Rogier P. J. Pinkers, P. Knijnenburg, M. Haneda, H. Wijshoff","doi":"10.1109/MASCOT.2004.1348305","DOIUrl":"https://doi.org/10.1109/MASCOT.2004.1348305","url":null,"abstract":"Compilers have many switches or options that enable certain code optimizations. However, it is well known that the optimal set of options to be turned on is dependent on both the application and the target architecture. In many cases, standard settings, like -O3, produce suboptimal results due to negative interference of some of the options they contain. We propose an automatic iterative procedure to turn on or to turn off compiler options. This procedure is based on orthogonal arrays that are used for a statistical analysis of profile information to calculate the main effect of the options. We show that our approach outperforms -O3 of GCC on six SPEC benchmarks.","PeriodicalId":32394,"journal":{"name":"Performance","volume":"29 1","pages":"494-501"},"PeriodicalIF":0.0,"publicationDate":"2004-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76023207","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}
PerformancePub Date : 2004-10-04DOI: 10.1109/MASCOT.2004.1348303
Fujian Liu, Yanping Zhao, Wenguang Wang, D. Makaroff
{"title":"Database server workload characterization in an e-commerce environment","authors":"Fujian Liu, Yanping Zhao, Wenguang Wang, D. Makaroff","doi":"10.1109/MASCOT.2004.1348303","DOIUrl":"https://doi.org/10.1109/MASCOT.2004.1348303","url":null,"abstract":"In an e-commerce system, the database server performance is crucial. A dynamic cache is often used to reduce the load on the database server, which reduces the need for scalability. A good understanding of the workload characteristics of the database server in an e-commerce environment is important to the design, tuning, and capacity planning of the database server. We characterize the database server workloads in a benchmark e-commerce system. We focus on the response time, CPU utilization, the database page reference characteristics, and disk I/Os of the database server. We find that using a dynamic cache can substantially reduce the CPU utilization but not always the number of disk I/Os of the database server. In most cases, using a dynamic cache reduces the temporal locality in database page references, but to a smaller degree than that reported in file servers and Web proxies. Interestingly, in certain e-commerce workloads, using a dynamic cache results in better temporal locality.","PeriodicalId":32394,"journal":{"name":"Performance","volume":"6 1","pages":"475-483"},"PeriodicalIF":0.0,"publicationDate":"2004-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86974518","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}
PerformancePub Date : 2004-10-04DOI: 10.1109/MASCOT.2004.1348288
C. Margi, K. Obraczka
{"title":"Instrumenting network simulators for evaluating energy consumption in power-aware ad-hoc network protocols","authors":"C. Margi, K. Obraczka","doi":"10.1109/MASCOT.2004.1348288","DOIUrl":"https://doi.org/10.1109/MASCOT.2004.1348288","url":null,"abstract":"In this paper, we describe our work on instrumenting network simulators to enable them to adequately and accurately account for the energy consumed by ad hoc network protocols' communication-related tasks. This is accomplished by explicitly accounting for low-power radio modes and considering the different energy costs associated with each possible radio state, i.e, transmitting, receiving, overhearing, idle, sensing, and sleeping. Our energy consumption instrumentation also allows the energy accounting to be done automatically by the simulator irrespective of what layer of the stack the protocol designer is working. To validate our model, we compare: (1) simulation results using the GloMoSim/QualNet simulation platform with and without our instrumentation for the IEEE 802.11 DCF; (2) analytical results for both 802.11 and S-MAC (a power-aware MAC designed for sensor networks); and (3) simulation results reproducing testbed experiments obtained for the S-MAC protocol. Finally, by comparing S-MAC against 802.11 and AODV against DSR, we showcase the ability of a network simulation platform instrumented with our energy consumption model to evaluate energy consumption in ad-hoc network protocols.","PeriodicalId":32394,"journal":{"name":"Performance","volume":"14 1","pages":"337-346"},"PeriodicalIF":0.0,"publicationDate":"2004-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87106811","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}
PerformancePub Date : 2004-10-04DOI: 10.1109/MASCOT.2004.1348179
Dong Lu, Huanyuan Sheng, P. Dinda
{"title":"Size-based scheduling policies with inaccurate scheduling information","authors":"Dong Lu, Huanyuan Sheng, P. Dinda","doi":"10.1109/MASCOT.2004.1348179","DOIUrl":"https://doi.org/10.1109/MASCOT.2004.1348179","url":null,"abstract":"Size-based scheduling policies, such as shortest remaining processing time (SRPT), have been studied since the 1960s and have been applied in various areas, including packet networks and Web server scheduling. SRPT has been proven to be optimal in the sense that it yields - compared to any other conceivable strategy - the smallest mean value of occupancy and therefore also of waiting and delay time. One important prerequisite to applying size-based scheduling is to know the sizes of all jobs in advance, which are unfortunately not always available. No work has been done to study the performance of size-based scheduling policies when only inaccurate scheduling information is available. We study the performance of SRPT and fair sojourn protocol (FSP) as a function of the correlation coefficient between the actual job sizes and estimated job sizes. We have developed a simulator that supports both M/G/l/m and G/G/n/m queuing models. The simulator can be driven by trace data or synthetic data produced by a workload generator we have developed that allows us to control the correlation. The simulations show that the degree of correlation has a dramatic effect on the performance of SRPT and FSP, and that a reasonably good job size estimator makes both SRPT and FSP outperform processor sharing (PS) in both mean response time and slowdown.","PeriodicalId":32394,"journal":{"name":"Performance","volume":"71 1","pages":"31-38"},"PeriodicalIF":0.0,"publicationDate":"2004-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85641567","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}
PerformancePub Date : 2004-10-04DOI: 10.1109/MASCOT.2004.1348312
F. Hancke, T. Dhaene, J. Broeckhove
{"title":"Performance characterisation and verification of JavaSpaces based on design of experiments","authors":"F. Hancke, T. Dhaene, J. Broeckhove","doi":"10.1109/MASCOT.2004.1348312","DOIUrl":"https://doi.org/10.1109/MASCOT.2004.1348312","url":null,"abstract":"In the ever increasing world of distributed systems, different middleware implementations can be compared qualitatively or quantitatively. Existing evaluation techniques are often not satisfying. We apply design of experiments (DoE) to evaluate and model the performance of JavaSpaces, a tuple spaces implementation for distributing tasks through a virtual space. DoE is a statistical technique for identifying relevant input factors from a (large) set of input factors. The setup of the experiments is determined using experimental design (ED) and a selection of the relevant input factors is based on analysis of variance (ANOVA). Then regression analysis (RA) is used to obtain a multivariate representation. Some extra experiments are performed to validate this approach.","PeriodicalId":32394,"journal":{"name":"Performance","volume":"5 1","pages":"553-559"},"PeriodicalIF":0.0,"publicationDate":"2004-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88868045","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}
PerformancePub Date : 2004-10-04DOI: 10.1109/MASCOT.2004.1348314
Bo Hong, T. Schwarz, S. Brandt, D. Long
{"title":"Reliability of MEMS-based storage enclosures","authors":"Bo Hong, T. Schwarz, S. Brandt, D. Long","doi":"10.1109/MASCOT.2004.1348314","DOIUrl":"https://doi.org/10.1109/MASCOT.2004.1348314","url":null,"abstract":"MEMS-based storage is a new, non-volatile storage technology currently under development. It promises fast data access, high throughput, high storage density, small physical size, low power consumption, and low entry costs. These properties make MEMS-based storage into a serious alternative to disk drives, in particular for mobile applications. The first generation of MEMS will only offer a fraction of the storage capacity of disks; therefore, we propose to integrate multiple MEMS devices into a MEMS storage enclosure, organizing them as a RAID Level 5 with multiple spares, to be used as the basic storage building block. The paper investigates the reliability of such an enclosure. We find that mean-time-to-failure is an inappropriate reliability metric for MEMS enclosures. We show that the reliability of the enclosures is appropriate for their economic lifetime if users choose not to replace failed MEMS storage components. In addition, we investigate the benefits of occasional, preventive maintenance of enclosures.","PeriodicalId":32394,"journal":{"name":"Performance","volume":"8 1","pages":"571-579"},"PeriodicalIF":0.0,"publicationDate":"2004-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82738946","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}
PerformancePub Date : 2004-10-04DOI: 10.1109/MASCOT.2004.1348279
Ximing Zeng, Chung-Horng Lung, Changcheng Huang, A. Srinivasan
{"title":"A bandwidth-efficient scheduler for MPLS DiffServ networks","authors":"Ximing Zeng, Chung-Horng Lung, Changcheng Huang, A. Srinivasan","doi":"10.1109/MASCOT.2004.1348279","DOIUrl":"https://doi.org/10.1109/MASCOT.2004.1348279","url":null,"abstract":"DiffServ networks support three forwarding classes: EF (expedited forwarding); AF (assured forwarding); BE (best effort). Scheduling algorithms based on priority queueing, such as Cisco LLQ (low latency queueing) and MDRR (modified deficit round robin), seem to be a natural choice to provide an EF service. The main problem with priority queueing is that, due to lack of service isolation, QoS to AF classes may not be guaranteed if EF traffic is bursty. As an alternative, fair queueing schedulers can provide service isolation and guarantee QoS to all classes by reserving certain bandwidth. However, over-provisioning required by the EF service leads to low bandwidth utilization. We propose a bandwidth-efficient scheduler to provide QoS guarantees to both EF and AF classes. Simulation results show that the proposed scheduler outperforms Cisco MDRR in guaranteeing QoS to AF classes and excels fair queueing schedulers in bandwidth utilization.","PeriodicalId":32394,"journal":{"name":"Performance","volume":"13 1","pages":"251-258"},"PeriodicalIF":0.0,"publicationDate":"2004-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89895968","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}
PerformancePub Date : 2004-10-04DOI: 10.1109/MASCOT.2004.1348295
G. Orfanos, J. Habetha, Ling Liu
{"title":"MC-CDMA based IEEE 802.11 wireless LAN","authors":"G. Orfanos, J. Habetha, Ling Liu","doi":"10.1109/MASCOT.2004.1348295","DOIUrl":"https://doi.org/10.1109/MASCOT.2004.1348295","url":null,"abstract":"In this paper, a modified version of the IEEE 802.11a protocol is proposed and evaluated. We combine multicarrier code division multiple access (MC-CDMA), a novel, high capacity multicarrier modulation technique, with the standard medium access control (MAC) protocol of the 802.11 wireless local area network (WLAN). The suggested system utilizes spread spectrum to divide the channel bandwidth into parallel codechannels, and allows for a number of mobile terminals to share the medium in a more fair and efficient way. The proposed system has been evaluated using a protocol simulator, MACNET-2, and the performance results are discussed in this paper.","PeriodicalId":32394,"journal":{"name":"Performance","volume":"20 1","pages":"400-405"},"PeriodicalIF":0.0,"publicationDate":"2004-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81899572","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}
PerformancePub Date : 2004-10-04DOI: 10.1109/MASCOT.2004.1348193
Tianwei Chen, G. Schäfer, A. Wolisz, M. Sortais
{"title":"A performance study of session state re-establishment schemes in IP-based micro-mobility scenarios","authors":"Tianwei Chen, G. Schäfer, A. Wolisz, M. Sortais","doi":"10.1109/MASCOT.2004.1348193","DOIUrl":"https://doi.org/10.1109/MASCOT.2004.1348193","url":null,"abstract":"In order to support seamless handovers in IP-based micro-mobility scenarios, updating a mobile user's location information with an optimized mobility management scheme is necessary. In such a re-registration procedure, an appropriate quality-of-service (QoS) provisioning is required to meet end users' expectations. Security measures designed to protect network infrastructure and user data are also inevitable. Some proposals for seamless handover support have been published and some analytic work on the their performance has been done. However, no proposal has given a complete re-registration procedure considering the security checks, QoS provisioning and mobility management. We propose and compare several schemes for a complete re-registration procedure taking these three kinds of operations into account, analyzing their performances in terms of registration latency, packet loss, and CPU processing load at certain nodes.","PeriodicalId":32394,"journal":{"name":"Performance","volume":"5 1","pages":"159-166"},"PeriodicalIF":0.0,"publicationDate":"2004-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81916222","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}