# memory-and-process-scheduler

git clone git://git.codymlewis.com/memory-and-process-scheduler.git
Log | Files | Refs | README

Report.md (740B)

      1 ---
2 title: COMP2240 Assignment 3
3 author: Cody Lewis [mailto:c3283349@uon.edu.au](c3283349@uon.edu.au)
4 date: \today
6 geometry: margin=2cm
7 ---
8
9
10     \#_{frames_{process}} =  \left \lfloor \frac{F}{\#_{processes}} \right \rfloor
11
12
13 # Least Recently Used
14
15 I used a binary tree to sort the frames by time of use as I found that to be the
16 least complex to use and update, $\mathcal{O}(\log n)$, as opposed to a list, which
17 would be $\mathcal{O}(n\log n)$ on every update. Although, a list or queue would
18 have faster add and remove operations, $\mathcal{O}(1)$, the update is likely a
19 more common operation in the case of a sheduler, and the combined complexity
20 of the operations, make the tree better.