Sunday, March 31, 2019

Digest for comp.lang.c++@googlegroups.com - 21 updates in 2 topics

Bonita Montero <Bonita.Montero@gmail.com>: Mar 31 04:08PM +0200

Does anyone know what's the technical reason behind that when I do
an .erase() on a vecor all iterators beginning from ther point where
I erased and not shifted (excluding the last elements the vector which
are the same number of elements I erased)?
As the capacity doesn't change the iterators could partitially remain
valid but just point to the shifted elements.
Juha Nieminen <nospam@thanks.invalid>: Mar 31 05:06PM

> are the same number of elements I erased)?
> As the capacity doesn't change the iterators could partitially remain
> valid but just point to the shifted elements.
 
I'm honestly not trying to be a dick, but the amount of spelling
errors in that message genuinely makes it hard to understand
*exactly* what you are asking.
 
But if I'm interpreting it correctly, are you asking why the
C++ standard declares all the iterators that point to elements
that are located on or after the deletion point as invalid,
even though there's no technical reason for it?
 
For starters, the iterators are invalid because they won't be
pointing to the *same* elements anymore. That's why they are
invalid. Even if they are still pointing to *some* valid element
in the same vector, that doesn't mean it's somehow valid. It will
be a completely different element.
 
Secondly, the standard probably doesn't forbid the std::vector
implementation from physically reducing the allocated size of the
vector, if it can do that without moving the other elements around.
Bonita Montero <Bonita.Montero@gmail.com>: Mar 31 10:35PM +0200

> For starters, the iterators are invalid because they won't be
> pointing to the *same* elements anymore.
 
That shoudln't be a problem since they could partitially point to the
shifted elements. That could be guaranteed by the standard withoud any
restrictions on the implementation.
 
> Secondly, the standard probably doesn't forbid the std::vector
> implementation from physically reducing the allocated size of the
> vector, if it can do that without moving the other elements around.
 
I don't know it for sure but I'll bet my right hand that the standard
guarantees not to move the allocation in this case or to reduce its
capacity but just do everything in-place.
Mr Flibble <flibbleREMOVETHISBIT@i42.co.uk>: Mar 31 10:05PM +0100

On 31/03/2019 21:35, Bonita Montero wrote:
 
> That shoudln't be a problem since they could partitially point to the
> shifted elements. That could be guaranteed by the standard withoud any
> restrictions on the implementation.
And you had the nerve to call my capabilities into question. Invalid
iterators should never be used even if they still "point" to valid objects
as this is undefined behaviour according to the standard.
 
/Flibble
 
--
"You won't burn in hell. But be nice anyway." – Ricky Gervais
 
"I see Atheists are fighting and killing each other again, over who
doesn't believe in any God the most. Oh, no..wait.. that never happens." –
Ricky Gervais
 
"Suppose it's all true, and you walk up to the pearly gates, and are
confronted by God," Bryne asked on his show The Meaning of Life. "What
will Stephen Fry say to him, her, or it?"
"I'd say, bone cancer in children? What's that about?" Fry replied.
"How dare you? How dare you create a world to which there is such misery
that is not our fault. It's not right, it's utterly, utterly evil."
"Why should I respect a capricious, mean-minded, stupid God who creates a
world that is so full of injustice and pain. That's what I would say."
Bonita Montero <Bonita.Montero@gmail.com>: Mar 31 11:22PM +0200


> And you had the nerve to call my capabilities into question. Invalid
> iterators should never be used even if they still "point" to valid
> objects as this is undefined behaviour according to the standard.
 
If you were able to read you did read that I already know that.
 
But there's a point in which I wasn't certain and where had tomatoes
on my eyes: reallocation obviously doesn't occur because the iterators
before the erased sequence remain valid.
So there's absolutely no obvious coercive necessity for the standard
to mandate to invalidate the iterators beginning or behind that
sequence. The iterators could point partitially to shifted elements
without any restriction on the implementation.
Mr Flibble <flibbleREMOVETHISBIT@i42.co.uk>: Mar 31 10:52PM +0100

On 31/03/2019 22:22, Bonita Montero wrote:
> to mandate to invalidate the iterators beginning or behind that
> sequence. The iterators could point partitially to shifted elements
> without any restriction on the implementation.
 
The iterator concept dictates that what an iterator refers to never
changes unless the iterator itself is changed. What you propose would
ruin the iterator concept.
 
/Flibble
 
--
"You won't burn in hell. But be nice anyway." – Ricky Gervais
 
"I see Atheists are fighting and killing each other again, over who
doesn't believe in any God the most. Oh, no..wait.. that never happens." –
Ricky Gervais
 
"Suppose it's all true, and you walk up to the pearly gates, and are
confronted by God," Bryne asked on his show The Meaning of Life. "What
will Stephen Fry say to him, her, or it?"
"I'd say, bone cancer in children? What's that about?" Fry replied.
"How dare you? How dare you create a world to which there is such misery
that is not our fault. It's not right, it's utterly, utterly evil."
"Why should I respect a capricious, mean-minded, stupid God who creates a
world that is so full of injustice and pain. That's what I would say."
Bonita Montero <Bonita.Montero@gmail.com>: Apr 01 12:21AM +0200


> The iterator concept dictates that what an iterator refers to never
> changes unless the iterator itself is changed.  What you propose would
> ruin the iterator concept.
 
But there's no technical necessity for this concept.
Mr Flibble <flibbleREMOVETHISBIT@i42.co.uk>: Mar 31 11:32PM +0100

On 31/03/2019 23:21, Bonita Montero wrote:
>> changes unless the iterator itself is changed.  What you propose would
>> ruin the iterator concept.
 
> But there's no technical necessity for this concept.
 
Of course there is: people want to know that an object referred to by an
iterators remains stable and they want to know when iterators become
invalid so they can design clean robust software; with your proposal all
bets are off. The reason iterators are invalidated is the same reason
element references are invalidated. The fact that you don't get this leads
me to the conclusion that the code you write is a mess.
 
/Flibble
 
--
"You won't burn in hell. But be nice anyway." – Ricky Gervais
 
"I see Atheists are fighting and killing each other again, over who
doesn't believe in any God the most. Oh, no..wait.. that never happens." –
Ricky Gervais
 
"Suppose it's all true, and you walk up to the pearly gates, and are
confronted by God," Bryne asked on his show The Meaning of Life. "What
will Stephen Fry say to him, her, or it?"
"I'd say, bone cancer in children? What's that about?" Fry replied.
"How dare you? How dare you create a world to which there is such misery
that is not our fault. It's not right, it's utterly, utterly evil."
"Why should I respect a capricious, mean-minded, stupid God who creates a
world that is so full of injustice and pain. That's what I would say."
Mr Flibble <flibbleREMOVETHISBIT@i42.co.uk>: Mar 31 11:35PM +0100

On 31/03/2019 21:35, Bonita Montero wrote:
 
> That shoudln't be a problem since they could partitially point to the
> shifted elements. That could be guaranteed by the standard withoud any
> restrictions on the implementation.
 
I see you snipped part of a reply again that you disagree with but cannot
argue against, so I will repeat it again here:
 
"Even if they are still pointing to *some* valid element
in the same vector, that doesn't mean it's somehow valid. It will
be a completely different element."
 
Now reply to this snipped part please, if you can.
 
/Flibble
 
--
"You won't burn in hell. But be nice anyway." – Ricky Gervais
 
"I see Atheists are fighting and killing each other again, over who
doesn't believe in any God the most. Oh, no..wait.. that never happens." –
Ricky Gervais
 
"Suppose it's all true, and you walk up to the pearly gates, and are
confronted by God," Bryne asked on his show The Meaning of Life. "What
will Stephen Fry say to him, her, or it?"
"I'd say, bone cancer in children? What's that about?" Fry replied.
"How dare you? How dare you create a world to which there is such misery
that is not our fault. It's not right, it's utterly, utterly evil."
"Why should I respect a capricious, mean-minded, stupid God who creates a
world that is so full of injustice and pain. That's what I would say."
blt_abadcf@h4gtm9uj3i5lygp_c2ioctrq.com: Mar 31 08:53AM

Is there any equivalent of the pthreads pthread_rwlock_t in C++ threading?
shared_mutex seems to be mentioned but the functionality seems different to
me pluts its 2017 only anyway which rules out the compiler I'm using.
Melzzzzz <Melzzzzz@zzzzz.com>: Mar 31 09:27AM

> Is there any equivalent of the pthreads pthread_rwlock_t in C++ threading?
> shared_mutex seems to be mentioned but the functionality seems different to
> me pluts its 2017 only anyway which rules out the compiler I'm using.
 
Use pthread_rwlock_t, as you don't have c++17 compliant compiler.
What's difference between pthread and C++17 variant, just to start
discussion?
 
 
--
press any key to continue or any other to quit...
blt_rHkx@rjrnwk17q3gki8i5ps4p50dlbz.org: Mar 31 10:22AM

On Sun, 31 Mar 2019 09:27:34 GMT
>> shared_mutex seems to be mentioned but the functionality seems different to
>> me pluts its 2017 only anyway which rules out the compiler I'm using.
 
>Use pthread_rwlock_t, as you don't have c++17 compliant compiler.
 
Umm, because I was hoping to use C++ threading as its syntatically tidier
than pthreads and getting lambdas to work with pthreads would probably be a
PITA (I don't know, never tried).
Melzzzzz <Melzzzzz@zzzzz.com>: Mar 31 11:23AM


> Umm, because I was hoping to use C++ threading as its syntatically tidier
> than pthreads and getting lambdas to work with pthreads would probably be a
> PITA (I don't know, never tried).
it's easy:
eg
#include <functional>
#include <stdio.h>
using std::function;
void f(void* lambda) {
function<void(int)>* pf = (function<void(int)>*)lambda;
(*pf)(5);
}
 
int main(){
int j = 5;
function<void(int)> l = [j](int){ printf("%d\n",j); };
f(&l);
}
 
 
 
--
press any key to continue or any other to quit...
Sam <sam@email-scan.com>: Mar 31 08:51AM -0400


> Umm, because I was hoping to use C++ threading as its syntatically tidier
> than pthreads and getting lambdas to work with pthreads would probably be a
> PITA (I don't know, never tried).
 
"Getting lambdas to work with pthreads", whatever that means, is no harder
and no easier than getting lambdas to work with anything else.
 
It shouldn't take more than an hour, or so, to write a C++ class wrapper
around pthread_rwlock_t that implements similar functionality to the C++17
class. It's not complicated. If you started when you posted your first
message in this thread, you would've probably been done by the time you
posted your second message in this thread.
blt_8u6bgf6@1fcy52bz_kvxxu.net: Mar 31 04:23PM

On Sun, 31 Mar 2019 08:51:29 -0400
>> than pthreads and getting lambdas to work with pthreads would probably be a
>> PITA (I don't know, never tried).
 
>"Getting lambdas to work with pthreads", whatever that means, is no harder
 
I'll assume English is your second language if you didn't understand that.
 
>class. It's not complicated. If you started when you posted your first
>message in this thread, you would've probably been done by the time you
>posted your second message in this thread.
 
I could write a class wrapper around pthreads? Wow! Why didn't I think of that??
Truly a savant and nobel prizes surely await you!
 
I guess trying to be a smart ass is more satisfying for you than just giving a
simple answer, right?
blt_c7qd40zk@x7o.gov: Mar 31 04:25PM

On Sun, 31 Mar 2019 11:23:45 GMT
> function<void(int)> l = [j](int){ printf("%d\n",j); };
> f(&l);
>}
 
And what exactly is the point of using lambda functions if you have to write a
wrapper function for them anyway? You might just as well put the code in a
standard function.
Melzzzzz <Melzzzzz@zzzzz.com>: Mar 31 04:54PM


> And what exactly is the point of using lambda functions if you have to write a
> wrapper function for them anyway? You might just as well put the code in a
> standard function.
 
You said it is difficult. It is not.
 
--
press any key to continue or any other to quit...
blt_1bdc2e@cvjfc_s2lr2wbr2y.org: Mar 31 05:12PM

On Sun, 31 Mar 2019 16:54:17 GMT
>> wrapper function for them anyway? You might just as well put the code in a
>> standard function.
 
>You said it is difficult. It is not.
 
Any idiot can wrap a lambda, I meant passing one direct to pthread_create().
Show us your code for that.
Sam <sam@email-scan.com>: Mar 31 01:18PM -0400

> >> PITA (I don't know, never tried).
 
> >"Getting lambdas to work with pthreads", whatever that means, is no harder
 
> I'll assume English is your second language if you didn't understand that.
 
You seem to be assuming a great deal many of things.
 
That, understandably, is often the only possible avenue when no other
options are available.
 
The statement "Getting lambdas to work with threads" is logically equivalent
to "making elephants fly with automobiles".
 
There's nothing unique about POSIX threads that requires employing any
unique aspects or attributes of lambdas. Or vice versa. Most fundamental
POSIX structures are not copyable; but that's not some earth-shattering
property either. Plenty of classes in the C++ library are also not copyable.
Like std::ifstream, for example. So the same issues, with regards to
captures, apply to POSIX threads as they do to std::ifstream, when it comes
to lambdas. There's nothing particularly special about POSIX threads and
lambdas.
 
So, your obsession with lambdas and POSIX threads is, pretty much, totally
unwarranted.
 
> >posted your second message in this thread.
 
> I could write a class wrapper around pthreads? Wow! Why didn't I think of
> that??
 
That's why I'm here, to help.
 
> Truly a savant and nobel prizes surely await you!
 
I'll decline. I don't like traveling.
 
> I guess trying to be a smart ass is more satisfying for you than just giving
> a
> simple answer, right?
 
I just did give a simple answer: write a simple wrapper. Can't get any
simpler than that.
Jorgen Grahn <grahn+nntp@snipabacken.se>: Mar 31 07:20PM

> On Sun, 31 Mar 2019 08:51:29 -0400
> Sam <sam@email-scan.com> wrote:
...
> I could write a class wrapper around pthreads? Wow! Why didn't I think of that??
> Truly a savant and nobel prizes surely await you!
 
Please: drop the sarcasm. Your original question was reasonable and
you obviously wanted an answer. It was even more interesting than
90% of the postings here.
 
At the same time, you /know/ you're now turning it into the same old
flamewar.
 
/Jorgen
 
--
// Jorgen Grahn <grahn@ Oo o. . .
\X/ snipabacken.se> O o .
"Chris M. Thomasson" <invalid_chris_thomasson_invalid@invalid.com>: Mar 31 02:02PM -0700

> Is there any equivalent of the pthreads pthread_rwlock_t in C++ threading?
> shared_mutex seems to be mentioned but the functionality seems different to
> me pluts its 2017 only anyway which rules out the compiler I'm using.
 
Fwiw, you just might be interested in the following thread:
 
https://groups.google.com/d/topic/comp.lang.c++/DBIG55vCBSA/discussion
 
Here is my crude C++ code:
 
https://pastebin.com/raw/1QtPCGhV
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.lang.c+++unsubscribe@googlegroups.com.

Saturday, March 30, 2019

Digest for comp.lang.c++@googlegroups.com - 1 update in 1 topic

Mr Flibble <flibbleREMOVETHISBIT@i42.co.uk>: Mar 30 09:27PM

My universal compiler will cause a technological singularity.
 
https://neos.dev
 
/Flibble
 
--
"You won't burn in hell. But be nice anyway." – Ricky Gervais
 
"I see Atheists are fighting and killing each other again, over who
doesn't believe in any God the most. Oh, no..wait.. that never happens." –
Ricky Gervais
 
"Suppose it's all true, and you walk up to the pearly gates, and are
confronted by God," Bryne asked on his show The Meaning of Life. "What
will Stephen Fry say to him, her, or it?"
"I'd say, bone cancer in children? What's that about?" Fry replied.
"How dare you? How dare you create a world to which there is such misery
that is not our fault. It's not right, it's utterly, utterly evil."
"Why should I respect a capricious, mean-minded, stupid God who creates a
world that is so full of injustice and pain. That's what I would say."
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.lang.c+++unsubscribe@googlegroups.com.

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

Horizon68 <horizon@horizon.com>: Mar 29 09:45AM -0700

Hello..
 
Read this:
 
 
As you know i am a white arab that is a more serious computer
programmer who has specialized in parallel programming and
synchronization algorithms, and i have invented many scalable algorithms
and there implementations, so i invite you to read the following
to know more:
 
Beating Moore's Law: Scaling Performance for Another Half-Century
 
Read more here:
 
https://www.infoworld.com/article/3287025/beating-moore-s-law-scaling-performance-for-another-half-century.html
 
 
Thank you,
Amine Moulay Ramdane.
Horizon68 <horizon@horizon.com>: Mar 29 08:52AM -0700

Hello...
 
 
I have just invented other more powerful scalable algorithms,
read below(they are now both bounded and unbounded), so i think
i have just "revolutionized" computing.
 
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 both bounded and unbounded.
- Fully scalable LIFO priority stack both bounded and unbounded
- Fully scalable FIFO priority queue both bounded and unbounded and 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.
Horizon68 <horizon@horizon.com>: Mar 29 08:40AM -0700

Hello...
 
 
More evidence about my work..
 
 
As you have noticed i am a white arab that is a gentleman type
of person, and i am an "inventor" of many scalable algorithms and there
implementations..
 
You have to know me more, i give you an example:
i have invented a "fully" scalable reference counting
with efficient support for weak references,
so when you type "scalable reference counting" on Google
search, my "invention" is the first one that
shows up, here is the Google search results:
 
https://www.google.com/search?source=hp&ei=1D2NXN6OKYaQ5wK8jJvIDw&q=scalable+reference+counting&btnK=Google+Search&oq=scalable+reference+counting&gs_l=psy-ab.3..35i39.394.3959..4179...0.0..0.89.2063.28......0....1..gws-wiz.....0..0i131j0j0i20i263j0i22i30.Im2gflxOWSA
 
 
As you have noticed i am like a PhD researcher, because
i am inventing scalable algorithms and competing with
inventions of the best PhD researchers like the following one that
is an jewish from Israel:
 
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.37.2448
 
 
Read my writing below to know more about my new invention:
 
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 algorithm
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 algorithm, 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>: Mar 29 08:36AM -0700

Hello..
 
 
Read again, i correct a last typo
 
Here is my new invention..
 
I have just invented a new scalable lock that is "better" than
my following scalable lock:
 
https://sites.google.com/site/scalable68/scalable-mlock
 
 
I think i will sell my new scalable lock to Embarcadero software company
or such software companies.
 
My new scalable lock is a node based Lock that is scalable, FIFO fair
and starvation-free.
 
- Discovered by Amine Moulay Ramdane
 
- This lock is scalable
 
- It has the same space requirement as the scalable MCS lock
 
- Doesn't require a local "queue node" to be passed in as a parameter as
is doing the MCS and CLH locks.
 
- Spins only on local locations on a cache-coherent machine
 
- And it's fast.
 
 
So you have to know that my new scalable lock doesn't require a local
"queue node" to be passed in as a parameter as is doing the MCS and CLH
locks, my scalable MLock doesn't require any parameter to be passed,
just call the Enter() and Leave() methods and that's all.
 
 
Thank you,
Amine Moulay Ramdane.
Horizon68 <horizon@horizon.com>: Mar 29 08:30AM -0700

Hello..
 
 
Here is my new invention..
 
I have just invented a new scalable lock that is "better" than
my following scalable lock:
 
https://sites.google.com/site/scalable68/scalable-mlock
 
 
I think i will sell my new scalable lock to Embarcadero sofware company
or such software companies.
 
My new scalable lock is a node based Lock that is scalable, FIFO fair
and starvation-free.
 
- Discovered by Amine Moulay Ramdane
 
- This lock is scalable
 
- It has the same space requirement as the scalable MCS lock
 
- Doesn't require a local "queue node" to be passed in as a parameter as
is doing the MCS and CLH locks.
 
- Spins only on local locations on a cache-coherent machine
 
- And it's fast.
 
 
So you have to know that my new scalable lock doesn't require a local
"queue node" to be passed in as a parameter as is doing the MCS and CLH
locks, my scalable MLock doesn't require any parameter to be passed,
just call the Enter() and Leave() methods and that's all.
 
 
Thank you,
Amine Moulay Ramdane.
Horizon68 <horizon@horizon.com>: Mar 29 06:15AM -0700

Hello..
 
 
More philosophy about scalability..
 
As i said:
 
"To be "convinced" of my writing, we can notice that from the running
hardware we can extract the ideas of the software(or the software), so
from empiricism we can get rationalism."
 
And i wrote:
 
"But i think that the right definition is also to include the running
software that is physical as the definition of a software."
 
 
I mean that the "set" that is called the "existence" of a software
can be composed of a the ideas of the software extracted from
the running hardware, so empiricism gives rationalism, so
that when you see a hardware running , you can say that this
hardware that is running engender that ideas of the software that is
called the running software, and the engendered ideas of the software
are running in the time scale, so the running software has
a scalability that can be the new "speed" of the running software
relatively to the old speed, and the old speed can be fixed here or
there in the reference of time.
 
Read the rest of my previous thoughts so to understand:
 
More explanation about scalability..
 
I said yesterday the following:
 
"What do you think is an idea in philosophy ?
An idea in philosophy can be immaterial or material.
So if an idea is immaterial , we will not allow the definition
of an idea as a running idea that is physical, but if it is material we
will allow the definition of an idea as a running idea that is physical,
this is the basis of logic. So more importantly we can define a software
as only ideas that we think with our logical reasoning and minds, so
with this we will exclude in the definition the software as a running
software that is physical, but we can also define a software as a
running ideas that are material so that we can define a software as a
running software that is material and also with its ideas that are
immaterial. But i think that the right definition is also to include the
running software that is physical as the definition of a software."
 
 
To be "convinced" of my above writing, we can notice that from the
running hardware we can extract the ideas of the software(or the
software), so from empiricism we can get rationalism.
 
 
Read the rest of my previous thoughts:
 
 
I think we have to be more smart about scalability..
 
I think we have to understand philosophy correctly:
 
What do you think is an idea in philosophy ?
 
An idea in philosophy can be immaterial or material.
 
So if an idea is immaterial , we will not allow the definition
of an idea as a running idea that is physical, but if it is material we
will allow the definition of an idea as a running idea that is physical,
this is the basis of logic. So more importantly we can define a software
as only ideas that we think with our logical reasoning and minds, so
with this we will exclude in the definition the software as a running
software that is physical, but we can also define a software as a
running ideas that are material so that we can define a software as a
running software that is material and also with its ideas that are
immaterial. But i think that the right definition is also to include the
running software that is physical as the definition of a software and
this is why i wrote the following in my previous writing about scalability:
 
My new and final logical proof about scalability..
 
I have proved below that:
 
"An understanding of a concept is a running concept"
 
But i have to be more smart, so follow me:
 
What do you think is an idea ?
 
Since:
 
"An understanding of a concept is a running concept"
 
So an idea too is a running idea.
 
 
But what is a software ?
 
A software is composed of a running software and
text of a oftware.
 
But since a software is a running software too, so
the running software is the hardware, so software scalability
is the concept and also the running software scalability that
is the hardware, so we can infer logically that even if the program
is single threaded and it runs on a more powerful hardware,
the running software scalability will be the new more powerful hardware
that compose the running software scalability, thus my logical proof is
complete.
 
Read the rest of my previous thoughts to understand more:
 
More logical proof about scalability:
 
I will now prove the following to be able for you to see the big
picture, i said the following:
 
"An understanding of a concept is a running concept"
 
 
My logical proof of it is the following:
 
You have to read first my previous writing below that say
the following:
 
"In political philosophy we have what we call the "concept" of
democracy,but we have to know that the concept of democracy that is
understood by our mind and consciousness is a "running" concept of
democracy, i mean a running concept of democracy in our mind."
 
So as you are noticing consciousness and understanding of the concept of
democracy is a running concept of democracy, so this part is logical
from the above, so we can logically infer that: "An understanding of a
concept is a running concept", because the understanding of a concept
comes from a running concept of our mind and consciousness and it comes
from the running concept of the outside reality, so it is in both
a running concept, hence logically we can say: "An understanding of a
concept is a running concept".
 
Read my previous following thoughts to understand:
 
 
My final thoughts about scalability..
 
I think that i am like proving the following: An understanding of a
concept is a running concept, because to be able to be an understanding
of a concept there must be a running concept, and the running concept
permits us to measure the running concept, so the running concept of
democracy permits us to say that "democracy" is good or not, that's the
same for software scalability, because the software scalability is also
the running concept of software scalability that permits us to measure
the running concept of scalability, so we can finally say that software
scalability is also the running software scalability , and this running
concept of software scalability is the new "speed" of the software
relatively to the old speed, and the old speed can be fixed here or
there in the reference of time.
 
Read the rest of my previous thoughts to understand more:
 
 
I think i have to do more philosophy about scalability..
 
I said the following:
 
"The actual scalability of my Parallel Sort Library in the mergesort
mode will go to around 12X"
 
 
In political philosophy we have what we call the "concept" of democracy,
but we have to know that the concept of democracy that is understood by
our mind and consciousness is a "running" concept of democracy, i mean
a running concept of democracy in our mind.
 
That's the same for software scalability, software scalability is not
just the concept, software scalability is also the running concept of
software scalability, and this running concept of software scalability
is the new "speed" of the software relatively to the old speed, and the
old speed can be fixed here or there in the reference of time, this is
why when i say that:
 
"The actual scalability of my Parallel Sort Library in the mergesort
mode will go to around 12X"
 
It also means the "running" concept of scalability.
 
 
So read my below previous writing to understand more:
 
 
More explanation about scalability..
 
As you have noticed i said below the following:
 
"The actual scalability of my Parallel Sort Library in the mergesort
mode will go to around 12X"
 
You have to distinguish between the scalability that is the combination
of scalability of hardware and software, and the scalability that is
only software or only hardware.
 
So you have to know that i am speaking below about the "total"
scalability of both the hardware(from one channel memory to 8 channels
memory) and software on actual Intel and AMD processors, but 3D stacking
of memory will give much more scalability.
 
 
Read again:
 
About Multi-channel memory architecture and my Parallel Sort Library..
 
On actual Intel and AMD processors data is moved from and to main memory
only in 64 bytes chunks, so in a 8 channels of a Multi-channel memory
architecture in a ganged mode, i think that the memory speed of
my Parallel Sort library in the mergesort mode will go to 8X speed,
and the actual scalability of my Parallel Sort Library in the mergesort
mode will go to around 12X. So i will advice you to use the ganged mode
of the Multi-channel memory architecture because it works great.
 
My Parallel Sort Library was updated to version 3.64
 
I have enhanced it more, and i think it is stable and fast
and it scales more.
 
You can download it from:
 
https://sites.google.com/site/scalable68/parallel-sort-library
 
 
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.

Friday, March 29, 2019

Digest for comp.lang.c++@googlegroups.com - 2 updates in 1 topic

James Kuyper <jameskuyper@alumni.caltech.edu>: Mar 28 08:21PM -0400

On 3/28/19 13:25, Paavo Helde wrote:
> of the number of seconds since 00:00 January 1, 1970 (a C run-time
> time_t value), that indicates when the file was created."
 
> I do not see the high 32 bits of the time_t value stored anywhere.
 
I think they're assuming that you can make a reasonable guess as to what
they are. After all, they're going to remain 0 until 2106-02-07T06:28:16
<https://www.timeanddate.com/date/dateadded.html?m1=01&d1=01&y1=1970&type=add&ay=&am=&aw=&ad=&h1=&i1=&s1=&ah=&ai=&as=4294967296&rec=>
Robert Wessel <robertwessel2@yahoo.com>: Mar 28 08:45PM -0500

On Thu, 28 Mar 2019 19:25:34 +0200, Paavo Helde
 
>I do not see the high 32 bits of the time_t value stored anywhere. Maybe
>the TimeDateStamp field is meant just as a convenient label for telling
>apart different versions of the file?
 
 
IIRC, .NET executables do something funky with the TimeDateStamp
field.
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.lang.c+++unsubscribe@googlegroups.com.

Digest for comp.programming.threads@googlegroups.com - 9 updates in 8 topics

Horizon68 <horizon@horizon.com>: Mar 28 11:23AM -0700

Hello,
 
Read this:
 
 
More explanation about scalability..
 
As you have noticed i said below the following:
 
"The scalability of my Parallel Sort Library in the mergesort mode will
go to around 12X"
 
You have to distinguish between the scalability that is the combination
of scalibility of hardware and software, and the scalability that is
only software or only hardware.
 
So you have to know that i am speaking below about the "total"
scalability of both the hardware(from one channel memory to 8 channels
memory) and software on actual Intel and AMD processors, but 3D stacking
of memory will give much more scalability.
 
 
Read again:
 
About Multi-channel memory architecture and my Parallel Sort Library..
 
On actual Intel and AMD processors data is moved from and to main memory
only in 64 bytes chunks, so in a 8 channels of a Multi-channel memory
architecture in a ganged mode, i think that the memory speed of
my Parallel Sort library in the mergesort mode will go to 8X speed,
and the actual scalability of my Parallel Sort Library in the mergesort
mode will go to around 12X. So i will advice you to use the ganged mode
of the Multi-channel memory architecture because it works great.
 
My Parallel Sort Library was updated to version 3.64
 
I have enhanced it more, and i think it is stable and fast
and it scales more.
 
You can download it from:
 
https://sites.google.com/site/scalable68/parallel-sort-library
 
 
Thank you,
Amine Moulay Ramdane.
Horizon68 <horizon@horizon.com>: Mar 29 04:35AM -0700

Hello...
 
 
More explanation about scalability..
 
I said yesterday the following:
 
"What do you think is an idea in philosophy ?
An idea in philosophy can be immaterial or material.
So if an idea is immaterial , we will not allow the definition
of an idea as a running idea that is physical, but if it is material we
will allow the definition of an idea as a running idea that is physical,
this is the basis of logic. So more importantly we can define a software
as only ideas that we think with our logical reasoning and minds, so
with this we will exclude in the definition the software as a running
software that is physical, but we can also define a software as a
running ideas that are material so that we can define a software as a
running software that is material and also with its ideas that are
immaterial. But i think that the right definition is also to include the
running software that is physical as the definition of a software."
 
 
To be "convinced" of my above writing, we can notice that from the
running hardware we can extract the ideas of the software(or the
software), so from empiricism we can get rationalism.
 
 
Read the rest of my previous thoughts:
 
 
I think we have to be more smart about scalability..
 
I think we have to understand philosophy correctly:
 
What do you think is an idea in philosophy ?
 
An idea in philosophy can be immaterial or material.
 
So if an idea is immaterial , we will not allow the definition
of an idea as a running idea that is physical, but if it is material we
will allow the definition of an idea as a running idea that is physical,
this is the basis of logic. So more importantly we can define a software
as only ideas that we think with our logical reasoning and minds, so
with this we will exclude in the definition the software as a running
software that is physical, but we can also define a software as a
running ideas that are material so that we can define a software as a
running software that is material and also with its ideas that are
immaterial. But i think that the right definition is also to include the
running software that is physical as the definition of a software and
this is why i wrote the following in my previous writing about scalability:
 
My new and final logical proof about scalability..
 
I have proved below that:
 
"An understanding of a concept is a running concept"
 
But i have to be more smart, so follow me:
 
What do you think is an idea ?
 
Since:
 
"An understanding of a concept is a running concept"
 
So an idea too is a running idea.
 
 
But what is a software ?
 
A software is composed of a running software and
text of a oftware.
 
But since a software is a running software too, so
the running software is the hardware, so software scalability
is the concept and also the running software scalability that
is the hardware, so we can infer logically that even if the program
is single threaded and it runs on a more powerful hardware,
the running software scalability will be the new more powerful hardware
that compose the running software scalability, thus my logical proof is
complete.
 
Read the rest of my previous thoughts to understand more:
 
More logical proof about scalability:
 
I will now prove the following to be able for you to see the big
picture, i said the following:
 
"An understanding of a concept is a running concept"
 
 
My logical proof of it is the following:
 
You have to read first my previous writing below that say
the following:
 
"In political philosophy we have what we call the "concept" of
democracy,but we have to know that the concept of democracy that is
understood by our mind and consciousness is a "running" concept of
democracy, i mean a running concept of democracy in our mind."
 
So as you are noticing consciousness and understanding of the concept of
democracy is a running concept of democracy, so this part is logical
from the above, so we can logically infer that: "An understanding of a
concept is a running concept", because the understanding of a concept
comes from a running concept of our mind and consciousness and it comes
from the running concept of the outside reality, so it is in both
a running concept, hence logically we can say: "An understanding of a
concept is a running concept".
 
Read my previous following thoughts to understand:
 
 
My final thoughts about scalability..
 
I think that i am like proving the following: An understanding of a
concept is a running concept, because to be able to be an understanding
of a concept there must be a running concept, and the running concept
permits us to measure the running concept, so the running concept of
democracy permits us to say that "democracy" is good or not, that's the
same for software scalability, because the software scalability is also
the running concept of software scalability that permits us to measure
the running concept of scalability, so we can finally say that software
scalability is also the running software scalability , and this running
concept of software scalability is the new "speed" of the software
relatively to the old speed, and the old speed can be fixed here or
there in the reference of time.
 
Read the rest of my previous thoughts to understand more:
 
 
I think i have to do more philosophy about scalability..
 
I said the following:
 
"The actual scalability of my Parallel Sort Library in the mergesort
mode will go to around 12X"
 
 
In political philosophy we have what we call the "concept" of democracy,
but we have to know that the concept of democracy that is understood by
our mind and consciousness is a "running" concept of democracy, i mean
a running concept of democracy in our mind.
 
That's the same for software scalability, software scalability is not
just the concept, software scalability is also the running concept of
software scalability, and this running concept of software scalability
is the new "speed" of the software relatively to the old speed, and the
old speed can be fixed here or there in the reference of time, this is
why when i say that:
 
"The actual scalability of my Parallel Sort Library in the mergesort
mode will go to around 12X"
 
It also means the "running" concept of scalability.
 
 
So read my below previous writing to understand more:
 
 
More explanation about scalability..
 
As you have noticed i said below the following:
 
"The actual scalability of my Parallel Sort Library in the mergesort
mode will go to around 12X"
 
You have to distinguish between the scalability that is the combination
of scalability of hardware and software, and the scalability that is
only software or only hardware.
 
So you have to know that i am speaking below about the "total"
scalability of both the hardware(from one channel memory to 8 channels
memory) and software on actual Intel and AMD processors, but 3D stacking
of memory will give much more scalability.
 
 
Read again:
 
About Multi-channel memory architecture and my Parallel Sort Library..
 
On actual Intel and AMD processors data is moved from and to main memory
only in 64 bytes chunks, so in a 8 channels of a Multi-channel memory
architecture in a ganged mode, i think that the memory speed of
my Parallel Sort library in the mergesort mode will go to 8X speed,
and the actual scalability of my Parallel Sort Library in the mergesort
mode will go to around 12X. So i will advice you to use the ganged mode
of the Multi-channel memory architecture because it works great.
 
My Parallel Sort Library was updated to version 3.64
 
I have enhanced it more, and i think it is stable and fast
and it scales more.
 
You can download it from:
 
https://sites.google.com/site/scalable68/parallel-sort-library
 
 
Thank you,
Amine Moulay Ramdane.
Horizon68 <horizon@horizon.com>: Mar 28 05:09PM -0700

Hello...
 
Read this:
 
 
I think we have to be more smart about scalability..
 
I think we have to understand philosophy correctly:
 
What do you think is an idea in philosophy ?
 
An idea in philosophy can be immaterial or material.
 
So if an idea is immaterial , we will not allow the definition
of an idea as a running idea that is physical, but if it is material we
will allow the definition of an idea as a running idea that is physical,
this is the basis of logic. So more importantly we can define a software
as only ideas that we think with our logical reasoning and minds, so
with this we will exclude in the definition the software as a running
software that is physical, but we can also define a software as a
running ideas that are material so that we can define a software as a
running software that is material and also with its ideas that are
immaterial. But i think that the the right definition is also to include
the running software that is physical as the definition of a software
and this is why i wrote the following in my previous writing about
scalability:
 
My new and final logical proof about scalability..
 
I have proved below that:
 
"An understanding of a concept is a running concept"
 
But i have to be more smart, so follow me:
 
What do you think is an idea ?
 
Since:
 
"An understanding of a concept is a running concept"
 
So an idea too is a running idea.
 
 
But what is a software ?
 
A software is composed of a running software and
text of a oftware.
 
But since a software is a running software too, so
the running software is the hardware, so software scalability
is the concept and also the running software scalability that
is the hardware, so we can infer logically that even if the program
is single threaded and it runs on a more powerful hardware,
the running software scalability will be the new more powerful hardware
that compose the running software scalability, thus my logical proof is
complete.
 
Read the rest of my previous thoughts to understand more:
 
More logical proof about scalability:
 
I will now prove the following to be able for you to see the big
picture, i said the following:
 
"An understanding of a concept is a running concept"
 
 
My logical proof of it is the following:
 
You have to read first my previous writing below that say
the following:
 
"In political philosophy we have what we call the "concept" of
democracy,but we have to know that the concept of democracy that is
understood by our mind and consciousness is a "running" concept of
democracy, i mean a running concept of democracy in our mind."
 
So as you are noticing consciousness and understanding of the concept of
democracy is a running concept of democracy, so this part is logical
from the above, so we can logically infer that: "An understanding of a
concept is a running concept", because the understanding of a concept
comes from a running concept of our mind and consciousness and it comes
from the running concept of the outside reality, so it is in both
a running concept, hence logically we can say: "An understanding of a
concept is a running concept".
 
Read my previous following thoughts to understand:
 
 
My final thoughts about scalability..
 
I think that i am like proving the following: An understanding of a
concept is a running concept, because to be able to be an understanding
of a concept there must be a running concept, and the running concept
permits us to measure the running concept, so the running concept of
democracy permits us to say that "democracy" is good or not, that's the
same for software scalability, because the software scalability is also
the running concept of software scalability that permits us to measure
the running concept of scalability, so we can finally say that software
scalability is also the running software scalability , and this running
concept of software scalability is the new "speed" of the software
relatively to the old speed, and the old speed can be fixed here or
there in the reference of time.
 
Read the rest of my previous thoughts to understand more:
 
 
I think i have to do more philosophy about scalability..
 
I said the following:
 
"The actual scalability of my Parallel Sort Library in the mergesort
mode will go to around 12X"
 
 
In political philosophy we have what we call the "concept" of democracy,
but we have to know that the concept of democracy that is understood by
our mind and consciousness is a "running" concept of democracy, i mean
a running concept of democracy in our mind.
 
That's the same for software scalability, software scalability is not
just the concept, software scalability is also the running concept of
software scalability, and this running concept of software scalability
is the new "speed" of the software relatively to the old speed, and the
old speed can be fixed here or there in the reference of time, this is
why when i say that:
 
"The actual scalability of my Parallel Sort Library in the mergesort
mode will go to around 12X"
 
It also means the "running" concept of scalability.
 
 
So read my below previous writing to understand more:
 
 
More explanation about scalability..
 
As you have noticed i said below the following:
 
"The actual scalability of my Parallel Sort Library in the mergesort
mode will go to around 12X"
 
You have to distinguish between the scalability that is the combination
of scalability of hardware and software, and the scalability that is
only software or only hardware.
 
So you have to know that i am speaking below about the "total"
scalability of both the hardware(from one channel memory to 8 channels
memory) and software on actual Intel and AMD processors, but 3D stacking
of memory will give much more scalability.
 
 
Read again:
 
About Multi-channel memory architecture and my Parallel Sort Library..
 
On actual Intel and AMD processors data is moved from and to main memory
only in 64 bytes chunks, so in a 8 channels of a Multi-channel memory
architecture in a ganged mode, i think that the memory speed of
my Parallel Sort library in the mergesort mode will go to 8X speed,
and the actual scalability of my Parallel Sort Library in the mergesort
mode will go to around 12X. So i will advice you to use the ganged mode
of the Multi-channel memory architecture because it works great.
 
My Parallel Sort Library was updated to version 3.64
 
I have enhanced it more, and i think it is stable and fast
and it scales more.
 
You can download it from:
 
https://sites.google.com/site/scalable68/parallel-sort-library
 
 
Thank you,
Amine Moulay Ramdane.
Horizon68 <horizon@horizon.com>: Mar 28 04:10PM -0700

Hello...
 
Read this:
 
 
My new and final logical proof about scalability..
 
I have proved below that:
 
"An understanding of a concept is a running concept"
 
But i have to be more smart, so follow me:
 
What do you think is an idea ?
 
Since:
 
"An understanding of a concept is a running concept"
 
So an idea too is a running idea.
 
 
But what is a software ?
 
A software is composed of a running software and
text of a oftware.
 
But since a software is a running software too, so
the running software is the hardware, so software scalability
is the concept and also the running software scalability that
is the hardware, so we can infer logically that even if the program
is single threaded and it runs on a more powerful hardware,
the running software scalability will be the new more powerful hardware
that compose the running software scalability, thus my logical proof is
complete.
 
Read the rest of my previous thoughts to understand more:
 
More logical proof about scalability:
 
I will now prove the following to be able for you to see the big
picture, i said the following:
 
"An understanding of a concept is a running concept"
 
 
My logical proof of it is the following:
 
You have to read first my previous writing below that say
the following:
 
"In political philosophy we have what we call the "concept" of
democracy,but we have to know that the concept of democracy that is
understood by our mind and consciousness is a "running" concept of
democracy, i mean a running concept of democracy in our mind."
 
So as you are noticing consciousness and understanding of the concept of
democracy is a running concept of democracy, so this part is logical
from the above, so we can logically infer that: "An understanding of a
concept is a running concept", because the understanding of a concept
comes from a running concept of our mind and consciousness and it comes
from the running concept of the outside reality, so it is in both
a running concept, hence logically we can say: "An understanding of a
concept is a running concept".
 
Read my previous following thoughts to understand:
 
 
My final thoughts about scalability..
 
I think that i am like proving the following: An understanding of a
concept is a running concept, because to be able to be an understanding
of a concept there must be a running concept, and the running concept
permits us to measure the running concept, so the running concept of
democracy permits us to say that "democracy" is good or not, that's the
same for software scalability, because the software scalability is also
the running concept of software scalability that permits us to measure
the running concept of scalability, so we can finally say that software
scalability is also the running software scalability , and this running
concept of software scalability is the new "speed" of the software
relatively to the old speed, and the old speed can be fixed here or
there in the reference of time.
 
Read the rest of my previous thoughts to understand more:
 
 
I think i have to do more philosophy about scalability..
 
I said the following:
 
"The actual scalability of my Parallel Sort Library in the mergesort
mode will go to around 12X"
 
 
In political philosophy we have what we call the "concept" of democracy,
but we have to know that the concept of democracy that is understood by
our mind and consciousness is a "running" concept of democracy, i mean
a running concept of democracy in our mind.
 
That's the same for software scalability, software scalability is not
just the concept, software scalability is also the running concept of
software scalability, and this running concept of software scalability
is the new "speed" of the software relatively to the old speed, and the
old speed can be fixed here or there in the reference of time, this is
why when i say that:
 
"The actual scalability of my Parallel Sort Library in the mergesort
mode will go to around 12X"
 
It also means the "running" concept of scalability.
 
 
So read my below previous writing to understand more:
 
 
More explanation about scalability..
 
As you have noticed i said below the following:
 
"The actual scalability of my Parallel Sort Library in the mergesort
mode will go to around 12X"
 
You have to distinguish between the scalability that is the combination
of scalability of hardware and software, and the scalability that is
only software or only hardware.
 
So you have to know that i am speaking below about the "total"
scalability of both the hardware(from one channel memory to 8 channels
memory) and software on actual Intel and AMD processors, but 3D stacking
of memory will give much more scalability.
 
 
Read again:
 
About Multi-channel memory architecture and my Parallel Sort Library..
 
On actual Intel and AMD processors data is moved from and to main memory
only in 64 bytes chunks, so in a 8 channels of a Multi-channel memory
architecture in a ganged mode, i think that the memory speed of
my Parallel Sort library in the mergesort mode will go to 8X speed,
and the actual scalability of my Parallel Sort Library in the mergesort
mode will go to around 12X. So i will advice you to use the ganged mode
of the Multi-channel memory architecture because it works great.
 
My Parallel Sort Library was updated to version 3.64
 
I have enhanced it more, and i think it is stable and fast
and it scales more.
 
You can download it from:
 
https://sites.google.com/site/scalable68/parallel-sort-library
 
 
Thank you,
Amine Moulay Ramdane.
Horizon68 <horizon@horizon.com>: Mar 28 03:14PM -0700

Hello...
 
Read this:
 
 
More logical proof about scalability:
 
I will now prove the following to be able for you to see the big
picture, i said the following:
 
"An understanding of a concept is a running concept"
 
 
My logical proof of it is the following:
 
You have to read first my previous writing below that say
the following:
 
"In political philosophy we have what we call the "concept" of
democracy,but we have to know that the concept of democracy that is
understood by our mind and consciousness is a "running" concept of
democracy, i mean a running concept of democracy in our mind."
 
So as you are noticing consciousness and understanding of the concept of
democracy is a running concept of democracy, so this part is logical
from the above, so we can logically infer that: "An understanding of a
concept is a running concept", because the understanding of a concept
comes from a running concept of our mind and consciousness and it comes
from the running concept of the outside reality, so it is in both
a running concept, hence logically we can say: "An understanding of a
concept is a running concept".
 
Read my previous following thoughts to understand:
 
 
My final thoughts about scalability..
 
I think that i am like proving the following: An understanding of a
concept is a running concept, because to be able to be an understanding
of a concept there must be a running concept, and the running concept
permits us to measure the running concept, so the running concept of
democracy permits us to say that "democracy" is good or not, that's the
same for software scalability, because the software scalability is also
the running concept of software scalability that permits us to measure
the running concept of scalability, so we can finally say that software
scalability is also the running software scalability , and this running
concept of software scalability is the new "speed" of the software
relatively to the old speed, and the old speed can be fixed here or
there in the reference of time.
 
Read the rest of my previous thoughts to understand more:
 
 
I think i have to do more philosophy about scalability..
 
I said the following:
 
"The actual scalability of my Parallel Sort Library in the mergesort
mode will go to around 12X"
 
 
In political philosophy we have what we call the "concept" of democracy,
but we have to know that the concept of democracy that is understood by
our mind and consciousness is a "running" concept of democracy, i mean
a running concept of democracy in our mind.
 
That's the same for software scalability, software scalability is not
just the concept, software scalability is also the running concept of
software scalability, and this running concept of software scalability
is the new "speed" of the software relatively to the old speed, and the
old speed can be fixed here or there in the reference of time, this is
why when i say that:
 
"The actual scalability of my Parallel Sort Library in the mergesort
mode will go to around 12X"
 
It also means the "running" concept of scalability.
 
 
So read my below previous writing to understand more:
 
 
More explanation about scalability..
 
As you have noticed i said below the following:
 
"The actual scalability of my Parallel Sort Library in the mergesort
mode will go to around 12X"
 
You have to distinguish between the scalability that is the combination
of scalability of hardware and software, and the scalability that is
only software or only hardware.
 
So you have to know that i am speaking below about the "total"
scalability of both the hardware(from one channel memory to 8 channels
memory) and software on actual Intel and AMD processors, but 3D stacking
of memory will give much more scalability.
 
 
Read again:
 
About Multi-channel memory architecture and my Parallel Sort Library..
 
On actual Intel and AMD processors data is moved from and to main memory
only in 64 bytes chunks, so in a 8 channels of a Multi-channel memory
architecture in a ganged mode, i think that the memory speed of
my Parallel Sort library in the mergesort mode will go to 8X speed,
and the actual scalability of my Parallel Sort Library in the mergesort
mode will go to around 12X. So i will advice you to use the ganged mode
of the Multi-channel memory architecture because it works great.
 
My Parallel Sort Library was updated to version 3.64
 
I have enhanced it more, and i think it is stable and fast
and it scales more.
 
You can download it from:
 
https://sites.google.com/site/scalable68/parallel-sort-library
 
 
Thank you,
Amine Moulay Ramdane.
Horizon68 <horizon@horizon.com>: Mar 28 02:37PM -0700

Hello...
 
Read this:
 
 
My final thoughts about scalability..
 
I think that i am like proving the following: An understanding of a
concept is a running concept, because to be able to be an understanding
of a concept there must be a running concept, and the running concept
permits us to measure the running concept, so the running concept of
democracy permits us to say that "democracy" is good or not, that's the
same for software scalability, because the software scalability is also
the running concept of software scalability that permits us to measure
the running concept of scalability, so we can finally say that software
scalability is also the running software scalability , and this running
concept of software scalability is the new "speed" of the software
relatively to the old speed, and the old speed can be fixed here or
there in the reference of time.
 
Read the rest of my previous thoughts to understand more:
 
 
I think i have to do more philosophy about scalability..
 
I said the following:
 
"The actual scalability of my Parallel Sort Library in the mergesort
mode will go to around 12X"
 
 
In political philosophy we have what we call the "concept" of democracy,
but we have to know that the concept of democracy that is understood by
our mind and consciousness is a "running" concept of democracy, i mean
a running concept of democracy in our mind.
 
That's the same for software scalability, software scalability is not
just the concept, software scalability is also the running concept of
software scalability, and this running concept of software scalability
is the new "speed" of the software relatively to the old speed, and the
old speed can be fixed here or there in the reference of time, this is
why when i say that:
 
"The actual scalability of my Parallel Sort Library in the mergesort
mode will go to around 12X"
 
It also means the "running" concept of scalability.
 
 
So read my below previous writing to understand more:
 
 
More explanation about scalability..
 
As you have noticed i said below the following:
 
"The actual scalability of my Parallel Sort Library in the mergesort
mode will go to around 12X"
 
You have to distinguish between the scalability that is the combination
of scalability of hardware and software, and the scalability that is
only software or only hardware.
 
So you have to know that i am speaking below about the "total"
scalability of both the hardware(from one channel memory to 8 channels
memory) and software on actual Intel and AMD processors, but 3D stacking
of memory will give much more scalability.
 
 
Read again:
 
About Multi-channel memory architecture and my Parallel Sort Library..
 
On actual Intel and AMD processors data is moved from and to main memory
only in 64 bytes chunks, so in a 8 channels of a Multi-channel memory
architecture in a ganged mode, i think that the memory speed of
my Parallel Sort library in the mergesort mode will go to 8X speed,
and the actual scalability of my Parallel Sort Library in the mergesort
mode will go to around 12X. So i will advice you to use the ganged mode
of the Multi-channel memory architecture because it works great.
 
My Parallel Sort Library was updated to version 3.64
 
I have enhanced it more, and i think it is stable and fast
and it scales more.
 
You can download it from:
 
https://sites.google.com/site/scalable68/parallel-sort-library
 
 
Thank you,
Amine Moulay Ramdane.
Horizon68 <horizon@horizon.com>: Mar 28 01:29PM -0700

Hello..
 
 
I think i have to do more philosophy about scalability..
 
I said the following:
 
"The actual scalability of my Parallel Sort Library in the mergesort
mode will go to around 12X"
 
 
In political philosophy we have what we call the "concept" of democracy,
but we have to know that the concept of democracy that is understood by
our mind and consciousness is a "running" concept of democracy, i mean
a running concept of democracy in our mind.
 
That's the same for software scalability, software scalability is not
just the concept, software scalability is also the running concept of
software scalability, and this running concept of software scalability
is the new "speed" of the software relatively to the old speed, and the
old speed can be fixed here or there in the reference of time, this is
why when i say that:
 
"The actual scalability of my Parallel Sort Library in the mergesort
mode will go to around 12X"
 
It also means the "running" concept of scalability.
 
 
So read my below previous writing to understand more:
 
 
More explanation about scalability..
 
As you have noticed i said below the following:
 
"The actual scalability of my Parallel Sort Library in the mergesort
mode will go to around 12X"
 
You have to distinguish between the scalability that is the combination
of scalability of hardware and software, and the scalability that is
only software or only hardware.
 
So you have to know that i am speaking below about the "total"
scalability of both the hardware(from one channel memory to 8 channels
memory) and software on actual Intel and AMD processors, but 3D stacking
of memory will give much more scalability.
 
 
Read again:
 
About Multi-channel memory architecture and my Parallel Sort Library..
 
On actual Intel and AMD processors data is moved from and to main memory
only in 64 bytes chunks, so in a 8 channels of a Multi-channel memory
architecture in a ganged mode, i think that the memory speed of
my Parallel Sort library in the mergesort mode will go to 8X speed,
and the actual scalability of my Parallel Sort Library in the mergesort
mode will go to around 12X. So i will advice you to use the ganged mode
of the Multi-channel memory architecture because it works great.
 
My Parallel Sort Library was updated to version 3.64
 
I have enhanced it more, and i think it is stable and fast
and it scales more.
 
You can download it from:
 
https://sites.google.com/site/scalable68/parallel-sort-library
 
 
Thank you,
Amine Moulay Ramdane.
Horizon68 <horizon@horizon.com>: Mar 28 11:32AM -0700

Hello...
 
 
Read again, i correct a last typo:
 
More explanation about scalability..
 
As you have noticed i said below the following:
 
"The scalability of my Parallel Sort Library in the mergesort mode will
go to around 12X"
 
You have to distinguish between the scalability that is the combination
of scalability of hardware and software, and the scalability that is
only software or only hardware.
 
So you have to know that i am speaking below about the "total"
scalability of both the hardware(from one channel memory to 8 channels
memory) and software on actual Intel and AMD processors, but 3D stacking
of memory will give much more scalability.
 
 
Read again:
 
About Multi-channel memory architecture and my Parallel Sort Library..
 
On actual Intel and AMD processors data is moved from and to main memory
only in 64 bytes chunks, so in a 8 channels of a Multi-channel memory
architecture in a ganged mode, i think that the memory speed of
my Parallel Sort library in the mergesort mode will go to 8X speed,
and the actual scalability of my Parallel Sort Library in the mergesort
mode will go to around 12X. So i will advice you to use the ganged mode
of the Multi-channel memory architecture because it works great.
 
My Parallel Sort Library was updated to version 3.64
 
I have enhanced it more, and i think it is stable and fast
and it scales more.
 
You can download it from:
 
https://sites.google.com/site/scalable68/parallel-sort-library
 
 
Thank you,
Amine Moulay Ramdane.
Horizon68 <horizon@horizon.com>: Mar 28 11:02AM -0700

Hello..
 
 
About Multi-channel memory architecture and my Parallel Sort Library..
 
On actual Intel and AMD processors data is moved from and to main memory
only in 64 bytes chunks, so in a 8 channels of a Multi-channel memory
architecture in a ganged mode, i think that the memory speed of
my Parallel Sort library in the mergesort mode will go to 8X speed,
and the scalability of my Parallel Sort Library in the mergesort mode
will go to around 12X. So i will advice you to use the ganged mode of
the Multi-channel memory architecture because it works great.
 
My Parallel Sort Library was updated to version 3.64
 
I have enhanced it more, and i think it is stable and fast
and it scales more.
 
You can download it from:
 
https://sites.google.com/site/scalable68/parallel-sort-library
 
 
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.