COSC6490A

User Tools

Site Tools

You are here: Concurrent Object Oriented Languages » Assignments » Assignment 1
Trace: • Assignment 1
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 [2007/10/21 14:36] – franckassignments:a1 [2007/10/24 12:41] (current) – 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 73: Line 75:
  
    * 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.    * 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.
  
assignments/a1.1192977389.txt.gz · Last modified: by franck