When parallelizing an application, the ideal speedup is speeding up by the number of processors. this is limited by two things: percentage of the application that can be parallelized and the cost of communication. amdahl’s law takes into account the former but not the latter. a. [10] < 1.10> what is the speedup with n processors if 80% of the application is parallelizable, ignoring the cost of communication? b. [20] < 1.10> what is the speedup with 8 processors if, for every processor added, the communication overhead is 0.5% of the original execution time. c. [20] < 1.10> what is the speedup with 8 processors if, for every time the number of processors is doubled, the communication overhead is increased by 0.5% of the original execution time?

Assume that there is a 4% rate of disk drive failure in a year. a. if all your computer data is stored on a hard disk drive with a copy stored on a second hard disk drive, what is the probability that during a year, you can avoid catastrophe with at least one working drive? b. if copies of all your computer data are stored on three independent hard disk drives, what is the probability that during a year, you can avoid catastrophe with at least one working drive?

Computer programming is one type of what career

Write a program that keeps asking the user for new values to be added to a list until the user enters 'exit' ('exit' should not be added to the list). these values entered by the user are added to a list we call 'initial_list'. then write a function that takes this initial_list as input and returns another list with 3 copies of every value in the initial_list. finally, inside print out all of the values in the new list. for example: input: enter value to be added to list: a enter value to be added to list: b enter value to be added to list: c enter value to be added to list: exit output: a b c a b c a b c note how 'exit' is not added to the list. also, your program needs to be able to handle any variation of 'exit' such as 'exit', 'exit' etc. and treat them all as 'exit'.