Generic Concurrent

Lock-Free Linked List



For this project I implemented and tested a generic lock-free ADT in C++ that allows concurrent traversal, insertion and deletion while preserving data integrity.

This project addresses the issue of concurrent access to shared data.  This is important to applications in parallel algorithms, distributed computing, user-level thread implementation and multiprocessor operating systems.

When multiple processes concurrently access shared data the most important issues are data integrity and performance.  Data integrity can be maintained using standard mutual exclusion methods, however, this comes with a performance cost. 


Paper         

Attachments

Slide Presentation


Code :

          Main.cpp

          LockFreeList.h
                   
          test.h
          test.cpp

          lock.h
          lock.cpp

          CriticalSection.h
          CriticalSection.cpp
         


Introduction | Fuzzy Logic Controller | Generic Distribution and Filtering | Hot-Potato Routing | Lock-Free
Linked List | Grep for Windows | RSA

To contact us:

Phone: (617) 924-2974
Email: bushL2@cs.rpi.edu