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
Last revisionBoth sides next revision
assignments:a1 [2007/10/12 13:14] franckassignments:a1 [2007/10/22 19:01] bashir
Line 29: Line 29:
  
 As the audience of your report, consider your fellow students in the course. As the audience of your report, consider your fellow students in the course.
 +
 +
 +
 +
  
  
Line 68: Line 72:
  
    * 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.    * 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, Myoung Ho Kim [[http://www.springerlink.com/content/q1uny2fdlbf8yxrx/?p=4a350778aa4d44abb4a50125e0077682&pi=0|A Concurrent B-Tree Algorithm Using a Cooperative Locking Protocol]]. // Lecture Notes in Computer Science, Springer Berlin / Heidelberg//, Volume 2712/2003.
  
assignments/a1.txt · Last modified: 2007/10/24 12:41 by franck