Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.programming.threads > #4109
| From | computer45 <computer45@cyber.com> |
|---|---|
| Newsgroups | comp.programming.threads |
| Subject | Read again about network of SPSC queue to form MPMC |
| Date | 2018-03-25 14:45 -0400 |
| Organization | A noiseless patient Spider |
| Message-ID | <p98qp6$kpb$3@dont-email.me> (permalink) |
Hello, Read again about network of SPSC queue to form MPMC: https://books.google.ca/books?id=jZG_DQAAQBAJ&pg=PA276&lpg=PA276&dq=SPSC+and+queue+and+MPMC&source=bl&ots=KwfRYpYWW3&sig=GYE7Sn7ZlhNsJISvTjV4bXnjvDc&hl=en&sa=X&ved=0ahUKEwia4fKKjojaAhUCuVkKHZnbBvMQ6AEIjgEwCQ#v=onepage&q=SPSC%20and%20queue%20and%20MPMC&f=false As you have noticed a matrix of (N-1)*(N-1) SPSC queues is needed to compose an MPMC queue , and strict FIFO order can be broken in it, this is not good, this is why said also: Other than the strict FIFO order that can be broken, here is another problem with the distributed network of SPSC queues, here it is: -- 5. finally, SPSC may not be a good point for massive ITC(inter-thread communication):. Because the space complexity goes in O(N^2), N is the number of threads. It is not rare to see a server with 1k or 2k hardware threads. And "many core" is the final destination of CPU from current sight. --- Read all the following webpage and the responses to it to understand: https://www.infoq.com/articles/High-Performance-Java-Inter-Thread-Communications So i think my scalable FIFO queue algorithm and its implementation is an invention and it is still useful. Thank you, Amine Moulay Ramdane.
Back to comp.programming.threads | Previous | Next | Find similar | Unroll thread
Read again about network of SPSC queue to form MPMC computer45 <computer45@cyber.com> - 2018-03-25 14:45 -0400
csiph-web