Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.programming.threads > #2076 > unrolled thread
| Started by | aminer <aminer@toto.net> |
|---|---|
| First post | 2014-02-19 22:48 -0800 |
| Last post | 2014-02-20 10:25 -0800 |
| Articles | 2 — 1 participant |
Back to article view | Back to comp.programming.threads
Scalable RWLock 3.0 aminer <aminer@toto.net> - 2014-02-19 22:48 -0800
Re: Scalable RWLock 3.0 aminer <aminer@toto.net> - 2014-02-20 10:25 -0800
| From | aminer <aminer@toto.net> |
|---|---|
| Date | 2014-02-19 22:48 -0800 |
| Subject | Scalable RWLock 3.0 |
| Message-ID | <le3tuh$jmp$1@news.albasani.net> |
Hello, Scalable RWLock 3.0 is here... I have thought all those days about my previous scalable LW_RWLockX, what i was trying to do is to make the readers side starvation-free but i have created another problem , the prfevious alorithm favored more the readers over the writers and this is not good, so i have decided to write another algorithm that solves this problem, i have wrote a lightweight EventCount that supports the Signal() and Signal_all() and setSignal() and resetSignal(), the setSignal() and resetSignal() are the same as the setEvent() and resetEvent() of the Windows event object, and i have used a clever algorithm that uses this lightweight EventCount and this LW_RWLockX and RWLockX starvation-free and scalable and portable. Now you will find two algorithms inside the zipfile, one called LW_RWLockX that uses spin-wait and that supports the following requirement: 1/ It's starvation-free 2/ It's portable. I have also provided you with a new algorithm called RWLockX that uses less CPU resources and that is starvation-free and portable. Hope you will take a look at my new algorithms inside the zipfile. You can download my new scalable RWLock version 3.0 from: http://pages.videotron.com/aminer/ Thank you, Amine Moulay Ramdane.
[toc] | [next] | [standalone]
| From | aminer <aminer@toto.net> |
|---|---|
| Date | 2014-02-20 10:25 -0800 |
| Message-ID | <le56og$mtu$6@news.albasani.net> |
| In reply to | #2076 |
Hello... I correct... Scalable RWLock 3.0 is here... I have thought all those days about my previous scalable LW_RWLockX, what i was trying to do is to make the readers side starvation-free but i have created another problem , the previous algorithm favored more the readers over the writers and this is not good, so i have decided to write another algorithm that solves this problem, i have wrote a lightweight EventCount that supports the Signal() and Signal_all() and setSignal() and resetSignal(), the setSignal() and resetSignal() are the same as the setEvent() and resetEvent() of the Windows event object, and i have used a clever algorithm that uses this lightweight EventCount and now LW_RWLockX and RWLockX are starvation-free and scalable and portable. Now you will find two algorithms inside the zipfile, one called LW_RWLockX that uses spin-wait and that supports the following requirement: 1/ It's starvation-free 2/ It's portable. 3/ It's scalable I have also provided you with a new algorithm called RWLockX that uses less CPU resources and that is starvation-free and portable and scalable. Hope you will take a look at my new algorithms inside the zipfile. You can download my new scalable RWLock version 3.0 from: http://pages.videotron.com/aminer/ Thank you, Amine Moulay Ramdane.
[toc] | [prev] | [standalone]
Back to top | Article view | comp.programming.threads
csiph-web