https://wiki.eecs.yorku.ca/course_archive/2009-10/W/6490A/ 2026-11-03T10:48:23+00:00 https://wiki.eecs.yorku.ca/course_archive/2009-10/W/6490A/ https://wiki.eecs.yorku.ca/course_archive/2009-10/W/6490A/lib/tpl/dokuwiki/images/favicon.ico text/html 2010-03-10T07:10:30+00:00 Anonymous (anonymous@undisclosed.example.com) https://wiki.eecs.yorku.ca/course_archive/2009-10/W/6490A/assignments:a1?rev=1268205030&do=diff Assignment 1 Find a concurrent algorithm Find a concurrent algorithm in the literature. The algorithm should not be trivial but also not extremely complex (since you are going to implement and verify the algorithm in Assignment 2 and 3). Concurrent algorithms are applicable to various areas including databases, operating systems, etcetera. You are encouraged to find a concurrent algorithm in an area of your interest. Preferably, the algorithm should be presented in a journal or conference proc… text/html 2010-01-01T17:38:23+00:00 Anonymous (anonymous@undisclosed.example.com) https://wiki.eecs.yorku.ca/course_archive/2009-10/W/6490A/assignments:a2?rev=1262367503&do=diff Assignment 2 Implement your algorithm in Java Implement your concurrent algorithm in Java. You may also want to implement a sequential version or a coarse grained locking version of your algorithm for comparison purposes. Test your algorithm Test your algorithm. text/html 2009-12-24T13:43:50+00:00 Anonymous (anonymous@undisclosed.example.com) https://wiki.eecs.yorku.ca/course_archive/2009-10/W/6490A/assignments:a3?rev=1261662230&do=diff Assignment 3 Verify your implementation Verify some properties of your implementation using Java PathFinder (JPF). Just running JPF on your code is not enough. Either you add something to your code that enables you to check a property (for example, add a few assertions). Or you consider minor variations on your implementation (showing, for example, that a particular lock is essential to guarantee deadlock freedom). Etcetera. Feel free to be creative. text/html 2009-12-24T13:31:13+00:00 Anonymous (anonymous@undisclosed.example.com) https://wiki.eecs.yorku.ca/course_archive/2009-10/W/6490A/assignments:start?rev=1261661473&do=diff Assignments There will be three assignments. The objective of the first assignment is to find a nontrivial concurrent algorithm in the literature. In the second assignment, the aim is the implementation of the concurrent algorithm presented in the first assignment in Java. The focus of the third assignment is to apply tools to verify the concurrent Java program of the second assignment. More details can be found below.