20.500.12556/DKUM-41901 SIMULATOR ALGORITMOV ZA ZAMENJAVO STRANI PRI VIRTUALNEM POMNILNIKU SIMULATION OF PAGE REPLACEMENT ALGORITHMS V diplomskem delu smo zasnovali in implementirali simulator za zamenjavo strani pri virtualnem pomnilniku. Simuliramo lahko naslednje algoritme: kdor prej pride, prej melje; redko uporabljen; najdalj časa neuporabljen; algoritem druge možnosti ter naključni. Po literaturi smo povzeli opise in lastnosti teh algoritmov, predstavili delovanje s psevdokodom ter izpostavili njihove prednosti in slabosti. Po zastavljenih zahtevah in specifikacijah smo zasnovali simulator, ki smo ga napisali v programskem jeziku C#, razvili pa v programskem okolju Visual Studio. Grafični uporabniški vmesnik med simulacijo nazorno kaže, kako se posamezne strani selijo iz diskovnih zapisov v delovni pomnilnik in kako ga zapuščajo, ko je poln, če so izbrane za zamenjavo. Simulator šteje napake strani, hkrati pa vodi simulirani čas za izvajanje procesov, ki vsebujejo te strani. V nalogi smo tudi analizirali delovanje simulatorja in ga preizkusili z nekaj izbranimi primeri, s katerimi smo želeli preveriti uspešnost različnih algoritmov za zamenjavo strani pri enakem naboru izvajanih procesov. Rezultate smo prikazali grafično in jih ovrednotili, primerjali obnašanje algoritmov v simuliranih situacijah. In this diploma thesis we designed and implemented a simulator of page replacement algorithms comprising the virtual memory. The following algorithms can be simulated: first in first (FIFO), second chance (SC), least recently used (LRU), not frequently used (NFU) and random (RND). Based on existing publications, we recapitulated descriptions and features of all the algorithms, presented their functionality by pseudo-code, and exposed their strengths and weaknesses. Following the application requirements and specifications, we designed the simulator's structure, wrote it in the C# programming language and developed in the Visual Studio software environment. Graphical user interface accompanies the simulation by the intuitive presentation of page transfer from the disk into the memory, and in the opposite direction when pages are replaced. The simulator counts page faults and, at the same time, measures simulated time when the processes' execution is simulated. In our thesis, we also analysed the simulator's operation and tested on a few examples to assess the efficiency of the different page-replacement algorithms applied to the same sequence of the executed processes. The results were depicted graphically and numerically in order to illustrated the behaviour of each algorithm in simulated situations. upravljanje s pomnilnikom virtualni pomnilnik algoritmi za zamenjavo strani simulacije memory management virtual memory page replacement algorithms simulation true true false [D. Pandel] Slovenski jezik Angleški jezik Diplomsko delo/naloga 2013-09-07 00:27:29 2013-09-25 12:14:43 2022-05-05 03:08:56 2021-04-26 03:26:28 2013 0 Maribor 0 0000-00-00 NiDoloceno NiDoloceno NiDoloceno 0000-00-00 0000-00-00 0000-00-00 004.8:004.92(043.2) 17324566 URN:SI:UM:DK:CGQHLIYD UNI_Pandel_David_2013.pdf UNI_Pandel_David_2013.pdf 1 2370FB2D4A6A52ACE83D910C0422BB2A e5f9e2b3f0d66b1e8d3340b0a5c9e162476aae1fd1b1ebfaaaefa4ac3c1aea58 6cc03b19-7c0a-11eb-bb7a-00155d0001ca https://dk.um.si/Dokument.php?lang=slv&id=59512 Fakulteta za elektrotehniko, računalništvo in informatiko 0 0 0