| aminer68@gmail.com: May 08 01:23PM -0700 Hello, About my html tutorial of the Jackson network problem.. I have just corrected some english typos in my html tutorial of the analytic and mathematical modeling of the Jackson network problem that is also provided to you inside my zip file as a PDQ demo called test_network.pas. So you can download again my PDQ for Delphi and Freepascal from here: https://sites.google.com/site/scalable68/pdq-for-delphi-and-freepascal My other web link about my tutorial is here: https://sites.google.com/site/scalable68/jackson-network-problem Read my previous thoughts: More about me and more about my education and my Diploma.. As you have just noticed, i have just ported PDQ to Delphi and Freepascal and i have just posted about it, not only that, but i have just included two demos inside the zip file, and as you have just noticed i have also included inside the zip file my html tutorial of the analytic modeling of the jackson network problem of my PDQ demo called test_network.pas that i have included inside the zip file. You can download it from my website here: https://sites.google.com/site/scalable68/pdq-for-delphi-and-freepascal And as you have noticed, i am not just a more serious software developer , but i have also studied operational research and i am also an inventor of many scalable algorithms and there implementations. Read more here about me: More about my education and my Diploma.. My name is Amine Moulay Ramdane, i am a white arab from Morocco, i am a gentleman type of person, and i live in Quebec Canada since 1989, i am a Canadian from Morocco, and you have seen me writing my thoughts of my political philosophy here, and now i will talk about my education and my Diploma: my Diploma is a university level Diploma, my school in Morocco where i have studied and gotten my university level Diploma in Microelectronics and informatics was under the control of Paris Academie in France (we call it Académie de Paris), and here it is: https://translate.google.com/translate?hl=en&sl=auto&tl=en&u=https%3A%2F%2Ffr.wikipedia.org%2Fwiki%2FAcad%25C3%25A9mie_de_Paris And i have continued to study one more year of applied mathematics in university of Montreal in Quebec Canada, and i have succeeded this one year in applied mathematics in university of Montreal, so with my Diploma and this one year of applied mathematics i have studied and succeeded 3 years at the university level, after that i have studied Network administration and i have also worked as a network administrator and as software developer consultant, the name of my company was and is Cyber-NT Communications in Quebec Canada, and around years 2001 and 2002 i have started to implement some of my softwares like PerlZip that looked like PkZip of PKware software company, but i have implemented it for Perl , and i have implemented the Dynamic Link Libraries of my PerlZip that permits to compress and decompress etc. with the "Delphi" compiler, so my PerlZip software product was very fast and very efficient, in year 2002 i have posted the Beta version on internet, and as a proof , please read about it here: http://computer-programming-forum.com/52-perl-modules/ea157f4a229fc720.htm And after that i have sold the release version of my PerlZip product to many many companies and to many individuals around the world, and i have even sold it to many Banks in Europe, and with that i have made more money. And after that i have continued to work like a software developer consultant and network administrator, the name of my company was and is CyberNT Communications, Here is my company in Quebec(Canada) called CyberNT Communications, i have worked as a software developer and as a network administrator, read the proof here: https://opencorporates.com/companies/ca_qc/2246777231 Also read the following part of a somewhat old book of O'Reilly called Perl for System Administration by David N. Blank-Edelman, and you will notice that it contains my name and it speaks about some of my Perl modules: https://www.oreilly.com/library/view/perl-for-system/1565926099/ch04s04.html As you are noticing (read below) that i have talked about management by posting the following web link about the way of decentralization and its benefits: Managing complex programs – standardize and decentralize for efficiency and agility Read more here: http://www.reddal.com/insights/managing-complex-programs-standardize-and-decentralize-for-agile-control/ But i have also studied operational research, and when you study operational research you will find management or operations management easy, this is why you have noticed that i have implemented many tools of operational research such as my PERT++, here it is, read about it and download it from my website here: https://sites.google.com/site/scalable68/pert-an-enhanced-edition-of-the-program-or-project-evaluation-and-review-technique-that-includes-statistical-pert-in-delphi-and-freepascal And i have also implemented my following projects of operational research: M/M/n queuing model simulation with Object Pascal https://sites.google.com/site/scalable68/m-m-n-queuing-model-simulation-with-object-pascal And my Maxflow algorithm for Delphi and FreePascal https://sites.google.com/site/scalable68/maxflow-algorithm-for-delphi-and-freepascal Please look at my sofware projects on my website where i have put some of my inventions of my scalable algorithms such as my invention of a Scalable reference counting with efficient support for weak references here: https://sites.google.com/site/scalable68/scalable-reference-counting-with-efficient-support-for-weak-references Here is my website where i have put some my software projects: https://sites.google.com/site/scalable68/ I am also an inventor of many scalable algorithms, read my following writing to notice it: And here is some of my other inventions: Here is my other new invention.. As you have noticed i have just implemented my EasyList here: https://sites.google.com/site/scalable68/easylist-for-delphi-and-freepascal But i have just enhanced its algorithm to be scalable in the Add() method and in the search method, but it is not all , i will use for that my just new invention that is my generally scalable counting networks, also its parallel sort algorithm will become much much more scalable , because i will use for that my other invention of my fully scalable Threadpool, and it will use a fully scalable parallel merging algorithm , and read below about my just new invention of generally scalable counting networks: Here is my previous new invention of a scalable algorithm: I have just read the following PhD paper about the invention that we call counting networks and they are better than Software combining trees: Counting Networks http://people.csail.mit.edu/shanir/publications/AHS.pdf And i have read the following PhD paper: http://people.csail.mit.edu/shanir/publications/HLS.pdf So as you are noticing they are saying in the conclusion that: "Software combining trees and counting networks which are the only techniques we observed to be truly scalable" But i just found that this counting networks algorithm is not generally scalable, and i have the logical proof here, this is why i have just come with a new invention that enhance the counting networks algorithm to be generally scalable. And i think i will sell my new algorithm of a generally scalable counting networks to Microsoft or Google or Embarcadero or such software companies. So you have to be careful with the actual counting networks algorithm that is not generally scalable. My other new invention is my scalable reference counting and here it is: https://sites.google.com/site/scalable68/scalable-reference-counting-with-efficient-support-for-weak-references And my other new invention is my scalable Fast Mutex that is really powerful, and here it is: About fair and unfair locking.. I have just read the following lead engineer at Amazon: Highly contended and fair locking in Java https://brooker.co.za/blog/2012/09/10/locking.html So as you are noticing that you can use unfair locking that can have starvation or fair locking that is slower than unfair locking. I think that Microsoft synchronization objects like the Windows critical section uses unfair locking, but they still can have starvation. But i think that this not the good way to do, because i am an inventor and i have invented a scalable Fast Mutex that is much more powerful , because with my Fast Mutex you are capable to tune the "fairness" of the lock, and my Fast Mutex is capable of more than that, read about it on my following thoughts: More about research and software development.. I have just looked at the following new video: Why is coding so hard... https://www.youtube.com/watch?v=TAAXwrgd1U8 I am understanding this video, but i have to explain my work: I am not like this techlead in the video above, because i am also an "inventor" that has invented many scalable algorithms and there implementions, i am also inventing effective abstractions, i give you an example: Read the following of the senior research scientist that is called Dave Dice: Preemption tolerant MCS locks https://blogs.oracle.com/dave/preemption-tolerant-mcs-locks As you are noticing he is trying to invent a new lock that is preemption tolerant, but his lock lacks some important characteristics, this is why i have just invented a new Fast Mutex that is adaptative and that is much much better and i think mine is the "best", and i think you will not find it anywhere, my new Fast Mutex has the following characteristics: 1- Starvation-free 2- Tunable fairness 3- It keeps efficiently and very low its cache coherence traffic 4- Very good fast path performance 5- And it has a good preemption tolerance. 6- It is faster than scalable MCS lock this is how i am an "inventor", and i have also invented other scalable algorithms such as a scalable reference counting with efficient support for weak references, and i have invented a fully scalable Threadpool, and i have also invented a Fully scalable FIFO queue, and i have also invented other scalable algorithms and there implementations, and i think i will sell some of them to Microsoft or to Google or Embarcadero or such software companies. And here is one of my new software project that is my powerful Parallel Compression Library was updated to version 4.45 You can download it from: https://sites.google.com/site/scalable68/parallel-compression-library And read more about it below: Author: Amine Moulay Ramdane Description: Parallel Compression Library implements Parallel LZ4 , Parallel LZMA , and Parallel Zstd algorithms using my Thread Pool Engine. - It supports memory streams, file streams and files - 64 bit supports - lets you create archive files over 4 GB , supports archives up to 2^63 bytes, compresses and decompresses files up to 2^63 bytes. - Parallel compression and parallel decompression are extremely fast - Now it supports processor groups on windows, so that it can use more than 64 logical processors and it scales well. - It's NUMA-aware and NUMA efficient on windows (it parallelizes the reads and writes on NUMA nodes) - It minimizes efficiently the contention so that it scales well. - It supports both compression and decompression rate indicator - You can test the integrity of your compressed file or stream - It is thread-safe, that means that the methods can be called from multiple threads - Easy programming interface - Full source codes available. Now my Parallel compression library is optimized for NUMA (it parallelizes the reads and writes on NUMA nodes) and it supports processor groups on windows and it uses only two threads that do the IO (and they are not contending) so that it reduces at best the contention, so that it scales well. Also now the process of calculating the CRC is much more optimized and is fast, and the process of testing the integrity is fast. I have done a quick calculation of the scalability prediction for my Parallel Compression Library, and i think it's good: it can scale beyond 100X on NUMA systems. The Dynamic Link Libraries for Windows and Dynamic shared libraries for Linux of the compression and decompression algorithms of my Parallel Compression Library and for my Parallel archiver were compiled from C with the optimization level 2 enabled, so they are very fast. Here are the parameters of the constructor: First parameter is: The number of cores you have specify to run the compression algorithm in parallel. Second parameter is: A boolean parameter that is processorgroups to support processor groups on windows , if it is set to true it will enable you to scale beyond 64 logical processors and it will be NUMA efficient. Just look at the Easy compression library for example, if you have noticed it's not a parallel compression library: http://www.componentace.com/ecl_features.htm And look at its pricing: http://www.componentace.com/order/order_product.php?id=4 My parallel compression library costs you 0$ and it's a parallel compression library.. My Parallel compression library was updated, i have ported the Parallel LZ4 compression algorithm(one of the fastest in the world) to the Windows 64 bit system, now Parallel LZ4 compression algorithm is working perfectly with Windows 32 bit and 64 bit, if you want to use Windows 64 bit Parallel LZ4 just copy the lz4_2.dll inside the LZ4_64 directory (that you find inside the zip file) to your current directory or to the c:\windows\SysWow64 directory, and if you want to use the Windows 32bit Parallel LZ4 use the lz4_2.dll inside the LZ4_32 directory. If you want to use Windows 64 bit Parallel LZMA with Windows 64 bit just copy the LZMAStream1.dll inside the LZMA_fpc64 directory and LZMAStream2.dll inside LZMA_dcc64 directory to your current directory or to the c:\windows\SysWow64 directory, and if you want to use Windows 32bit Parallel LZMA copy the LZMAStream1.dll inside the LZMA_fpc32 directory and LZMAStream2.dll inside LZMA_dcc32 directory to your current directory or to the c:\windows\system32 directory. Operating systems: Windows , Linux (x86) Language: FPC Pascal v2.2.0+ / Delphi 7+: http://www.freepascal.org/ Required FPC switches: -O3 -Sd -Sd for delphi mode.... Required Delphi switches: -$H+ -DDelphi32 Required Delphi XE-XE5 switches: -DXE {$DEFINE CPU32} and {$DEFINE Windows32} for 32 bit systems {$DEFINE CPU64} and {$DEFINE Windows64} for 64 bit systems Thank you, Amine Moulay Ramdane. |
| aminer68@gmail.com: May 08 12:21PM -0700 Hello, More about me and more about my education and my Diploma.. As you have just noticed, i have just ported PDQ to Delphi and Freepascal and i have just posted about it, not only that, but i have just included two demos inside the zip file, and as you have just noticed i have also included inside the zip file my html tutorial of the analytic modeling of the jackson network problem of my PDQ demo called test_network.pas that i have included inside the zip file. You can download it from my website here: https://sites.google.com/site/scalable68/pdq-for-delphi-and-freepascal And as you have noticed, i am not just a more serious software developer , but i have also studied operational research and i am also an inventor of many scalable algorithms and there implementations. Read more here about me: More about my education and my Diploma.. My name is Amine Moulay Ramdane, i am a white arab from Morocco, i am a gentleman type of person, and i live in Quebec Canada since 1989, i am a Canadian from Morocco, and you have seen me writing my thoughts of my political philosophy here, and now i will talk about my education and my Diploma: my Diploma is a university level Diploma, my school in Morocco where i have studied and gotten my university level Diploma in Microelectronics and informatics was under the control of Paris Academie in France (we call it Académie de Paris), and here it is: https://translate.google.com/translate?hl=en&sl=auto&tl=en&u=https%3A%2F%2Ffr.wikipedia.org%2Fwiki%2FAcad%25C3%25A9mie_de_Paris And i have continued to study one more year of applied mathematics in university of Montreal in Quebec Canada, and i have succeeded this one year in applied mathematics in university of Montreal, so with my Diploma and this one year of applied mathematics i have studied and succeeded 3 years at the university level, after that i have studied Network administration and i have also worked as a network administrator and as software developer consultant, the name of my company was and is Cyber-NT Communications in Quebec Canada, and around years 2001 and 2002 i have started to implement some of my softwares like PerlZip that looked like PkZip of PKware software company, but i have implemented it for Perl , and i have implemented the Dynamic Link Libraries of my PerlZip that permits to compress and decompress etc. with the "Delphi" compiler, so my PerlZip software product was very fast and very efficient, in year 2002 i have posted the Beta version on internet, and as a proof , please read about it here: http://computer-programming-forum.com/52-perl-modules/ea157f4a229fc720.htm And after that i have sold the release version of my PerlZip product to many many companies and to many individuals around the world, and i have even sold it to many Banks in Europe, and with that i have made more money. And after that i have continued to work like a software developer consultant and network administrator, the name of my company was and is CyberNT Communications, Here is my company in Quebec(Canada) called CyberNT Communications, i have worked as a software developer and as a network administrator, read the proof here: https://opencorporates.com/companies/ca_qc/2246777231 Also read the following part of a somewhat old book of O'Reilly called Perl for System Administration by David N. Blank-Edelman, and you will notice that it contains my name and it speaks about some of my Perl modules: https://www.oreilly.com/library/view/perl-for-system/1565926099/ch04s04.html As you are noticing (read below) that i have talked about management by posting the following web link about the way of decentralization and its benefits: Managing complex programs – standardize and decentralize for efficiency and agility Read more here: http://www.reddal.com/insights/managing-complex-programs-standardize-and-decentralize-for-agile-control/ But i have also studied operational research, and when you study operational research you will find management or operations management easy, this is why you have noticed that i have implemented many tools of operational research such as my PERT++, here it is, read about it and download it from my website here: https://sites.google.com/site/scalable68/pert-an-enhanced-edition-of-the-program-or-project-evaluation-and-review-technique-that-includes-statistical-pert-in-delphi-and-freepascal And i have also implemented my following projects of operational research: M/M/n queuing model simulation with Object Pascal https://sites.google.com/site/scalable68/m-m-n-queuing-model-simulation-with-object-pascal And my Maxflow algorithm for Delphi and FreePascal https://sites.google.com/site/scalable68/maxflow-algorithm-for-delphi-and-freepascal Please look at my sofware projects on my website where i have put some of my inventions of my scalable algorithms such as my invention of a Scalable reference counting with efficient support for weak references here: https://sites.google.com/site/scalable68/scalable-reference-counting-with-efficient-support-for-weak-references Here is my website where i have put some my software projects: https://sites.google.com/site/scalable68/ I am also an inventor of many scalable algorithms, read my following writing to notice it: And here is some of my other inventions: Here is my other new invention.. As you have noticed i have just implemented my EasyList here: https://sites.google.com/site/scalable68/easylist-for-delphi-and-freepascal But i have just enhanced its algorithm to be scalable in the Add() method and in the search method, but it is not all , i will use for that my just new invention that is my generally scalable counting networks, also its parallel sort algorithm will become much much more scalable , because i will use for that my other invention of my fully scalable Threadpool, and it will use a fully scalable parallel merging algorithm , and read below about my just new invention of generally scalable counting networks: Here is my previous new invention of a scalable algorithm: I have just read the following PhD paper about the invention that we call counting networks and they are better than Software combining trees: Counting Networks http://people.csail.mit.edu/shanir/publications/AHS.pdf And i have read the following PhD paper: http://people.csail.mit.edu/shanir/publications/HLS.pdf So as you are noticing they are saying in the conclusion that: "Software combining trees and counting networks which are the only techniques we observed to be truly scalable" But i just found that this counting networks algorithm is not generally scalable, and i have the logical proof here, this is why i have just come with a new invention that enhance the counting networks algorithm to be generally scalable. And i think i will sell my new algorithm of a generally scalable counting networks to Microsoft or Google or Embarcadero or such software companies. So you have to be careful with the actual counting networks algorithm that is not generally scalable. My other new invention is my scalable reference counting and here it is: https://sites.google.com/site/scalable68/scalable-reference-counting-with-efficient-support-for-weak-references And my other new invention is my scalable Fast Mutex that is really powerful, and here it is: About fair and unfair locking.. I have just read the following lead engineer at Amazon: Highly contended and fair locking in Java https://brooker.co.za/blog/2012/09/10/locking.html So as you are noticing that you can use unfair locking that can have starvation or fair locking that is slower than unfair locking. I think that Microsoft synchronization objects like the Windows critical section uses unfair locking, but they still can have starvation. But i think that this not the good way to do, because i am an inventor and i have invented a scalable Fast Mutex that is much more powerful , because with my Fast Mutex you are capable to tune the "fairness" of the lock, and my Fast Mutex is capable of more than that, read about it on my following thoughts: More about research and software development.. I have just looked at the following new video: Why is coding so hard... https://www.youtube.com/watch?v=TAAXwrgd1U8 I am understanding this video, but i have to explain my work: I am not like this techlead in the video above, because i am also an "inventor" that has invented many scalable algorithms and there implementions, i am also inventing effective abstractions, i give you an example: Read the following of the senior research scientist that is called Dave Dice: Preemption tolerant MCS locks https://blogs.oracle.com/dave/preemption-tolerant-mcs-locks As you are noticing he is trying to invent a new lock that is preemption tolerant, but his lock lacks some important characteristics, this is why i have just invented a new Fast Mutex that is adaptative and that is much much better and i think mine is the "best", and i think you will not find it anywhere, my new Fast Mutex has the following characteristics: 1- Starvation-free 2- Tunable fairness 3- It keeps efficiently and very low its cache coherence traffic 4- Very good fast path performance 5- And it has a good preemption tolerance. 6- It is faster than scalable MCS lock this is how i am an "inventor", and i have also invented other scalable algorithms such as a scalable reference counting with efficient support for weak references, and i have invented a fully scalable Threadpool, and i have also invented a Fully scalable FIFO queue, and i have also invented other scalable algorithms and there implementations, and i think i will sell some of them to Microsoft or to Google or Embarcadero or such software companies. And here is one of my new software project that is my powerful Parallel Compression Library was updated to version 4.45 You can download it from: https://sites.google.com/site/scalable68/parallel-compression-library And read more about it below: Author: Amine Moulay Ramdane Description: Parallel Compression Library implements Parallel LZ4 , Parallel LZMA , and Parallel Zstd algorithms using my Thread Pool Engine. - It supports memory streams, file streams and files - 64 bit supports - lets you create archive files over 4 GB , supports archives up to 2^63 bytes, compresses and decompresses files up to 2^63 bytes. - Parallel compression and parallel decompression are extremely fast - Now it supports processor groups on windows, so that it can use more than 64 logical processors and it scales well. - It's NUMA-aware and NUMA efficient on windows (it parallelizes the reads and writes on NUMA nodes) - It minimizes efficiently the contention so that it scales well. - It supports both compression and decompression rate indicator - You can test the integrity of your compressed file or stream - It is thread-safe, that means that the methods can be called from multiple threads - Easy programming interface - Full source codes available. Now my Parallel compression library is optimized for NUMA (it parallelizes the reads and writes on NUMA nodes) and it supports processor groups on windows and it uses only two threads that do the IO (and they are not contending) so that it reduces at best the contention, so that it scales well. Also now the process of calculating the CRC is much more optimized and is fast, and the process of testing the integrity is fast. I have done a quick calculation of the scalability prediction for my Parallel Compression Library, and i think it's good: it can scale beyond 100X on NUMA systems. The Dynamic Link Libraries for Windows and Dynamic shared libraries for Linux of the compression and decompression algorithms of my Parallel Compression Library and for my Parallel archiver were compiled from C with the optimization level 2 enabled, so they are very fast. Here are the parameters of the constructor: First parameter is: The number of cores you have specify to run the compression algorithm in parallel. Second parameter is: A boolean parameter that is processorgroups to support processor groups on windows , if it is set to true it will enable you to scale beyond 64 logical processors and it will be NUMA efficient. Just look at the Easy compression library for example, if you have noticed it's not a parallel compression library: http://www.componentace.com/ecl_features.htm And look at its pricing: http://www.componentace.com/order/order_product.php?id=4 My parallel compression library costs you 0$ and it's a parallel compression library.. My Parallel compression library was updated, i have ported the Parallel LZ4 compression algorithm(one of the fastest in the world) to the Windows 64 bit system, now Parallel LZ4 compression algorithm is working perfectly with Windows 32 bit and 64 bit, if you want to use Windows 64 bit Parallel LZ4 just copy the lz4_2.dll inside the LZ4_64 directory (that you find inside the zip file) to your current directory or to the c:\windows\SysWow64 directory, and if you want to use the Windows 32bit Parallel LZ4 use the lz4_2.dll inside the LZ4_32 directory. If you want to use Windows 64 bit Parallel LZMA with Windows 64 bit just copy the LZMAStream1.dll inside the LZMA_fpc64 directory and LZMAStream2.dll inside LZMA_dcc64 directory to your current directory or to the c:\windows\SysWow64 directory, and if you want to use Windows 32bit Parallel LZMA copy the LZMAStream1.dll inside the LZMA_fpc32 directory and LZMAStream2.dll inside LZMA_dcc32 directory to your current directory or to the c:\windows\system32 directory. Operating systems: Windows , Linux (x86) Language: FPC Pascal v2.2.0+ / Delphi 7+: http://www.freepascal.org/ Required FPC switches: -O3 -Sd -Sd for delphi mode.... Required Delphi switches: -$H+ -DDelphi32 Required Delphi XE-XE5 switches: -DXE {$DEFINE CPU32} and {$DEFINE Windows32} for 32 bit systems {$DEFINE CPU64} and {$DEFINE Windows64} for 64 bit systems Thank you, Amine Moulay Ramdane. |
| aminer68@gmail.com: May 08 10:49AM -0700 Hello, I have just updated of my PDQ port for Delphi and Freepascal, also i have just verified it much more, and i think it is working correctly. You can download it below.. PDQ for Delphi and Freepascal was updated.. This is a port to Delphi on Windows and to Freepascal on both Windows and Linux of PDQ version 6.2.0 by me Amine Moulay Ramdane, i have also provided you with two demos, one queuing MM1 demo, and another Jackson network demo. Also i have provided you with my tutorial on how to solve analytically the Jackson network problem provided to you as a PDQ demo. PDQ is an analytic queueing-circuit analyzer made freely available under MIT/X11 license from www.perfdynamics.com Read more about PDQ here: http://www.perfdynamics.com/Tools/PDQ.html You can download it from my website: https://sites.google.com/site/scalable68/pdq-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