On Net Modeling of OLTP for Parallel Systems
Ludmila A. Cherkasova, Vadim Evgenich Kotov, Tomas Rokicki · 1993
net modeling, OLTP, TPC-A benchmark, colored Petri nets, scalable systems In this report, we consider and discuss the first stage in the net modeling of OLTP (On-Line Transaction Processing) applications for parallel computers. The goal was to propose a convenient and flexible model, which would be easy to modify with respect to different scheduling algorithms and the number of processes and disks. The parameters 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.