A Wait-free Queue with Poly-logarithmic Worst-case Step Complexity
dc.contributor.advisor | Ruppert, Eric | |
dc.contributor.author | Naderibeni, Hossein | |
dc.date.accessioned | 2023-03-28T21:15:14Z | |
dc.date.available | 2023-03-28T21:15:14Z | |
dc.date.copyright | 2022-11-09 | |
dc.date.issued | 2023-03-28 | |
dc.date.updated | 2023-03-28T21:15:14Z | |
dc.degree.discipline | Computer Science | |
dc.degree.level | Master's | |
dc.degree.name | MSc - Master of Science | |
dc.description.abstract | In this work, we introduce a novel linearizable wait-free queue implementation. Linearizability and lock-freedom are standard requirements for designing shared data structures. To the best of our knowledge, all of the existing linearizable lock-free queues in the literature have a common problem in their worst case, called the CAS Retry Problem. We show that our algorithm avoids this problem with the helping mechanism which we use and has a worst-case running time better than prior lock-free queues. The amortized number of steps for an Enqueue or Dequeue in our algorithm is O(log^2 p + log q), where p is the number of processes and q is the size of the queue when the operation is linearized. | |
dc.identifier.uri | http://hdl.handle.net/10315/40975 | |
dc.language | en | |
dc.rights | Author owns copyright, except where explicitly noted. Please contact the author directly with licensing requests. | |
dc.subject | Computer science | |
dc.subject.keywords | Distributed computing | |
dc.subject.keywords | Concurrent algorithms | |
dc.subject.keywords | Shared data structures | |
dc.subject.keywords | Wait-free queues | |
dc.subject.keywords | Linearizable | |
dc.subject.keywords | CAS retry problem | |
dc.subject.keywords | Polylogarithmic step complexity | |
dc.title | A Wait-free Queue with Poly-logarithmic Worst-case Step Complexity | |
dc.type | Electronic Thesis or Dissertation |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- A_Wait_free_Queue_with_Poly_logarithmic_Step_Complexity-2.pdf
- Size:
- 1.14 MB
- Format:
- Adobe Portable Document Format