- My Winmenus using wingraph was updated to version 1.03 - 1 Update
- About my next software projects (i correct some last typo).. - 1 Update
- Here is my kind of music - 1 Update
- Here is one of my prefered song of Dire Straits - 1 Update
- And now a beautiful song of Elvis Presley - 1 Update
| Sky89 <Sky89@sky68.com>: Aug 24 07:03PM -0400 Hello.. My Winmenus using wingraph was updated to version 1.03 Now you will notice that i have added a demo called "second graphical demo", please run the windows real3d1.exe executable inside the zip to notice it. You can now download both the zipfiles for FreePascal and for Delphi. You can download my Winmenus using wingraph version 1.03 from: https://sites.google.com/site/scalable68/winmenus-using-wingraph Thank you, Amine Moulay Ramdane. |
| Sky89 <Sky89@sky68.com>: Aug 24 01:52PM -0400 Hello.. About my next software projects (i correct some last typo).. As you have noticed i have implemented graphical Winmenus, it is an interesting Widget that i have designed myself, i will enhance it more, but as also you have noticed that the zipfile of my Winmenus using Wingraph contains my 64 bit windows executabe demo called real3d1.exe that makes you take a look at my Winmenus widget and it contains a 3D Opengl demo and other demos , please execute this real3d1.exe to look at how powerful is my graphical program, i have also made Wingraph compatible with FreePascal and Delphi including Delphi tokyo, so that you will be able to prototype rapidly 3D "Opengl" graphical programs, you can download my graphical Winmenus using wingraph from: https://sites.google.com/site/scalable68/winmenus-using-wingraph And as i will enhance soon my graphical Winmenus Here is my next software projects that i will implement and "invent": Here is my other software project for Delphi and FreePascal that i will finish soon: 1- I will support async and await 2- I will support futures 3- I will support "scalable" Parallel Foreach with priorities that will be very "powerful" using my "scalable" Threadpools with and without priorities. Here is my Threadpool with priorities that i have invented and that scales very well (i have invented another "fully" scalable Threadpool that is really powerful), read about it and download it from here: https://sites.google.com/site/scalable68/an-efficient-threadpool-engine-with-priorities-that-scales-very-well And here is my last project in FreePascal and Delphi(including Delphi tokyo) that i have "invented", it is a "scalable" reference counting with efficient support for weak references, you will not find it in C++ and you will not find it in Rust, read about it and download it from here: https://sites.google.com/site/scalable68/scalable-reference-counting-with-efficient-support-for-weak-references I have also "invented" my C++ synchronization objects library, read about it and download it from here: https://sites.google.com/site/scalable68/c-synchronization-objects-library You have to understand my work.. I have invented many scalable algorithms and there implementations, here is some of them that i have "invented": 1- Scalable Threadpools that are powerful 2- Scalable RWLocks of different sorts. 3- Scalable reference counting with efficient support for weak references 4- Scalable FIFO queues that are node-based and array-based. 5- My Scalable Varfiler 6- Scalable Parallel implementation of Conjugate Gradient Dense Linear System Solver library that is NUMA-aware and cache-aware, and also a Scalable Parallel implementation of Conjugate Gradient Sparse Linear System Solver library that is cache-aware. 7- Scalable MLock that is a scalable Lock. 8- Scalable SeqlockX And there is also "many" other scalable algorithms that i have "invented". You can find some of my scalable algorithms and there implementations in Delphi and FreePascal and C++ on my website here: https://sites.google.com/site/scalable68/ What i am doing by "inventing" many scalable algorithms and there implementations, is wanting to make "Delphi" much better and making FreePascal on the "Delphi" mode much better, my scalable algorithms and there implementations are like HPC(high performance computing, and as you have noticed i said also: You will ask why have i invented many scalable algorithms and there implementations? because also my work will permit us also to "revolutionise" science and technology because it is HPC(high performance computing), this is why i will also sell some of my scalable algorithms and there implementations to companies such as Google or Microsoft or Embarcadero. Also HPC has revolutionised the way science is performed. Supercomputing is needed for processing sophisticated computational models able to simulate the cellular structure and functionalities of the brain. This should enable us to better understand how our brain works and how we can cope with diseases such as those linked to ageing and to understand more about HPC, read more here: https://ec.europa.eu/digital-single-market/en/blog/why-do-supercomputers-matter-your-everyday-life And i think i will "sell" "some" of my scalable algorithms and there implementations to Google or to Microsoft or to Embarcadero. I will also enhance my Parallel archiver and my Parallel compression Library that are powerful and that work with both C++Builder and Delphi and to perhaps sell them to Embarcadero that sells Delphi and C++Builder. About portability of my software projects I have thought more, and as you have noticed i have written Intel assembler routines for 32 bit and 64 bit for atomically incrementing and and for atomically CompareExchange etc. so now they are working with x86 AMD and Intel processors for 32 bit and 64 bit, but i will soon make my Delphi and FreePascal and C++ libraries portable to the other CPUs like ARM(for Android) etc. for that i will use the following Delphi methods for Delphi: http://docwiki.embarcadero.com/Libraries/XE8/en/System.SyncObjs.TInterlocked.CompareExchange and http://docwiki.embarcadero.com/Libraries/Tokyo/en/System.SyncObjs.TInterlocked.Exchange And I will use the same functions that you find inside FreePascal, here they are: https://www.freepascal.org/docs-html/rtl/system/interlockedexchange64.html and https://www.freepascal.org/docs-html/rtl/system/interlockedexchange.html and https://www.freepascal.org/docs-html/rtl/system/interlockedcompareexchange.html and https://www.freepascal.org/docs-html/rtl/system/interlockedcompareexchange64.html I will use them inside my scalable lock that is called scalable MLock that i have "invented", so that it will be portable, here it is: https://sites.google.com/site/scalable68/scalable-mlock And when my scalable MLock will become portable on Delphi and FreePascal i will port with it all my other libraries that uses atomically increment and decrement etc., so my libraries will become portable to the other CPUs like ARM for Android etc., so i think you will be happy with my work. About Extreme Scaling in CAE Applications.. I have just read the following about Ansys company: https://en.wikipedia.org/wiki/Ansys Notice that Ansys develops and markets finite element analysis software used to simulate engineering problems. I think that i have thought about this, and i have "invented" a Scalable Parallel C++ Conjugate Gradient Linear System Solver Library, in fact it scales "very" well, my library contains a Scalable Parallel implementation of Conjugate Gradient Dense Linear System Solver library that is NUMA-aware and cache-aware, and it contains also a Scalable Parallel implementation of Conjugate Gradient Sparse Linear System Solver library that is cache-aware. Sparse linear system solvers are ubiquitous in high performance computing (HPC) and often are the most computational intensive parts in scientific computing codes. A few of the many applications relying on sparse linear solvers include fusion energy simulation, space weather simulation, climate modeling, and environmental modeling, and finite element method, and large-scale reservoir simulations to enhance oil recovery by the oil and gas industry. Conjugate Gradient is known to converge to the exact solution in n steps for a matrix of size n, and was historically first seen as a direct method because of this. However, after a while people figured out that it works really well if you just stop the iteration much earlier - often you will get a very good approximation after much fewer than n steps. In fact, we can analyze how fast Conjugate gradient converges. The end result is that Conjugate gradient is used as an iterative method for large linear systems today. You can download my Scalable Parallel C++ Conjugate Gradient Linear System Solver Library from here: https://sites.google.com/site/scalable68/scalable-parallel-c-conjugate-gradient-linear-system-solver-library Read the following about Extreme Scaling in CAE Applications, this is why i have invented my Scalable Parallel C++ Conjugate Gradient Linear System Solver Library that scales very well: https://www.cray.com/blog/extreme-scaling-in-cae-applications/ You can find some of my other software projects here: https://sites.google.com/site/scalable68/ Thank you, Amine Moulay Ramdane. |
| Sky89 <Sky89@sky68.com>: Aug 24 12:22PM -0400 Hello... Read this: I am a gentleman type of person and i am a decent man, and here is my kind of music: Song of the sea vangelis https://www.youtube.com/watch?v=55SVonv-sio&list=RD55SVonv-sio&start_radio=1 Thank you, Amine Moulay Ramdane. |
| Sky89 <Sky89@sky68.com>: Aug 24 11:53AM -0400 Hello.. Read this: Here is one of my prefered song of Dire Straits: Dire Straits - Down To The Waterline https://www.youtube.com/watch?v=ugZRzISBrKk Thank you, Amine Moulay Ramdane. |
| Sky89 <Sky89@sky68.com>: Aug 24 11:36AM -0400 Hello.... Read this: And now a beautiful song of Elvis Presley: Elvis Presley - Stuck On You https://www.youtube.com/watch?v=jVqR2PwX428 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