Primary Task Response: Within the Discussion Board area, write 400–600 words that respond to the following questions with your thoughts, ideas, and comments. This will be the foundation for future discussions by your classmates. Be substantive and clear, and use examples to reinforce your ideas:Virtual machine environments and nonvirtual or real-time machine environments each have their own challenges with selecting an operating system configuration with the most effective process-scheduling algorithms.Investigate the library and Internet for information about process-scheduling algorithms used in operating systems for virtual machine and nonvirtual machine environments.Select at least 2 operating system process-scheduling algorithms, and compare and contrast their effectiveness in a virtual machine environment and in a nonvirtual environment.Which scheduling algorithm is effective in both a virtual machine and non-virtual machine or real-time environment? Defend your answer.Responses to Other Students: Respond to at least 2 of your fellow classmates with at least a 100-word reply about their Primary Task Response regarding items you found to be compelling and enlightening. To help you with your discussion, please consider the following questions:What did you learn from your classmate’s posting?What additional questions do you have after reading the posting?What clarification do you need regarding the posting?What differences or similarities do you see between your posting and other classmates’ postings?
Primary Task Response: Within the Discussion Board area, write 400–600 words that respond to the following questions with your thoughts, ideas, and comments. This will be the foundation for future dis
Janet Fematt 09/24/2021 Select at least 2 operating system process-scheduling algorithms and compare and contrast their effectiveness in a virtual machine environment and in a nonvirtual environment. In process-process scheduling there is different processes that are assigned to place the CPU in its scheduling algorithm, there are six most used process when it comes to scheduling algorithms in which they will be explained what they are down below, First come, first served (FCFS) Scheduling Shortest-Job-Next (SJN) Scheduling Priority Scheduling Shortest Remaining Time Round Robin (RR) Scheduling Multiple-Level Queues Scheduling There are only two to be chosen to compare and contrast the effectiveness in the virtual machine environment and in the nonvirtual environment they are: First Come First Serve (FCFS) These jobs are executed on the first come, first serve basis it is also a non-preemptive and pre-emptive scheduling algorithm. This algorithm is also easy to understand and implement, the implementation can be based on the FIFO queue. When the CPU requests information first it gets connected and executed. This is a operating system scheduling algorithm that can automatically execute tasks that are requested in the process of the arrival. This is also one of the simplest CPU scheduling algorithms. The pros of using a First Come First Serve (FCFS) is that it is the simplest form of a CPU scheduling algorithm. It can also be easy to program, first come first served. Shortest Job Next (SJN) This is also known as shortest job first (SJF) this algorithm is a process that has the smallest execution time in which it can be chosen for the next execution. The scheduling method can be preemptive or non preemptive. This algorithm shortens the waiting time for other processes that awaits execution. When a job is completed, each job is associated with a unit of time that can be completed. When there is an algorithm method it can be helpful to batch the type of processing, this means that waiting for jobs to be completed can be critical. Which Scheduling algorithm is effective in both a virtual machine and nonvirtual machine or real time environment? Defend your answer. The effective algorithm for a real time perspective is going to be the shortest job next algorithm, this algorithm has the ability to switch from to ways in which the CPU executes a task. Its sorts the process depending on the arrival time, it also selects the process in which there can be a minimum arrival time and minimum burst time for a real time environment. Alonzo Williams Sun 9/26/2021 12:23 AM LikeUnit 2 – Discussion Board Like PostFlagUnit 2 – Discussion Board Flag Post In a single-processor Operating System only process can run at a time. Any others must wait until the CPU is free and can be rescheduled. The objective of multiprogramming is to have some type of process running at all the times to maximize CPU utilization. When one process must wait, the Operating System takes the CPU away from that process and give the CPU to another process and this becomes a cycle. Selecting Two Operating System Process-Scheduling Algorithms The (First-Come, First-Served Scheduling Algorithm) FCFS is an algorithm that is by far the simplest CPU-Scheduling algorithm. The process that requests the CPU first is allocated the CPU first. The implementation of the FCFS policy is easily managed with a FIFO queue. The queue has a tail element, middle element(s), and a head element. When a process enters the ready queue, its PCB (Process Control Block) is linked onto the tail of the queue. When the CPU is free, it is allocated to the process at the head of the queue. The Shortest Job First (SJF) Scheduling Algorithm is associated with each process the length of the process’s next CPU burst. When the CPU is available, it is assigned the process that has the smallest next CPU burst. If the next CPU burst are the same, FCFS is used to break the tie. The SJF Algorithm can be preemptive or non-preemptive. A more appropriate term for the SJF could be Shortest-Next-CPU-Burst Algorithm because scheduling depends on the length of the next CPU burst of a process, rather than its total length. Compare and Contrast their Effectiveness in a Virtual Machine Environment and in a Nonvirtual Environment. Disadvantage of FCFS can be the average wait time which can be exceptionally long if the process is not first acquiring CPU utilization. Burst Time will be longer for the first process and shorter for other processes. The FCFS scheduling algorithm is non preemptive. Once the CPU has been allocated to a process, that process keeps the CPU until it releases the CPU, either by terminating or by requesting disk I/O. This could create a problem in a Non-Virtual Environment. But, in Virtual Machines Environments CPUs, Memory, and more resources in Cloud Computing can be easily allocated to accommodate performance bottlenecks. The FCFS is better for a small burst time beneficial for both non-virtual and virtual. The SJF is better if the process comes to processor simultaneously and does not affect either system. FCFS is the simplest scheduling algorithm, FIFO simply queues processes in the order that they arrive in the ready queue. First Come First Served Scheduling Algorithm provides high response time for the processes. SJF is also non-preemptive, but its preemptive version is also there called Shortest Remaining Time First (SRTF) algorithm. My Summary and Which Scheduling Algorithm is Effective in both a Virtual Machine and Non-Virtual Machine or real-time Environment along with Defending my Answer. Processor manufacturers AMD and Intel added functionality to their processors to enhance performance with hypervisors. AMD-V and Intel’s VT-x designate the hardware-assisted virtualization extensions that the hypervisors can take advantage of during processing. Intel processors offer an extra instruction set called Virtual Machine Extensions (VMX). This type of technology best supports First Come First Served Scheduling Algorithm (FSCS) because of the small burst time and high response time. Once ERP type Applications and others are tuning properly down to the SQL Statements, the SQL Statements can run in milliseconds or seconds allowing for enough time for completion. This type of performance makes users happy and batch processing timing more efficient.
Why Choose Us
- 100% non-plagiarized Papers
- 24/7 /365 Service Available
- Affordable Prices
- Any Paper, Urgency, and Subject
- Will complete your papers in 6 hours
- On-time Delivery
- Money-back and Privacy guarantees
- Unlimited Amendments upon request
- Satisfaction guarantee
How it Works
- Click on the “Place Order” tab at the top menu or “Order Now” icon at the bottom and a new page will appear with an order form to be filled.
- Fill in your paper’s requirements in the "PAPER DETAILS" section.
- Fill in your paper’s academic level, deadline, and the required number of pages from the drop-down menus.
- Click “CREATE ACCOUNT & SIGN IN” to enter your registration details and get an account with us for record-keeping and then, click on “PROCEED TO CHECKOUT” at the bottom of the page.
- From there, the payment sections will show, follow the guided payment process and your order will be available for our writing team to work on it.