COMP3000 Operating Systems W22: Tutorial 6 - Revision history

Lianyingzhao at 05:11, 27 February 2022

2022-02-27T05:11:41Z

← Older revision		Revision as of 05:11, 27 February 2022
Line 22:		Line 22:
	# Run both programs with the same arguments of your choice. Do this a few times with different arguments. Do they behave the same way? Do you notice <u>any differences</u>? (again, no “correct” answers but just play with them and document your observations)		# Run both programs with the same arguments of your choice. Do this a few times with different arguments. Do they behave the same way? Do you notice <u>any differences</u>? (again, no “correct” answers but just play with them and document your observations)
	# Repeat the above experiment, this time running each program under <tt>strace</tt> (with the <tt>-f</tt> flag to trace children too). Do you notice any difference in the system calls each program makes? Remember to ignore the lines before <tt>main()</tt> that might be distracting, e.g., start looking around and after the <tt>clone()</tt> system call.		# Repeat the above experiment, this time running each program under <tt>strace</tt> (with the <tt>-f</tt> flag to trace children too). Do you notice any difference in the system calls each program makes? Remember to ignore the lines before <tt>main()</tt> that might be distracting, e.g., start looking around and after the <tt>clone()</tt> system call.
			# You can see there is "<tt>#define QUEUESIZE 32</tt>" in both programs. Are they actually used? <u>Why (not)</u>?

	==B: Producer/Consumer with Pipes==		==B: Producer/Consumer with Pipes==

Lianyingzhao at 04:51, 27 February 2022

2022-02-27T04:51:21Z

← Older revision		Revision as of 04:51, 27 February 2022
Line 25:		Line 25:
	==B: Producer/Consumer with Pipes==		==B: Producer/Consumer with Pipes==
	<ol style="list-style-type:decimal">		<ol style="list-style-type:decimal">
	<li> Examine the source code of <tt>3000pc-fifo</tt>. Explain the following:		<li> Examine the source code of <tt>3000pc-fifo</tt>. Pay attention to the call to <tt>pipe(pipefd)</tt> on line 192 and make the connection with what has been discussed in the lecture (also look at the man page for <tt>pipe(2)</tt>). Explain the following:
	<ol style="list-style-type:lower-alpha">		<ol style="list-style-type:lower-alpha">
	~~<li> What does the call to <tt>pipe(pipefd)</tt> on line 192 do? Hint: Look at the man page for <tt>pipe(2)</tt> </li>~~
	<li> How does the consumer receive words to consume? </li>		<li> How does the consumer receive words to consume? </li>
	<li> How does the producer send words to the consumer? </li>		<li> How does the producer generate and send words to the consumer? </li>
	<li> Why is the call to <tt>srandom(time(NULL))</tt> on line 169 necessary? </li>		<li> Why is the call to <tt>srandom(time(NULL))</tt> on line 169 necessary? </li>
	</ol>		</ol>

Lianyingzhao at 04:13, 27 February 2022

2022-02-27T04:13:29Z

← Older revision		Revision as of 04:13, 27 February 2022
Line 20:		Line 20:
	::* The number of events to consume before the consumer sleeps for 1 second		::* The number of events to consume before the consumer sleeps for 1 second

	# Run both programs with the same arguments of your choice. Do this a few times with different arguments. Do they behave the same way? Do you notice any differences? (again, no “correct” answers but just play with them and document your observations)		# Run both programs with the same arguments of your choice. Do this a few times with different arguments. Do they behave the same way? Do you notice <u>any differences</u>? (again, no “correct” answers but just play with them and document your observations)
	# Repeat the above experiment, this time running each program under <tt>strace</tt> (with the <tt>-f</tt> flag to trace children too). Do you notice any difference in the system calls each program makes? Remember to ignore the lines before <tt>main()</tt> that might be distracting, e.g., start looking around and after the <tt>clone()</tt> system call.		# Repeat the above experiment, this time running each program under <tt>strace</tt> (with the <tt>-f</tt> flag to trace children too). Do you notice any difference in the system calls each program makes? Remember to ignore the lines before <tt>main()</tt> that might be distracting, e.g., start looking around and after the <tt>clone()</tt> system call.

Lianyingzhao at 03:11, 27 February 2022

2022-02-27T03:11:13Z

← Older revision		Revision as of 03:11, 27 February 2022
Line 41:		Line 41:
	<ol style="list-style-type:lower-alpha">		<ol style="list-style-type:lower-alpha">
	<li> What are a few ways that <tt>3000pc-rendezvous</tt> is different from <tt>3000pc-fifo</tt>? </li>		<li> What are a few ways that <tt>3000pc-rendezvous</tt> is different from <tt>3000pc-fifo</tt>? </li>
	<li> What does the call to <tt>mmap()</tt> on line 347 do? How did you figure this out? </li>		<li> What does the call to <tt>mmap()</tt> on line 347 do (compared to our previous uses of <tt>mmap()</tt>)? <u>How</u> did you figure this out? </li>
	<li> How does the producer notify the consumer that the queue is no longer empty? </li>		<li> How does the producer notify the consumer that the queue is no longer empty? </li>
	<li> How does the consumer notify the producer that the queue is no longer full? </li>		<li> How does the consumer notify the producer that the queue is no longer full? </li>

Lianyingzhao at 02:51, 27 February 2022

2022-02-27T02:51:22Z

← Older revision		Revision as of 02:51, 27 February 2022
Line 12:		Line 12:
	==A: Getting Started==		==A: Getting Started==
	Download [https://people.scs.carleton.ca/~lianyingzhao/comp3000/w22/tut6/3000pc.zip 3000pc.zip], unpack, and run <tt>make</tt> to compile <tt>3000pc-fifo</tt> and <tt>3000pc-rendezvous</tt>.		Download [https://people.scs.carleton.ca/~lianyingzhao/comp3000/w22/tut6/3000pc.zip 3000pc.zip], unpack, and run <tt>make</tt> to compile <tt>3000pc-fifo</tt> and <tt>3000pc-rendezvous</tt>.

			Try to take this opportunity to read and understand the two programs line by line.

	:: Note that these programs take 3 arguments each:		:: Note that these programs take 3 arguments each:

Lianyingzhao at 15:18, 24 February 2022

2022-02-24T15:18:35Z

← Older revision		Revision as of 15:18, 24 February 2022
Line 13:		Line 13:
	Download [https://people.scs.carleton.ca/~lianyingzhao/comp3000/w22/tut6/3000pc.zip 3000pc.zip], unpack, and run <tt>make</tt> to compile <tt>3000pc-fifo</tt> and <tt>3000pc-rendezvous</tt>.		Download [https://people.scs.carleton.ca/~lianyingzhao/comp3000/w22/tut6/3000pc.zip 3000pc.zip], unpack, and run <tt>make</tt> to compile <tt>3000pc-fifo</tt> and <tt>3000pc-rendezvous</tt>.

	Note that these programs take 3 arguments each:		:: Note that these programs take 3 arguments each:
	* The number of events to process		::* The number of events to process
	* The number of events to produce before the producer sleeps for 1 second		::* The number of events to produce before the producer sleeps for 1 second
	* The number of events to consume before the consumer sleeps for 1 second		::* The number of events to consume before the consumer sleeps for 1 second

	# Run both programs with the same arguments of your choice. Do this a few times with different arguments. Do they behave the same way? Do you notice any differences? (again, no “correct” answers but just play with them and document your observations)		# Run both programs with the same arguments of your choice. Do this a few times with different arguments. Do they behave the same way? Do you notice any differences? (again, no “correct” answers but just play with them and document your observations)

Lianyingzhao at 04:45, 24 February 2022

2022-02-24T04:45:20Z

@@ Line 32: / Line 32: @@
 </li>
 <li> Replace the call to <tt>srandom(time(NULL))</tt> on line 169 with <tt>srandom(42)</tt>. What differences do you notice in <tt>3000pc-fifo</tt>'s behavior? </li>
 </ol>

Lianyingzhao at 04:39, 24 February 2022

2022-02-24T04:39:12Z

← Older revision		Revision as of 04:39, 24 February 2022
Line 14:		Line 14:

	Note that these programs take 3 arguments each:		Note that these programs take 3 arguments each:
	** The number of events to process		* The number of events to process
	** The number of events to produce before the producer sleeps for 1 second		* The number of events to produce before the producer sleeps for 1 second
	** The number of events to consume before the consumer sleeps for 1 second		* The number of events to consume before the consumer sleeps for 1 second

	# Run both programs with the same arguments of your choice. Do this a few times with different arguments. Do they behave the same way? Do you notice any differences? (again, no “correct” answers but just play with them and document your observations)		# Run both programs with the same arguments of your choice. Do this a few times with different arguments. Do they behave the same way? Do you notice any differences? (again, no “correct” answers but just play with them and document your observations)
	# Repeat the above experiment, this time running each program under <tt>strace</tt> (with the <tt>-f</tt> flag to trace children too). Do you notice any difference in the system calls each program makes? Remember to ignore the lines before <tt>main()</tt> that might be distracting, e.g., start looking around and after the <tt>clone()</tt> system call.		# Repeat the above experiment, this time running each program under <tt>strace</tt> (with the <tt>-f</tt> flag to trace children too). Do you notice any difference in the system calls each program makes? Remember to ignore the lines before <tt>main()</tt> that might be distracting, e.g., start looking around and after the <tt>clone()</tt> system call.

			==B: Producer/Consumer with Pipes==
			<ol style="list-style-type:decimal">
			<li> Examine the source code of <tt>3000pc-fifo</tt>. Explain the following:
			<ol style="list-style-type:lower-alpha">
			<li> What does the call to <tt>pipe(pipefd)</tt> on line 192 do? Hint: Look at the man page for <tt>pipe(2)</tt> </li>
			<li> How does the consumer receive words to consume? </li>
			<li> How does the producer send words to the consumer? </li>
			<li> Why is the call to <tt>srandom(time(NULL))</tt> on line 169 necessary? </li>
			</ol>
			</li>
			<li> Replace the call to <tt>srandom(time(NULL))</tt> on line 169 with <tt>srandom(42)</tt>. What differences do you notice in <tt>3000pc-fifo</tt>'s behavior? </li>
			</ol>

Lianyingzhao at 04:20, 24 February 2022

2022-02-24T04:20:41Z

← Older revision		Revision as of 04:20, 24 February 2022
Line 14:		Line 14:

	Note that these programs take 3 arguments each:		Note that these programs take 3 arguments each:
	* The number of events to process		** The number of events to process
	* The number of events to produce before the producer sleeps for 1 second		** The number of events to produce before the producer sleeps for 1 second
	* The number of events to consume before the consumer sleeps for 1 second		** The number of events to consume before the consumer sleeps for 1 second

	# Run both programs with the same arguments of your choice. Do this a few times with different arguments. Do they behave the same way? Do you notice any differences? (again, no “correct” answers but just play with them and document your observations)		# Run both programs with the same arguments of your choice. Do this a few times with different arguments. Do they behave the same way? Do you notice any differences? (again, no “correct” answers but just play with them and document your observations)
	# Repeat the above experiment, this time running each program under <tt>strace</tt> (with the <tt>-f</tt> flag to trace children too). Do you notice any difference in the system calls each program makes? Remember to ignore the lines before <tt>main()</tt> that might be distracting, e.g., start looking around and after the <tt>clone()</tt> system call.		# Repeat the above experiment, this time running each program under <tt>strace</tt> (with the <tt>-f</tt> flag to trace children too). Do you notice any difference in the system calls each program makes? Remember to ignore the lines before <tt>main()</tt> that might be distracting, e.g., start looking around and after the <tt>clone()</tt> system call.

Lianyingzhao at 04:19, 24 February 2022

2022-02-24T04:19:55Z

← Older revision		Revision as of 04:19, 24 February 2022
Line 18:		Line 18:
	* The number of events to consume before the consumer sleeps for 1 second		* The number of events to consume before the consumer sleeps for 1 second

	1. Run both programs with the same arguments of your choice. Do this a few times with different arguments. Do they behave the same way? Do you notice any differences? (again, no “correct” answers but just play with them and document your observations)		# Run both programs with the same arguments of your choice. Do this a few times with different arguments. Do they behave the same way? Do you notice any differences? (again, no “correct” answers but just play with them and document your observations)
	2. Repeat the above experiment, this time running each program under <tt>strace</tt> (with the <tt>-f</tt> flag to trace children too). Do you notice any difference in the system calls each program makes? Remember to ignore the lines before <tt>main()</tt> that might be distracting, e.g., start looking around and after the <tt>clone()</tt> system call.		# Repeat the above experiment, this time running each program under <tt>strace</tt> (with the <tt>-f</tt> flag to trace children too). Do you notice any difference in the system calls each program makes? Remember to ignore the lines before <tt>main()</tt> that might be distracting, e.g., start looking around and after the <tt>clone()</tt> system call.