So I went looking for options to query the OS for a free port and found an
answer on stackoverflow that I think is simply brilliant.
(I hope it's OK to quote from others here? Apologies if not.)
"If your server was told what port to use, just bind() it. Seriously.
Sure, you could parse /proc/net
As elegant as some of these ideas are, it might be possible, depending on the
number and nature of the transactions, to batch them up every n seconds and use
rcp to copy them to an "in" box on the remote machine.
-Rick
> On Mar 5, 2014, at 4:19 PM, "Horacio Pellegrino"
> wrote:
>
> Why don'
Peter is the only point of the "parent child communications" to address points
like
1 I'm busy go away; OR
2 I'm available to work
If so, you could simply use a lock-semaphore to address both of those issues.\
-Original Message-
From: Horacio Pellegrino
To: U2 Users List
Sent: Wed,
Why don't you have one port listening for requests, and as soon as they
come in, you create a new phantom to answer that request ( liberating the
listener immediately for the next request ), then when the phantom finishes
it could log off.
Might be you want to keep a "pool" of phantoms alive for a
I wrote a paragraph called ML to use MERGE.LIST on saved lists - much easier
than assembling the lists manually.
PA
* ML type list1 list2 list3
* <>
IF <> = "U" THEN GO THERE
IF <> = "D" THEN GO THERE
IF <> = "I" THEN GO THERE
DISPLAY
DISPLAY Command Format is
DISPLAY ML type list1 list2 list3
D
Instead of phantoms we us a different approach.
Our middle-ware built on Apache Tomcat and UniObjects for Java replicates
data from Universe to Universe or Unidata to Unidata. Using the built in
routines in UOJ we are able to handle over 10,000 to 20,000 transactions
per day. This technology use
I don't know how you would query the OS on the fly, but you can do a manual
search for a bank of 10 or 20 unused ports and "claim" them.
David A. Green
(480) 201-7953
DAG Consulting
-Original Message-
From: u2-users-boun...@listserver.u2ug.org
[mailto:u2-users-boun...@listserver.u2ug.or
