Tuesday, December 11, 2018

Digest for comp.programming.threads@googlegroups.com - 14 updates in 6 topics

Elephant Man <conanospamic@gmail.com>: Dec 10 08:16PM

Article d'annulation émis par un modérateur JNTP via Nemo.
Elephant Man <conanospamic@gmail.com>: Dec 10 08:16PM

Article d'annulation émis par un modérateur JNTP via Nemo.
Elephant Man <conanospamic@gmail.com>: Dec 10 08:16PM

Article d'annulation émis par un modérateur JNTP via Nemo.
Elephant Man <conanospamic@gmail.com>: Dec 10 08:16PM

Article d'annulation émis par un modérateur JNTP via Nemo.
Elephant Man <conanospamic@gmail.com>: Dec 10 08:17PM

Article d'annulation émis par un modérateur JNTP via Nemo.
Elephant Man <conanospamic@gmail.com>: Dec 05 08:34AM

Article d'annulation émis par un modérateur JNTP via Nemo.
Elephant Man <conanospamic@gmail.com>: Dec 04 06:12PM

Article d'annulation émis par un modérateur JNTP via Nemo.
Elephant Man <conanospamic@gmail.com>: Dec 04 09:09AM

Article d'annulation émis par un modérateur JNTP via Nemo.
Elephant Man <conanospamic@gmail.com>: Dec 04 09:09AM

Article d'annulation émis par un modérateur JNTP via Nemo.
Horizon68 <horizon@horizon.com>: Dec 10 11:13AM -0800

Hello,
 
 
I will explain more my new poem below, so that you understand it more,
i will explain the following part of my poem that is more difficult to
understand:
 
"And when I hear the wind
And when I look at the sun
I see your heart beating
Like the beat of the wings of the little birds
Because like the delicacy and like caresses
Moderation is faithful to us and it is wisdom"
 
 
When i say:
 
"And when I hear the wind
And when I look at the sun"
 
You have to read it also symbolically, the wind is also the wind of
change of our humanity and the wind of progress of our humanity.
 
So when i say:
 
"And when I hear the wind
And when I look at the sun
I see your heart beating
Like the beat of the wings of the little birds"
 
Now you are more capable of understanding , that it means
that i am "constantly" thinking about you, and when i say:
 
"I see your heart beating
Like the beat of the wings of the little birds"
 
I mean by it that since the little bird is
weak, so the beat of the wings of the little birds
is also weakness because the little birds are weakness,
so it means that i am understanding that the beat of
your heart is also weakness, because everybody wants
to live much more 100 years, so the beat of our heart becomes
also weakness that doesn't permit us to live much more than
100 years, so i am understanding it and thinking about this weakness
and thinking about you.
 
This is why after that i am saying the following on my poem:
 
"Because like the delicacy and like caresses
Moderation is faithful to us and it is wisdom"
 
It means that i am delicacy etc.
 
Please reread my new poem to understand more:
 
Our silence cry patience
And our hearts cries love and justice
Like the blue sky
Like the heartbeat of pretty birds
Since we hear the pretty song of the nightingales
And the oasis of the desert tells us about wisdom
Its wisdom that defies the tourmants of the desert
So we walk towards the light
Like a Rainbow
Because my story is multicolored
So I go back to my multicolored land
Because diversity is also wisdom
Since we feel the desert
Since we feel the silence
Like the wind blowing
Like the cold and the hot
Like the day and night
This contrast of diversity guides our essence
Towards the right perfection
Because diversity is also the path
Because diversity is also the light
So we are perfection and we are love and we are progress
And when I hear the wind
And when I look at the sun
I see your heart beating
Like the beat of the wings of the little birds
Because like the delicacy and like caresses
Moderation is faithful to us and it is wisdom
 
Thank you,
Amine Moulay Ramdane.
Horizon68 <horizon@horizon.com>: Dec 10 11:08AM -0800

Hello,
 
 
My new "invention" that is an enhanced fully scalable algorithm is
finished and is coming soon..
 
I have just enhanced "much" more my "invention" of a scalable algorithms
of a scalable reference counting with efficient support for weak
references, i think i am the only one who has invented this scalable
algorithm, because it is the only one who is suited for non-garbage
collecting languages such as C++ and Rust and Delphi, and i have just
made my enhanced algorithm fully scalable on manycores and multicores
and NUMA systems by using a clever scalable algorithms, so i think i
will "sell" my new invention that is my enhanced scalable reference
counting algorithm with efficient support for weak references and its
implementation to Microsoft or to Google or to Intel or Embarcadero
 
And about memory safety and memory leaks in programming languages..
 
Memory safety is the state of being protected from various software bugs
and security vulnerabilities when dealing with memory access, such as
buffer overflows and dangling pointers.
 
I am also working with Delphi and FreePascal and C++, and as you have
noticed i have invented a scalable reference counting with efficient
support for weak references that is really powerful, read about it and
download it from here(it is the Delphi and FreePascal implementation):
 
https://sites.google.com/site/scalable68/scalable-reference-counting-with-efficient-support-for-weak-references
 
And you have to understand that this invention of mine solves
the problem of dangling pointers and it solves the problem of memory
leaks and this reference counting of mine is also "scalable", and i
think that this invention of mine is the only one that you will find,
and you will not find it in C++ and you will not find it in Rust.
 
Also Delphi and FreePascal detect the out of bounds in arrays and
strings like this by making range checks enabled:
 
In the {$R+} state, all array and string-indexing expressions are
verified as being within the defined bounds, and all assignments to
scalar and subrange variables are checked to be within range. **If a
range check fails, an ERangeError exception is raised (or the program is
terminated if exception handling is not enabled).
 
Range Checks is OFF by default. To enable it, you can add this directive
to your code:
 
{$RANGECHECKS ON}
 
You can use also generic (template) style containers for bound checking,
my following writing to understand more:
 
About C++ and Delphi and FreePascal generic (template) style containers..
 
Generics.Collections of Delphi and FreePascal for generic (template)
style containers that you can download from here:
 
https://github.com/maciej-izak/generics.collections
 
TList of Generics.Collections of Delphi and FreePascal is implemented
the same as STL C++ Vectors: they are array-based. And since data
structureS are the same then also performance should be comparable.
 
So I've done a small test between Tlist of Generics.Collections of
Delphi and FreePascal and C++ vector, it's an addition of 3000000
records of 16 byte length, in one loop, here is the results:
 
Tlist time = 344ms
Vector time = 339ms
 
It seems they are the same, the test use only the function ( List.add ,
vector.push_back).
 
STL vectors with the at() and Delphi TList of Generics.Collections of
Delphi and FreePascal perform bounds checking.
 
 
So i think that with my invention above and with all my other inventions
that are my scalable algorithms and there implementations and such in
C++ and Delphi and FreePascal that you will find
in my following website, Delphi and FreePascal have become powerful:
 
https://sites.google.com/site/scalable68/
 
 
 
Thank you,
Amine Moulay Ramdane.
Horizon68 <horizon@horizon.com>: Dec 10 11:04AM -0800

Hello,
 
Read this:
 
My C++ synchronization objects library was updated,
now it is much more stable and fast, it contains
many of my inventions such as my scalable RWLock that
is starvation-free and my SemaMonitor and my scalable MLock
and many others of my inventions..
 
You can download the new updated version from:
 
https://sites.google.com/site/scalable68/c-synchronization-objects-library
 
 
Thank you,
Amine Moulay Ramdane.
Horizon68 <horizon@horizon.com>: Dec 10 10:56AM -0800

Hello,
 
 
Again about scalable Parallel For and scalable Parallel ForEach..
 
I thought more, and i think that "emulating" a "scalable" Parallel For
or "scalable" Parallel ForEach with my Threadpool engines that scale
very well is easy to do, please look at the html documentation of my
Threadpool engines that scale very well to understand how to do it.
 
Here is my "invention" that is my efficient Threadpool engine with
priorities that scales very well, read about it and download it and you
will notice that it is powerful:
 
https://sites.google.com/site/scalable68/an-efficient-threadpool-engine-that-scales-very-well
 
 
Thank you,
Amine Moulay Ramdane.
Horizon68 <horizon@horizon.com>: Dec 10 10:53AM -0800

Hello..
 
Read this:
 
 
Read the following interesting webpage:
 
Memory Models: x86 is TSO, TSO is Good
 
Essentially, the conclusion is that x86 in practice implements the old
SPARC TSO memory model.
 
The big take-away from the talk for me is that it confirms the
observation made may times before that SPARC TSO seems to be the optimal
memory model. It is sufficiently understandable that programmers can
write correct code without having barriers everywhere. It is
sufficiently weak that you can build fast hardware implementation that
can scale to big machines.
 
Read more here:
 
https://jakob.engbloms.se/archives/1435
 
 
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.
Posted by at

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)