On Fri, Apr 15, 2016 at 10:29:24PM +0200, Jon S wrote: > Hello all! > > As a port of a backup solution, i needa a queue. Having looked around the > net, i haven found any standard way (besides named pipes) that I can use. > > Requirements are: > * There will be few elements in the queue (<20) > * No critical section is needed (this is already adressed using mkdir) > * The queue must be possible to examine without altering it > * It would be nice if the queue only can contain unique elements (no point > in queing the same job twice) > > My own two ideas are: > * Files in a dir. Gives uniqueness if names are well selected, but I dont > know how to handle element order neatly > * Rows in a file: No guarantee for unique jobs. Easy to define order and to > add a new job at end (or beginning) of a file or pop a job > > Any ideas or proposal of standard way to do this?
Not sure lpd could be configured to be spooler for non printing jobs like it is on AIX but you can try. There's OpenLava but there's no OpenBSD port for that http://www.openlava.org/documentation/guide/features.html#parallel-job-scheduling j.
