Tutorial configurations:
namedescriptioncountlast used
Tutorial01Simple example program35,04825-Apr-24 13:39:03
Tutorial02Demonstration of basic arithmetic operations and load/store instructions9,52725-Apr-24 07:06:02
Tutorial03Demonstration of the branch instruction5,82624-Apr-24 13:57:23
Tutorial04Demonstration of the several jump and branch instructions1,65214-Apr-24 06:03:13
Tutorial05Execution of a single instruction in the non-pipelined processor6,62725-Apr-24 04:40:58
Tutorial06Execution of a single instruction in the non-pipelined processor6,43023-Apr-24 21:51:46
Tutorial07Simple program in the non-pipelined processor5,25325-Apr-24 16:37:11
Tutorial08Simple program in the pipelined processor6,23625-Apr-24 16:37:12
Tutorial09Ignoring data dependencies ("No ALU Interlock")8,63324-Apr-24 04:02:57
Tutorial10Stalling on data dependencies ("ALU Interlock")6,83822-Apr-24 15:07:21
Tutorial11Avoiding data hazards by using ALU forwarding7,22522-Apr-24 15:07:24
Tutorial12Ignoring load hazards ("No load interlock" and "No ALU forwarding")4,79325-Apr-24 13:39:30
Tutorial13Load interlocks4,88725-Apr-24 23:11:37
Tutorial14Load interlock combined with ALU forwarding5,65124-Apr-24 08:50:43
Tutorial15Demonstrating delayed branches6,23524-Apr-24 07:55:40
Tutorial16Demonstrating branch interlock5,24623-Apr-24 13:32:00
Tutorial17Demonstration of branch prediction6,35122-Apr-24 15:07:39
Tutorial18No zero interlock4,20522-Apr-24 15:07:43
Tutorial19Zero interlock4,13122-Apr-24 15:07:48
Tutorial20Zero forwarding4,33324-Apr-24 09:37:58
Tutorial21RAW Hazard7,01224-Apr-24 04:01:58
Tutorial22RAW Hazard (2)4,01322-Apr-24 15:07:54
Tutorial23RAW Hazard (for stores, 1)3,95122-Apr-24 15:07:55
Tutorial24RAW Hazard (for stores, 2)6,59022-Apr-24 15:07:57
Tutorial25RAW Hazard (for conditional branches, 1)4,32522-Apr-24 15:08:01
Tutorial26RAW Hazard (for conditianal branches, 2)3,90624-Apr-24 12:03:42
Tutorial27RAW Hazard (for indirect jumps, 1)3,78822-Apr-24 15:08:06
Tutorial28RAW Hazard (for indirect jumps, 2)3,86926-Apr-24 01:05:13
Tutorial29Load hazard4,22324-Apr-24 07:29:58
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,14322-Apr-24 15:08:17
Tutorial31Control hazard. Note that the branch target buffer eliminates all stalls when it fills up.4,14624-Apr-24 01:34:47
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,09325-Apr-24 13:39:36
XXXXj test21613-Apr-24 12:24:43