User Tools

Site Tools


assignments:a1

Differences

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

Link to this comparison view

Both sides previous revisionPrevious revision
Next revision
Previous revision
assignments:a1 [2010/02/07 22:51] franckassignments:a1 [2010/03/10 07:10] (current) joanna
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.   * 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, Panagiota Fatourou, Faith Ellen. 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 15th Annual ACM Symposium on Principles of Distributed Computing//, pages 267-275, Philadelphia, PA, USA, May 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. 
Line 38: Line 38:
   * 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.   * 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, 2003. ACM.+  * 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.   * 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.
assignments/a1.txt · Last modified: 2010/03/10 07:10 by joanna