- cmsg cancel <nfb4qf$m74$2@dont-email.me> - 5 Updates
- A more precise proof... - 1 Update
- LockFree SelfOrganizing List Opinion needed about correctness - 2 Updates
| bleachbot <bleachbot@httrack.com>: Apr 21 08:09PM +0200 |
| bleachbot <bleachbot@httrack.com>: Apr 21 08:58PM +0200 |
| bleachbot <bleachbot@httrack.com>: Apr 21 09:47PM +0200 |
| bleachbot <bleachbot@httrack.com>: Apr 21 09:51PM +0200 |
| bleachbot <bleachbot@httrack.com>: Apr 24 08:03PM +0200 |
| Ramine <ramine@1.1>: Apr 24 02:04PM -0700 Hello, If in a parallel program the locked region is 1/8 the parallel region, so at fewer cores and fewer threads, USL methodology can miss to give a good approximation of the scalability, but this cases constitutes a much much smaller part of the chance probabilisticaly that will miss the possibilitity of forecasting correctly, but since testing a database system or a parallel compression program will not give the right and exact solution that optimizes efficiently the criterion of the cost, so we can consider those cases benign and because they are part of the those hasards of this world. So i repeat: Because in the USL methodology the much much greater part of the chance probabilistically will hit and gives us the possibility of forecating up to 10X the maximum number of cores and threads of the performance data measurements, so it is a better approximation. And because a much much smaller part of the chance probabilistically will hit and gives us the possibility of forecating up to 5X the maximum number of cores and threads of the performance data measurements. So forecasting up to 10X the maximum number of cores and threads of the performance data measurements is a good approximation with USL methodology, so if you want to optimize the criterion of the cost, you have to forecast up to 10X the maximum number of cores and threads of the performance data measurements, and see the tendency, if it says that you can scale more and more on for example NUMA architecture , so when you want to buy bigger NUMA systems, make sure that you buy them with the right configuration that permit to add more processors and more memory, and you have to go buying step by step more and more processors and memory, and on each step you will be able to test empirically again the Computer NUMA system that you have bought with my USL programs,to better forecast again farther the scalability and optimize more the criterion of the cost, so as you have noticed my USL programs are great tools and important tools ! I have included the 32 bit and 64 bit windows executables of my programs inside the zip file to easy the job for you. You can download my USL programs version 3.0 with the source code from: https://sites.google.com/site/aminer68/universal-scalability-law-for-delphi-and-freepascal Thank you, Amine Moulay Ramdane. |
| Bonita Montero <Bonita.Montero@gmail.com>: Apr 21 11:08PM +0200 Efficient algorithms in an inefficent language are paradox. -- http://facebook.com/bonita.montero/ |
| tamashionuth@gmail.com: Apr 24 10:32AM -0700 On Friday, April 22, 2016 at 12:08:28 AM UTC+3, Bonita Montero wrote: > Efficient algorithms in an inefficent language are paradox. > -- > http://facebook.com/bonita.montero/ Yeah, I agree that Java may not be the best way to go. But is this algo lock-free? |
| 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