Tutorial configurations:
namedescriptioncountlast used
Tutorial01Simple example program36,44716-Aug-26 06:47:55
Tutorial02Demonstration of basic arithmetic operations and load/store instructions10,23715-Aug-26 03:23:01
Tutorial03Demonstration of the branch instruction6,46015-Aug-26 03:22:46
Tutorial04Demonstration of the several jump and branch instructions1,98315-Aug-26 03:22:46
Tutorial05Execution of a single instruction in the non-pipelined processor7,21117-Aug-26 01:28:56
Tutorial06Execution of a single instruction in the non-pipelined processor6,99616-Aug-26 22:26:36
Tutorial07Simple program in the non-pipelined processor5,94417-Aug-26 16:53:04
Tutorial08Simple program in the pipelined processor6,91915-Aug-26 08:36:49
Tutorial09Ignoring data dependencies ("No ALU Interlock")9,14415-Aug-26 03:23:01
Tutorial10Stalling on data dependencies ("ALU Interlock")7,53516-Aug-26 10:07:46
Tutorial11Avoiding data hazards by using ALU forwarding7,76915-Aug-26 03:23:01
Tutorial12Ignoring load hazards ("No load interlock" and "No ALU forwarding")5,28317-Aug-26 02:15:01
Tutorial13Load interlocks5,48515-Aug-26 03:23:35
Tutorial14Load interlock combined with ALU forwarding6,37015-Aug-26 03:22:48
Tutorial15Demonstrating delayed branches6,75215-Aug-26 03:23:00
Tutorial16Demonstrating branch interlock5,75115-Aug-26 03:23:01
Tutorial17Demonstration of branch prediction6,87617-Aug-26 12:17:44
Tutorial18No zero interlock4,72315-Aug-26 03:25:48
Tutorial19Zero interlock4,63615-Aug-26 03:22:52
Tutorial20Zero forwarding4,87015-Aug-26 07:52:41
Tutorial21RAW Hazard7,61517-Aug-26 04:35:26
Tutorial22RAW Hazard (2)4,52315-Aug-26 03:22:58
Tutorial23RAW Hazard (for stores, 1)4,51515-Aug-26 03:22:52
Tutorial24RAW Hazard (for stores, 2)7,10915-Aug-26 03:22:54
Tutorial25RAW Hazard (for conditional branches, 1)4,88115-Aug-26 13:13:07
Tutorial26RAW Hazard (for conditianal branches, 2)4,45016-Aug-26 10:20:03
Tutorial27RAW Hazard (for indirect jumps, 1)4,29916-Aug-26 07:09:34
Tutorial28RAW Hazard (for indirect jumps, 2)4,41715-Aug-26 03:22:46
Tutorial29Load hazard4,75915-Aug-26 03:23:00
Tutorial30Control hazard. Notice that the first jump (which jumps to the next instruction) does not cause a jump, because the condition for the hazard (if calculated PC does not match the target PC) is not met - the calculated PC happens to be correct.4,81516-Aug-26 16:17:49
Tutorial31Control hazard. Note that the branch target buffer eliminates all stalls when it fills up.4,66115-Aug-26 03:23:00
Tutorial32Control hazard (3). Notice again that the first branch does not cause a stall because the branch is not taken (and hence, the "predicted" PC actually equals the target PC).4,71415-Aug-26 03:25:45
XXXXj test51915-Aug-26 03:22:48