what is Shortest-Remaining-Time (SRT) Scheduling?, Basic Computer Science

what is Shortest-Remaining-Time (SRT) Scheduling?, Basic Computer Science

Assignment Help:

• The SRT is the preemptive complement of SJF and helpful in time-sharing environment.
• In SRT scheduling, the process with the least estimated run-time to completion is run next, counting new arrivals.
• In SJF scheme, once a job begins executing, it run to end.
• In SJF scheme, a running progression may be preempted by a new arrival process with shortest predictable run-time.
• The algorithm SRT has higher transparency than its counterpart SJF.
• The SRT must keep track of the beyond time of the running process and must grip occasional preemptions.
• In this scheme, advent of small processes will run almost without delay. on the other hand, longer jobs have even longer mean waiting time.

Related Discussions:- what is Shortest-Remaining-Time (SRT) Scheduling?

Microprocessor, what is computer mapped input / output

what is computer mapped input / output

Data communications, Data communication as a need developed in the 1960s wi...

Data communication as a need developed in the 1960s with the interconnection of peripheral devices to mainframe computers. Within the immediate vicinity of the mainframe computer t

Differentiate between a dynamic and a static web site, QUESTION a) Diff...

QUESTION a) Differentiate between a dynamic and a static web site. b) Why are electronic mails (e-mails) preferred to the post office mails? How do they affect the modern of

C language, parent and child process using c language

parent and child process using c language

Microprocessor, 8088 timing system diagram

8088 timing system diagram

Outdoor patient department features - a doctor module, A Doctor Module ...

A Doctor Module Doctor has a list of the patients waiting for consultation. The doctor's module should include all the following details: Fields for common complaint

How to avoid race conditions with critical section?, • The key to preventi...

• The key to preventing problem involving shared storage is get some way to prohibit more than one process from reading and writing the shared data concurrently. That part of the p

Application-specific multiprocessors, Application-Specific Multiprocessors ...

Application-Specific Multiprocessors Although this book details a variety of similar architectures, it specializes in the design of such architectures in the perspective of par

Explain the concept of knowledge discovery in database, Question 1 Explain...

Question 1 Explain the concept of knowledge discovery in database Question 2 Discuss the following types of Multidimensional Data Models Stars, Snowflakes and

Cryptography, For which X,Y in {o, O, Theta, Omega, omega}, do the relation...

For which X,Y in {o, O, Theta, Omega, omega}, do the relationships t(n)+t''(n) = X(min(t(n),t''(n))) and t(n)+t''(n) = Y(max(t(n),t''(n))) hold for all t,t'' such that t(n),t''(n)

Write Your Message!

Name

Email id

Message

Verfication Code

Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

Submit Assignment

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd