Assignment: LL/SC - Revision history

Akoehler: /* Lab Report */

2010-03-05T03:32:43Z

Lab Report

Akoehler: /* Synchronization Hardware */

2010-03-05T03:32:34Z

Synchronization Hardware

Akoehler: /* Synchronization Hardware */

2010-03-05T03:32:22Z

Synchronization Hardware

Akoehler: /* Lab Report */

2010-03-05T03:31:55Z

Lab Report

Akoehler: /* References */

2010-03-05T03:25:22Z

References

Akoehler: /* References */

2010-03-05T03:25:12Z

References

Akoehler at 03:21, 5 March 2010

2010-03-05T03:21:02Z

Akoehler: /* Lab Report */

2010-03-05T03:13:14Z

Lab Report

Akoehler: /* Lab Report */

2010-03-05T03:12:34Z

Lab Report

Akoehler: /* Lab Report */

2010-03-05T03:12:22Z

Lab Report

@@ Line 52: / Line 52: @@
 # Can you deadlock your producer and consumer?
-I rewrote the <code>testAndSet()</code> MIPS code from lab today to correspond more closely to the semantics used in the textbook chapter 6 <ref name="textbook"/>. There is an example of the [http://xinu/wiki/images/b/b6/Labreport.pdf lab report format], and analysis questions to report upon in the final section. Typeset your lab report with whatever software you are comfortable with.
+I rewrote the <code>testAndSet()</code> MIPS code from lab today to correspond more closely to the semantics used in the textbook chapter 6<ref name="textbook"/>. There is an example of the [http://xinu/wiki/images/b/b6/Labreport.pdf lab report format], and analysis questions to report upon in the final section. Typeset your lab report with whatever software you are comfortable with.
 == References ==
 <references/>

@@ Line 32: / Line 32: @@
 Disabling all interrupts is an effective but heavy-handed approach for providing mutual exclusion. Multicore systems and complex real-time systems often cannot afford to disable interrupts, and rely more on hardware support for atomic updates.
-The assembly code in <code>system/testAndSet.S</code> implements the <code>testAndSet()</code> operation (ala Figure 6.4 in your textbook <ref name="textbook">Silberschatz, A., Galvin, P. B., and Gagne, G. 2009 Operating System Concepts. 8th. John Wiley & Sons, Inc.</ref>) using the MIPS LL/SC (load-linked and store-conditional) opcodes. Much more complex synchronization primitives can be built on top of simple atomic opcode combinations such as there.
+The assembly code in <code>system/testAndSet.S</code> implements the <code>testAndSet()</code> operation (ala Figure 6.4 in your textbook<ref name="textbook">Silberschatz, A., Galvin, P. B., and Gagne, G. 2009 Operating System Concepts. 8th. John Wiley & Sons, Inc.</ref>) using the MIPS LL/SC (load-linked and store-conditional) opcodes. Much more complex synchronization primitives can be built on top of simple atomic opcode combinations such as there.
-Build <code>mutexAcquire()</code> and <code>mutexRelease()</code> in <code>system/mutex.c</code> using the bounded-waiting algorithm presented in Figure 6.8 of your textbook <ref name="textbook" />.
+Build <code>mutexAcquire()</code> and <code>mutexRelease()</code> in <code>system/mutex.c</code> using the bounded-waiting algorithm presented in Figure 6.8 of your textbook<ref name="textbook" />.
 == Lab Report ==

@@ Line 34: / Line 34: @@
 The assembly code in <code>system/testAndSet.S</code> implements the <code>testAndSet()</code> operation (ala Figure 6.4 in your textbook <ref name="textbook">Silberschatz, A., Galvin, P. B., and Gagne, G. 2009 Operating System Concepts. 8th. John Wiley & Sons, Inc.</ref>) using the MIPS LL/SC (load-linked and store-conditional) opcodes. Much more complex synchronization primitives can be built on top of simple atomic opcode combinations such as there.
-Build <code>mutexAcquire()</code> and <code>mutexRelease()</code> in <code>system/mutex.c</code> using the bounded-waiting algorithm presented in Figure 6.8 of your textbook<ref name="textbook" />.
+Build <code>mutexAcquire()</code> and <code>mutexRelease()</code> in <code>system/mutex.c</code> using the bounded-waiting algorithm presented in Figure 6.8 of your textbook <ref name="textbook" />.
 == Lab Report ==

@@ Line 52: / Line 52: @@
 # Can you deadlock your producer and consumer?
-I rewrote the <code>testAndSet()</code> MIPS code from lab today to correspond more closely to the semantics used in the textbook chapter 6<ref name="textbook"/>. There is an example of the [http://xinu/wiki/images/b/b6/Labreport.pdf lab report format], and analysis questions to report upon in the final section. Typeset your lab report with whatever software you are comfortable with.
+I rewrote the <code>testAndSet()</code> MIPS code from lab today to correspond more closely to the semantics used in the textbook chapter 6 <ref name="textbook"/>. There is an example of the [http://xinu/wiki/images/b/b6/Labreport.pdf lab report format], and analysis questions to report upon in the final section. Typeset your lab report with whatever software you are comfortable with.
 == References ==
 <references/>

← Older revision		Revision as of 03:25, 5 March 2010
Line 55:		Line 55:

	== References ==		== References ==
−	~~{{Reflist}}~~	+	<references/>

← Older revision		Revision as of 03:13, 5 March 2010
Line 55:		Line 55:

	== References ==		== References ==
−	~~<references/>~~	+	{{Reflist}}

← Older revision		Revision as of 03:12, 5 March 2010
Line 55:		Line 55:

	== References ==		== References ==
−	<~~refs~~/>	+	<references/>

@@ Line 54: / Line 54: @@
 I rewrote the <code>testAndSet()</code> MIPS code from lab today to correspond more closely to the semantics used in the textbook chapter 6<ref name="textbook">. There is an example of the [http://xinu/wiki/images/b/b6/Labreport.pdf lab report format], and analysis questions to report upon in the final section. Typeset your lab report with whatever software you are comfortable with.
-== Notes ==
+== References ==
-<references/>
+<refs/>