Differences

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

--- assignments:a1 [2007/10/08 12:26] – franck
+++ assignments:a1 [2007/10/24 12:41] (current) – franck
@@ Line 14: / Line 14: @@
 Once your paper has been approved by the instructor, add your paper to the list below.  Ensure that the reference in complete, that is, make sure that all relevant information is included.  Attach a hyperlink to the title of your paper, linking it to the doi (something like http://dx.doi.org/10.1145/769800.769804).
@@ Line 22: / Line 24: @@
 Write a report. In the report, describe your algorithm using pseudocode. If you have found a description of the algorithm in pseudocode in the literature, you may use that description. However, do not forget to mention the source. Also explain the algorithm in your own words. This implies that you do not copy parts of the paper. Feel free to include examples. If the examples are not your own, then mention the source.
-You are encouraged to use LaTeX and BiBTeX to write your report. You may start from the files {{assignments:assignment1.tex|}} and {{assignments:assignment1.bib}}. Skeletons of various types of entries of a BiBTeX file can be found in {{assignments:sample.bib}}. Numerous tutorials on LaTeX and BiBTeX can be found on the web. If you have any questions, feel free to contact the instructor.
+You may want to try LaTeX and BiBTeX to write your report. You may start from the files {{assignments:assignment1.tex}} and {{assignments:assignment1.bib}}. Skeletons of various types of entries of a BiBTeX file can be found in {{assignments:sample.bib}}. Numerous tutorials on LaTeX and BiBTeX can be found on the web. If you have any questions, feel free to contact the instructor.
-The report should be roughly between 4 and 10 pages.  These bounds are not absolute (but one page is definitely not enough and 20 pages it too much).
+The report should be roughly between 4 and 10 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.
@@ Line 61: / Line 71: @@
    * Mark Shtern:\\ Steve Heller, Maurice Herlihy, Victor Luchangco, Mark Moir, William N. Scherer and Nir Shavit [[http://dx.doi.org/10.1007/11795490_3|A Lazy Concurrent List-Based Set Algorithm]]. In //Proceedings of the 9th International Conference On Principles Of Distributed Systems,// volume 3974 of //Lecture Notes in Computer Science//, pages 3-16, Pisa, Italy, December 2005. Springer-Verlag.
+   * Yi Feng:\\ Ori Shalev and Nir Shavit.[[http://dx.doi.org/10.1145/1147954.1147958|Split-ordered lists: Lock-free extensible hash tables]]. //Journal of the ACM//, 53(3):379-405, May 2006.
+   * Pourya Jafari:\\ Jehoshua Bruck, Ching-Tien Ho, Shlomo Kipnis, Shlomo Kipnis and Derrick Weathersby. [[http://dx.doi.org/10.1109/71.642949|Efficient Algorithms for All-to-All Communications in Multiport Message-Passing Systems ]]. //IEEE Transactions on Parallel and Distributed Systems//, 8(11):1143 - 1156, November 1997.
+   * Bashir Raeesmohammadian:\\ Sung-Chae Lim, Joonseon Ahn and Myoung Ho Kim [[http://www.springerlink.com/content/q1uny2fdlbf8yxrx/?p=4a350778aa4d44abb4a50125e0077682&pi=0|A Concurrent B-Tree Algorithm Using a Cooperative Locking Protocol]]. In //New Horizons in Information Management//, volume 2713 of //Lecture Notes in Computer Science//, pages 165-??, Springer-Verlag.  2003.