Skip to content

Comparing the performance of two different implementations of the concurrent unbounded queue

License

Notifications You must be signed in to change notification settings

lsmgeb89/concurrent_unbounded_queue

Repository files navigation

Concurrent Unbounded Queue

Summary

  • Implemented a concurrent unbounded queue that supports three operations, enque, deque and is-empty by using the following two approaches:
    1. lock-based synchronization
    2. lock-free synchronization
  • Implemented a common test facility that could generate operations with different distribution and test unbounded queues by different degree of concurrency (number of threads concurrently operating on a unbounded queue) according to the requirements of testing throughput
  • Compared the averaged performance of the two implementations as a function of number of threads (varied from one to the number of logical cores in the machine) under different distribution of operations

Project Information

  • Course: Introduction to Multicore Programming (CS 6301)
  • Professor: Neeraj Mittal
  • Semester: Fall 2016
  • Programming Language: C++
  • Build Tool: CMake

About

Comparing the performance of two different implementations of the concurrent unbounded queue

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published