This is interesting, because A will run twice before C runs, but you
have to factor in the queueing up, as well as the duration of each
escalation.

Let's say that:
A takes 4 minutes
B takes 4 minutes
C takes 8 minutes

We would get the following execution table (factoring in queueing and
duration of run-time) (disclaimer, I did not check the timing below,
there might be one or two that are off by a bit, but it still gets the
point across)

Minute       --      Processes
0            --      A starts,     B sleeps, C sleeps
1            --      A runs,       B sleeps, C sleeps
2            --      A runs,       B sleeps, C sleeps
3            --      A runs,       B sleeps, C sleeps 
4            --      A stops,      B sleeps, C sleeps
5            --      A sleeps,     B starts, C sleeps
6            --      A sleeps,     B runs,   C sleeps
7            --      A sleeps,     B runs,   C queues
8            --      A queues,     B runs,   C queued
9            --      A queued,     B runs,   C queued
10           --      A queued,     B stops,  C starts
11           --      A queued,     B sleeps, C runs
12           --      A queued,     B sleeps, C runs
13           --      A queued,     B sleeps, C runs
14           --      A queued,     B sleeps, C runs
15           --      A queued,     B sleeps, C runs
16           --      A queued,     B queues, C runs
17           --      A queued,     B queued, C runs
18           --      A queued,     B queued, C runs
19           --      A starts,     B queued, C sleeps
20           --      A runs,       B queued, C sleeps
21           --      A runs,       B queued, C sleeps
22           --      A runs,       B queued, C sleeps
23           --      A stops,      B starts, C sleeps
24           --      A sleeps,     B runs,   C sleeps
24           --      A sleeps,     B runs,   C sleeps
24           --      A sleeps,     B runs,   C queues

I think that, based on this duration, that you would end up with A B and
C always running in order, instead of the A, B, A, C you would expect,
since A runs twice before C runs.

However, this is assuming a very long duration no your escalations. If
your escalations each run in a few seconds, then you should see the A,
B, A, C pattern that repeats itself. The Escalations should queue up,
and then execute as soon as the thread becomes free. While the thread is
being used, the escalations will queue up and then execute in the order
they are queued. After each escalation executes, then its sleep clock
starts over.

This is assuming that I understand correctly how escalations work. I do
not think that a single escalation, such as A, would queue up twice,
basically keeping the A, B, A, C pattern intact. I don't think that it
would queue up A twice before C got to execute because I don't think
that A's sleep clock would restart until A ended.

If I understand correctly, then an escalation's sleep clock (interval
time) starts after it completes. It wouldn't make sense to start it
whenever the escalation begins, because if the escalation is set to run
every three minutes, but it takes four minutes to complete, then it
would be perpetually running. I think this probably addresses your
question. If I'm wrong, then I'm sure that someone out there will
correct me, they always do :)

Thanks,

Gary Opela, Jr.


-----Original Message-----
From: Action Request System discussion list(ARSList)
[mailto:[email protected]] On Behalf Of Barber, David
Sent: Wednesday, December 17, 2008 10:28 AM
To: [email protected]
Subject: Escalation timings

** 

Just a general question on escalations ... 

Say if we have several escalations in place on different timings. 

Escalation A - 3 minutes 
Escalation B - 5 minutes 
Escalation C - 7 minutes 

Escalations are a single thread, so run in sequence.  If say some of the
escalations could possibly take longer than their scheduled time to run
- the 3 minute one taking 4 minutes, etc. will they all just be
continually running in sequence?

Regards 

Dave Barber 


This e-mail has been scanned for viruses by the Cable & Wireless e-mail
security system - powered by MessageLabs. For more information on a
proactive managed e-mail security service, visit
http://www.cw.com/uk/emailprotection/ 

The information contained in this e-mail is confidential and may also be
subject to legal privilege. It is intended only for the recipient(s)
named above. If you are not named above as a recipient, you must not
read, copy, disclose, forward or otherwise use the information contained
in this email. If you have received this e-mail in error, please notify
the sender (whose contact details are above) immediately by reply e-mail
and delete the message and any attachments without retaining any copies.

Cable and Wireless plc 
Registered in England and Wales.Company Number 238525 
Registered office: 3rd Floor, 26 Red Lion Square, London WC1R 4HQ

__Platinum Sponsor: www.rmsportal.com ARSlist: "Where the Answers Are"
html___

_______________________________________________________________________________
UNSUBSCRIBE or access ARSlist Archives at www.arslist.org
Platinum Sponsor: www.rmsportal.com ARSlist: "Where the Answers Are"

Reply via email to