Ashtin Dorsaint - Assignment - 1 - Computer Science 305

.docx

School

Saint Leo University *

*We aren’t endorsed by this school

Course

430

Subject

Computer Science

Date

Jan 9, 2024

Type

docx

Pages

4

Uploaded by BarristerIceKudu28

Report
Computer Science 305 – Assignment 1: Solving Memory Management Problems Ashtin Dorsaint Study.com For these assignments, it’s been difficult to find the best scenario for each set of the jobs. The language that I have decided to use is Python, since I’m most familiar with the language, even it’s the most abstracted compared to other languages. Before I get to the results, Windows vs Linux when it comes to memory management will handle memory in different methods. The closest thing to ending state is their page replacement algorithms; With Windows it relies on FIFO, while Linux uses the LRU algorithm. Windows FIFO algorithm will allow to do page replacement from newest to oldest, this is more linear, but will provide the best mothed to go through all replacements. Linux LRU will allow you to optimize replacements that are least used, which enables you to save more memory for the OS. In the python program I will use the csv library to use the data from the tables assigned, and based on results, Best-Fit will be best option since it’s a good balance between performance and fragmentation. Will include the text files of results, but will include a screenshot of the code.
Your preview ends here
Eager to read complete document? Join bartleby learn and gain access to the full version
  • Access to all documents
  • Unlimited textbook solutions
  • 24/7 expert homework help