Differences

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

--- assignments:a1 [2009/04/10 17:50] – mirokuc
+++ assignments:a1 [2009/04/13 23:51] (current) – franck
@@ Line 40: / Line 40: @@
   * Liping Han:\\ Vladimir Lanin and Dennis Shasha. [[http://portal.acm.org/citation.cfm?id=324589#|A symmetric concurrent B-tree algorithm]]. In //Proceedings of 1986 ACM Fall Joint Computer Conference//, pages 380-389, Dallas, Texas, United States, 1986. IEEE Computer Society Press.
   * Xuanqing Chu:\\ Patrick Keane and Mark Moir. [[http://dx.doi.org/10.1145/301308.301319|A simple local-spin group mutual exclusion algorithm]]. In //Proceedings of the 18th annual ACM Symposium on Principles of Distributed Computing//, pages 23-32, Atlanta, Georgia, United States, 1999. ACM.\\ Srdjan Petrovic. [[http://dx.doi.org/10.1016/j.ipl.2005.04.009|Space-efficient FCFS group mutual exclusion]]. //Information Processing Letters//, 95(2): 343-350, July 2005.
-  * Alexandre Walzberg:\\ MikhailFomitchev and Eric Ruppert [[http://www.cse.yorku.ca/~ruppert/papers/lfll.pdf|Lock-Free Linked Lists and Skip Lists]]. //PODC'04//, July 25-28, 2004, St. Johns, Newfoundland, Canada. ACM.
+  * Alexandre Walzberg:\\ Mikhail Fomitchev and Eric Ruppert.[[http://dx.doi.org/10.1145/1011767.1011776|Lock-Free Linked Lists and Skip Lists]]. In //Proceedings of the 23rd annual ACM Symposium on Principles of Distributed Computing//, pages 50-59, St. Johns, Newfoundland, Canada, July 2004. ACM.
-  * Huxia Shi:\\ Carla Schlatter Ellis. [[http://portal.acm.org/citation.cfm?id=22952.22954&coll=portal&dl=ACM&CFID=15590639&CFTOKEN=82226420|Concurrency in linear hashing]]. //ACM Transactions on Database Systems (TODS)//, 12(2): 195-217, June 1987.
+  * Huxia Shi:\\ Carla Schlatter Ellis. [[http://dx.doi.org/10.1145/22952.22954|Concurrency in linear hashing]]. //ACM Transactions on Database Systems//, 12(2): 195-217, June 1987.
-  * Miroslaw Kuc:\\ Piotr Kraj, Ashok Sharma, Nikhil Garge, Robert Podolsky, and Richard A McIndoe. [[http://www.pubmedcentral.nih.gov/articlerender.fcgi?artid=2375128]]. BMC Bioinformatics. 2008; 9: 200.
+  * Miroslaw Kuc:\\ Piotr Kraj, Ashok Sharma, Nikhil Garge, Robert Podolsky, and Richard A McIndoe. [[http://dx.doi.org/10.1186/1471-2105-9-200|ParaKMeans: Implementation of a parallelized K-means algorithm suitable for general laboratory use]]. //BMC Bioinformatics//, 9: 200, April 2008.\\ Ruoming Jin and Ge Yang. [[http://dx.doi.org/10.1109/TKDE.2005.18|Shared Memory Parallelization of Data Mining Algorithms: Techniques, Programming Interface, and Performance]]. //IEEE Transactions on Knowledge and Data Engineering//, 17(1): 71-89, January 2005.
-\\ Ruoming Jin and Ge Yang. [[http://portal.acm.org/citation.cfm?id=1038207]]. IEEE Transactions on Knowledge and Data Engineering, Volume 17 ,  Issue 1  (January 2005), Pages: 71 - 89
+  * Ulka Thaker:\\ Anurag Kahol, Sumit Khurana, Sandeep K.S. Gupta, Pradip K. Srimani. [[http://dx.doi.org/10.1006/jpdc.2000.1719|Adaptive Distributed Dynamic Channel Allocation for Wireless Networks]]. //Journal of Parallel and Distributed Computing//, 16(7): 898-914, July 2001.
+  * Xin Zhang:\\ Daniel Lehmann and Michael O. Rabin [[http://dx.doi.org/10.1145/567532.567547|On the advantages of free choice: a symmetric and fully distributed solution to the dining philosophers problem]]. In //Proceedings of the 8th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages//, pages 133–138, Williamsburg, VI, USA, January 1981. ACM.\\ I. Rhee, A. Warrier, and L. Xu [[http://www.csc.ncsu.edu/faculty/rhee/export/zmac/publications/DRAND-Technical-report.pdf|Randomized dining philosophers to TDMA scheduling in wireless sensor networks]]. Technical Report TR-2005-20, Computer Science Department, North Carolina State University, Raleigh, NC, USA, 2005.