Databases
StackOverflow2013
Postsdbo
POIs there a fast in-memory queue I can use that swaps items as it reaches a certain size?
 

Note that there are some explanatory texts on larger screens.

plurals
  1. POIs there a fast in-memory queue I can use that swaps items as it reaches a certain size?
    primarykey
    data
    text
    <p>I've been using c/c++/cuda for less than a week and not familiar with all the options available in terms of libraries(sorry if my question is too wacky or impossible). Here's my problem, I have a process that takes data and analyzes it then does 1 of 3 things, (1) saves the results, (2) discards the results or (3) breaks the data down and sends it back to be processed. </p> <p>Often option (3) creates a lot of data and I very quickly exceed the memory available to me(my server is 16 gigs) so the way I got around that was to setup a queue server(rabbitmq) that I would send and receive work from(it swaps the queue once it reaches a certain size of memory). This worked perfectly when I used small servers with faster nics to transfer the data, but lately I have been learning and converting my code from Java to c/c++ and running it on a GPU which has made the queues a big bottleneck. The bottleneck was obviously the network io(profiling on cheap systems showed high cpu usage and similar on old gpu's but new faster cpus/gpus are not getting utilized as much and network IO is steady at 300-400/mbs). So I decided to try to eliminate the network totally and run the queue server locally on the server which made it faster but I suspect it could be even more faster if I used a solution that didn't rely on external network services(even if I am running them locally). It may not work but I want to experiment.</p> <p>So my question is, is there anything that I can use like a queue that I can remove entries as I read them but also swaps the queue to disk once it reaches a certain size(but keeps the in-memory queue always full so I don't have to wait to read from disk)? When learning about Cuda, there are many examples of researchers running analysis on huge datasets, any ideas of how they keep data coming in at the fastest rate for the system to process(I imagine they aren't bound by disk/network otherwise faster gpu's wouldn't really give them magnitudes increase in performance)? </p> <p>Does anything like this exist?</p> <p>p.s. if it helps, so far I have experimented with rabbitmq(too slow for my situation), apollo mq(good but still network based), reddis(really liked it but cannot exceed physical memory), playing with mmap(), and I've also compressed my data to get better throughput. I know general solutions but I'm wondering if there's something native to c/c++, cuda or a library I can use(<em>ideally, I would have a queue in Cuda global memory that swapped to the host memory that swapped to the disk so the GPU's would always be at full speed</em> but that maybe wishful thinking). If there's anything else you can think of let me know and I'd enjoy experimenting with it(if it helps, I develop on a Mac and run it on linux).</p>
    singulars
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. PTQuestion
    1. This table or related slice is empty.
    1. USLostsoul
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. PO
      singulars
      1. PTAnswer
    2. PO
      singulars
      1. PTAnswer
    1. VO
      singulars
      1. POIs there a fast in-memory queue I can use that swaps items as it reaches a certain size?
      1. This table or related slice is empty.
      1. VTUpMod
    2. VO
      singulars
      1. POIs there a fast in-memory queue I can use that swaps items as it reaches a certain size?
      1. This table or related slice is empty.
      1. VTUpMod
    3. VO
      singulars
      1. POIs there a fast in-memory queue I can use that swaps items as it reaches a certain size?
      1. This table or related slice is empty.
      1. VTUpMod
    1. CO[Boost.CircularBuffer](http://www.boost.org/libs/circular_buffer/)?
      singulars
      1. POIs there a fast in-memory queue I can use that swaps items as it reaches a certain size?
      1. USildjarn
    2. COthat's backed by disk?!
      singulars
      1. POIs there a fast in-memory queue I can use that swaps items as it reaches a certain size?
      1. USandrew cooke
    3. COMaybe STXXL? http://stxxl.sourceforge.net/
      singulars
      1. POIs there a fast in-memory queue I can use that swaps items as it reaches a certain size?
      1. USRoger Dahl
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload