On Fri, Aug 13, 2010 at 03:49:39PM -0700, Dustin Norlander wrote:
> plan for approximate lifo is what you suggested. (start at 3b and
> count down as tasks are submitted, then cycle when priority = 1).
> obviously its not perfect, but we don't really need it to be (just
> MOSTLY lifo). are there any other drawbacks to this approach?
Since the priority value is a 32-bit integerl (smaller values being
dequeued before higher values), you could create a LIFO stack by queueing
jobs with a priority of maxint - time(). Jobs queued in the same second
will get the same priority, so it would just be approximate, but you
probably don't care about that level of granularity.
--
you forth love if honk then
. . . . .
Karen Etheridge, [email protected] GCS C+++$ USL+++$ P+++$ w--- M++
http://etheridge.ca/ PS++ PE-- b++ DI++++ e++ h(-)
--
You received this message because you are subscribed to the Google Groups
"beanstalk-talk" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/beanstalk-talk?hl=en.
