CST 334: Week 2

Write a 1 - 2 paragraph journal post, of at least 250 words, of what you learned this week in CST 334.

This week we developed a deeper understanding about processes. For starters, the OS has data structures to hold information about processes that include their id, their state, their register values, and the size of memory. Additionally, the OS needs to manage each process’ state, which can either be ready, running, or blocked. When a process is in the ready state, it is prepared to run and waiting to be chosen by the OS. Once the process is chosen by the OS, it moves into the running state and begins implementing its instructions. When a process needs to wait for an event (such as I/O completion or a resource to become available), it moves from the running state to the blocked state. Once the event occurs, the process transitions back to the ready state. To ensure all processes are given an opportunity to run through to completion, we will apply scheduling policies to dictate when processes will run and for how long. There are various disciplines that can be applied in scheduling and there are two metrics that we measure to determine how efficient each discipline is, response time and turnaround time. Response time is the amount of time between when a process first arrives to the moment it is called to run by the OS. Turnaround time is the amount of time that is taken for a process to arrive in the system and complete it. The averages for these metrics will vary depending on which disciplines we use for scheduling and which is more suitable at what time may not be easy to determine, so understanding how each discipline works prepares us to be adaptable if one discipline isn’t producing our desired results.

Comments

Post a Comment

Popular posts from this blog

CST 334: Week 4

  Write a 1 - 2 paragraph journal post, of at least 250 words, of what you learned this week in CST 334. As an alternative to base-and-bounds, we learned this week that we can implement a technique called paging. This technique breaks virtual address space up into sections of equal size. In comparison to base-and-bounds, paging is simpler to implement and much more flexible in use and it allows us to avoid fragmentation. On the downside, paging needs larger data structures for translation, so more space is used, and translation info does not fit into the MMU registers, which makes paging slower than using base-and-bounds.  Each process will have a page table, which logs a page frame number, or PFN, that corresponds with a virtual page number, or VPN. Virtual addresses are made up of the VPN and then what is referred to as the offset. During address translation, we retrieve the PFN using the VPN in the page table and replace the VPN in the virtual address with the PFN, and we e...
Read more

Week 4 Learning Journal Post

Part 1: Educational Goals A goal I am working to achieve within this or next term is to finish an O'Rilley online course on the basics and fundamentals of Python programming. I will then be working on a similar course that pertains to Java programming. Simultaneously to these courses, I have a goal of creating an online study hour with those within our cohort. Two long-term goals I have are to obtain my bachelor's degree in computer science and to graduate with honors. After obtaining my bachelor's degree, I plan to then go for my master's so I can teach at a college level if I choose later on in my career. Part 2: Career Goals A goal I have for my career is to obtain at least two professional certifications before I graduate my bachelor's degree program, CompTIA Security+ and Cisco Certified Network Associate. Additionally, I have a goal of securing a cybersecurity internship with a local company before I graduate. Once I have gained enough experience and obtained ...
Read more

CST 363: Week 5

  If indexes are supposed to speed up performance of query,  what does the author mean by a slow index?  The author indicates that a slow index occurs when a query performs slower than expected despite using an index. To ensure a query has found all entries matching the search criteria, the database will need to read all the nodes within the final chain, which will consist of a large number of operations and slow the process. In addition to the database's need to read all the nodes within the chain, the database will also need to read data from different table blocks, which will only slow the process even more. The author specifies that though a slow index can consist of slower than normal queries, it doesn't necessarily mean the index is broken or useless. 
Read more