W dniu czwartek, 13 grudnia 2018 07:54:14 UTC+1 użytkownik segn napisał:
> Basically I'm looking for implementation of the same queue. In the > project, the same principle was used for both thread-thread > single-direction communication (typical master thread + # of worker > threads; each channel is the SPSC FIFO queue), and for kernel-thread > communication. > > The second one was quite specific: it was using a reserved shared memory > block, used as an C array in a way circular buffer is used (so: FIFO). I > wrote the queue, but surprisingly I've lost memory on this :) I cannot tell > if there was some index `int first_free_idx', it looks like there should be. > I've found the queue that I've used, I think that many (like me and other's from my team) programmers came up with it on their own, but here it is called Fast-Forward Queue: https://scholar.colorado.edu/cgi/viewcontent.cgi?article=1960&context=csci_techreports segn -- --- You received this message because you are subscribed to the Google Groups "Scalable Synchronization Algorithms" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To view this discussion on the web visit https://groups.google.com/d/msgid/lock-free/89eb09ea-2eba-468a-835a-e7da510d73eb%40googlegroups.com. For more options, visit https://groups.google.com/d/optout.
