Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Parallelism based on Granularity size
Granularity: Granularity or Grain size is a determine which measure how much computation is devoted in a process.Granularity size is determined by counting the number of instructions in a program section. The following types of grain sizes have been recognized (shown in Figure):
1) Fine Grain: This type includes approximately less than 20 instructions.
2) Medium Grain: This type includes approximately less than 500 instructions.
3) Coarse Grain: This type includes approximately greater than or identical to one thousand instructions.
Based on these Granularity sizes, parallelism can be specified at various stages in a program. These parallelism stages form a hierarchy according to which, lower the level, the greater is the granularity of the process. The degree of parallelism reduces with increase in level. Every stages according to a granularity size demands scheduling and communication overhead. Following are the parallelism levels (shown in Figure ):
Why address bus is unidirectional and data bus is bidirectional? Ans) Because there is no require address transaction among processor and peripheral device but data bus is req
Commutatively of Connectives You will be aware from the fact that some arithmetic operators have a property that it does not matter which way around you give the operator input
How do you make programs portable on Unix and Does under such circumstances? Constructors are invoked themself when the object is created for a class. There may be any number o
(a) Write short notes on displacement only addressing mode. (b) Explain the formats of a 80-bit floating point number. (c) Given the following assembly program. Instructi
Q Explain Instruction cycle and Execution cycle. and also explain Instruction Counter, Memory Address Register and Memory Buffer Register.
Suppose that a process scheduling algorithm favors those processes that have used the least processor time in the recent past. Why will this algorithm favour I/O- bound processes,
Differentiate between non-relocatable self relocatable programs. A non-relocatable program is one which cannot be executed in any memory area other than the area starting at
1. Write the function makegrid. This function accepts a width and height and creates a grid/matrix of cells. The width gives the number of columns and the height the number of rows
Q. Versions of small computer systems interface? SCSI-1 calls for a cable with 8 data wires plus one for parity. SCSI-2 allows use of multiple cables to support 16- or
Define the Information System Growing sophistication in products and markets is driving the organisational requirement for increasing amounts of information. This req
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!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd