· 3 operational steps of computer systems· 5 functional units of computer systems· Server· SupercomputingServer?· Machine’s view point: Equipped with very powerful processing unit, huge main...

1 answer below »

I have a midterm exam with 16 questions

It includes multiple choice, true and false, and questions that need to be solved

I need expert help with the exam.

In the attachments, you will find all the lecture notes included in the test



· 3 operational steps of computer systems · 5 functional units of computer systems · Server · Supercomputing Server? · Machine’s view point: Equipped with very powerful processing unit, huge main memory, and fast I/O devices to support very high-performance computation. · Service’s view point: Big database, equipped with capability to handle multiple simultaneous requests from its client computers. Example) Consider DNS server What is the first action your computer has to take when you type www.google.com on your browser? Contact DNS server to get an IP address of the given domain name. You know my name but you need my telephone number to call me. You typed domain name (google.com) but your computer needs IP address of google.com Human being likes to use mnemonic expression but machine likes to use numeric expression. Numeric expression vs. Mnemonic expression ------------------------------------------------------------------- SSN (123-45-6789) Name (Jinsuk Baek) IP (126.21.10.8) Domain name (www.google.com) Google server DNS Server D.N IP addr. google 126.21.10.8 facebook 152.15.234.86 ….. ….. Your PC www.google.com 126.21.10.8 Convert this to binary 01111110000101010000101000001000 32 bits Requirements of Server: · Reliable · Available · Scalable · Secure Supercomputer Supercomputing Technology Supercomputer vs. Desktop PC $1 million $1000 (X 50 performance) Supercomputing technology Parallel Cluster Computing · Need space equipped with AC 24/7 · Need operator to reside in the server room · Introduce additional maintenance cost Distributed Grid Computing · Eliminate space limitation of parallel cluster computing · What about the performance? · Need conditions · Network bandwidth should be very sufficient and its associated network speed is fast enough · Most of computer systems are in idle status in most of time Assumption: · 10% of time Active Busy status · 90% of time Inactive Idle status Performance analysis for feasibility of distributed grid computing: Let us consider the following five computer systems and its probability distribution in terms of activity. PC1 PC2 PC3 PC4 PC5 Active (Busy) 10% (= 0.1) 10% (= 0.1) 10% (= 0.1) 10% (= 0.1) 10% (= 0.1) Inactive (Idle) 90% (= 0.9) 90% (= 0.9) 90% (= 0.9) 90% (= 0.9) 90% (= 0.9) Percentage (%) Probability (Decimal) X (1/100) % X (1/100) 10% 10 X (1/100) 10/100 0.1 30% 30 X (1/100) 30/100 0.3 90% 90 X (1/100) 90/100 0.9 In probability, “AT THE SAME TIME” interpret as “AND” ( Multiplication). Example) Let us toss a dice (on left hand) and a coin (on right hand) at the same time. How many different cases we will have? Dice 1, 2, 3, 4, 5, 6 6 cases Coin Front, Back 2 cases 6 X 2 = 12 cases What is a probability that there is no available computing resource for me at the same time? What happens in this case? All five computers are in busy status at the same time. (PC1 is active) X (PC2 is active) X (PC3 is active) X (PC4 is active) X (PC5 is active) = 0.1 X 0.1 X 0.1 X 0.1 X 0.1 = 0.00001 What is a probability that there are at most 2 active computer systems? What happens in this case? There will be at least 3 available computer systems for me. There is no active computer + There is 1 active computer + There are 2 active computers 1 X (0.1)0 X (0.9)5 + 5 X (0.1)1 X (0.9)4 + 10 X (0.1)2 X (0.9)3 nCr = 5C0 = = = 1 5C1 = = = 5 5C2 = = = 10 Probability that there is no active computer 5C0 X (0.1)0 X (0.9)5 = 1 X (0.1)0 X (0.9)5 0.9 X 0.9 X 0.9 X 0.9 X 0.9 = (0.1)0 X (0.9)5 Probability that there is 1 active computer 5C1 X (0.1)1 X (0.9)4 = 5 X (0.1)1 X (0.9)4 0.1 X 0.9 X 0.9 X 0.9 X 0.9 = (0.1)1 X (0.9)4 + 0.9 X 0.1 X 0.9 X 0.9 X 0.9 = (0.1)1 X (0.9)4 + 0.9 X 0.9 X 0.1 X 0.9 X 0.9 = (0.1)1 X (0.9)4 + 0.9 X 0.9 X 0.9 X 0.1 X 0.9 = (0.1)1 X (0.9)4 + 0.9 X 0.9 X 0.9 X 0.9 X 0.1 = (0.1)1 X (0.9)4 Probability that there are 2 active computers 5C2 X (0.1)2 X (0.9)3 = 10 X (0.1)2 X (0.9)3 0.1 X 0.1 X 0.9 X 0.9 X 0.9 = (0.1)2 X (0.9)3 + 0.1 X 0.9 X 0.1 X 0.9 X 0.9 = (0.1)2 X (0.9)3 + 0.1 X 0.9 X 0.9 X 0.1 X 0.9 = (0.1)2 X (0.9)3 + 0.1 X 0.9 X 0.9 X 0.9 X 0.1 = (0.1)2 X (0.9)3 + 0.9 X 0.1 X 0.1 X 0.9 X 0.9 = (0.1)2 X (0.9)3 + 0.9 X 0.1 X 0.9 X 0.1 X 0.9 = (0.1)2 X (0.9)3 + 0.9 X 0.1 X 0.9 X 0.9 X 0.1 = (0.1)2 X (0.9)3 + 0.9 X 0.9 X 0.1 X 0.1 X 0.9 = (0.1)2 X (0.9)3 + 0.9 X 0.9 X 0.1 X 0.9 X 0.1 = (0.1)2 X (0.9)3 + 0.9 X 0.9 X 0.9 X 0.1 X 0.1 = (0.1)2 X (0.9)3 There is no active computer + There is 1 active computer + There are 2 active computers 1 X (0.1)0 X (0.9)5 + 5 X (0.1)1 X (0.9)4 + 10 X (0.1)2 X (0.9)3 = 0.59049 + 0.32805 + 0.0729 = 0.99144 99.144% More than 99% More than 99% of time, there are at least 3 computer resources for me. Probability Time domain (1 day) 1 minute = 60 seconds 1 hour = 60 minutes = 60 X 60 seconds = 3600
Answered 6 days AfterOct 28, 2022

Answer To: · 3 operational steps of computer systems· 5 functional units of computer systems· Server·...

Dr Raghunandan G answered on Nov 04 2022
47 Votes
Name:     
·
Time allowed is 75 minutes.
· There are 7 questions totaling 20 points.
1. Briefly answer the following questions.
a. [1 point] What is an advan
tage of time-sharing system over the batch system?
    It provides the advantage of quick response. This type of operating system avoids duplication of software. It reduces CPU idle time.
b. [2 points] Even though the time-sharing system has advantage over the batch system, what computational and system overhead can be introduced by the time-sharing system?
Since Time sharing Utilizes CPU scheduling and multiprogramming to allocate a tiny amount of a shared computer to each user simultaneously. Each user's memory has at least one distinct program. When a program is loaded into memory and executed, it executes for a brief length of time prior to completion or to finish I/O. This brief interval during which a user receives CPU attention is known as a time slice, time slot, or quantum. Typically, it ranges between 10 and 100 milliseconds. The complexity of time shared operating systems is greater than that of multiprogrammed operating systems. In both cases, many jobs must be stored in memory concurrently, necessitating memory management and security.

2. Consider the following set of processes, with the length of the CPU execution time given in milliseconds. The processes are assumed to have arrived in the order P1, P2, P3, P4, P5 at the following times.

Process     Arrival Time    Execution Time
-----------------------------------------------------
P1 0      20
P2 10      30
P3 20      10
P4 30      40
P5 40      10

a. [2 points] Draw CPU grant chart that illustrates the execution of these processes using the SJF with non-preemptive scheduling.

    P1
    P3
    P2
    P5
    P4
0 20 30 60 70 110

b. [2 points] Calculate the average waiting time over all processes?
    Process
    Arrival Time
    Burst Time
    Finish Time
    Turnaround Time
    Waiting Time
    P1
    0
    20
    20
    20
    0
    P2
    10
    30
    60
    50
    20
    P3
    20
    10
    30
    10
    0
    P4
    30
    40
    110
    80
    40
    P5
    40
    10
    70
    30
    20

Average waiting time= 80/5 = 16





c. [2 points] Draw CPU grant chart that illustrates the execution of these processes using the SJF with preemptive scheduling.
...
SOLUTION.PDF

Answer To This Question Is Available To Download

Related Questions & Answers

More Questions »

Submit New Assignment

Copy and Paste Your Assignment Here