Differences

This shows you the differences between two versions of the page.

--- assignments:a1 [2014/11/19 18:03] – franck
+++ assignments:a1 [2015/04/03 19:29] (current) – franck
@@ Line 5: / Line 5: @@
 ===== 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 proceedings.
+Find an algorithm in the literature. The algorithm should either be concurrent or it is a sequential algorithm for which you proposed a concurrent version. The algorithm should not be trivial but also not extremely complex (since you are going to implement the algorithm in Assignment 2). Concurrent algorithms are applicable to various areas including databases, operating systems, etcetera. You are encouraged to find an algorithm in an area of your interest. Preferably, the algorithm should be presented in a journal or conference proceedings.
 ===== Ask the instructor =====
@@ Line 24: / Line 24: @@
 The report should be roughly between 3 and 8 pages.  These bounds are not absolute (but one page is definitely not enough and 20 pages is too much).
 As the audience of your report, consider your fellow students in the course.
+{{:public:myassignment1.pdf|myassignment1.pdf}} contains a sample.  The corresponding LaTeX and BiBTeX files are {{:public:myassignment1.tex.txt|myassignment1.tex}} and {{:public:myassignment1.bib.txt|myassignment1.bib}}, respectively (remove the suffix .txt from the file name).
 ===== List your paper =====
   * Franck van Breugel:\\ Carla Schlatter Ellis. [[http://dx.doi.org.ezproxy.library.yorku.ca/10.1109/TC.1980.1675680|Concurrent Search and Insertion in AVL Trees]]. //IEEE Transactions on Computers//, 29(9): 811-817, September 1980.
+  * Qiyi Tang:\\ Giorgio Bacci, Giovanni Bacci, Kim G. Larsen, and Radu Mardare.  [[http://dx.doi.org.ezproxy.library.yorku.ca/10.1007/978-3-642-36742-7_1|On-the-Fly Exact Computation of Bisimilarity]]. In //Proceedings of the 19th International Conference on Tools and Algorithms for the Construction and Analysis of Systems//, volume 7795 of //Lecture Notes in Computer Science//, pages 1–15, Rome, Italy, March 2013.  Springer-Verlag.
+  * Mingbin Xu:\\ Nir Shavit and Itay Lotan. [[http://dx.doi.org.ezproxy.library.yorku.ca/10.1109/IPDPS.2000.845994|Skiplist-based concurrent priority queues]]. In //Proceedins of the 14th International Parallel and Distributed Processing Symposium//, pages 263-268, Cancun, Mexico, May 2000. IEEE.