Simulation of computer systems with FIFO-discipline interrupt handling

MaRDI QIDQ5110086zbMATH OpenFDO

Authors E. V. Larkin, Aleksandr Nikolaevich Privalov

Publication date 15 May 2020

Full work available at URL http://mathnet.ru/eng/cheb786

zbMATH Keywords

competitionbinary treesemi-Markov processinterruptionPetri-Markov netFIFO disciplinetime characteristics

Mathematics Subject Classification ID

Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Asymptotic analysis of systems with intensive interrupts
• The effects of service disciplines on the performance of a nonreliable terminal system
• Generalized M-Timed Petri Nets And Performance Evaluation Of Computer Systems
• Modeling Power of Stochastic Petri Nets for Simulation
• A priority queue with interruptions of service permitted after a time quantum

This page was built for publication: Simulation of computer systems with FIFO-discipline interrupt handling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5110086)