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
Next revisionBoth sides next revision
assignments:a1 [2007/10/09 23:47] franckassignments:a1 [2007/10/21 14:36] franck
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 63: Line 69:
  
    * 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.    * 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.
 +
assignments/a1.txt · Last modified: 2007/10/24 12:41 by franck

Donate Powered by PHP Valid HTML5 Valid CSS Driven by DokuWiki