Visit The New, Modern Unix Linux Community

Full Discussion: Linux equivalent for daemon2
Operating Systems Linux Linux equivalent for daemon2 Post 302082201 by jstuardo on Monday 31st of July 2006 06:12:57 PM
Linux equivalent for daemon2

Hi all...

In my Unix system a program exists called "daemon2" which is responsible to enqueue program executions. For example, if I want to make the system to enqueue lpr executions for certain users, I call daemon2 with lpr as the parameter.

Is there an equivalent in Linux?

Thanks
Jaime
 
Test Your Knowledge in Computers #140
Difficulty: Easy
Unix and the C programming language were both developed at AT&T.
True or False?

10 More Discussions You Might Find Interesting

1. Linux

windows startup equivalent in linux

hi all, greetings, please tell me how to start a java GUI program in the startup of the machine. since it invokes a GUI is it possiable to entry the same in /etc/rc2.d/S99userdefinedfiles. thanks in advance ., :-) (1 Reply)
Discussion started by: raguramtgr
1 Replies

2. Shell Programming and Scripting

Equivalent Suse Linux command

hi, In solaris, psrinfo gives number of cpu in use/online and so on. What is the equivalent command for "psrinfo" in Suse Linux ? Thx (3 Replies)
Discussion started by: braindrain
3 Replies

3. UNIX for Advanced & Expert Users

Equivalent for iostat -e in AIX HP-UX Linux

iostat -e gives the soft, hard and transport error information in Solaris. What is the equivalent command in the other flavors of Unix AIX HP Linux. Thanks Prasi (1 Reply)
Discussion started by: prasi_in
1 Replies

4. UNIX for Dummies Questions & Answers

What is the equivalent of Solaris snoop in Linux

What is the equivalent of Solaris snoop in Linux I could not find snoop in RHEL (2 Replies)
Discussion started by: santosh149
2 Replies

5. Linux

Mksysb Equivalent For Linux?

I have experience with making bootable images of AIX systems using mksysb and wondered if there was some type of equivalent software for Linux. Or perhaps some of the folks here have alternatives or unique ideas for how they are backing up their Linux systems enabling them to recover them as... (13 Replies)
Discussion started by: scotbuff
13 Replies

6. Linux

Linux equivalent for...

I moved to a Linux system from Windows a few months ago. Most of the programs I had been using were already native to Linux (Firefox, the GIMP, Pari, etc.) and most others I found a close enough program (Crimson Editor -> gedit, Visual Studio -> KDevelop, Primo -> Morain's ECPP). Now I'm down... (1 Reply)
Discussion started by: CRGreathouse
1 Replies

7. Programming

WSAAsyncSelect equivalent for linux

Hello, I'm writing a multi-threaded socket server in C++ and I needed something like wsaasyncselect to handle messages like fd_accept, fd_read, fd_connect, fd_close. Thanks in advance. (2 Replies)
Discussion started by: lucastonon
2 Replies

8. Linux

/etc/netmasks equivalent in linux

Hi Guys, I am used to configuring DHCP on Solaris and foreach subnet added I place a corresponding entry in /etc/netmasks. I am now looking at configuring DHCP on linux, is there an equivalnet entry required somewhere or is this not needed in linux Thanks (3 Replies)
Discussion started by: eeisken
3 Replies

9. Red Hat

NFS_v4_fail_over_timeout equivalent in Linux

Hi, I need to mount a replicated nfs4 export on a number of AIX and Redhat hosts. To get the failover on the clients working smoothly, I need to change certain values on the AIX boxes like nfs_v4_fail_over_timeout, timeo and retrans values. Since I have no clue about Linux, I am not quite sure... (1 Reply)
Discussion started by: zxmaus
1 Replies

10. Shell Programming and Scripting

Need Linux equivalent for UNIX

I have a folder called "log" which has a few sub-folders say "fda" "fd7" "fdd" "fd6 .... " I wish to fire the below command inside each subfolder starting with the folder with the latest time stamp. grep "$greptime.*exit" Prod.$(hostname).log | grep $fdrdate_new If the seach did not yield... (3 Replies)
Discussion started by: mohtashims
3 Replies
Thread::Queue(3pm)					 Perl Programmers Reference Guide					Thread::Queue(3pm)

NAME
Thread::Queue - Thread-safe queues VERSION
This document describes Thread::Queue version 2.12 SYNOPSIS
use strict; use warnings; use threads; use Thread::Queue; my $q = Thread::Queue->new(); # A new empty queue # Worker thread my $thr = threads->create(sub { while (my $item = $q->dequeue()) { # Do work on $item } })->detach(); # Send work to the thread $q->enqueue($item1, ...); # Count of items in the queue my $left = $q->pending(); # Non-blocking dequeue if (defined(my $item = $q->dequeue_nb())) { # Work on $item } # Get the second item in the queue without dequeuing anything my $item = $q->peek(1); # Insert two items into the queue just behind the head $q->insert(1, $item1, $item2); # Extract the last two items on the queue my ($item1, $item2) = $q->extract(-2, 2); DESCRIPTION
This module provides thread-safe FIFO queues that can be accessed safely by any number of threads. Any data types supported by threads::shared can be passed via queues: Ordinary scalars Array refs Hash refs Scalar refs Objects based on the above Ordinary scalars are added to queues as they are. If not already thread-shared, the other complex data types will be cloned (recursively, if needed, and including any "bless"ings and read- only settings) into thread-shared structures before being placed onto a queue. For example, the following would cause Thread::Queue to create a empty, shared array reference via "&shared([])", copy the elements 'foo', 'bar' and 'baz' from @ary into it, and then place that shared reference onto the queue: my @ary = qw/foo bar baz/; $q->enqueue(@ary); However, for the following, the items are already shared, so their references are added directly to the queue, and no cloning takes place: my @ary :shared = qw/foo bar baz/; $q->enqueue(@ary); my $obj = &shared({}); $$obj{'foo'} = 'bar'; $$obj{'qux'} = 99; bless($obj, 'My::Class'); $q->enqueue($obj); See "LIMITATIONS" for caveats related to passing objects via queues. QUEUE CREATION
->new() Creates a new empty queue. ->new(LIST) Creates a new queue pre-populated with the provided list of items. BASIC METHODS
The following methods deal with queues on a FIFO basis. ->enqueue(LIST) Adds a list of items onto the end of the queue. ->dequeue() ->dequeue(COUNT) Removes the requested number of items (default is 1) from the head of the queue, and returns them. If the queue contains fewer than the requested number of items, then the thread will be blocked until the requisite number of items are available (i.e., until other threads <enqueue> more items). ->dequeue_nb() ->dequeue_nb(COUNT) Removes the requested number of items (default is 1) from the head of the queue, and returns them. If the queue contains fewer than the requested number of items, then it immediately (i.e., non-blocking) returns whatever items there are on the queue. If the queue is empty, then "undef" is returned. ->pending() Returns the number of items still in the queue. ADVANCED METHODS
The following methods can be used to manipulate items anywhere in a queue. To prevent the contents of a queue from being modified by another thread while it is being examined and/or changed, lock the queue inside a local block: { lock($q); # Keep other threads from changing the queue's contents my $item = $q->peek(); if ($item ...) { ... } } # Queue is now unlocked ->peek() ->peek(INDEX) Returns an item from the queue without dequeuing anything. Defaults to the the head of queue (at index position 0) if no index is specified. Negative index values are supported as with arrays (i.e., -1 is the end of the queue, -2 is next to last, and so on). If no items exists at the specified index (i.e., the queue is empty, or the index is beyond the number of items on the queue), then "undef" is returned. Remember, the returned item is not removed from the queue, so manipulating a "peek"ed at reference affects the item on the queue. ->insert(INDEX, LIST) Adds the list of items to the queue at the specified index position (0 is the head of the list). Any existing items at and beyond that position are pushed back past the newly added items: $q->enqueue(1, 2, 3, 4); $q->insert(1, qw/foo bar/); # Queue now contains: 1, foo, bar, 2, 3, 4 Specifying an index position greater than the number of items in the queue just adds the list to the end. Negative index positions are supported: $q->enqueue(1, 2, 3, 4); $q->insert(-2, qw/foo bar/); # Queue now contains: 1, 2, foo, bar, 3, 4 Specifying a negative index position greater than the number of items in the queue adds the list to the head of the queue. ->extract() ->extract(INDEX) ->extract(INDEX, COUNT) Removes and returns the specified number of items (defaults to 1) from the specified index position in the queue (0 is the head of the queue). When called with no arguments, "extract" operates the same as "dequeue_nb". This method is non-blocking, and will return only as many items as are available to fulfill the request: $q->enqueue(1, 2, 3, 4); my $item = $q->extract(2) # Returns 3 # Queue now contains: 1, 2, 4 my @items = $q->extract(1, 3) # Returns (2, 4) # Queue now contains: 1 Specifying an index position greater than the number of items in the queue results in "undef" or an empty list being returned. $q->enqueue('foo'); my $nada = $q->extract(3) # Returns undef my @nada = $q->extract(1, 3) # Returns () Negative index positions are supported. Specifying a negative index position greater than the number of items in the queue may return items from the head of the queue (similar to "dequeue_nb") if the count overlaps the head of the queue from the specified position (i.e. if queue size + index + count is greater than zero): $q->enqueue(qw/foo bar baz/); my @nada = $q->extract(-6, 2); # Returns () - (3+(-6)+2) <= 0 my @some = $q->extract(-6, 4); # Returns (foo) - (3+(-6)+4) > 0 # Queue now contains: bar, baz my @rest = $q->extract(-3, 4); # Returns (bar, baz) - (2+(-3)+4) > 0 NOTES
Queues created by Thread::Queue can be used in both threaded and non-threaded applications. LIMITATIONS
Passing objects on queues may not work if the objects' classes do not support sharing. See "BUGS AND LIMITATIONS" in threads::shared for more. Passing array/hash refs that contain objects may not work for Perl prior to 5.10.0. SEE ALSO
Thread::Queue Discussion Forum on CPAN: http://www.cpanforum.com/dist/Thread-Queue <http://www.cpanforum.com/dist/Thread-Queue> threads, threads::shared MAINTAINER
Jerry D. Hedden, <jdhedden AT cpan DOT org> LICENSE
This program is free software; you can redistribute it and/or modify it under the same terms as Perl itself. perl v5.16.2 2012-10-11 Thread::Queue(3pm)

Featured Tech Videos

All times are GMT -4. The time now is 10:39 PM.
Unix & Linux Forums Content Copyright 1993-2020. All Rights Reserved.
Privacy Policy