https://wiki.eecs.yorku.ca/course_archive/2008-09/W/6411/ 2026-10-28T13:04:40+00:00 https://wiki.eecs.yorku.ca/course_archive/2008-09/W/6411/ https://wiki.eecs.yorku.ca/course_archive/2008-09/W/6411/_media/wiki:dokuwiki-128.png text/html 2009-03-20T04:06:36+00:00 Anonymous (anonymous@undisclosed.example.com) https://wiki.eecs.yorku.ca/course_archive/2008-09/W/6411/assignments:a1?rev=1237521996&do=diff Assignment 1 Assignment 1 due date:before class on Wednesday March 18th. The following is a Spin description of a mutual exclusion algorithm using a semaphore variable r. You should be able to show (in JSpin) that the algorithm is safe (does not allow two processes in the critical area at the same time), and does not deadlock. However, it is not fair (i.e. there is no guarantee, under weak fairness, that processes will eventually get into the critical region). If using JSpin, make sure there a… text/html 2007-08-01T13:58:26+00:00 Anonymous (anonymous@undisclosed.example.com) https://wiki.eecs.yorku.ca/course_archive/2008-09/W/6411/assignments:a2?rev=1185976706&do=diff Assignment 2 text/html 2007-08-01T13:58:50+00:00 Anonymous (anonymous@undisclosed.example.com) https://wiki.eecs.yorku.ca/course_archive/2008-09/W/6411/assignments:a3?rev=1185976730&do=diff Assignment 3 text/html 2009-04-13T14:06:14+00:00 Anonymous (anonymous@undisclosed.example.com) https://wiki.eecs.yorku.ca/course_archive/2008-09/W/6411/assignments:start?rev=1239631574&do=diff Assignments Here, you can link to your course assignments: * Assignment 1 * Assignment 2 * Assignment 3 * Assignment 4 * Project