- How do I look inside an .exe file to view the programming - 1 Update
- cmsg cancel <neub7g$e8r$2@dont-email.me> - 10 Updates
- You will ask me about my previous mathematical proof - 2 Updates
- I explain better my previous proof... - 1 Update
- I correct, please reread my mathematical proof - 1 Update
- I will be more precise on my mathematical proof using probability... - 1 Update
- Hope you have read my previous mathematical proof - 1 Update
- Read again my mathematical proof - 1 Update
- Here is my own and more intuitive mathematical proof - 1 Update
- Here is my solution and my new intuitive proof about the USL methodology... - 1 Update
- My Universal Scalability Law for Delphi and FreePascal was updated to version 3.0.. - 1 Update
| tychodevos@gmail.com: Apr 17 05:08AM -0700 Well, here is the real answer... It could be coded with any type of coding program what means that if its in JAVA coded it will have JAVA codes but if it is coded in an diffrent type of studio it will be diffrent to... The only thing I can help you with is cracking a .bat file and you can crack it with: http://www.angusj.com/resourcehacker/#download I hope this post worked for you... |
| bleachbot <bleachbot@httrack.com>: Apr 16 11:39PM +0200 |
| bleachbot <bleachbot@httrack.com>: Apr 17 01:04AM +0200 |
| bleachbot <bleachbot@httrack.com>: Apr 17 02:12AM +0200 |
| bleachbot <bleachbot@httrack.com>: Apr 17 02:14AM +0200 |
| bleachbot <bleachbot@httrack.com>: Apr 17 02:19AM +0200 |
| bleachbot <bleachbot@httrack.com>: Apr 17 03:06AM +0200 |
| bleachbot <bleachbot@httrack.com>: Apr 17 03:15AM +0200 |
| bleachbot <bleachbot@httrack.com>: Apr 17 04:01AM +0200 |
| bleachbot <bleachbot@httrack.com>: Apr 17 04:36AM +0200 |
| bleachbot <bleachbot@httrack.com>: Apr 17 04:38AM +0200 |
| Ramine <ramine@1.1>: Apr 16 10:40PM -0700 Hello, You will ask me about my previous mathematical proof this: How Amine are you calling your proof a mathematical proof? I am calling my previous proof a mathematical proof because a more intuitive proof that uses a reasonning with probability and logic is also a more intuitive mathematical proof. But there is an important thing to know: In my previous mathematical proof about the USL methodology i have made an approximation because we don't know about the empirical distribution of the probabilities of the the size of the serial parts of the Amdahl's law, so i think i have made a good approximation about this distribution , and i think my mathematical proof is sound and i think it demonstrates that the USL methododologyy is an amazing great tool that is successful. And my USL programs are a really amazing great tools ! 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. |
| Ramine <ramine@1.1>: Apr 16 10:42PM -0700 Hello............... You will ask me about my previous mathematical proof this: How Amine are you calling your proof a mathematical proof? I am calling my previous proof a mathematical proof because a more intuitive proof that uses a reasonning with probability and logic is also a more intuitive mathematical proof. But there is an important thing to know: In my previous mathematical proof about the USL methodology i have made an approximation because we don't know about the empirical distribution of the probabilities of the the size of the serial parts of the Amdahl's law, so i think i have made a good approximation about this distribution , and i think my mathematical proof is sound and i think it demonstrates that the USL methodology is an amazing great tool that is successful. And my USL programs are a really amazing great tools ! 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. |
| Ramine <ramine@1.1>: Apr 16 10:02PM -0700 Hello.... I am not crazy, please follow my proof... I explain better my previous proof... For a bigger part of the serial part of the Amdahl's law, here is my proof: If the serial part of the Amdahl's law is more bigger, so the chance to get contention with the USL methodology with fewer cores and fewer threads is bigger, so this will allow the USL methodology to have a better approximation of the predicted scalability and to forecast farther. But i will be clear on the smaller parts of the Amdahl's law: But if the serial part of the Amdahl's law is smaller , so the chance to get contention with the USL methodology with fewer cores and fewer threads will get smaller, so this will allow the USL methodology to forecast farther with fewer cores and fewer threads. But since when the serial part of the Amdahl's law is bigger you will hit probabilistically more the contention and this will make the USL methodology work, and since the chance probabilistically that the bigger parts that causes contention and the smaller serial parts that are much farther from the serial part that causes contention is much higher, so this this prooves mathematically that USL methodology is successful and is an amazing great tool that can predict scalability and forecast scalability much farther. This is my mathematical proof using probability. So now you undertand that USL methodology is a really an amazing great tool ! And my USL programs are a really amazing great tools ! 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. |
| Ramine <ramine@1.1>: Apr 16 09:17PM -0700 Hello.......... I will be more precise on my mathematical proof using probability... If the serial part of the Amdahl's law is more bigger, so the chance to get contention with the USL methodology with fewer cores and fewer threads is bigger, so this will allow the USL methodology to have a better approximation of the predicted scalability and to forecast farther. But if the serial part of the Amdahl's law is smaller , so the chance to get contention with the USL methodology with fewer cores and fewer threads will get smaller, so this will allow the USL methodology to forecast farther. But since when the serial part of the Amdahl's law is bigger you will hit probabilistically more the contention, and since we can make an approximation that smaller serial parts of Amdahl's law are distributed probabilistically in a such way that you will get more chance probabilistically that you will get farther from the smaller serial parts of the Amdahl's law, so this prooves mathematically that USL methodology is successful and is an amazing great tool that can predict scalability. This is my mathematical proof using probability. So now you undertand that USL methodology is a really an amazing great tool ! And my USL programs are a really amazing great tools ! 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. |
| Ramine <ramine@1.1>: Apr 16 09:08PM -0700 Hello.... I will be more precise on my mathematical proof using probability... If the serial part of the Amdahl's law is more bigger, so the chance to get contention with the USL methodology with fewer cores and fewer threads is bigger, so this will allow the USL methodology to have a better approximation of the predicted scalability and to forecast farther. But if the serial part of the Amdahl's law is smaller , so the chance to get contention with the USL methodology with fewer cores and fewer threads will get smaller, so this will allow the USL methodology to forecast farther. But since when the serial part of the Amdahl's law is bigger you will hit probabilistic more contention, and since we can make an approximation that smaller serial parts of Amdahl's law are distributed probabilistically in a such way that you will get more chance probabilistically that you will get farther from the smaller serial parts of the Amdahl's law, so this prooves mathematically that USL methodology is successful and is an amazing great tool that can predict scalability. This is my mathematical proof using probability. So now you undertand that USL methodology is a really an amazing great tool ! And my USL programs are a really amazing great tools ! 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. |
| Ramine <ramine@1.1>: Apr 16 08:21PM -0700 Hello.... Hope you have read my previous mathematical proof using probability that explains the USL methodology ! So now you undertand that USL methodology is a really an amazing great tool ! And my USL programs are a really amazing great tools ! 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. |
| Ramine <ramine@1.1>: Apr 16 08:17PM -0700 Hello................. Universal scalability Law (USL) methodology is really amazing ! Here is my own and more intuitive mathematical proof using probability that explains the USL methodology... As state the Amdahl's law, a parallel program can be constituted of serial part and a parallel part, that we call S and P. Now since in the overall application the S (serial part) is variable , it can be smaller or bigger, when you will do the benchmark of your parallel program with fewer number of cores and threads, let say up to 8 cores and 8 threads, so if the serial part is bigger so you will get more chance to get contention and this will allow the USL methodology to get a good approximation, but the chance on the overall parallel application to get a bigger serial part that get contention with 8 cores and 8 threads is small, so since you will have less chance to get contention on 8 cores, so the USL methodology with fewer cores and fewer threads will constitute a better approximation of the predicted scalability and will allow the USL methodology to forecast scalability farther, so this is amazing and successful ! and i say USL methodology is an amazing and succefull tool. Hope you have understood my proof. So i think that USL methodology is a great tool. 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. Thank you, Amine Moulay Ramdane. |
| Ramine <ramine@1.1>: Apr 16 08:14PM -0700 Hello, Universal scalability Law (USL) methodology is really amazing ! Here is my own and more intuitive mathematical proof using probability that explains the USL methodology... As state the Amdahl's law, a parallel program can be constituted of serial part and a parallel part, that we call S and P. Now since in the overall application the S (serial part) is variable , it can be smaller or bigger, when you will do the benchmark of your parallel program with fewer number of cores and threads, let say up to 8 cores and 8 threads, so if the serial part is bigger so you will get more chance to get contention and this will allow the USL methodology to get a good approximation, but the chance on the overall parallel application to get a bigger serial part that get contention with 8 cores and 8 threads is small, so since you will have less chance to get contention on 8 cores, so the USL methodology with fewer cores and fewer threads will constitute a better approximation of the predicted scalability and will allow the USL methodology to gerecat scalability farther, so this is amazing and successful ! and i say USL methodology is an amazing and succefull tool. Hope you have understood my proof. So i think that USL methodology is a great tool. 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. Thank you, Amine Moulay Ramdane. |
| Ramine <ramine@1.1>: Apr 16 07:06PM -0700 Hello.... You have seen me thinking and writing yesterday about the USL methodology... Here is my solution and my new intuitive proof about the USL methodology... USL methodology that uses nonlinear regression or poylynomial regression is a methodology that is based on probability, i explain: When the serial part of the overall parallel program is more bigger, so the chance to score better on the contention and the crosstalk is higher and this will constitute a useful approximation of the Alpha and Beta coefficient of USL, because when the chance is higher in probability the contention and the crosstalk of the predicted scalability will be a better approximation, but when the serial part of the overall parallel program is more and more smaller so the chance to score better on the contention and the crosstalk is more and more lower, so the result of this new and more intuitive proof constitute a good approximation that enable the forecasting of the scalability much farther.. this is what make the USL methodology really amazing and successful , so i think that my USL programs are great and important tools that predict scalability. So i think that USL methodology is a great tool. 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. |
| Ramine <ramine@1.1>: Apr 16 05:40PM -0700 Hello, My Universal Scalability Law for Delphi and FreePascal was updated to version 3.0.. Finally i have added nonlinear regression using the simplex method as minimization, this is all about mathematics, so now you have two options: When you pass the -nlr option to my usl or usl_graph programs they will solve the problem using mathematical nonlinear regression using the simplex method as minimization that is more efficient. If you don't pass -nlr, they will use the default solver that is polynomial regression. So now my USL prorams are really powerful and complete, and i think they are stable. I have included the 32 bit and 64 bit 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. |
| 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