Differences

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

--- assignments:a1 [2010/02/04 13:23] – franck
+++ assignments:a1 [2010/03/10 07:10] (current) – joanna
@@ Line 11: / Line 11: @@
 ===== Add your paper to the list =====
-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).
+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.ezproxy.library.yorku.ca/10.1109/TC.1980.1675680).
 ===== Write a report =====
@@ Line 32: / Line 32: @@
   * 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.
-  * Joanna Helga:\\ Eric Ruppert. Lock-Free Binary Search Trees. //Draft paper//, February 2010.
+  * Joanna Helga:\\ Eric Ruppert, Franck van Breugel, Panagiota Fatourou, Faith Ellen. Non-Blocking Binary Search Trees. //Draft paper//, February 18, 2010.
-  * Jun Miao:\\ Maged M.Michael, Michael L.Scott. [[http://dx.doi.org.ezproxy.library.yorku.ca/10.1145/248052.248106|Simple, fast, and practical non-blocking and blocking concurrent queue algorithms]]. In //Proceedings of the fifteenth Annual ACM Symposium on Principles of Distributed Computing//, pages 267-275, Philadelphia, PA, USA, 1996. ACM.
+  * Jun Miao:\\ Maged M.Michael, Michael L.Scott. [[http://dx.doi.org.ezproxy.library.yorku.ca/10.1145/248052.248106|Simple, fast, and practical non-blocking and blocking concurrent queue algorithms]]. In //Proceedings of the 15th Annual ACM Symposium on Principles of Distributed Computing//, pages 267-275, Philadelphia, PA, USA, May 1996. ACM.
+  * Mehdi Kargar:\\ Marcel Kornacker, Douglas Banks. [[http://portal.acm.org/citation.cfm?id=645921.673305&coll=Portal&dl=GUIDE&CFID=76472520&CFTOKEN=14839502|High-Concurrency Locking in R-Trees]]. In //Proceedings of the 21th International Conference on Very Large Data Bases//, pages 134-145, Zurich, Switzerland, September 1995. Morgan Kaufmann.
+  * Haneen Dabain:\\ Zvi Lotker, Elan Pavlov, Boaz Patt-Shamir, David Peleg. [[http://dx.doi.org.ezproxy.library.yorku.ca/10.1145/777412.777428|MST construction in O(log log n) communication rounds]]. In //Proceedings of the 15th Annual ACM Symposium on Parallel Algorithms and Architectures//, pages 94-100, San Diego, CA, USA, June 2003. ACM.
+  * Wael Yehia:\\ D. Hendler, N. Shavit, L. Yerushalmi.[[http://dx.doi.org.ezproxy.library.yorku.ca/10.1145/1007912.1007944|A Scalable Lockfree Stack Algorithm]]. In //Proceedings of the 16th Annual ACM Symposium on Parallel Algorithms//, pages 206–215, Barcelona, Spain, June 2004. ACM.