Key Assignment Draft As is true with all components in any computing environment, security considerations are paramount for operating systems as well. Performing risk assessments and identifying mitig

Key Assignment Draft As is true with all components in any computing environment, security considerations are paramount for operating systems as well. Performing risk assessments and identifying mitig
OS UPGRADE Course number and name CS630-2104A-01 Project name Operating Systems Design Student name Asim Farooq Date 09/20/2021 Table of Contents 1.Project Outline 3 1.Brief Description 3 2.Summary for current OS use 3 2. OS Processor and Core 4 1.Advantages of upgrading OS using multi-processor 4 2.Steps to Upgrade the Processor and The Core 5 3.Requirements this will support for the upgrade. 6 3.Scheduling Algorithms 7 4.OS Concurrency Mechanism 8 5.OS Security Risks and Mitigation Strategy 9 6.Future Considerations Using Emerging Technology 10 References 11 Project Outline Brief Description The organization I intend to use in this scenario is Western Acoustics, Inc. We shall upgrade the changes considered for computer networks and operating systems to handle both near and future tasks. This construction company’s requirements are cost-effective and raise the output of the company. The services offered by this organization in both commercial settings and real estate are painting, installation, metal stud framing, acoustical ceiling, painting, maintenance, and drywall. I have been in the company for two years, working part-time while being an undergraduate. In this company am working as an IT consultant agent to report on its framework requirement progressively. Thus, I have much experience in the networking and operating system of the company’s IT infrastructure. Summary for current OS use The head offices of the company are in Tempe, Arizona. Currently, they pose a material and workshop warehouse. The office building has several office spaces and operating system (OS) concurrency. Also, there is one room considered for conferences. They aim to have a technical specialty for security mitigation where they currently depend on software to secure the systems. The security packages are antimalware, antiviruses, and web-protection mechanisms. The primary software that they concurrently use in their operations is Microsoft 0ffice 365. Other software includes estimating, timesheet data for employees, and construction mock-up software. They are operating without a server, and they depend on a single processor with multiple cores within each computer, which is 9 of them. Each computer is running on a Windows XP 32-bit operating system. Western Acoustics, Inc requires an outfit in their operation to upgrade their outdated windows XP OS and technological upgrades constantly. Since April 2014, Windows XP has discontinued its security updates on OS concurrency Core and processor (Fisher, 2014). 2. OS Processor and Core Advantages of upgrading OS using multi-processor Suppose the company installs a new OS capable of handling security updates in multicore inside the computers. In that case, there will be a significant change in their working efficiency and output for a single input. The company will also experience less or no trafficking since it will be a one-chip with cores integrated, ensuring less time to give an output. This will assist on the merits of time-saving. Also, the company will benefit by saving costs by using a multicore system compared to using a multi-processor system; this is expected to reduce the number of CPUs in each computer they purchase and what they shall put in their office. This is likely because a single multi-processor system has some advantages, such as performing a single task at a given time. This is effective and relieves the computer’s CPU from disk scheduling (Fisher, 2014). When more work is done in less time, this shows that is the respective increase in throughout. The advantage of multiple processors is that they can run parallel to the other, increasing the system performance. Thus, according to CCM (2018), multi-processing involves operating numerous processors parallel to get a higher calculation power than expected when using a high-end processor to increase chances if there is damage to one processor. If the company switches to the latest OS, Windows 11 Pro, there will be minimum expectations for the required setup. Steps to Upgrade the Processor and The Core I will need to use PowerPoint presentations to exhibit the organization’s advantages from having other chips and OS. After endorsement, check what OS type is being used and processor model expected to be utilized, motherboard type, force supply, and ultimately how much RAM they each have, essentially the organization’s computer details. An evaluation of the organization and computer system. One more initial step to take before the relocation is to reinforce every one of the computers. On the off chance that something falls flat, we will securely have every one of the organization’s records. Requirements this will support for the upgrade. All the upgrades can support software used by the company. Recapping some of the software, Western Acoustics, Inc will use Office 365, Zayzoom for development, On-Screen Takeoff to estimate their solutions, and the last but not the least is NationalPEO for employee and timekeeping. Scheduling Algorithms OS Concurrency Mechanism OS Security Risks and Mitigation Strategy Future Considerations Using Emerging Technology References CCM (March 2018) Operating System. Internet Archaeology. Retrieved https://ccm.net/contents/664-operating-system Fisher, T (March 2020) Lifewire. “Microsoft Windows XP” Retrieved https://www.lifewire.com/windows-xp-2626354.
Key Assignment Draft As is true with all components in any computing environment, security considerations are paramount for operating systems as well. Performing risk assessments and identifying mitig
Operating System Concurrency Mechanism Student Name University Course Instructor Name Date Operating System Concurrency Mechanism Shared-State Concurrency Mechanism The recommended concurrency mechanism in a distributed computing environment is the shared-state concurrency mechanism. According to Klabnik and Nichols (2019), the shared-state concurrency allows concurrency computations to communicate by reading and updating a shared memory location. For the shared-state concurrency mechanism to work effectively, it requires an explicit synchronization. This helps to avoid a potential occurrence of race conditions. For example, while updating, the state may be inconsistent making the simultaneous reading of the state cause data race. A data race is an undefined behavior that occurs when two or more threads in a single process are trying to access the same memory location synchronously where at least one of the accesses is for writing and the threads are not using any type of exclusive locks to control access to the memory location (Klabnik & Nichols, 2019). The order of access to the memory location becomes non-deterministic. Therefore, the computation may give results that are different based on the order followed. In the process, many data races may act as a bug in the program although they may become benign when access to the shared memory location is used for a busy wait. In a shared-state concurrency, linearizability or atomicity refers to the higher-level concept that requires the prevention of interference between concurrent computations when using a shared state (Klabnik & Nichols, 2019). Shared memory systems tend to utilize both a shared memory and hardware parallelism. As a result, the shared state concurrency mechanism is considered to be a go-to approach for concurrency because of its flexibility. Handling Communication and Synchronization Synchronization in a shared state model of concurrency is achieved in various ways. One common strategy is known as spinning. Spinning is a synchronization technique whereby two threads are able to synchronize by first figuring out what the other thread is doing (Libert & Vanhoof, 2017). In such cases, each of the threads waits to get an update from the other thread before taking any action. This could be very useful when it comes to multiprocessors in a shared state concurrency where a thread can give up its quantum, helping to achieve synchronization with the other threads. In a shared-state model of concurrency, modules that are concurrent communicate by reading and writing the objects that have been shared in the memory. It is based on the concept of threads where interaction is achieved through the modification of variables and states (Libert & Vanhoof, 2017). For example, two processor cores or processors located in the same computer system sharing the same memory or two programs running on the same computer and sharing the same files and file systems that the programs can both read and write can be considered to be shared memory. This allows multiple entities to work on the same set of data by reading and writing data. Through synchronization, messages can be read and written without causing conflicts. In order to ensure that inter-process communication occurs concurrently, the shared state concurrency model can be a bit challenging to implement. System calls will only be required when establishing shared memory regions. When the regions of share memory have been established, intervention or assistance from the kernel will not be required because access to such regions will be considered to be routine memory access (Libert & Vanhoof, 2017). As a result, shared state concurrency allows processes to communicate faster, allowing for the convenience of communication and a maximum speed of communication. References Klabnik, S., & Nichols, C. (2019). The Rust Programming Language (Covers Rust 2018). No Starch Press. Libert, C., & Vanhoof, W. (2017). Survey of software visualization systems to teach message-passing concurrency in secondary school. In International Conference on Practical Applications of Agents and Multi-Agent Systems (pp. 386-397). Springer, Cham.
Key Assignment Draft As is true with all components in any computing environment, security considerations are paramount for operating systems as well. Performing risk assessments and identifying mitig
OS UPGRADE Course number and name CS630-2104A-01 Modern Operating System Project name Scheduling Algorithms Student name Asim Farooq Date 09/28/2021 Table Of Contents 3 Table of Contents 1.Project Outline 3 1.Brief Description 3 2.Summary for current OS use 3 2. OS Processor and Core 4 1.Advantages of upgrading OS using multi-processor 4 2.Steps to Upgrade the Processor and The Core 5 3.Requirements this will support for the upgrade. 5 3.Scheduling Algorithms 6 4.OS Concurrency Mechanism 11 5.OS Security Risks and Mitigation Strategy 12 6.Future Considerations Using Emerging Technology 13 Project Outline Brief Description The organization I intend to use in this scenario is Western Acoustics, Inc. We shall upgrade the changes considered for computer networks and operating systems to handle both near and future tasks. This construction company’s requirements are cost-effective and raise the output of the company. The services offered by this organization in both commercial settings and real estate are painting, installation, metal stud framing, acoustical ceiling, painting, maintenance, and drywall. I have been in the company for two years, working part-time while being an undergraduate. In this company am working as an IT consultant agent to report on its framework requirement progressively. Thus, I have much experience in the networking and operating system of the company’s IT infrastructure. Summary for current OS use The head offices of the company are in Tempe, Arizona. Currently, they pose a material and workshop warehouse. The office building has several office spaces and operating system (OS) concurrency. Also, there is one room considered for conferences. They aim to have a technical specialty for security mitigation where they currently depend on software to secure the systems. The security packages are antimalware, antiviruses, and web-protection mechanisms. The primary software that they concurrently use in their operations is Microsoft 0ffice 365. Other software includes estimating, timesheet data for employees, and construction mock-up software. They are operating without a server, and they depend on a single processor with multiple cores within each computer, which is 9 of them. Each computer is running on a Windows XP 32-bit operating system. Western Acoustics, Inc requires an outfit in their operation to upgrade their outdated windows XP OS and technological upgrades constantly. Since April 2014, Windows XP has discontinued its security updates on OS concurrency Core and processor (Fisher, 2014). 2. OS Processor and Core Advantages of upgrading OS using multi-processor Suppose the company installs a new OS capable of handling security updates in multicore inside the computers. In that case, there will be a significant change in their working efficiency and output for a single input. The company will also experience less or no trafficking since it will be a one-chip with cores integrated, ensuring less time to give an output. This will assist on the merits of time-saving. Also, the company will benefit by saving costs by using a multicore system compared to using a multi-processor system; this is expected to reduce the number of CPUs in each computer they purchase and what they shall put in their office. This is likely because a single multi-processor system has some advantages, such as performing a single task at a given time. This is effective and relieves the computer’s CPU from disk scheduling (Fisher, 2014). When more work is done in less time, this shows that is the respective increase in throughout. The advantage of multiple processors is that they can run parallel to the other, increasing the system performance. Thus, according to CCM (2018), multi-processing involves operating numerous processors parallel to get a higher calculation power than expected when using a high-end processor to increase chances if there is damage to one processor. If the company switches to the latest OS, Windows 11 Pro, there will be minimum expectations for the required setup. Steps to Upgrade the Processor and The Core I will need to use PowerPoint presentations to exhibit the organization’s advantages from having other chips and OS. After endorsement, check what OS type is being used and processor model expected to be utilized, motherboard type, force supply, and ultimately how much RAM they each have, essentially the organization’s computer details. An evaluation of the organization and computer system. One more initial step to take before the relocation is to reinforce every one of the computers. On the off chance that something falls flat, we will securely have every one of the organization’s records. Requirements this will support for the upgrade. All the upgrades can support software used by the company. Recapping some of the software, Western Acoustics, Inc will use Office 365, Zayzoom for development, On-Screen Takeoff to estimate their solutions, and the last but not the least is NationalPEO for employee and timekeeping. References CCM (March 2018) Operating System. Internet Archaeology. Retrieved https://ccm.net/contents/664-operating-system Fisher, T (March 2020) Lifewire. “Microsoft Windows XP” Retrieved https://www.lifewire.com/windows-xp-2626354 Scheduling Algorithms One of the algorithms that could be selected is the First Come First Served scheduling algorithm. In a virtual environment, this algorithm is non-preemptive and the first process to arrive in the scheduler is allowed to run to completion, regardless of whether the process effectively uses the resources. The FCFS scheduling algorithm does not consider if there is a queue of other processes waiting to use the resources or even whether the processes waiting to use the resources have higher priority/importance compared to the process already running. In case we have 5 VM’s and at any instance all the VM’s are free, then each of the five hosts a process to each of the VM’s based on the allocation needs of the user. Execution will be improved, and the ready state will have a lesser number of processes at any instance. In a non-virtual environment, a single computer system is used thus the allocation of processes is based on the availability of the CPU. This means that the FCFS could be slower in a non-virtual environment as one process will be executed at a time based on the processes that came early while later tasks will have to wait regardless of the priority. The other scheduling algorithms that I would recommend implementing is the Round Robin scheduling algorithm. The Round Robin scheduling algorithm is a pre-emptive type of scheduling algorithm. This means that it prioritizes the scheduler to allow processes or tasks that are running and have low priority to be pre-emptied when a high-priority task or process enters a ready state. This algorithm focuses on the equal distribution of the processes by allocating equal time slices, known as quantum. In a virtual environment, the scheduler will assign each of the VM hosts a process until each of the available nodes is assigned a process. High priority processes can be attended to through context switching by any of the nodes. One of the challenges is that power consumption will be greater since the nodes will be kept on standby for longer periods. In a non-virtual environment, a single computer system will have to handle the processes based on the time quantum before the next process in the queue is executed. There will be higher average wait times due to waiting for the quantum to expire although power consumption will be reduced. All processes in a Round Robin scheduling algorithm are assigned a fixed amount of time to execute. This fixed amount of time is known as a quantum. Once each of the processes is executed for the given quantum, they are pre-emptied and other processes are executed for their given time period (Fiad, Maaza, & Bendoukha, 2020). The Round Robin scheduling algorithm uses context switching to save states of the pre-emptied processes when a low priority process has to be pre-emptied to allow a high priority process to be attended to. The scheduling algorithm that seems more effective in both the virtual and non-virtual environment would be the Shortest Job First (SJF). When compared to the other operating system scheduling algorithms, the SJF would be best suited for handling the processes because processes that are I/O bound will take the least time in the CPU compared to the processes that are CPU-bound. The user experience will be enhanced greatly because processes that take the least time will be solves faster rather than waiting in the queue as it would happen for FCFS. Similarly, the Round Robin scheduling algorithm could waste CPU time during context switching, thus not the best option. Environment Chosen The environment will be a virtual environment. A virtualized environment will allow us to use lesser hardware by allowing us to run multiple operating systems or application servers to the existing physical hardware. This will help to reduce the costs of purchasing new hardware. Benefits and Challenges Benefits of the Scheduling Algorithms The FCFS scheduling algorithm is easy to understand and implement. This scheduling algorithm also seems very fair because the first process to be submitted to the scheduler is the process that will be run first. The Round Robin scheduling algorithm is pre-emptive which makes it drastically improve the average response time. In this scheduling algorithm, each task is limited to a certain time period known as a quantum, ensuring that the operating system effectively cycles through all the tasks that are ready (Fiad, Maaza, & Bendoukha, 2020). All the processes will be allowed the opportunity to run, ensuring fairness in accessing the CPU as a resource. The Round Robin scheduling algorithm is also easy to implement whereby the worst-case scenario response time for processes can be predicted when the number of processes on the running queue is known. Challenges of the Scheduling Algorithms One of the challenges of the FCFS scheduling algorithm is that it has poor performance because the average wait time tends to be higher compared to other scheduling algorithms. High-priority tasks may have to wait longer, leading to longer average wait times (Krishna, 2018). This is because high-priority processes may have to wait longer to be executed compared to tasks or processes that were submitted earlier but having low priority as tasks that are submitted first are run first without prioritizing processes. For interactive jobs, the FCFS scheduling algorithm may thus not be suitable. Furthermore, processes that may run for longer periods may delay the tasks that will have to be run after them. On the other hand, the Round Robin scheduling algorithm faces the challenge of assigning all processes an equal amount of time. This is not a good idea because highly interactive processes tend to be scheduled equally to CPU-bound processes References Fiad, A., Maaza, Z. M., & Bendoukha, H. (2020). Improved Version of Round Robin Scheduling Algorithm Based on Analytic Model. International Journal of Networked and Distributed Computing, 8(4), 195-202. Krishna, M. V. (2018). Big Data Processing using First Come First Served (FCFS) Algorithm. International Journal of Computer Science and Mobile Computing, 7(7), 83-87. OS Concurrency Mechanism OS Security Risks and Mitigation Strategy Future Considerations Using Emerging Technology