Also assume that on a single processor a program requires the execution of 2.56E9 arithmetic instructions, 1.28E9 load/store instructions, and 256 million branch instructions. Choose names for the states that are different from the names of the outputs.Īssume for arithmetic, load/store, and branch instructions, a processor have CPIs of 1, 12, and 5, respectively.
Do not assert both the green and yellow signals at the same time, since American drivers will certainly be confused, even if European drivers understand what this means! Draw the graphical representation for the finite-state machine for this improved controller. If both signals are off, the red light is on. If the output NSgreen is asserted, the green light is on if the output NSyellow is asserted, the yellow light is on. We do this by defining two output signals for each light: green and yellow. Also, we must redefine the traffic signals to include yellow. The timer has a single input, called TimerReset, which restarts the timer, and a single output, called TimerSignal, which indicates that the 30-second period has expired. To prevent the green and red lights from cycling too fast, we add a 30-second timer.
We will do this by changing the clock to run at 0.25 Hz (a 4-second clock cycle time), which is the duration of a yellow light. Question: We wish to add a yellow light to our traffic light example on page B-68.
0 kommentar(er)
