Alright, I am taking a summer course on Operating Systems and it has been a while since I took Java. I am trying to re-learn everything that I have forgotten. In my field, Java was only required as an introduction class and therefore my level of programming in a computer language that is not on the web has never reached this level.
With that said, I am about to dive into the code and I was hoping to start a thread here to receive some help. My main problem is I am not even sure where to begin.
The first part of my assignment is to: Write an event-driven simulation to help decide which storage placement strategy should be used. Run the program until all jobs have been executed with the memory as is.
The second part deals with running the program a second time but with best-fit. I'm assuming this should be two separate programs, correct?
I assume I can put my Job list and my Memory List into two arrays and work from there, somehow attempting to put my Job List into my Memory List. My job list has 25 items and my memory list has 10 items, so I need a way to run them through I assume. This is highly confusing to me. I have been looking for a simple example and I am not finding one. I can usually get this stuff easily with an example online, does anyone know where I could find one?
I have to measure the throughput and percentage of partitions used, etc, waiting queue length, waiting time in queue, and internal fragmentation. Not sure how to measure these things. So I guess my main question is does anyone know of an example of this somewhere online or in a book?