Computers and Technology, 26.11.2019 21:31 Mendi1026
The following fortran program is to be executed on a computer, and a parallel version is to be executed on a 32-computer cluster. l1: do 10 i = 1, 1024 l2: sum(i) = 0 l3: do 20j = 1, i l4: 20 sum(i) = sum (i) + 1 l5: 10 continue suppose lines 2 and 4 each take two machine cycle times, including all processor and memory-access activities. ignore the overhead caused by the software loop control statements (lines 1,3,5) and all other system overhead and resource conflicts.
a. what is the total execution time (in machine cycle times) of the program on a single computer?
b. divide the i-loop iterations among the 32 computers as follows: computer 1 executes the first 32 iterations (i= 1 to 32), processor 2 executes the next 32 iterations, and so on. what are the execution time and speedup factor compared with part (a)? (note that the computational workload, dictated by the j-loop, is unbalanced among the computers).
c. explain how to modify the parallelizing to facilitate a balanced parallel execution of all the computational workload over 32 computers. by a balanced load is meant an equal number of additions assigned to each computer with respect to both loops.
d. what is the minimum execution time resulting from the parallel execution on 32 computers? what is the resulting speedup over a single computer?
Answers: 3
Other questions on the subject: Computers and Technology
Computers and Technology, 21.06.2019 22:00, blackjack73
3. (6 pts) internally in the computer, with few exceptions, all numerical computation is done using binary numbers. output, however, often uses ascii, which is formed by appending 011 to the left of a bcd code. thus, an algorithm that directly converts a binary integer to a bcd integer is very useful. here is one such algorithm 1) draw lines to the left of the binary number to bound the expected bcd decades. (each decade is a group of 4 bits.) move the binary number one bit to the left. add 0011 to each bcd decade containing a binary value> 0100 repeat steps 2-3 until the last bit in the binary number has been moved into the least significant decade position. (note that when the last bit has been shifted into bcd decade, step 3 is not repeated.) read the bcd result. 2) 3) 4) 5) a) execute the algorithm for the binary number 1101101 b) execute the algorithm for the binary number 01110101110 4. (4 pts) represent the decimal number 3568 in bcd; excess-3 code; ascil; and hex.
Answers: 1
Computers and Technology, 22.06.2019 10:30, dreyes439
You are almost finished updating a web site. as part of the update, you have converted all pages from html 4.0 to html5. the project is currently on schedule. however, your project manager has been asked by the marketing team manager to justify a day of time spent validating the site's html5 pages. the marketing team manager does not have technical knowledge of the internet or the web. which is the most appropriate explanation to provide to the marketing team manager?
Answers: 1
Computers and Technology, 22.06.2019 16:30, sayedaly2096
What type of file does a cookie place on web site visitors' computers so that web site managers can customize their sites to their visitors' preferences?
Answers: 1
You know the right answer?
The following fortran program is to be executed on a computer, and a parallel version is to be execu...
Questions in other subjects:
Social Studies, 07.04.2021 01:30
Mathematics, 07.04.2021 01:30
