Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.lang.pascal.misc > #699
| From | aminer <aminer@toto.net> |
|---|---|
| Newsgroups | comp.lang.pascal.misc |
| Subject | More about speed and scalability |
| Date | 2014-04-13 21:04 -0700 |
| Organization | albasani.net |
| Message-ID | <lifc66$768$3@news.albasani.net> (permalink) |
Hello, I have come to another subject, you have seen me on this forums inventing scalable RWLocks and scalable FIFO fair locks, and speaking about waitfree and lockfree FIFO queues.. and i was thinking more and saying to myself what is the very important think to know when designing such scalable algorithms? i think the very important think to know about those algorithms is there speed and scalability, but when you you want to optimize those algorithms for speed you have to concentrate on cache-lines transfers, you have to reduce cache-lines transfers between caches and that's the very important think to do to speed your synchronization algorithms or concurrent FIFO queues algorithms, and the other very important think to know is how to achieve scalability with those algorithms? it's the same answer, you have to eliminate cache-lines transfers between caches this is how you can achieve scalability, so from know on you have to look at those synchronization algorithms and concurrent FIFO queues algorithms from the cache-lines transfers point of view to judge or to achieve speed and scalability. Thank you, Amine Moulay Ramdane.
Back to comp.lang.pascal.misc | Previous | Next — Next in thread | Find similar
More about speed and scalability aminer <aminer@toto.net> - 2014-04-13 21:04 -0700 Re: More about speed and scalability aminer <aminer@toto.net> - 2014-04-13 23:02 -0700
csiph-web