multicore processor with 4 cores has 15 attached tape drives. There is a large number of jobs submitted to the system that each requires exactly 4 tape drives to complete execution. Assume that each job runs on 4 tapes for the entire duration of its execution. Also assume an endless supply of such jobs. The scheduler in the operating system will not start a job unless there are 4 tape drives available. When a job is started, 4 drives are utilized immediately for its execution and are not released until the job finishes. a) What is the maximum number of jobs that can be in progress at once? b) What are the maximum number of tape drives that may be left idle at a given time as a result of this policy? c) What are the minimum number of tape drives that may be left idle at a given time as a result of this policy
multicore processor with 4 cores has 15 attached tape drives. There is a large number of jobs submitted to the system that each requires exactly 4 tape drives to complete execution. Assume that each job runs on 4 tapes for the entire duration of its execution. Also assume an endless supply of such jobs. The scheduler in the operating system will not start a job unless there are 4 tape drives available. When a job is started, 4 drives are utilized immediately for its execution and are not released until the job finishes. a) What is the maximum number of jobs that can be in progress at once? b) What are the maximum number of tape drives that may be left idle at a given time as a result of this policy? c) What are the minimum number of tape drives that may be left idle at a given time as a result of this policy
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
multicore processor with 4 cores has 15 attached tape drives. There is a large number of jobs submitted
to the system that each requires exactly 4 tape drives to complete execution. Assume that each job runs
on 4 tapes for the entire duration of its execution. Also assume an endless supply of such jobs. The
scheduler in the
is started, 4 drives are utilized immediately for its execution and are not released until the job finishes.
- a) What is the maximum number of jobs that can be in progress at once?
- b) What are the maximum number of tape drives that may be left idle at a given time
as a result of this policy?
- c) What are the minimum number of tape drives that may be left idle at a given time
as a result of this policy?
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps with 2 images
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education