Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]

Groups > comp.programming.threads > #5055

Read again, i correct a last typo, because i write fast..

Show all headers | View raw

Hello..


Read again, i correct a last typo, because i write fast..


Analogy with parallel computing..

My personality is more complex, you have to understand me more,
when i say i am also a gay like Chevy Chase because i am more 
humoristic, you have to understand this "abstraction" of saying
humoristic, i am humoristic like Chevy Chase because i am more
positive and i want the others to be more posititive, so i can
be humoristic to make you positive, but my humoristic way
of doing is more "smart", because i can use a sophisticated humoristic 
manner to learn you more about morality and about life and i am
more intellectual in doing so.

And speaking about "abstractions", i think it is a good subject
of philosophy, because i think you have to be capable
of philosophy about computing, i think one of the main part
of computing is also about abstracting, but it is not only
about abstracting but you have to abstract and be sophisticated
in it by making your abstractions "efficient". I give you an example:

As you know i am an inventor of many scalable algorithms, and
one of my last invention is a Fast Mutex that is adaptative,
so i have extracted the abstractions from my Fast Mutex,
and those abstractions are like a language or like an automaton
that is also like a protocol that is constituted of a language,
so when i execute the abstraction that is the Enter() method, it will 
enter the Fast Mutex, and when i execute the abstraction that is
the Leave() method, it will leave the Fast Mutex, but you have
to be more smart, because it is "not" enough to abstract, you
have to be more efficient, i mean that i am thinking like a researcher
when i have invented my last Fast Mutex by taking into account
the following characteristics, so i have made my new Fast Mutex powerful 
by making it as the following:


1- Starvation-free
2- Good fairness
3- It keeps efficiently and very low the cache coherence traffic
4- Very good fast path performance (it has the same performance as the
scalable MCS lock when there is contention.)
5- And it has a good preemption tolerance.


I think that you will not find anywhere this new invention of mine.



Thank you,
Amine Moulay Ramdane.

Back to comp.programming.threads | Previous | Next | Find similar | Unroll thread

Thread

Read again, i correct a last typo, because i write fast.. Horizon68 <horizon@horizon.com> - 2019-06-28 11:34 -0700

csiph-web