PerformancePub Date : 2004-10-04DOI: 10.1109/MASCOT.2004.1348287
J. Himmelspach, A. Uhrmacher
{"title":"Processing dynamic PDEVS models","authors":"J. Himmelspach, A. Uhrmacher","doi":"10.1109/MASCOT.2004.1348287","DOIUrl":"https://doi.org/10.1109/MASCOT.2004.1348287","url":null,"abstract":"Structural changes, i.e. the creation and deletion of components, and the change of interactions are salient features of adaptive systems. To model and specify these systems, variable structure models are required, i.e. models that entail in their own description the possibility to change their structure. To execute these models, a simulator with a clear semantic of intertwining structural and non-structural changes is required. In JAMES (Java-based agent modeling environment for simulation), different simulator components, e.g., for paced, unpaced, sequential, and parallel simulation, support the continuous use of models and simulation from specification to testing and a composition of the simulation engine on demand. Two types of simulator components for variable structure models are developed and integrated into the simulation layer; the implications are discussed.","PeriodicalId":32394,"journal":{"name":"Performance","volume":"42 1","pages":"329-336"},"PeriodicalIF":0.0,"publicationDate":"2004-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72788285","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.1348317
Nathan K. Edel, Deepa Tuteja, E. L. Miller, S. Brandt
{"title":"MRAMFS: a compressing file system for non-volatile RAM","authors":"Nathan K. Edel, Deepa Tuteja, E. L. Miller, S. Brandt","doi":"10.1109/MASCOT.2004.1348317","DOIUrl":"https://doi.org/10.1109/MASCOT.2004.1348317","url":null,"abstract":"File systems using non-volatile RAM (NVRAM) promise great improvements in file system performance over conventional disk storage. However, current technology allows for a relatively small amount of NVRAM, limiting the effectiveness of such an approach. We have developed a prototype in-memory file system which utilizes data compression on inodes, and which has preliminary support for compression of file blocks. Our file system, MRAMFS, is also based on data structures tuned for storage efficiency in non-volatile memory. This prototype allows us to examine how to use this limited resource more efficiently. Simulations show that inodes can be reduced to 15-20 bytes each at a rate of 250,000 or more inodes per second. This is a space savings of 79-85% over conventional 128-byte inodes. Our prototype file system shows that for metadata operations, inode compression does not significantly impact performance, while significantly reducing the space used by inodes. We also note that a naive block-based implementation of file compression does not perform acceptably either in terms of speed or compression achieved.","PeriodicalId":32394,"journal":{"name":"Performance","volume":"9 1","pages":"596-603"},"PeriodicalIF":0.0,"publicationDate":"2004-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84884135","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.1348281
G. Riley, Monirul I. Sharif, Wenke Lee
{"title":"Simulating Internet worms","authors":"G. Riley, Monirul I. Sharif, Wenke Lee","doi":"10.1109/MASCOT.2004.1348281","DOIUrl":"https://doi.org/10.1109/MASCOT.2004.1348281","url":null,"abstract":"The accurate and efficient modeling of Internet worms is a particularly challenging task for network simulation tools. The atypical and aggressive behavior of these worms can easily consume excessive resources, both processing time and storage, within a typical simulator. In particular the selection of random IP addresses, and the sending of packets to the selected hosts, even if they are non-existent or not modeled in the simulation scenario, is challenging for existing network simulation tools. Further, the computation of routing information for these randomly chosen target addresses defeats most caching or on-demand routing methods, resulting in substantial overhead in the simulator. We discuss the design of our Internet worm models in the Georgia Tech Network Simulator, and show how we addressed these issues. We present some results from our Internet worm simulations that show the rate of infection spread for a typical worm under a variety of conditions.","PeriodicalId":32394,"journal":{"name":"Performance","volume":"746 1","pages":"268-274"},"PeriodicalIF":0.0,"publicationDate":"2004-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84927069","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.1348289
W. Sandmann
{"title":"Fast simulation of excessive population size in tandem Jackson networks","authors":"W. Sandmann","doi":"10.1109/MASCOT.2004.1348289","DOIUrl":"https://doi.org/10.1109/MASCOT.2004.1348289","url":null,"abstract":"We consider the probability that the population in a two node tandem Jackson network reaches some high level during a busy period. For estimating this rare event probability we apply fast simulation using importance sampling. Our focus is thereby on systems without a single bottleneck queue, which has turned out to be the most critical case for existing methods. A state independent change of measure is developed heuristically based on typical system behavior and the likelihood ratio properties on state cycles. Neither complicated large deviations analysis nor costly presimulations are needed to determine the change of measure. Although state independent changes of measure are known to have limitations, they also provide several advantages. They are easy to use and understand, and they do not cause space complexity problems often strongly limiting state-dependent approaches. The efficiency of our change of measure is demonstrated by numerical results.","PeriodicalId":32394,"journal":{"name":"Performance","volume":"1 1","pages":"347-354"},"PeriodicalIF":0.0,"publicationDate":"2004-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91088469","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.1348318
Yijian Wang, D. Kaeli
{"title":"Execution-driven simulation of network storage systems","authors":"Yijian Wang, D. Kaeli","doi":"10.1109/MASCOT.2004.1348318","DOIUrl":"https://doi.org/10.1109/MASCOT.2004.1348318","url":null,"abstract":"A number of new network storage architectures have emerged recently that provide shared, adaptable and high-performance storage systems for data-intensive applications. Three common storage networking architectures are direct-attached storage (DAS), network-attached storage (NAS), and storage area network (SAN). Efficient implementations of each of these classes of storage architecture can have a significant impact on overall system performance. To be able to tune both the performance of a network storage architecture and its underlying workload, an accurate simulation modeling environment can be very valuable. In this paper we present ParIOSim, a validated execution-driven simulator for network storage systems. This simulator can be used to accurately predict the performance of parallel I/O applications as a function of the underlying storage architecture. ParIOSim also provides a flexible simulation environment to guide system level storage optimizations. To evaluate the accuracy of our simulation environment, we compare the performance of ParIOsim to the performance obtained on an actual parallel system. To demonstrate the utility of ParIOSim, we report on the overall system performance obtained for a parallel I/O benchmark application as run on different storage architectures.","PeriodicalId":32394,"journal":{"name":"Performance","volume":"7 1","pages":"604-611"},"PeriodicalIF":0.0,"publicationDate":"2004-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82883161","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-08-31DOI: 10.1109/MASCOT.2004.1348302
E. Strohmaier, H. Shan
{"title":"Architecture independent performance characterization and benchmarking for scientific applications","authors":"E. Strohmaier, H. Shan","doi":"10.1109/MASCOT.2004.1348302","DOIUrl":"https://doi.org/10.1109/MASCOT.2004.1348302","url":null,"abstract":"A simple, tunable, synthetic benchmark with a performance directly related to applications would be of great benefit to the scientific computing community. We present a novel approach to developing such a benchmark. The initial focus of this project is on the data access performance of scientific applications. First, a hardware independent characterization of code performance in terms of address streams is developed. The parameters chosen to characterize a single address stream are related to regularity, size, and spatial and temporal locality. These parameters are then used to implement a synthetic benchmark program that mimics the performance of a corresponding code. To test the validity of our approach we performed experiments using five test kernels on six different platforms. The performance of most of our test kernels can be approximated by a single synthetic address stream. However, in some cases, overlapping two address streams is necessary to achieve a good approximation.","PeriodicalId":32394,"journal":{"name":"Performance","volume":"60 1","pages":"467-474"},"PeriodicalIF":0.0,"publicationDate":"2004-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87492428","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-06-01DOI: 10.1145/1005686.1005743
Mengzhi Wang, Kinman Au, A. Ailamaki, A. Brockwell, C. Faloutsos, G. Ganger
{"title":"Storage device performance prediction with CART models","authors":"Mengzhi Wang, Kinman Au, A. Ailamaki, A. Brockwell, C. Faloutsos, G. Ganger","doi":"10.1145/1005686.1005743","DOIUrl":"https://doi.org/10.1145/1005686.1005743","url":null,"abstract":"Storage device performance prediction is a key element of self-managed storage systems. The paper explores the application of a machine learning tool, CART (classification and regression trees) models, to storage device modeling. Our approach predicts a device's performance as a function of input workloads, requiring no knowledge of the device internals. We propose two uses of CART models: one that predicts per-request response times (and then derives aggregate values); one that predicts aggregate values directly from workload characteristics. After being trained on the device in question, both provide accurate black-box models across a range of test traces from real environments. Experiments show that these models predict the average and 90th percentile response time with a relative error as low as 19%, when the training workloads are similar to the testing workloads, and interpolate well across different workloads.","PeriodicalId":32394,"journal":{"name":"Performance","volume":"33 1","pages":"588-595"},"PeriodicalIF":0.0,"publicationDate":"2004-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84150521","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 : 2002-09-23DOI: 10.1007/3-540-45798-4_7
Virgílio A. F. Almeida
{"title":"Capacity Planning for Web Services","authors":"Virgílio A. F. Almeida","doi":"10.1007/3-540-45798-4_7","DOIUrl":"https://doi.org/10.1007/3-540-45798-4_7","url":null,"abstract":"","PeriodicalId":32394,"journal":{"name":"Performance","volume":"43 1","pages":"142-157"},"PeriodicalIF":0.0,"publicationDate":"2002-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85062227","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 : 2002-01-01DOI: 10.1007/3-540-45798-4_8
P. Cremonesi, G. Serazzi
{"title":"End-to-End Performance of Web Services","authors":"P. Cremonesi, G. Serazzi","doi":"10.1007/3-540-45798-4_8","DOIUrl":"https://doi.org/10.1007/3-540-45798-4_8","url":null,"abstract":"","PeriodicalId":32394,"journal":{"name":"Performance","volume":"5 1","pages":"158-178"},"PeriodicalIF":0.0,"publicationDate":"2002-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89814577","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 : 2002-01-01DOI: 10.1007/3-540-45798-4_16
E. D. S. E. Silva, R. M. Leão, B. Ribeiro-Neto, S. Campos
{"title":"Performance Issues of Multimedia Applications","authors":"E. D. S. E. Silva, R. M. Leão, B. Ribeiro-Neto, S. Campos","doi":"10.1007/3-540-45798-4_16","DOIUrl":"https://doi.org/10.1007/3-540-45798-4_16","url":null,"abstract":"","PeriodicalId":32394,"journal":{"name":"Performance","volume":"31 1","pages":"374-404"},"PeriodicalIF":0.0,"publicationDate":"2002-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76951782","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}