Problem 1: Matchless Endeavors (30)

For each item record the letter of the answer that best matches the term to the left of the number below, in the column labelled Letter. Note that there may be more than one correct answer per question, although only one is required, and that answers may be reused, or used not at all.

Letter
	1.1	anti-dependence		a. effective speedup.
	1.2	branch folding		b. scoreboard issue stall
	1.3	superscalar machine		c. speculation
	1.4	cache block identification		d. JMP POWER
	1.5	instruction latency		e. RAW Hazard
	1.6	capacity miss		f. CDB
	1.7	Amdahl's law		g. decrease ${\rm CPI}_{\rm stalls}$
	1.8	500 Mhz		h. scoreboard
	1.9	memory hierarchy		i. compiler optimization
	1.10	loop unrolling		j. fully associative cache
	1.11	dynamic scheduling		k. small static code size
	1.12	TLB		l. tag bits
	1.13	structural hazard		m. branch delay slot
	1.14	forwarding and bypassing		n. potential WAW hazard
	1.15	dynamic scheduling		o. clock rate
	1.16	dirty bits		p. initiation interval
	1.17	branch predication		q. potential WAR hazard
	1.18	PDP 11, IBM 360		r. VLIW
	1.19	reorder buffer		s. Itanium
	1.20	implicit branch prediction		t. page fault
				u. pipe-like pipe
				z. Other: Explain for full credit