| aminer68@gmail.com: Oct 18 01:40PM -0700 Hello... I am an inventor of many software algorithms.. How have i been able to invente all those software algorithms such as my C++ synchronization objects library ? here is how: I have enhanced my IQ by working harder on computer science and by inventing many softwares , i have enhanced my IQ by doing more and more computer science and operational research and mathematics etc. Here is the proof that we can enhance our IQ: Ignore IQ Tests: Your Level of Intelligence Is Not Fixed for Life http://blogs.discovermagazine.com/crux/2014/08/27/ignore-iq-tests-intelligence-fixed-life/#.WCib0PkrJId You can download all my software projects from: https://sites.google.com/site/aminer68/ Thank you, Amine Moulay Ramdane. |
| "Öö Tiib" <ootiib@hot.ee>: Oct 18 01:06PM -0700 On Wednesday, 18 October 2017 21:34:16 UTC+3, JiiPee wrote: > object (which would then have automatically everything initialized to > first values by the constructor). When you have to "zero" the object to > its initial values (the same values as when the object is created). Normally it is better when objects are not reused in different roles. When we want to reuse object (for example in two roles) then it may make it dim and hard to follow (for rest of the program, for reader of code, for person debugging it) in what role it is. Additionally we must be sure that need for first role is always over by the time we use object for second role. If the roles are unrelated then that is lucky coincidence and may change and cause incorrect results. Reusing objects may give performance advantage because of reduced amount of allocations and deallocations. If that benefit is measurable then managing a whole pool (recycling center) of such objects typically gives even more notable advantage than reusing single objects here or there. |
| aminer68@gmail.com: Oct 18 12:55PM -0700 Hello..... My C++ synchronization objects library for Windows and Linux was updated.. I have added to my inventions the following: - A scalable reader-writer lock using scalable counting networks. This scalable reader-writer lock is starvation-free and it does spin-wait. and - A scalable reader-writer lock using scalable counting networks. This scalable reader-writer lock is starvation-free and it doesn't spin-wait, but it waits on the Event objects and my SemaMonitor, so it is energy efficient. Here is the papers of the scalable counting network algorithm: http://people.csail.mit.edu/shanir/publications/AHS.pdf and also read the following (the counting network is truly scalable, please look at the graph inside the paper): http://people.csail.mit.edu/shanir/publications/HLS.pdf Counting networks are truly scalable and are a special type of balancer networks which count. You can download my new C++ synchronization objects library from: https://sites.google.com/site/aminer68/c-synchronization-objects-library Thank you, Amine Moulay Ramdane. |
| You received this digest because you're subscribed to updates for this group. You can change your settings on the group membership page. To unsubscribe from this group and stop receiving emails from it send an email to comp.lang.c+++unsubscribe@googlegroups.com. |
No comments:
Post a Comment