Re: help plz.

[Stephen Leake <Stephe.Leake@nasa.gov>]

I think I have a general idea of what you are looking for, but I can't
help unless you ask a specific Ada question.

This sounds like a homework problem, rather than a real-life problem.
If it is homework, have you tried asking your instructor?

"Fisher" <fisher@biuroserwis-kalisz.com> writes:

> hi
> 
> thanks for Your answers.
> 
> I have with this Ada problem.
> 
> it walks about something like this, as dynamic priorities:
> 
> we have N processes (let's put 7)
> 
> the attached priority becomes every of processes
> 
> np. P1 has 1 ( the highest), P2 - 2, P3 - 3 itd P7 -7.
> 
> processes look as follows: local section - some delay
> 
> and critical section - some delay
> 
> it walks about show dynamic priority use only.
> 
> we have the protected object and these processes compete to access to
> 
> this object to execute his critical section.
> 
> if P1 competes from P2 this P1 comes in and executes critical section
> 
> (because P1 has higher priority than P2).
> 
> after exit from protected object  P1 sets his priority on the lowest,
> 
> sets his priority on 7 and the rest of processes raises,
> 
> that is P2 -1 (highest), P3 -2 .... P7-6 and to the end P1 -7.
> 
> however if (from start state) about entry to protected object
> 
> it competes P3 and P4 ( P3 comes in)
> 
> after exit from object alters the priorities of processes, but only these,
> 
> which they are for him, that is P1 becomes without changes, P2 without
> changes, P4 -3,
> 
> P5-4, P6-5,P7-6 and P3-7.
> 
> I have to show this use only.
> 
> Please help me if You can.
> 
> My work inflicts that I haven't time for nothing besides sleep.
> 
> I will be very grateful for Your help.
> 
> I apologize for my English, it is not on top-level.
> 
> 
> 
> Fisher
> 
> fisher@biuroserwis-kalisz.com
> 
> Poland
> 
> 
> 
> 
> 
> 

-- 
-- Stephe