{"title":"A simulation model of the MICRONET computer system during join processing","authors":"Joseph D. Brownsmith","doi":"10.5555/800077.802494","DOIUrl":null,"url":null,"abstract":"The MICRONET computer system was specifically designed for processing distributed relational databases. This paper describes a simulation study of the queueing and resource utilization of this system during processing of a relational join operation. Problems associated with representing a computer network in a simulation model are presented. In our model, one set of simulation facilities can represent any node of interest in the network. The processing at each node involves competition for resources by the data bus and the join algorithm. This was represented by processes which were synchronized by Wait Event and Post Event primitives. An algorithm for interrupting a non-shareable resource (e.g. the cpu) was also developed. Results for various system loadings and database sizes are presented.","PeriodicalId":186490,"journal":{"name":"Annual Simulation Symposium","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1981-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annual Simulation Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5555/800077.802494","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5
Abstract
The MICRONET computer system was specifically designed for processing distributed relational databases. This paper describes a simulation study of the queueing and resource utilization of this system during processing of a relational join operation. Problems associated with representing a computer network in a simulation model are presented. In our model, one set of simulation facilities can represent any node of interest in the network. The processing at each node involves competition for resources by the data bus and the join algorithm. This was represented by processes which were synchronized by Wait Event and Post Event primitives. An algorithm for interrupting a non-shareable resource (e.g. the cpu) was also developed. Results for various system loadings and database sizes are presented.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
