OLTP的可扩展网络建模

L. Cherkasova, V. Kotov, Tomas Rokicki
{"title":"OLTP的可扩展网络建模","authors":"L. Cherkasova, V. Kotov, Tomas Rokicki","doi":"10.1109/PNPM.1993.393444","DOIUrl":null,"url":null,"abstract":"Practical experiments with the net modeling of OLTP (online transaction processing) applications are discussed. The goal was to propose a convenient and flexible model that would be easy to modify with respect to different scheduling algorithms, number of processors, and disks. The parameters of the model may be varied depending on the size of available memory and timing in a model in order to provide the necessary information to analyze the functioning of the system under different transaction rates and conditions, to identify bottlenecks and potential inefficiencies in the system design. The main effort was focused on speeding up the simulation through combining nets with code, using refinement techniques, and exploiting the scalability of colored Petri nets.<<ETX>>","PeriodicalId":404832,"journal":{"name":"Proceedings of 5th International Workshop on Petri Nets and Performance Models","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":"{\"title\":\"On scalable net modeling of OLTP\",\"authors\":\"L. Cherkasova, V. Kotov, Tomas Rokicki\",\"doi\":\"10.1109/PNPM.1993.393444\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Practical experiments with the net modeling of OLTP (online transaction processing) applications are discussed. The goal was to propose a convenient and flexible model that would be easy to modify with respect to different scheduling algorithms, number of processors, and disks. The parameters of the model may be varied depending on the size of available memory and timing in a model in order to provide the necessary information to analyze the functioning of the system under different transaction rates and conditions, to identify bottlenecks and potential inefficiencies in the system design. The main effort was focused on speeding up the simulation through combining nets with code, using refinement techniques, and exploiting the scalability of colored Petri nets.<<ETX>>\",\"PeriodicalId\":404832,\"journal\":{\"name\":\"Proceedings of 5th International Workshop on Petri Nets and Performance Models\",\"volume\":\"13 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-10-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"14\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 5th International Workshop on Petri Nets and Performance Models\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PNPM.1993.393444\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 5th International Workshop on Petri Nets and Performance Models","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PNPM.1993.393444","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14

摘要

讨论了联机事务处理(OLTP)应用的网络建模的实际实验。我们的目标是提出一个方便而灵活的模型,该模型可以根据不同的调度算法、处理器数量和磁盘数量轻松修改。模型的参数可能会根据模型中可用内存的大小和时间而变化,以便提供必要的信息来分析系统在不同事务速率和条件下的功能,以识别系统设计中的瓶颈和潜在的低效率。主要的工作集中在通过将网络与代码结合,使用改进技术以及利用彩色Petri网的可扩展性来加速模拟。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
On scalable net modeling of OLTP
Practical experiments with the net modeling of OLTP (online transaction processing) applications are discussed. The goal was to propose a convenient and flexible model that would be easy to modify with respect to different scheduling algorithms, number of processors, and disks. The parameters of the model may be varied depending on the size of available memory and timing in a model in order to provide the necessary information to analyze the functioning of the system under different transaction rates and conditions, to identify bottlenecks and potential inefficiencies in the system design. The main effort was focused on speeding up the simulation through combining nets with code, using refinement techniques, and exploiting the scalability of colored Petri nets.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信