https://wiki.eecs.yorku.ca/course_archive/2007-08/F/6490A/ 2026-09-27T19:51:39+00:00 https://wiki.eecs.yorku.ca/course_archive/2007-08/F/6490A/ https://wiki.eecs.yorku.ca/course_archive/2007-08/F/6490A/_media/wiki:dokuwiki-128.png text/html 2007-10-24T12:41:57+00:00 Anonymous (anonymous@undisclosed.example.com) https://wiki.eecs.yorku.ca/course_archive/2007-08/F/6490A/assignments:a1?rev=1193229717&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 suggested to find a concurrent algorithm in an area of your interest. Preferably, the algorithm should be presented in a refereed journal or fairly … text/html 2007-10-25T20:43:18+00:00 Anonymous (anonymous@undisclosed.example.com) https://wiki.eecs.yorku.ca/course_archive/2007-08/F/6490A/assignments:a2?rev=1193344998&do=diff Assignment 2 Implement your algorithm in Java Implement your algorithm in Java. Test your algorithm Test your algorithm. Write a report Write a report. You may start your report with briefly reviewing your algorithm. In the report, also discuss your implementation. For example, describe how the problem was broken down into classes, discuss the relationship amongst classes, motivate the choice of the key data structures used, but most importantly discuss those parts related to concurrency,… text/html 2007-11-02T23:34:33+00:00 Anonymous (anonymous@undisclosed.example.com) https://wiki.eecs.yorku.ca/course_archive/2007-08/F/6490A/assignments:a3?rev=1194046473&do=diff Assignment 3 Verification 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. Or you consider minor variations on your implementation (showing, for example, that a particular lock is essential to guarantee deadlock freedom). Or you implement a listener that checks a particular property. Etcetera. text/html 2007-08-15T13:57:05+00:00 Anonymous (anonymous@undisclosed.example.com) https://wiki.eecs.yorku.ca/course_archive/2007-08/F/6490A/assignments:start?rev=1187186225&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.