Show simple item record

dc.contributor.author Farook, Mohammad en_US
dc.date.accessioned 2007-05-15T19:06:17Z
dc.date.available 2007-05-15T19:06:17Z
dc.date.issued 1998-02-01T00:00:00Z en_US
dc.identifier.uri http://hdl.handle.net/1993/1227
dc.description.abstract In shared memory systems concurrent processes operate on shared data structures. The consistency of the data structures is maintained by mutual exclusion, which is implemented by locking. Locking is an easy way of ensuring consistency of the shared data structures, but it has several drawbacks. The major drawback is that it increases the latency of all the processes as the shared data structure is accessed in a serial manner. It might also result in deadlocks when the process currently accessing the shared data structure is pre-empted or terminated. An alternate approach to avoid mutual exclusion by locking is by implementing lock-free data structures. This is possible by using basic synchronization primitives such as Compare & Swap and Double Compare & Swap. Processes can concurrently read and write on these data structures and also maintain the consistency of the data structure. Lock-free data structures reduces the latency of the processes and avoids deadlocks. This thesis presents lock-free linked listsalong with the algorithms that operate on them. The algorithms were simulated and were compared with Greenwald & Cheriton's and Valois' algorithms. The design of the linked lists along with the effective and efficient use of the synchronization primitives in the algorithms provides a improved performance over the other two algorithms. The correctness of the algorithms is also presented in the thesis. en_US
dc.format.extent 3752439 bytes
dc.format.extent 184 bytes
dc.format.mimetype application/pdf
dc.format.mimetype text/plain
dc.language en en_US
dc.language.iso en_US
dc.title Fast lock-free linked lists in distributed shared memory systems en_US
dc.degree.discipline Computer Science en_US
dc.degree.level Master of Science (M.Sc.) en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

View Statistics