Pub Date : 1998-07-19DOI: 10.1109/MASCOT.1998.693703
Mariela Curiel, R. Puigjaner
The paper focuses on reducing completion time in large simulation models by replacing some of their elements with analytically determined solutions. In particular, we study realistic analytical server models that include operating system overhead. This overhead will be determined by measuring the behaviour of a representative workload. We propose a methodology to reduce the number of measurements based on information provided by an analytical workload model. The calibration of the model is also presented. As workload, the TPC-C benchmark was chosen due to our interest in transactional systems.
{"title":"A measurement methodology to calibrate analytical models including operating system overhead","authors":"Mariela Curiel, R. Puigjaner","doi":"10.1109/MASCOT.1998.693703","DOIUrl":"https://doi.org/10.1109/MASCOT.1998.693703","url":null,"abstract":"The paper focuses on reducing completion time in large simulation models by replacing some of their elements with analytically determined solutions. In particular, we study realistic analytical server models that include operating system overhead. This overhead will be determined by measuring the behaviour of a representative workload. We propose a methodology to reduce the number of measurements based on information provided by an analytical workload model. The calibration of the model is also presented. As workload, the TPC-C benchmark was chosen due to our interest in transactional systems.","PeriodicalId":272859,"journal":{"name":"Proceedings. Sixth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (Cat. No.98TB100247)","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116298781","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}
Pub Date : 1998-07-19DOI: 10.1109/MASCOT.1998.693674
W. Olesinski, P. Gburzynski
Multicasting in deflection networks is more difficult than in store-and-forward networks, because of the difficulties in sending multiple copies of the same packet on several output ports. On the other hand, deflected packets stray from their optimal paths and may visit the multicast recipients "accidentally", not necessary in the order envisioned by the sender. We compare a number of simple multicast strategies for deflection networks based on a few simple rules and assumptions. In particular, we never buffer packets that cannot be relayed immediately.
{"title":"Multicast in deflection networks","authors":"W. Olesinski, P. Gburzynski","doi":"10.1109/MASCOT.1998.693674","DOIUrl":"https://doi.org/10.1109/MASCOT.1998.693674","url":null,"abstract":"Multicasting in deflection networks is more difficult than in store-and-forward networks, because of the difficulties in sending multiple copies of the same packet on several output ports. On the other hand, deflected packets stray from their optimal paths and may visit the multicast recipients \"accidentally\", not necessary in the order envisioned by the sender. We compare a number of simple multicast strategies for deflection networks based on a few simple rules and assumptions. In particular, we never buffer packets that cannot be relayed immediately.","PeriodicalId":272859,"journal":{"name":"Proceedings. Sixth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (Cat. No.98TB100247)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129319105","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}
Pub Date : 1998-06-01DOI: 10.1109/MASCOT.1998.693681
C. Lemieux, P. L'Ecuyer
We consider an ATM switch model, in which each of N sources is a Markov modulated rate process. We look at some approximations that have been proposed for p, the probability that in steady-state conditions, the buffer content exceeds x. These approximations are compared with the simulation results for p and the cell-loss ratio.
{"title":"An empirical comparison of diffusion approximations and simulation in ATM networks","authors":"C. Lemieux, P. L'Ecuyer","doi":"10.1109/MASCOT.1998.693681","DOIUrl":"https://doi.org/10.1109/MASCOT.1998.693681","url":null,"abstract":"We consider an ATM switch model, in which each of N sources is a Markov modulated rate process. We look at some approximations that have been proposed for p, the probability that in steady-state conditions, the buffer content exceeds x. These approximations are compared with the simulation results for p and the cell-loss ratio.","PeriodicalId":272859,"journal":{"name":"Proceedings. Sixth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (Cat. No.98TB100247)","volume":"2016 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114527167","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
扫码关注我们
求助内容：
应助结果提醒方式：