Computers and Technology, 19.03.2020 02:07 uchechukwueigwe

There are 12 tasks: an input task, 10 computation tasks, and an output task. Each of the 12 tasks can be accomplished in 1 unit of time on one processor. The input task must complete before any computational tasks begin. Likewise, all 10 computational tasks must complete before the output task begins. The input task consumes the entire bandwidth of the input device. The output task consumes the entire bandwidth of the output device.

(a) What is the maximum speedup that can be achieved if this problem is solved on two processors? (Hint: Processors do not have to receive the message elements in order.)
(b) What is an upper bound on the speedup that can be achieved if this problem is solved with parallel processors?
(c) What is the smallest number of processors sufficient to achieve the speedup given in part (b)?
(d) What is the maximum speedup that can be achieved solving five instances of this problem on two processors? Continue to assume that there is one input device and one output device.
(e) What is an upper bound on the speedup that can be achieved solving 100 instances of this problem with parallel processors? Continue to assume that there is one input device and one output device.
(f) What is the smallest number of processors sufficient to achieve the speedup given in part (e)?

Answers: 2

Show answers

Another question on Computers and Technology

Computers and Technology, 22.06.2019 02:10

3. (5 points) describe what would be printed by the code below or what error would occur. const char* cstr = "0123456"; const char* ptr = & cstr[4]; cout < < ptr[-1] < < ptr < < endl; 1 4. (5 points) theseus has been trapped in a maze with a minotaur, which is trying to capture him. each round, theseus and the minotaur move through the maze; theseus towards the exit, and the minotaur towards theseus. theseus can move in any of the four cardinal directions, or he can wait for a round to see how the minotaur moves. write code that creates a data type to represent the possible moves that theseus could make.

Answers: 3

Answer

Computers and Technology, 22.06.2019 13:50

The instruction ishl (shift left integer) exists in jvm but not in ijvm. it uses the top two values on the stack, replacing the two with a single value, the result. the sec- ond-from-top word of the stack is the operand to be shifted. its content is shifted left by a value between 0 and 31, inclusive, depending on the value of the 5 least signifi- cant bits of the top word on the stack (the other 27 bits of the top word are ignored). zeros are shifted in from the right for as many bits as the shift count. the opcode for ishl is 120 (0x78).a. what is the arithmetic operation equivalent to shifting left with a count of 2? b. extend the microcode to include this instruction as a part of ijv.

Answers: 1

Answer

Computers and Technology, 22.06.2019 14:00

What are procedures that keep a data base current

Answers: 1

Answer

Computers and Technology, 23.06.2019 15:30

1. ask the user how many questions are in the quiz. 2. ask the user to enter the key (that is, the correct answers). there should be one answer for each question in the quiz, and each answer should be an integer. e.g., 34 7 13 100 81 3 9 10 321 12 might be the key for a 10-question quiz. you will need to store the key in an array. 3. ask the user to enter the answers for the quiz to be graded. there needs to be one answer for each question. note that these answers do not need to be stored; each answer can simply be compared to the key as it is entered. 4. when the user has entered all of the answers to be graded, print the number correct and the percent correct. 5. add a loop so that the user can grade any number of quizzes with a single key. after the results have been printed for each quiz, ask "grade another quiz? (y/n)." note: you only have one array (the key). you are not creating a new key for each set of quiz answers.

Answers: 3

Answer

You know the right answer?

There are 12 tasks: an input task, 10 computation tasks, and an output task. Each of the 12 tasks ca...

Questions