Computers and Technology, 02.12.2019 22:31, gigi239

Let us assume we have a program that executes sequence of back to back arbitrary operations and branching decisions that tightly depends on up to two results of previous operations. more specifically, if you were to cut the program execution stream at any one point, all of the operations that happens after that point will solely be dependent on two variables that were computed in the operations above that point.
(1) if all of the variables used in the program were unsigned characters (8-bits), how would you divide up the code to execute in cloud computing platform in parallel to speed up the software execution? can you get a speed up? (2) if in the future, you can get access to 1 billion cores in the cloud, what would be the maximum speed up of your software? (3) what if the variables used in the program were boolean (1-bit) with up to 8 variable dependency at any given cut?

Answers: 3

Show answers

Other questions on the subject: Computers and Technology

Computers and Technology, 22.06.2019 01:00, zuleromanos

)a grad student comes up with the following algorithm to sort an array a[1..n] that works by first sorting the first 2/3rds of the array, then sorting the last 2/3rds of the (resulting) array, and finally sorting the first 2/3rds of the new array. 1: function g-sort(a, n) . takes as input an array of n numbers, a[1..n] 2: g-sort-recurse(a, 1, n) 3: end function 4: function g-sort-recurse(a, `, u) 5: if u â’ ` â‰¤ 0 then 6: return . 1 or fewer elements already sorted 7: else if u â’ ` = 1 then . 2 elements 8: if a[u] < a[`] then . swap values 9: temp â† a[u] 10: a[u] â† a[`] 11: a[`] â† temp 12: end if 13: else . 3 or more elements 14: size â† u â’ ` + 1 15: twothirds â† d(2 â— size)/3e 16: g-sort-recurse(a, `, ` + twothirds â’ 1) 17: g-sort-recurse(a, u â’ twothirds + 1, u) 18: g-sort-recurse(a, `, ` + twothirds â’ 1) 19: end if 20: end function first (5 pts), prove that the algorithm correctly sorts the numbers in the array (in increasing order). after showing that it correctly sorts 1 and 2 element intervals, you may make the (incorrect) assumption that the number of elements being passed to g-sort-recurse is always a multiple of 3 to simplify the notation (and drop the floors/ceilings).

Answers: 3

continue

Computers and Technology, 23.06.2019 07:30, jackie0833

Which option allows you to view slides on the full computer screen?

Answers: 1

continue

Computers and Technology, 23.06.2019 17:30, granta1

Write pseudocode to represent the logic of a program that allows the user to enter a value. the program multiplies the value by 10 and outputs the result.

Answers: 1

continue

Computers and Technology, 24.06.2019 02:10, sIatt

Consider the usual algorithm to convert an infix expression to a postfix expression. suppose that you have read 10 input characters during a conversion and that the stack now contains these symbols: (5 points) | | | + | | ( | bottom |_*_| now, suppose that you read and process the 11th symbol of the input. draw the stack for the case where the 11th symbol is

Answers: 2

continue

Do you know the correct answer?

Let us assume we have a program that executes sequence of back to back arbitrary operations and bran...