On scalable net modeling of OLTP
Ludmila A. Cherkasova, Vadim Evgenich Kotov, Tomas Rokicki · 2002
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.>