Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.programming.threads > #4976
| From | Horizon68 <horizon@horizon.com> |
|---|---|
| Newsgroups | comp.programming.threads |
| Subject | My final thoughts about scalability.. |
| Date | 2019-03-28 14:37 -0700 |
| Organization | A noiseless patient Spider |
| Message-ID | <q7jer8$gul$9@dont-email.me> (permalink) |
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.
Back to comp.programming.threads | Previous | Next | Find similar | Unroll thread
My final thoughts about scalability.. Horizon68 <horizon@horizon.com> - 2019-03-28 14:37 -0700
csiph-web