2. Below are the data of the processing speed comparing old vs. new computers. With the difference intheir algorithms and running same programs, results showed consistent results. Is it evident that thereare differences?CPU time (s)ProgramOldNew8.05.71224.74.74328.33.7448.45.779.19.8025.20.83714.05.828.20.33.774.82.77108.54.72Copy the values from row 1-10using the last digit of your IDCopy the values from row 1-10using the last digit of your ID11number.number.

All current computer device technologies are indeed limited by the speed of electron motion. This…

2. Below are the data of the processing speed comparing old vs. new computers. With the difference in their algorithms and running same programs, results showed consistent results. Is it evident that there are differences? CPU time (s) Program Old New 1 8.05 .71 2 24.74 .74 28.33 .74 4 8.45 .77 5 9.19 .80 25.20 .83 7 14.05 .82 8 20.33 .77 4.82 .77 10 8.54 .72 Copy the values from row 1-10 using the last digit of your ID Copy the values from row 1-10 using the last digit of your ID number. 11 number.

2. Below are the data of the processing speed comparing old vs. new computers. With the difference in their algorithms and running same programs, results showed consistent results. Is it evident that there are differences? CPU time (s) Program Old New 1 8.05 .71 2 24.74 .74 28.33 .74 4 8.45 .77 5 9.19 .80 25.20 .83 7 14.05 .82 8 20.33 .77 4.82 .77 10 8.54 .72 Copy the values from row 1-10 using the last digit of your ID Copy the values from row 1-10 using the last digit of your ID number. 11 number.

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter2: Problem Solving Using C++using

Section2.3: Data Types

Problem 9E: (Practice) Although the total number of bytes varies from computer to computer, memory sizes of...

See similar textbooks

Similar questions

Please elaborate on the idea of parallel processing, which is also known as multiprocessing. Performing operations simultaneously. The Option Blue line of supercomputers from IBM can do three trillion computations per second. For this purpose, around a thousand computers are networked together. Is there a certain kind of software that is best suited to run in parallel? How has parallel processing changed the way we think about the structure of computers? To what extent can the average computer user benefit from parallel processing in the present day?
BenchmarkProcessorXYZ12010402408020Table 1.1 shows the execution times, in seconds, for two different benchmark programs on three machines.ii.Compute the geometric mean value for each system, using X as the reference machine and then using Y as the reference machine. Argue that the results are more realistic than with the arithmetic mean.
In a timesharing OS we have the following cpu timeline for two tasks X and Y. The timeslice is 1s.Both tasks are available in the system at the same time t=9:00:00.000 and order of arrival is the obviousX followed by Y. (The decimals reflect milliseconds if they showup in an indicated time reference.) There are no other processes (tasks) in the system other than X,Y. 1234567890 XYXYX--YXY The time line 1 indicates that at t=9:00:00s task X starts its execution and when t=9:00:01s is reached task Y takes over. The time line 1 indicates the 'first second' and time line 0 indicates the 'tenth second' above.Task Y completes its execution at t=9:00:10s, the completion of the tenth second since X started its execution. Task X has completed its execution earlier. (a) What is the total number of context switches starting from prior to t=9:00:00s (e.g. t=8:59:59.999) through thecompletion of $Y$? answer is 16s (b) What is the turnaround time for Y? answer is 10s (c) What is…
Two algorithms A and B report time complexities expressed by the functions n2and 2n , respectively. They are to be executed on a machine M that consumes 10–6 s to execute an instruction. What is the time taken by the algorithms to complete their execution on machine A for an input size of 50? If another machine N that is 10 times faster than machine M is provided for the execution, what is the largest input size that can be handled by the two algorithms on machine N? What are yourobservations?
The latest super-duper supercomputer has memory locations that are 64-bits wide. What is the largest unsigned integer that can be stored in one memory location? Suppose that we use sign-magnitude for storing negative numbers and dedicate one bit for a sign bit. What would be the largest POSITIVE integer that can be stored in a memory location.
Computer A has an overall CPI of 1.3 and can be run at a clock rate of 600MHz. Computer B has a CPI of 2.5 and can be run at a clock rate of 750 MHz. We have a particular program we wish to run. When compiled for computer A, this program has exactly 100,000 instructions. How many instructions would the program need to have when compiled for Computer B, in order for the two computers to have exactly the same execution time for this program? Please explain how to solve
Assume a computer has 32-bit integers. Show how the value OX0367ABC would be stored sequentially in memory, starting at address Ox100, on both a big endian machine and a little endian machine, assuming that each address holds one byte. Big Endian Address Ox100: type your answer. Big Endian Address Ox101: type your answer. Big Endian Address Ox102: type your answer. Big Endian Address Ox103: type your answer. .Little Endian Address Ox100: type your answer. Little Endian Address Ox101: type your answer. Little Endian Address Ox102: type your answer. Little Endian Address Ox103: type your answer..
OS Process P1 P2 P3 P4 P5 Let's Try This (1) CPU-burst 75 40 25 20 45 Arrival Time (a) Solve using RR with Q=15 (b) Solve using preemptive SJF 0 10 10 80 85 65
The functions n2 and 2n, respectively, are used to describe the temporal complexity of the two algorithms A and B. They must be carried out on machine M, which takes 10-6 s to complete one instruction. How long does it take the algorithms to finish running on machine A with a 50-item input? What is the biggest input size that the two algorithms on machine N can handle if a different machine N that is 10 times quicker than machine M is used for the execution? What conclusions have you drawn?
Given six memory partitions of 250 KB, 60 KB, 115 KB, 300 KB, 460 KB and 570KB (in order). How would the first-fit, best-fit and worst-fit algorithms place process of size 300 KB? Select one: a. 300 KB, 460 KB, 570 KB b.300 KB, 300 KB, 570 KB c.250 KB + 50 KB from 60 KB, 300 KB, 570 KB d.250 KB + 50 KB from 60 KB, 300 KB, 460 KB
Assume an algorithm takes 7.4 seconds to execute on a single 3.5 GHz processor. 49% of the algorithm is sequential. Assume that there is zero latency and that the remaining code exhibits perfect parallelism. How long (in seconds) should the algorithm take to execute on a parallel machine made of 4 3.5 GHz processors? Round answers to one decimal place (e.g. for an answer of 17.214 seconds, you would enter 17.2).
Microprocessor(Binary number) solve the ff with solution 1. 1000000 – 1100011 – 1001002. 111+ 101101 + 110010 + 1113. 101111 + 101011 - 1014. 11100 + (1011001 – 101011)5. 101000 + 110110 - 111116. 1100110 – 1111 – 1101107. 101010 + 100001 - 100118. 100100 + 111000 - 111109. 1100011 - 11011 – 11111110. 1010011 – 101001 + 111111