| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:SIMULATOR ALGORITMOV ZA ZAMENJAVO STRANI PRI VIRTUALNEM POMNILNIKU
Authors:ID Pandel, David (Author)
ID Zazula, Damjan (Mentor) More about this mentor... New window
Files:.pdf UNI_Pandel_David_2013.pdf (3,31 MB)
MD5: 2370FB2D4A6A52ACE83D910C0422BB2A
 
Language:Slovenian
Work type:Bachelor thesis/paper
Typology:2.11 - Undergraduate Thesis
Organization:FERI - Faculty of Electrical Engineering and Computer Science
Abstract: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.
Keywords:upravljanje s pomnilnikom, virtualni pomnilnik, algoritmi za zamenjavo strani, simulacije
Place of publishing:Maribor
Publisher:[D. Pandel]
Year of publishing:2013
PID:20.500.12556/DKUM-41901 New window
UDC:004.8:004.92(043.2)
COBISS.SI-ID:17324566 New window
NUK URN:URN:SI:UM:DK:CGQHLIYD
Publication date in DKUM:25.09.2013
Views:1438
Downloads:81
Metadata:XML DC-XML DC-RDF
Categories:KTFMB - FERI
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share



Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Secondary language

Language:English
Title:SIMULATION OF PAGE REPLACEMENT ALGORITHMS
Abstract: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.
Keywords:memory management, virtual memory, page replacement algorithms, simulation


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica