CST 334 Week 8 Journal Entry

-

Persistence as it applies to operating systems and a CS Online Student

Persistence in operating systems ensures that data is saved and managed even after a process is completed. It ensures that the operating system can save the data from a process when it writes to a file so it can be restored or resumed at a later time. The data will still exist after the process that created it has ended. Mechanisms such as file systems are used to save and manage data after a process is done. The contents of file systems are stored in non-volatile memory, such as a Hard Drive Disk or Solid State Drive, so that data is saved even in the event of power loss, reboots, or crashes. It is important that an operating system reinforces persistence so that data can be used in different applications, devices, and programs after a process finishes. 

In a way, we, as CS students, should follow the path of persistence. In our studies, we will encounter blockades and obstacles and need to find strategies and techniques to overcome them. By showing persistence, we can overcome them and use what we have learned later if needed. The more obstacles we overcome, the more data we have at our disposal later if they come up again in a different manner. No matter how difficult something may become for us, we can show persistence to overcome it. 


Comments

Post a Comment

Popular posts from this blog

CST 438 Week 6 Learning Journal

-
Image
Compute as a Service An example of CaaS This week, we were assigned to read the chapter Compute As A Service from Software Engineering at Google . When the code is production-ready, it is important to find a compute service that will meet the organization's needs and follow best practices. Some best practices of a compute service include automation, workload types, data handling, and implementing distributed system concepts.  The first best practice for a service is to leverage automation. In this case, we are referring to handling failures such as container crashing or dealing with an unhealthy job or machine. Containers and machines should be used as "cattle" for services to be healthy, which means that when one crashes, another can pick up the job and continue forward.  The next best practice is handling different types of workloads. A service should be designed to handle batch jobs and serving jobs. Batch jobs are short-lived jobs that are split into small chunks by ...
Read more

CST 334 Week 1 Journal Entry

-
Image
Week 1: Introduction to Operating Systems One of the main topics that I learned about this week in CST 334 was operating systems and the role they play in running programs. Operation Systems have two main tasks. One of the tasks is to provide an abstraction layer to the user. This layer shields hardware information from the user, as the user should not have access to it. In addition to the layer of abstraction, the operating system also acts as a resource manager. It optimizes the use of the resources in a computer while allocating them to each program in a fair and equitable manner.  Both of these tasks are completed with the help of two modes provided by the CPU: kernel mode and user mode. While in user mode, the information about the hardware is hidden, and the user is provided an address space to do the intended job. This mode provides the user with access to user, application, and system programs. While in kernel mode, the administor has access to hardware and can change the m...
Read more

CST 370 Week 3 Learning Journal Entry

-
Image
 Brute Force Design Techniques and Divide-and-Conquer  This week, we learned about different exhaustive search algorithms that used a Brute-Force design technique. Exhaustive search algorithms consider every possible case before coming to a conclusion.  The first algorithm discussed was the sequential search and matching algorithm. This algorithm was presented in the form of searching a string to find a pattern, such as the one below. In this algorithm, every character in a string is checked for the pattern until the end of the pattern is reached. The efficiency of this algorithm is dependent on the text and pattern. In the example below, there are 16 characters in the text and 4 characters in the pattern that we are looking for. Since we are considering all comparisons and cases, we should have 13 shifts and 52 comparisons.  Another exhaustive search was conducted for combinatorics problems. An exhaustive search can be used to solve problems such as the Traveling Sa...
Read more