Databases
StackOverflow2013
Postsdbo
POThreadpool multi-queue job dispatch algorithm
 

Note that there are some explanatory texts on larger screens.

plurals
  1. POThreadpool multi-queue job dispatch algorithm
    primarykey
    data
    text
    <p>I'm curious to know if there is a widely accepted solution for managing thread resources in a threadpool given the following scenario/constraints:</p> <ol> <li>Incoming jobs are all of the same nature and could be processed by any thread in the pool. </li> <li>Incoming jobs will be 'bucketed' into different queues based on some attribute of the incoming job such that all jobs going to the same bucket/queue MUST be processed serially. </li> <li>Some buckets will be less busy than others at different points during the lifetime of the program.</li> </ol> <p>My question is on the theory behind a threadpool's implementation. What algorithm could be used to efficiently allocate available threads to incoming jobs across all buckets?</p> <p><strong>Edit</strong>: Another design goal would be to eliminate as much latency as possible between a job being enqueued and it being picked up for processing, assuming there are available idle threads.</p> <p><strong>Edit2</strong>: In the case I'm thinking of there are a relatively large number of queues (50-100) which have unpredictable levels of activity, but probably only 25% of them will be active at any given time. </p> <p>The first (and most costly) solution I can think of is to simply have 1 thread assigned to each queue. While this will ensure incoming requests are picked up immediately, it is obviously inefficient. </p> <p>The second solution is to combine the queues together based on expected levels of activity so that the number of queues is inline with the number of threads in the pool, allowing one thread to be assigned to each queue. The problem here will be that incoming jobs, which otherwise could be processed in parallel, will be forced to wait on each other.</p> <p>The third solution is to create the maximum number of queues, one for each set of jobs that must be processed serially, but only allocate threads based on the number of queues we expect to be busy at any given time (which could also be adjusted by the pool at runtime). So this is where my question comes in: Given that we have more queues than threads, how does the pool go about allocating idle threads to incoming jobs in the most efficient way possible? </p> <p>I would like to know if there is a widely accepted approach. Or if there are different approaches - who makes use of which one? What are the advantages/disadvantages, etc? </p> <p><strong>Edit3</strong>:This might be best expressed in pseudo code.</p>
    singulars
    1. PO
      singulars
      1. PTAnswer
    1. This table or related slice is empty.
    1. PTQuestion
    1. UShifier
    1. UShifier
    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
    3. PO
      singulars
      1. PTAnswer
    1. VO
      singulars
      1. POThreadpool multi-queue job dispatch algorithm
      1. This table or related slice is empty.
      1. VTUpMod
    2. VO
      singulars
      1. POThreadpool multi-queue job dispatch algorithm
      1. This table or related slice is empty.
      1. VTUpMod
    1. This table or related slice is empty.
 

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