About smartness and the meaning..

[amin...@gmail.com]

Hello,


About smartness and the meaning..

So that to understand what is smartness we have to understand what is the meaning..

I think that there is still complex problems that actual high level smartness of humans can not comprehend, that means that they don't make sense or meaning to the actual high level smartness of humans, so they are like hidden to us, perhaps like extraterrestrial beings that have become complex problems or like God that is a complex problem, thus we can not comprehend them, since as i said you have to make a logical difference between the complex and the difficult, since i think that our actual high level human smartness is capable to understand the difficult that is not complex and with the divide and conquer methodology it is able to understand some complex problems, but i think that there still remain problems that are complex and that the actual high level smartness of humans is unable to comprehend with the divide and conquer methodology.

Read the rest of my previous thoughts to understand:

More about the smartness problem..

I am a white arab, and i think i am smart since i have invented many
scalable algorithms..

As you have noticed i have just spoken more about what is smartness(read below about it)..

But i think that there is something happening, since i think that we have been "lucky" that we have encountered complex problems that have
been solved by high level smartness by the divide and conquer methodology , but i think that we have to ask a question of: if there is
still problems that can not be solved by high level smartness of today humans by the divide and conquer methodology?

Read the rest of my previous thoughts:

More about what is human smartness..

I am a white arab, and i think i am smart since i have invented many
scalable algorithms..

I think to be able to understand human smartness, you have to understand
the logical difference between what is the complex and what is the difficult, this is one of the most important thing, because when you
look at the definition of complex it says:

Here is the definition of "complex" in the dictionary:

"Something that is complex has many different parts, and is therefore often difficult to understand."

Read the dictionary here to notice it:

https://www.collinsdictionary.com/dictionary/english/complex


So as you are noticing that complex doesn't mean difficult, because complex has "many" different parts, and you have to understand my writing about Lock-free algorithms, since i said that they are "difficult" even if they are not complex, since even they are not complex, you have to be smart to be able to see the paths or the parts that are hidden to be able to invent them, this is why you have to be smart to be able to invent a Lock-free bounded stack or Lock-free bounded queue.

So now you are understanding that high level smartness doesn't start to think the complex, but it starts with the difficult that is not complex and it uses the divide and conquer methodology so that to grow and be able to understand the complex..


Read my following previous thoughts to understand:

In my previous posts about my inventions of Lock-free algorithms, i said that inventing Lock-free algorithms is difficult and i have explained why, and there is a difference between saying it is difficult and saying it is complex, read the following from Dr. Dobb's to notice:

"Lock-Free Algorithms and Data Structures. Lock-free algorithms address the issues raised by locks, but bring their own set of problems. Their use in the industry is still fairly new. At their core, they rely on atomic operations at the hardware level. It is very hard to design and implement lock-free algorithms properly because the building blocks are very small; when you compose them, the emerging behavior is not trivial to analyze."

Read more here:

https://www.drdobbs.com/parallel/concurrent-programming-with-chain-lockin/240149442?pgno=1


So notice that he is saying that it is "very hard" and he is explaining why, and he is in accordance with my writing, read it again carefully:

More analysis of Lock-free algorithms..

I have just looked at the following invention of a Lock-free bounded queue by the following PhDs:

Peter Pirkelbauer that is a PhD in computer science

Here he is:

http://pirkelbauer.com/cv_peter_pirkelbauer.html

and by Reed Milewicz Postdoctoral Appointee, Sandia National Laboratories

Here he is:

https://scholar.google.com/citations?user=PzG-VUAAAAAJ&hl=en

Here is there paper of there Portable Lock-free Bounded Queue invention:

https://rmmilewi.github.io/files/lockfreequeue16.pdf


I think that there Lock-free Bounded Queue invention has a disadvantage , it is that it is too "complex", so it is not good , this is
why i have just invented my following Lock-free Bounbed Queue and a Lock-free Bounded Stack that are simple to reason about and are much less complex than the above invention:

About software fault tolerance and reliability, read again..

Read the following interesting document about Fault-tolerant computing:

http://web.cs.ucla.edu/~rennels/article98.pdf

I will soon provide you with my following new inventions that are my
new Lock-free algorithms that support software fault tolerance and reliability in a form of Thread-killing Immunity, that means any thread forcefully killed in the system won't delay other threads, and in a form of Signal Immunity and in a form of Pre-emption tolerance and convoy-avoidance and in a form of Priority Inversion Immunity etc.

Read my following thoughts to notice it:

About my new inventions of Lock-free algorithms..

I am a white arab, and i think i am smart since i have invented
many scalable algorithms and there implementations, and today
i will talk more about Lock-free algorithms..

I have previously invented a fully Lock-free bounded LIFO stack algorithm, but i have just invented a fully Lock-free bounded FIFO queue algorithm and a fully Lock-free bounded limited priority queue, but can we ask the question of: Do we have to be really smart to be able to invent those Lock-free algorithms ?

I think that we have to be smart to be able to invent them, because when you are inventing them you have to be able from the many characteristics of the Lock-free algorithm and the restrictive compare-and-swap (CAS) and/or double-length CAS (DCAS) to be able to invent them, so you are too restricted or too constrained and it makes the job of inventing those Lock-free algorithms difficult, this is why you have to be smart, and as you have noticed i have first invented a Lock-free bounded LIFO stack algorithm that is based on an almost(very nearly) Lock-free bounded FIFO queue, and this almost Lock-free bounded FIFO queue of mine has the following advantages(and notice that it only doesn't support Thread-killing Immunity, that means any thread forcefully killed in the system won't delay other threads):

- Signal Immunity: The C and C++Standards prohibit signals or
asynchronous interrupts from calling many system routines such
as malloc. If the interrupt calls malloc at the same time with
an interrupted thread, that could cause deadlock. With my
algorithms, there's no such problem anymore: Threads can
freely interleave execution.
- Priority Inversion Immunity: Priority inversion occurs when a
low-priority thread holds a lock to a mutex needed by a high-
priority thread. Such tricky conflicts must be resolved by the
OS kernel.
- Pre-emption tolerant and they are good at convoy-avoidance.
- Starvation-free.
- And for k number of threads in the system (of my almost Lock-
free FIFO queue or my almost Lock-free FIFO priority queue or
my almost Lock-free LIFO stack), my almost Lock-free FIFO
queue or my almost Lock-free FIFO priority queue or my almost
Lock-free LIFO stack have a system latency of O(q + s*sqrt(k)
and an individual latency of O(k(q + s*sqrt(k)), but my
algorithms are of the SCU(0,1) Class of Algorithms, so under
scheduling conditions which approximate those found in
commercial hardware architectures, there system latency is
O(sqrt(k)) and there individual latency is O(k*sqrt(k)),
read more below to understand more.

You can read about them and download them from my website here:

https://sites.google.com/site/scalable68/lockfree-bounded-lifo-stack-and-fifo-queue


But i will show you soon my inventions of a fully Lock-free bounded LIFO stack algorithm and of a fully Lock-free bounded FIFO queue algorithm and of a fully Lock-free bounded limited priority queue algorithm.


Thank you,
Amine Moulay Ramdane.