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

Groups > comp.programming.threads > #4956

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

Show key headers only | View raw

Hello..

Read this:


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

I am like a PhD researcher and i am competing against high-tech 
compagnies and against the best PhD researchers, because i am
an inventor of many scalable algorithms and there implementations, read 
the following to notice it:

As you have noticed i am a white arab that is a gentleman type of 
person, I am also a more serious computer programmer that is an 
"inventor" of many scalable algorithms and there implementations,
and i am able to dance a beautiful dance with high-tech companies such 
Microsoft and  Google and  Oracle and  Embarcadero and such big 
high-tech software compagnies, because i am like a PhD researcher that 
is inventing scalable algorithms, and i also know how to "dance" a 
"beautiful" dance on the following USA beautiful song:

https://www.youtube.com/watch?v=2s4slliAtQU&list=RD2s4slliAtQU&start_radio=1


This why i wrote the following poem to make you understand more
my way:

==

Is a beautiful dance a romance ?

Or is a beautiful dance a show of common sense ?

A beautiful dance is not only an instinct

Since beautifulness is feeling the essence

Since beautifulness is a beautiful cadence

Since beautifulness is also intelligence

Since beautifulness is a beautiful dance of patience and tolerance

Since beautifulness is a beautiful dance of transcendence

So you have to know how to dance the beautiful dance

To be able to "advance" by evidence.

==




So what is my new beautiful dance that i am dancing ?


I have just invented the following algorithms that i will sell
to high-tech big software compagnies:

And as i said Scalable method for producer and consumer elimination is 
already patented, here it is:

https://patents.google.com/patent/US7779165


But i have already "invented" the following scalable algorithms and 
there implementations that don't use elimination, here they are:

- Fully Scalable FIFO queue both unbounded and bounded
- Fully scalable LIFO stack that is unbounded
- Fully scalable LIFO priority stack that is unbounded
- Fully scalable FIFO priority queue that is unbounded with limited
   number of priorities(up to 25 or something like that).


But as you have noticed the following invention is patented:

Scalable method for producer and consumer elimination is already 
patented, here it is:

https://patents.google.com/patent/US7779165


This invention of the elimination method has given the following 
invention that uses "elimination" that as i said is patented:

Scalable Concurrent Priority Queue
Algorithms

http://people.csail.mit.edu/shanir/publications/SZ-priority.pdf


And elimination method above that is "patented" has given a scalable 
lockfree LIFO stack and a scalable FIFO queue that use elimination, but 
the weakness of those algorithms that use elimination is that: if we 
have, say, bursts of push calls followed by bursts of pop calls, there 
will again be no elimination and therefore no parallelism. This is why i 
have "solved" this weakness or problem by revolutionizing computing by 
inventing my above scalable algorithms that are fully scalable, and
my scalable algorithms above have permit me to invent a fully scalable
Threadpool and fully scalable Threadpool with priorities, this is
why my above scalable algorithms will revolutionize computing.


So as you are noticing i am an inventor of many scalable algorithms.


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-03-16 13:21 -0700

csiph-web