| Horizon68 <horizon@horizon.com>: May 27 11:17AM -0700 Hello.. Read this: Look at this interesting video: 2D vs 3D Stacking: Intel's plan to beat Zen 2 https://www.youtube.com/watch?v=26EzYDBNwLU Thank you, Amine Moulay Ramdane. |
| Horizon68 <horizon@horizon.com>: May 27 10:54AM -0700 Hello.. My Parallel Compression Library was updated to version 4.41 I have just made the Linux version work correctly, but the Windows version is working correctly. The Linux version works with Freepascal in the Delphi mode, but it is easily portable to the Delphi for Linux. And the Windows version works with Delphi and Freepascal. You can download it from: https://sites.google.com/site/scalable68/parallel-compression-library Thank you, Amine Moulay Ramdane. |
| Horizon68 <horizon@horizon.com>: May 27 10:24AM -0700 Hello.. I have just updated my scalable reference counting with efficient support for weak references to version 1.3 I have just added a TAMInterfacedPersistent that is a scalable reference counted version, and now i think i have just made it complete and powerful. Because I have just read the following web page: https://www.codeproject.com/Articles/1252175/Fixing-Delphis-Interface-Limitations But i don't agree with the writting of the guy of the above web page, because i think you have to understand the "spirit" of Delphi, here is why: A component is supposed to be owned and destroyed by something else, "typically" a form (and "typically" means in english: in "most" cases, and this is the most important thing to understand). In that scenario, reference count is not used.If you pass a component as an interface reference, it would be very unfortunate if it was destroyed when the method returns. Therefore, reference counting in TComponent has been removed. Also because i have just added TAMInterfacedPersistent to my invention. To use scalable reference counting with Delphi and FreePascal, just replace TInterfacedObject with my TAMInterfacedObject that is the scalable reference counted version, and just replace TInterfacedPersistent with my TAMInterfacedPersistent that is the scalable reference counted version, and you will find both my TAMInterfacedObject and my TAMInterfacedPersistent inside the AMInterfacedObject.pas file, and to know how to use weak references please take a look at the demo that i have included called example.dpr and look inside my zip file at the tutorial about weak references, and to know how to use delegation take a look at the demo that i have included called test_delegation.pas, and take a look inside my zip file at the tutorial about delegation that learns you how to use delegation. And please read the readme file inside the zip file that i have just extended to make you understand more. You can download my new scalable reference counting with efficient support for weak references version 1.3 from: https://sites.google.com/site/scalable68/scalable-reference-counting-with-efficient-support-for-weak-references Thank you, Amine Moulay Ramdane. |
| Horizon68 <horizon@horizon.com>: May 21 03:26PM -0700 Hello, About my new invention that is a Fast Mutex.. I have just invented a Fast mutex with the following characteristics: 1- Starvation-free 2- Good fairness 3- It reduces very efficiently the cache coherence traffic 4- Very good fast path performance But can you please run the following windows 64-bit benchmark of it and report to me the results, but you need to have 8 cores or more, here is the benchmark of mine: https://sites.google.com/site/scalable68/benchmark-of-my-new-fast-mutex Thank you, Amine Moulay Ramdane. |
| Horizon68 <horizon@horizon.com>: May 21 03:32PM -0700 On 5/21/2019 3:26 PM, Horizon68 wrote: > Thank you, > Amine Moulay Ramdane. And please report also to me how many cores you have. 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.programming.threads+unsubscribe@googlegroups.com. |
No comments:
Post a Comment