Trending Bestseller

Program scheduling and simulation in an operating system environment

bernard lampard

No reviews yet Write a Review
Paperback / softback
18 February 2014
$127.00
Ships in 3-5 business days
Hurry up! Current stock:
Research Paper (postgraduate) from the year 2011 in the subject Computer Science - Commercial Information Technology, grade: A, Massachusetts Institute of Technology, language: English, abstract: CPU scheduling is a technique used by computer operating systems to manage the usage of the computer's central processing unit. In a multi-programming environment whereby several processes are running on the same processor, it is essential to use scheduling criteria to avoid collisions in the computer's operations. This will help users in a given information technology oriented firm to share server spaces and resources like printers and file storage spaces. In the multi-tasking environment, a program called CPU scheduler selects one of the ready processes and allocates the processor to it. There are a number of occasions when a new process can or must be chosen to run: When a running process block and changes its state to 'Blocked', When a timer for a running process expires, When a waiting process unblocks and changes its state to 'Ready', and When a running process terminates and changes its state to 'Exit' (Wikipedia, 2013). Different types of scheduling programs referred to as algorithms can be employed in CPU scheduling instances. Among the most popular scheduling algorithms is Shortest Job First (SJF). SJF gives the processor to the process with the shortest next time allocation known as the burst. If there are processes with similar CPU bursts in the event queue, the scheduler uses First Come First Served algorithm which allocates the first process to arrive in the queue to the processor regardless of its burst time. It operates under the assumption that the length of the next CPU burst of each of the processes in ready queue is known (CPU scheduling, 2013). The SJF algorithm can be used in both pre-emptive and non-preemptive methods. The algorithm can be preemptive or not.Shortest Job First with preemption uses priority measure to determine the next process to be

This product hasn't received any reviews yet. Be the first to review this product!

$127.00
Ships in 3-5 business days
Hurry up! Current stock:

Program scheduling and simulation in an operating system environment

$127.00

Description

Research Paper (postgraduate) from the year 2011 in the subject Computer Science - Commercial Information Technology, grade: A, Massachusetts Institute of Technology, language: English, abstract: CPU scheduling is a technique used by computer operating systems to manage the usage of the computer's central processing unit. In a multi-programming environment whereby several processes are running on the same processor, it is essential to use scheduling criteria to avoid collisions in the computer's operations. This will help users in a given information technology oriented firm to share server spaces and resources like printers and file storage spaces. In the multi-tasking environment, a program called CPU scheduler selects one of the ready processes and allocates the processor to it. There are a number of occasions when a new process can or must be chosen to run: When a running process block and changes its state to 'Blocked', When a timer for a running process expires, When a waiting process unblocks and changes its state to 'Ready', and When a running process terminates and changes its state to 'Exit' (Wikipedia, 2013). Different types of scheduling programs referred to as algorithms can be employed in CPU scheduling instances. Among the most popular scheduling algorithms is Shortest Job First (SJF). SJF gives the processor to the process with the shortest next time allocation known as the burst. If there are processes with similar CPU bursts in the event queue, the scheduler uses First Come First Served algorithm which allocates the first process to arrive in the queue to the processor regardless of its burst time. It operates under the assumption that the length of the next CPU burst of each of the processes in ready queue is known (CPU scheduling, 2013). The SJF algorithm can be used in both pre-emptive and non-preemptive methods. The algorithm can be preemptive or not.Shortest Job First with preemption uses priority measure to determine the next process to be

Customers Also Viewed

Buy Books Online at BookLoop

Discover your next great read at BookLoop, Australiand online bookstore offering a vast selection of titles across various genres and interests. Whether you're curious about what's trending or searching for graphic novels that captivate, thrilling crime and mystery fiction, or exhilarating action and adventure stories, our curated collections have something for every reader. Delve into imaginative fantasy worlds or explore the realms of science fiction that challenge the boundaries of reality. Fans of contemporary narratives will find compelling stories in our contemporary fiction section. Embark on epic journeys with our fantasy and science fiction titles,

Shop Trending Books and New Releases

Explore our new releases for the most recent additions in romance books, fantasy books, graphic novels, crime and mystery books, science fiction books as well as biographies, cookbooks, self help books, tarot cards, fortunetelling and much more. With titles covering current trends, booktok and bookstagram recommendations, and emerging authors, BookLoop remains your go-to local australian bookstore for buying books online across all book genres.

Shop Best Books By Collection

Stay updated with the literary world by browsing our trending books, featuring the latest bestsellers and critically acclaimed works. Explore titles from popular brands like Minecraft, Pokemon, Star Wars, Bluey, Lonely Planet, ABIA award winners, Peppa Pig, and our specialised collection of ADHD books. At BookLoop, we are committed to providing a diverse and enriching reading experience for all.