CN1922577A - Method and system for restrained budget use with controlled budget transfer - Google Patents

Method and system for restrained budget use with controlled budget transfer Download PDF

Info

Publication number
CN1922577A
CN1922577A CNA2005800052575A CN200580005257A CN1922577A CN 1922577 A CN1922577 A CN 1922577A CN A2005800052575 A CNA2005800052575 A CN A2005800052575A CN 200580005257 A CN200580005257 A CN 200580005257A CN 1922577 A CN1922577 A CN 1922577A
Authority
CN
China
Prior art keywords
task
budget
nargin
guarantee
cycle
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CNA2005800052575A
Other languages
Chinese (zh)
Inventor
R·J·布里尔
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Koninklijke Philips NV
Original Assignee
Koninklijke Philips Electronics NV
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Koninklijke Philips Electronics NV filed Critical Koninklijke Philips Electronics NV
Publication of CN1922577A publication Critical patent/CN1922577A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46Multiprogramming arrangements
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46Multiprogramming arrangements
    • G06F9/48Program initiating; Program switching, e.g. by interrupt
    • G06F9/4806Task transfer initiation or dispatching
    • G06F9/4843Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
    • G06F9/4881Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units

Abstract

A method (10, 30) for controlling multiple tasks in a real-time operating system (20) assigns priorities to two or more tasks (24, 25). A first task (24) is assigned to be a More Important Task. A second task (25) is assigned to be a Less Important Task. A Guaranteed Budget Margin is then allocated to the More Important Task along with a More Important Guaranteed Budget. A Less Important Guaranteed Budget is also allocated to the Less Important Task. At some point during execution, the higher priority or More Important Task (24) may then determine that the More Important Task no longer requires the Guaranteed Budget Margin, in which case, a Conditionally Guaranteed Budget Margin is then allocated to the Less Important Task (24). Upon reclaiming of the Guaranteed Budget Margin from the LIT, the MIT waits either a predetermined static time period or a dynamic time period determined upon release or reclaiming of the GBM, whichever is longer, before receiving the GBM or before the CGBM is removed from the LIT.

Description

Utilize controlled budget to send and suppress the method and system that budget is used
The present invention relates generally to be used for the method and apparatus of the resource of MOS, more specifically, relate to a kind of method and apparatus that is used for the resource of MOS real time execution.
Originally the guarantee budget (CGB) of having ready conditions is to introduce as the mechanism on the budget scheduler program level, and purpose is to improve the cost efficiency of system.The basic thought of CGB back is as follows.Receive more important guarantee budget (MIGB) than vital task (MIT), also secured budget nargin (GBM) increases with the expectation structural load.Secondary task (LIT) receives less important guarantee budget (LIGB).In addition, LIT receives the guarantee budget nargin (CGBM) of having ready conditions when MIT does not use its GBM consistently.The problem of utilizing this CGB of a primitive type to bring is exactly: the appointment of CGBM is an implicit expression.We will be this CGB of a primitive type as weak CGB.Be meant a little less than the term: guarantee is the weak fact, and for example, MIT can use its GBM (a part), so LIT can receive and is less than its CGBM.
U.S. Provisional Patent Application 60/519, No. 811 [procurator numbers NO.613652] is improved this notion by carrying out explicit appointment.We will be back one type CGB as strong CGB.Term is meant by force: guarantee is the strong fact, and for example, and if only if that it requires GBM could use its GBM for MIT, and in fact LIT can rely on CGBM when MIT discharges (and requiring again as yet) its GBM.When MIT required its GBM, it received it at once, promptly during its current budget cycle.As a result, CGBM also recalls from LIT at once.
Two kinds of CGB have their advantage and use in system.For instance, when can't therefore be needed the budget of worst condition to specify when adapting to its load fluctuation by calibration such as the application of input the reader, can't use strong CGB, if we want to improve the cost efficiency of system, therefore we then need weak CGB.
As additional background, there is the budget consumption of two generic tasks in fact:
-behavior synchronously: consume the task of synchronousing working (that is, it is when budget is refilled when full, and finishes its work in budget cycle) with budget.
-asynchronous behavior: with the task of the asynchronous work of its budget.Compare with its budget consumption, it can be worked in advance, perhaps delays work.Often, use asynchronous behavior to eliminate load.
In some occasion, CGBM may have problems from losing at once of LIT.
Therefore, the present invention is directed to and solve exploitation and be used for improving based on the resource of the real time operating system of importance and use and do not cause the problem of the method and apparatus of recalling at once of CGBM.
The present invention solves these and other problem by a kind of leading mechanism is provided, and the use that the preset time cycle makes LIT shift reposefully to leave the guarantee budget nargin of having ready conditions thus will appear in this leading mechanism before MIT actual needs guarantee budget nargin when being used to indicate scheduler program to work as MIT to reclaim its guarantee budget nargin.
In addition, according to a further aspect in the invention, described leading mechanism has adopted cycle quiet hour, and this cycle quiet hour makes scheduler program know that MIT will can not need GBM at least in cycle quiet hour after notice scheduler program MIT will need GBM very soon.Described cycle quiet hour is by a default part as budget allocation.
In addition, according to another aspect of the invention, described leading mechanism comprises the dynamic time cycle, and it makes MIT can indicate scheduler program MIT when reclaiming GBM not need the time cycle of GBM.With regard to the dynamic time cycle, MIT can comprise in the message that discharges GBM or reclaim in the message of GBM this value.
Describe in detail according to looking back with reference to following accompanying drawing, it is obvious that others of the present invention will become for a person skilled in the art.
Fig. 1 has described the exemplary embodiment according to the method for a plurality of tasks that are used for control system of one aspect of the invention.
Fig. 2 has described the exemplary embodiment of the equipment that is used for the intrasystem first task of control operation according to a further aspect of the invention, and wherein first task has been specified than the higher importance level of second task in the operating system.
Fig. 3-4 has described also the exemplary embodiment of method of two or more tasks that is used to control multitask process according to a further aspect of the invention.
Fig. 5 has described still the exemplary embodiment of operating system according to a further aspect of the invention.
Fig. 6 has described to have (non-graceful) graceful quality degradation of the non-appropriateness of LIT overshoot.
Fig. 7 has described to have the timeline of budget-supply and the transfer of budget at once of getting back to MIT from LIT.
It should be noted that: any the quoting to " embodiment " or " embodiment " is meant that all described in conjunction with the embodiments special characteristic, structure or characteristic are at least one embodiment of the present invention involved here.Phrase " in one embodiment " different local appearance in instructions not necessarily all refer to same embodiment.
In some cases, MIT may need its GBM at once when running into unexpected load increase.Therefore, previous mechanism allows CGBM to recall immediately and supply GBM at once to MIT from LIT.Yet the quality degradation (referring to Fig. 6) of the non-appropriateness of the overshoot may cause having LIT is shifted in budget at once.
The reason of the quality degradation of this non-appropriateness that has an overshoot is two aspects.At first, for GBM can be provided at once, the recalling of CGBM (referring to example given below) in the middle of the supply that may occur in CGBM.Table 1 has been described the budget allocation of giving MIT, LIT and OIT (other vital task).To MIT specify MIGB be 2 and in addition GBM be 1, its cycle is 5.Specifying LIGB to LIT is 3 and CGBM2 in addition, and its cycle is 10.Specifying OIGB to OIT is 1, and its cycle is 12.We suppose the fixed priority priority scheduling (FPPS) of budget and " in-the-place-of " implementation of CGB.Application No. [procurator numbers PHNL010828EPP] has disclosed " in-the-place-of " implementation of CGB, and this piece application all is incorporated in this as a reference.
Example: in the middle of the CGBM supply, recall CGBM.Table 1: distribute to the budget of task.
Cycle GB GBM CGBM
MIT 5 2 1
LIT 10 3 2
OIT 12 1
Consider Fig. 7 now, the figure shows the timeline that has budget-supply, assure that wherein budget MIGB, LIGB and OIGB are discharged simultaneously.
For ease of reference, MIGB is numbered.Suppose that MIT discharges its GBM before discharging at the same time.Therefore, the first module that allows LIT after MIT has finished to identify the consumption of its GB of 1, to consume its CGBM " in-the-place-of " of GBM immediately.MIT requires its GBM again between the stage of exhaustion of the MIGB of sign 2.GBM offers MIT at once, and correspondingly recalls CGBM at once from LIT.As a result, LIT receives only the CGBM of half during that cycle, and CGBM recalls in the middle of supply.
In this case, LIT will discharge its CGBM usually when the work of treatment unit.Therefore, the operational quality grade of with that working cell of processing is also supplied based on the CGBM of supposition.Secondly, even notify LIT before recalling in that CGBM is actual, it also possibly can't impel level and smooth quality degradation, promptly adapts to its remarkable quality and does not have overshoot.
For instance, consider that LIT is handling the situation of the MPEG-2 stream of the set of diagrams sheet (GoP) that has the IB1B2PB3B4 form.Such GoP is carried out handling the P frame before decoding request any one in those B frames of can decoding.Although processed after a while, B1 and B2 reproduced before P (for example, appearing on the screen).Therefore, when recalling CGBM after LIT has handled the P frame, LIT also needs to handle all B frames of GoP, promptly comprises B1 and B2.As a result, will be with operational quality level treatments B 1 and the B2 lower than P, and more early present.It is lower than the situation quality of handling P with low operational quality equally that the fluctuation of this quality aspect may be felt.
When changing agreement, execution pattern that and if only if can guarantee just that level and smooth quality descends.For this situation, at first should allow LIT to make its quality-class be reduced to new (lower) rank reposefully, and then have only CGBM to recall.The quality that has the non-appropriateness of LIT overshoot reduces the interim quality decline (dip) that preferably is higher than MIT.
Previous work is based on following hypothesis: MIT needs its GBM at once, so purpose is to impel CGBM to recall from LIT immediately.In this part, we will consider that MIT does not need the situation of its GBM at once.In this case, do not need CGBM to recall from LIT immediately yet.In this part, we at first rethink the needs of MIT, follow by the resulting chance of LIT, and be the hint of system at last.
Exist MIT not need the situation of its GBM at once, as following example is shown.
-early stage the growth of load detects:
The controller of scalable algorithm perhaps fully the early detection growth of load but also predict upcoming needs in time so that not only take preventive measures to GBM with the sensation that prevents that quality from descending.
-scene (or shooting) changes:
Human eye changes insensitive to scene (or shooting).In addition, system can comprise in order to analysis of MPEG-2 stream and detect the device that scene (or shooting) changes.Therefore, when (a) causes the growth of load because of scene changes, (b) detect scene and change, (c) make MIT know that MIT can come deal with data and predict upcoming needs to GBM with lower operational quality level temporarily because of scene changes when causing the growth of load true.
The advance notice of-the growth of load:
Data stream can comprise the additional data of predicting the upcoming growth of load.Although the unqualified growth of load advance notice of the standard as MPEG-2, they allow incorporating into of this data really.Therefore, can increase the encode Media Stream to control dynamic upgradeable media in the information that demoder one side is used by adding.In this case, MIT also can predict the needs to its GBM.
In all these examples, can notify LIT about upcoming to the recalling of CGBM, and LIT can select thus that suitable strategy comes designated environment to the greatest extent may moderately reduce quality.Therefore, in the time can't impelling " full-fledged " pattern to change agreement, LIT can have available its quality-class that moderately reduces sufficient the time in advance.
According to an aspect of the present invention, MIT predicts the needs to its GBM in time, and this is the extremum of the transmission of budget at once and the middle solution between the full-fledged pattern change agreement.There are many conceivable options to be now or become knownly, depend on the final moment of MIT detection and the minimum between the actual needs " process " time quantum of the needs of GBM (therefore recalling about CGBM) to the LIT advance notice:
-needing the fixed time information of aspect about the delay of MIT: (minimum) " process " time quantum can be static known, promptly when GMB and CGMB are assigned to MIT and LIT.
-need the multidate information of aspect about the delay of MIT:
(minimum) " process " additional information of time quantum is when MIT discharges GBM and/or can become available when MIT requires GBM again.
It is various that following constraint condition is applicable to " process " time:
-between the specified time and release time: when MI T discharges GBM as " process " time quantum of information through MIT should be at least the amount at the appointed time stipulated and
-in release time with want between the seeking time again: when MIT requires GBM again as information " process " time quantum of process should be at least when MIT discharges GBM the amount of process.
When LIT notice about this (minimum) " process " during time quantum, it can take preventive measures to impel suitable quality decline.Attention: can at the appointed time select initial measure, and be used when LIT receives CGBM (when MIT discharges GBM according to information that MIT provided) time subsequently, and be used when notifying LIT to recall CGBM (when MIT requires GBM again according to information that MIT provided) time.
System exists three kinds to imply.The first, we need expand the information about MIT: the data that are associated with MIT must be expanded about the minimum in the budget fixed time the " process " information of the utilization rate of time quantum.The second, we must expand the additional interface with the elapsed time.
MIT interface(unchanged):
Set_budgets (in MIGB_value:budget_type; In Gum_value:budget_type); // called by AM.
The additional LIT interface of expansion:
Set_budgets (inLIGB_value:budget_type; In CGBM_value:budget_type; In elapse-time:time); // called by AM.
CGBM available (in elapse_time:time); // routine call is scheduled.
CGBM_not_available (in elapse_time:time); // routine call is scheduled.
Expansion additional schedule routine interface:
GBM_required (in tid:task_id; In elapse_time:time); // called by MIT.
GBM_not_required (in tid:task_id; In elapse_time:time); // called by MIT.
At last, when known MIT never needed its GBM at once in the presence of all, we can propose optionally design and with previous work the very corresponding implementation of big difference be arranged.
Turn to Fig. 1, wherein show method exemplary of two tasks that are used for control system
The process flow diagram of embodiment 10.
In step 11, first in two tasks is designated as than vital task (MIT).
In step 12, second in two tasks is designated as secondary task (LIT).
In step 13, distribute guarantee budget nargin (GBM) and more important guarantee budget (MIGB) to MIT.
In step 14, be assigned condition guarantee budget nargin (CGBM) and less important guarantee budget (LIGB) to LIT.
In step 15, distribute cycle quiet hour when MIT can determine that it needs GBM and between the MIT actual needs GBM.
In step 15a, MIGB and GBM are provided for MIT, and LIGB is provided for LIT.
In step 16, MIT determines that it no longer needs its GBM and send message and dynamic time cycle that MIT can wait for for this reason when reclaiming GBM its next time.The italics part of the literal in the middle of the step 16 and 18 is optional each other.If MIT sends the dynamic time cycle in step 16, the dynamic time cycle just is not sent out in step 18 so, and vice versa.As selection, can send two different dynamic time cycles, one sends when discharging GBM, and one sends when reclaiming GBM, depend on implementation and when in this time frame, may critical event take place, discharge GBM and recovery GBM between the elapsed time amount.
In step 17, no longer provide GBM, but provide condition guarantee budget nargin (CGBM) to LIT to MIT.In addition, notice LIT is about the supply of CGBM and static state or dynamic time long cycle in the cycle.
In step 18, MIT determines that now it needs its GBM and sends message and MIT is receiving the dynamic time cycle that can wait for before the GBM for this reason.
In step 19, notify LIT CGBM to be withdrawn clearly.Impliedly, LIT knows this and will occur at least after (from the more less processing delay of time of MIT notice scheduler program and the scheduler program notice LIT) expiration of cycle quiet hour.In addition, LIT can notify simultaneously about the time cycle longer than cycle quiet hour (that is, the dynamic time cycle), and CGBM will be withdrawn after cycle quiet hour.
In step 191, only at the dynamic time of cycle quiet hour or measuring and calculating when having determined that MIT needs GBM now the cycle after the long period expires, CGBM recalls and specifies GBM to MIT from LIT.
Fig. 2 shows the effect of the various processes described in Fig. 1 and the 3-5 and mutual exemplary embodiment.Wherein comprise application management program 21 in the middle of the various tasks 24,25 that will carry out by operating system 20, to specify the relative importance rank.According to an aspect of the present invention, application management program notifies first task 24 about first importance information (11) clearly, and notifies second task about second importance information (12).First importance information is than the second importance information height.First task 24 is known as than vital task.This higher importance task 24 can comprise and is positioned at the task outside the operating system 20 or is positioned at task within the operating system 20.
Second task 25 has and is lower than other second importance information of first significance level.This low vital task (or secondary task) 25 can comprise and is positioned at the task outside the operating system 20 or is positioned at task within the operating system 20.In addition, second task 25 only is lower than first task 24 aspect importance, but even can carry out second top priority.
Wherein comprise the budget of distribution mechanism 22 with allocated resource in the middle of the various tasks 24,25 that will carry out by operating system 20.According to an aspect of the present invention, application management program 21 is notified the relative importance rank of distribution mechanism about task 24,25 (11 and 12) clearly.According to a further aspect of the invention, distribution mechanism 22 notifies first task 24 about more important guarantee budget (MIGB) and guarantee budget nargin (GBM) clearly.More important guarantee is stock number in advance or reserves other limited availability project of using for first task 24.If guarantee budget nargin be stock number or reserve for other limited availability projects of first task 24 uses and first task need be higher than or exceed more important guarantee budget.Distribution mechanism 22 is also notified second task 25 clearly, and it requires cycle quiet hour (15) that can wait for after the GBM before it at needs about less important guarantee budget (LIGB) and have ready conditions guarantee budget nargin (CGBM) 14 and task 24.Less important guarantee budget (LIGB) is stock number or reserves for second or other limited availability project of using of lower priority task 25.
Also according to another aspect of the present invention, distribution mechanism 22 notify clearly scheduler program 23 about giving task 24,25 appointments budget (13 and 14) and task 24 its requires cycle quiet hour (15) that can wait for after guarantee budget nargin before it at needs.The budget amount of scheduler program 23 controlling resource is to the supply of the various tasks 24,25 that will be carried out by operating system 20, and described task comprises the first task 24 and second task 25.On the first possible opportunity, scheduler program 23 adds that with more important guarantee budget guarantee budget nargin offers first task 24 (15a) together.On the first possible opportunity, scheduler program second task 25 of also giving provides less important guarantee budget (15a).
If first task 24 the term of execution certain determine that this first task 24 can be suitably only with more important guarantee budget enforcement on a bit, then first task 24 notifies scheduler program 23 these first tasks 24 not need its guarantee budget nargin (16) clearly.The dynamic time cycle (16) that first task 24 also can notify scheduler program 23 can wait for when reclaiming GBM next time about this first task 24.
In this case, scheduler program 23 may opportunity stop first that tender guarantee budget nargin and beginning may second task 25 of giving opportunity provide condition guarantee budget nargin first to first task 24.After this, scheduler program 23 notifies second task 25 about permitting the guarantee budget nargin of having ready conditions, it comprise notice of withdrawal with actual the recalling of the guarantee budget nargin of having ready conditions between time cycle (static or dynamically in cycle of length) (17).It is now know that it will be in predetermined static at least (or dynamically for second task 25, when it is longer) have CGBM in the time cycle, because second task know it will CGBM is actual recall beginning before the notified CGBM of recalling, and know that the time cycle between notice of withdrawal and actual the recalling will be (or dynamic with the predetermined static time cycle at least, when it is longer) equally long (in some cases, it even may be longer).
Guarantee budget nargin is that second task 25 need then be higher than and exceed the stock number of less important guarantee budget or reserve other limited availability project of using for second task 25 if having ready conditions, but described amount only ought provide elsewhere when not required, such as providing by higher significant or than vital task 24.
Subsequently, first task 24 can the term of execution determine that this first task 24 also needs to assure budget nargin on a bit, and first task 24 notifies this scheduler program 23 these first tasks 24 to need its guarantee budget nargin (18) clearly in such cases.At this moment, first task 24 also can be notified scheduler program 23, and it can wait for the dynamic time cycle when reclaim GBM next time before actual reception GBM, and wherein the dynamic time cycle may be longer than the predetermined static time cycle.Scheduler program 23 is then notified second task 25 to have ready conditions and is assured that budget nargin will be withdrawn (after the long period in dynamic or cycle quiet hour) (19).Scheduler program 23 stops to provide condition to second task 23 then and assures budget nargin after the expiration of static state or the long period in dynamic time cycle, and scheduler program 23 begins after the static state or the expiration in dynamic time cycle to the first task 24 budget nargin (191) of tendering guarantee.
The MIT effect of specifying is specified and removed to the task of 21 pairs of appointments of application management program.The LIT effect of specifying is also specified and remove to application management program to another appointed task.Then, when distribution mechanism 22 becomes when effective, it is invalid that application management program 21 becomes.When MIT and LIT effect expiration, application management program 21 becomes effectively once more, and it is invalid that while distribution mechanism 22 becomes.Distribution mechanism 22 is specified MIGB and GBM to MIT, and notifies MIT to specify about these clearly.Distribution mechanism 22 is also specified LIGB and CGBM to LIT, and notifies LIT to specify about these clearly.Distribution mechanism 22 sends reservation to scheduler program 23, and described scheduler program activates scheduler process, and it is carried out to finishing.Scheduler program 23 receives the subscription command of LIT and MIT from distribution mechanism; Permit MIGB and GBM to MIT; And to LIT allowance LIGB.Scheduler program then moves according to dispatching algorithm.Scheduler program 23 receives the message that MIT no longer needs GBM from MIT.Scheduler program is then only permitted MIGB to MIT, and LIT is about increase of budget for notice, and permits LIGB and CGBM to LIT.Scheduler program 23 can receive the message that MIT needs its GBM now from MIT subsequently, and scheduler program 23 notice LIT reduce about budget in such cases.
Can act on behalf of the testimony of a witness number at U.S. Patent application No.[about the mutual more details of various processes: 613652] in find, this piece application is comprised that accompanying drawing all is incorporated in this for your guidance.
Turn to Fig. 3-4, wherein show the process flow diagram of exemplary embodiment 30 of the method for two tasks that are used for controlling multitask system.
In step 31, as notified more important guarantee budget and guarantee budget nargin clearly than the first task of vital task.
In step 32, notified less important guarantee budget clearly, had ready conditions guarantee budget nargin and cycle quiet hour as second task of secondary task, have ready conditions betwixt and assure recalling and will being delayed of budget nargin according to the notice of recalling.
In step 33,, more important guarantee budget is added that guarantee budget nargin offers first task together on the first possible opportunity.
In step 34, on the first possible opportunity, second task of giving provides less important guarantee budget.
In step 35, when first task the term of execution certain when determining that this first task only can be finished its work with more important guarantee budget on a bit, the dynamic time cycle of waiting for when the notified clearly first task of scheduler program does not need its guarantee budget nargin and this first task to reclaim guarantee budget nargin subsequently before actual needs is assured budget nargin.
In step 36, first may opportunity, no longer to the first task budget nargin of tendering guarantee.
In step 41, on the first possible opportunity, second task of giving provides condition guarantee budget nargin.
In step 42, second task is notified about providing condition guarantee budget nargin, it comprise describe the guarantee budget nargin of having ready conditions recalling and actual notice of recalling between the information of delay.
In step 43, first task the term of execution certain determine that this first task also needs to assure budget nargin on a bit.
In step 44, the notified clearly first task of scheduler program needs its guarantee budget nargin and first task receiving the dynamic time cycle that can wait for before the guarantee budget nargin.
In step 45, the notified guarantee budget nargin of having ready conditions of second task will be withdrawn after the cycle of length in the cycle in predetermined static time cycle or dynamic time.
In step 46, second task of no longer giving provides condition guarantee budget nargin after static state or dynamic time cycle (it was once longer) expiration.
In step 47, to the first task budget nargin of tendering guarantee.
Turn to Fig. 5, wherein show also the time stream of exemplary embodiment 50 of method that is used to control multi-process according to a further aspect of the present invention.The definite order of process set forth in fig. 5 is not important, yet has important relatedly by the order of time and some processes, and this will indicate when these processes of argumentation.Do not indicate as, order may be different relatively.When beginning 51, for the two process system following process may take place.For three process systems similar process will take place, and will be similar alternately between any two processes in hierarchical structure in such cases.
At first, must set up relative importance.Distribution mechanism or other process specify importance information for two tasks.One in these tasks is designated as than vital task 52, and distribution mechanism may notify this process to specify about its importance in such cases.In these tasks another is designated as secondary task 54, and distribution mechanism can notify this process to specify about its importance in such cases.Other needs not to be important in proper order the significance level of appointed task.For example, low importance task can at first be specified, so element 54 may appear at before the element 52.
In case relative importance is designated, each task is all notified its budget clearly.For example, distribution mechanism notifies MIT about more important guarantee budget and guarantee budget nargin 53 clearly.Distribution mechanism also notifies LIT about the less important guarantee budget 55 and the guarantee budget nargin of having ready conditions clearly.In addition, the information of CGBM comprises that LIT can expect (static state) elapsed time with CGBM therebetween.Process 53 and 55 order are unessential, be not they each all must appear at and specify after the relative importance rank.In addition, the notice of MIT budget may occur after specifying MIT or occur after specifying all importance information immediately immediately.The notice of LIT budget may appear at before and after the notice MIT budget.Unique requirement is exactly that the notice of budget can only appear at and specifies after the relative importance rank.
After notice MIT was about its budget, scheduler program may add that with more important guarantee budget guarantee budget nargin offers MIT 56 together first opportunity.The supply of this MIT budget may appear at the front and back of notice LIT about less important budget, and even may occur so that MIT can bring into use the MIT budget when being notified thus as soon as possible after notice MIT budget immediately.
After supply MIT budget, scheduler program may provide less important guarantee budget 57 to LIT first opportunity.Because the relative importance rank of two tasks, thereby this will appear at after the supply MIT budget usually, but may be as be right after that notice LIT budget takes place so early so that LIT can bring into use the LIT budget when notified thus.
The term of execution some points on, MIT may notice that it only can finish its work with its more important guarantee budget, and in such cases MIT notice scheduler program about this situation and dynamic deferred time 58.The dynamic deferred time is the time that MIT can wait for when reclaiming GBM before actual reception GBM.This step 58 can only appear at after the supply MIT budget, still can appear in budget cycle on any point after this.For simplicity's sake, the observation and the notice of scheduler program are shown as discrete component, but they can in time be separated.
In case notified observation about MIT, scheduler program just may opportunity stop the budget nargin 59 of tendering guarantee to MIT first.This occurs so that can use guarantee budget nargin as soon as possible after and then the information program that is scheduled receives immediately probably.In case MIT determines this situation (that is, MIT does not need to assure budget nargin) and exists that system should use guarantee budget nargin as early as possible, because may not can there be (perhaps at least in remaining budget cycle) forever in this situation.At this moment, MIT also can notify scheduler program to receive when reclaiming GBM next time about MIT to be ready before the GBM dynamic time cycle of waiting for.
After the budget nargin that stops to tender guarantee to MIT 59, scheduler program may begin to provide condition guarantee budget nargin 60 to LIT first opportunity.Scheduler program then notifies LIT can expect at least static state with LIGB or dynamic time long cycle in the cycle about this additional budget supply 61 and LIT.Preferably, this notifies 61 should appear at and be supplied with after the condition guarantee budget nargin 60 so that LIT can lingeringly not bring into use described extra budget, yet in some cases, these two elements 60,61 may take place by different order.
Scheduler program also notifies LIT about receive time cycle of preferring to wait for before the GBM (static or dynamically in long cycle) when reclaiming GBM next time.
In mutually same budget cycle the term of execution certain a bit on, MIT may notice that it also needs its guarantee budget nargin 62 now.This may appear at after the element 58 at any time, and when after this it depends on may influence some elements (that is, 59,60 and 61).Current new determine after, MIT notify clearly scheduler program it need its guarantee budget nargin 62.
As previously mentioned, this two sub-steps may in time independently occur, yet for simplicity's sake they is shown as discrete component.This message that reclaims guarantee budget nargin may comprise that MIT was ready dynamic time cycle of waiting for before receiving GBM.Shade wire frame representation cycle quiet hour, from this time cycle LIT notified it will lose CGBM and in fact CGBM recalls.This cycle quiet hour can also from MIT notify scheduler program it need the moment (perhaps determining moment of making) to the moment that GBM is provided to MIT of GBM to calculate by MIT from this.Because the delay between the message may be little, causes the definite start-stop in this cycle not remarkable.Significant point is known and various process can depend on this cycle quiet hour the predetermined static time cycle, therefore knows all according to each process of definition that cycle quiet hour is sent out from what point or what action and opens and finish.
After this information of reception, scheduler program notice LIT has ready conditions and assures that budget nargin will be withdrawn 63 afterwards at predetermined static time cycle (perhaps knowing then to LIT or present notified length about this time).As selection, LIT can the notified LIT of being longer than will have another time cycle (dynamic time cycle) in cycle quiet hour of CGBM before it is deleted.Especially, this should appear at scheduler program and stops to provide before this budget nargin to prevent that unsuitable resource from using and LIT can correspondingly be adjusted and can smooth transition to LIT.
Scheduler program stopped to provide condition guarantee budget nargin 64 to LIT after the period expires of length then in dynamic or cycle quiet hour.Scheduler program then static state or dynamic time cycle than beginning the budget nargin 65 of tendering guarantee after the elder expiration to MIT.Scheduler program should at first stop to provide extra budget to prevent unsuitable resource and use and can smooth transition to LIT before providing extra budget to MIT.
On some time points, described process finishes 66; Yet other repetition several times of element 58-65 may be depended on concrete application and occur.In addition, MIT may from uncertain it does not need to assure budget nargin 58, perhaps MIT may be never determine it after not needing to assure budget nargin 58 definite it need assure budget nargin 62.
We have shown budget at once, and to transmit (that is, CGBM from LIT recall the supply at once to MIT with GBM immediately) be urgent in many cases.We have summarized previous solution by the expansion that description is used for the method and system of CGB.Of the present inventionly be applied in this expansion and become and to review owing to additional interface.
Although illustrate and described various embodiment particularly at this, but will recognize that modification of the present invention and distortion are contained by top content and fallen within the scope of the appended claims in the situation that does not break away from spirit of the present invention and preset range.For example, some term and agreement are used, yet also can use other title and agreement without departing from the scope of the invention.In addition, this example should not be interpreted into the restriction modifications and variations of the present invention that claim contained, and only is to illustrate possible variation.

Claims (21)

1. (10) that are used for a plurality of tasks of control system comprising:
Specifying first task is than vital task (11);
Second task of specifying is secondary task (12);
To assure that budget nargin and more important guarantee budget allocation give than vital task (13);
Secondary task (14) is distributed in the less important guarantee budget and the guarantee budget nargin of having ready conditions;
When be distributed in than vital task and determine that it need assure budget nargin and than cycle quiet hour (15) between the vital task actual needs guarantee budget nargin;
On the first possible opportunity, more important guarantee budget and guarantee budget nargin are offered than vital task, and less important guarantee budget is offered secondary task (15a);
By determining no longer to need to assure budget nargin (16) than vital task than vital task;
Stop to tender guarantee budget nargin and begin to provide condition guarantee budget nargin, and notify the supply (17) of secondary task clearly about the guarantee budget of having ready conditions to secondary task to MIT;
By determining to assure budget nargin (18) now than vital task than vital task;
Notify secondary task will be withdrawn (19) clearly about the guarantee budget nargin of having ready conditions; And
Recall from secondary task and to have ready conditions guarantee budget nargin and only to assure budget nargin (191) from determining to assure now that budget nargin gives after the quiet hour period expires of measuring and calculating takes place to specify than vital task than vital task.
2. method according to claim 1 (10) further comprises:
The dynamic time cycle (16) of notice scheduler program when discharging guarantee budget nargin about when reclaiming guarantee budget nargin next time, waiting for than vital task.
3. method according to claim 2 (10) further comprises:
Recall the guarantee budget nargin and of having ready conditions from secondary task only from determining to assure now that budget nargin cycle quiet hour of measuring and calculating or dynamic time takes place gives than vital task after the long period expires the cycle and specify guarantee budget nargin (191) than vital task.
4. method according to claim 1 (10) further comprises:
The notice scheduler program is about receiving the dynamic time cycle (18) that can wait for before the guarantee budget nargin than vital task when reclaiming guarantee budget nargin.
5. method according to claim 4 (10) further comprises:
Recall the guarantee budget nargin and of having ready conditions from secondary task only from determining to assure now that budget nargin cycle quiet hour of measuring and calculating or dynamic time takes place gives than vital task after the long period expires the cycle and specify guarantee budget nargin (191) than vital task.
6. method according to claim 1 (10), the wherein said secondary task of notifying clearly further comprises about the supply of the guarantee budget nargin of having ready conditions: the notice secondary task closes therebetween potential recalling cycle quiet hour (17) that will be delayed of will occurring.
7. method according to claim 1 (10), the wherein said secondary task guarantee budget nargin of having ready conditions of notifying clearly will be withdrawn further and comprise: notify secondary task to close clearly and therebetween recall cycle quiet hour (19) that will be delayed.
8. method according to claim 1 (10) comprises that further the notice secondary task is about cycle quiet hour (17).
9. method (30) that is used to control two or more tasks of multitask system comprising:
Clearly notice as than the first task of vital task about more important guarantee budget and guarantee budget nargin (31);
Notify clearly as second task of secondary task about less important guarantee budget, the guarantee budget nargin of having ready conditions and therebetween according to the notice of recalling the recalling cycle quiet hour (32) that to be delayed of guarantee budget nargin of having ready conditions;
On the first possible opportunity, more important guarantee budget is added that guarantee budget nargin offers first task (33) together;
On the first possible opportunity, less important guarantee budget is offered second task (34);
In case first task the term of execution certain determine that this first task only just can carry out its work with more important guarantee budget on a bit, notify the scheduler program first task not need its guarantee budget nargin clearly together with before actual needs guarantee budget nargin, reclaiming when assuring budget nargin first task subsequently with the dynamic time cycle (35) of wait.
10. method according to claim 9 (30) further comprises:
First may opportunity, stop to the first task budget nargin (36) of tendering guarantee.
11. method according to claim 10 (30) further comprises:
On the first possible opportunity, beginning provides condition guarantee budget nargin (41) to second task.
12. method according to claim 11 (30) further comprises:
Notify second task about providing condition guarantee budget nargin together with recalling the guarantee budget nargin of having ready conditions subsequently with cycle quiet hour or the dynamic time cycle (42) that are delayed according to the notice of recalling therebetween.
13. method according to claim 11 (30) further comprises:
By first task the term of execution certain determine that this first task also needs to assure budget nargin (43) on a bit.
14. method according to claim 13 (30) further comprises:
Notify the scheduler program first task to need its guarantee budget nargin receiving the dynamic time cycle (44) that to wait for before the guarantee budget nargin clearly together with first task.
15. method according to claim 14 (30) further comprises:
Notify second task to have ready conditions and assure that budget nargin will be withdrawn (45) after the cycle of length in the cycle in predetermined static time cycle or dynamic time.
16. method according to claim 15 (30) further comprises:
Stop to provide condition guarantee budget nargin (46) after the period expires of length in the cycle in static state or dynamic time to second task.
17. method according to claim 15 (30) further comprises:
Begin after the long period expires in cycle to the first task budget nargin (47) of tendering guarantee at static state or dynamic time.
18. an equipment (20) comprising:
Has other first task of first significance level (24);
Have and be lower than other second task (25) of other second significance level of first significance level;
Distribution mechanism (22), be used for the budget of Resources allocation, described distribution mechanism (22) notifies first task (24) about more important guarantee budget and guarantee budget nargin and notify second task (25) about less important guarantee budget, the guarantee budget nargin of having ready conditions and therebetween according to the notice of recalling the recalling the predetermined static time cycle that will be delayed of guarantee budget nargin of having ready conditions clearly clearly; With
Scheduler program (23), it gives first and second tasks (24,25) provide the budget amount, described scheduler program (23) may add that with more important guarantee budget guarantee budget nargin offers first task (24) and may opportunity less important guarantee budget be offered second task (25) first first opportunity, wherein when first task (24) the term of execution certain when determining that this first task (24) only just can suitably be carried out with more important guarantee budget on a bit, described first task (24) notifies this first task of scheduler program (23) not need it to assure budget nargin clearly;
Wherein scheduler program (23) may opportunity stop to first task (24) the budget nargin of tendering guarantee first, and may begin opportunity to provide condition guarantee budget nargin to second task (25) first;
Wherein scheduler program (23) notifies second task (25) about providing condition guarantee budget nargin;
Wherein first task (24) the term of execution certain determine that this first task needs also to assure that budget nargin and first task notify this first task of scheduler program (23) (24) to need its guarantee budget nargin clearly on a bit;
Wherein scheduler program (23) is notified second task (25) to have ready conditions and is assured that budget nargin will be withdrawn; And
Wherein scheduler program (23) stops to provide condition guarantee budget nargin to second task (25) after the predetermined static time period expires.
19. equipment according to claim 18 (20), wherein scheduler program (23) begins after the predetermined static time period expires to first task (24) the budget nargin of tendering guarantee.
20. equipment according to claim 18 (20), wherein when first task (24) notice this first task of scheduler program (23) (24) does not need to assure budget nargin, the dynamic time cycle that first task (24) also notifies scheduler program (23) can wait for about this first task (24) when reclaiming guarantee budget nargin, and when first task (24) reclaimed guarantee budget nargin subsequently, scheduler program (23) stopped to provide condition guarantee budget nargin to second task (25) after the period expires of length in the cycle in predetermined static time cycle or dynamic time.
21. equipment according to claim 18 (20), wherein when first task (24) notice this first task of scheduler program (23) (24) needs guarantee budget nargin now, first task (24) also notifies scheduler program (23) receiving the dynamic time cycle that can wait for before the guarantee budget nargin about this first task (24), and scheduler program (23) stopped to provide condition guarantee budget nargin to second task (25) after the period expires of length in the cycle in predetermined static time cycle or dynamic time.
CNA2005800052575A 2004-02-18 2005-02-16 Method and system for restrained budget use with controlled budget transfer Pending CN1922577A (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US54543904P 2004-02-18 2004-02-18
US60/545,439 2004-02-18

Publications (1)

Publication Number Publication Date
CN1922577A true CN1922577A (en) 2007-02-28

Family

ID=34910728

Family Applications (1)

Application Number Title Priority Date Filing Date
CNA2005800052575A Pending CN1922577A (en) 2004-02-18 2005-02-16 Method and system for restrained budget use with controlled budget transfer

Country Status (5)

Country Link
EP (1) EP1721251A2 (en)
JP (1) JP2007523423A (en)
KR (1) KR20070005596A (en)
CN (1) CN1922577A (en)
WO (1) WO2005083566A2 (en)

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CA2252238A1 (en) * 1997-10-31 1999-04-30 Sun Microsystems, Inc. Method and apparatus for sharing a time quantum
US6799208B1 (en) * 2000-05-02 2004-09-28 Microsoft Corporation Resource manager architecture
US7140022B2 (en) * 2000-06-02 2006-11-21 Honeywell International Inc. Method and apparatus for slack stealing with dynamic threads
KR20020097154A (en) * 2000-11-06 2002-12-31 코닌클리케 필립스 일렉트로닉스 엔.브이. A method and a system for allocation of a budget to a task

Also Published As

Publication number Publication date
EP1721251A2 (en) 2006-11-15
JP2007523423A (en) 2007-08-16
WO2005083566A2 (en) 2005-09-09
WO2005083566A3 (en) 2006-03-09
KR20070005596A (en) 2007-01-10

Similar Documents

Publication Publication Date Title
CN1154928C (en) Resource management method and apparatus for information processing system of multitasking facility
CN1256637C (en) Central processing unit dispatch method and device
JP4697805B2 (en) Data processing device
CN101055533A (en) Multithreading processor dynamic EMS memory management system and method
CN1629774A (en) Information processing system and operating system
CN102779062A (en) Method and device for controlling number of threads accessing system resources
CN1862515A (en) Data trnasfer apparatus, data transfer method, and program
KR20050016170A (en) Method and system for performing real-time operation
CN1910553A (en) Method and apparatus for scheduling task in multi-processor system based on memory requirements
CN1643900A (en) Electronic device and power source control method
CN107728466B (en) Fixed priority reliability perception energy consumption optimization method suitable for numerical control system
CN1828541A (en) Implementation method for timing task in Java operating system
CN108681481B (en) Service request processing method and device
CN100346307C (en) Method of real time task regulation in Java operation system
JPH10289116A (en) Processor resource management device
CN103188521A (en) Method and device for transcoding distribution, method and device for transcoding
CN106598740A (en) System and method for limiting CPU (Central Processing Unit) occupancy rate of multi-thread program
CN1780265A (en) Flow controlling method for message system
CN1262934C (en) System integrating agents having different resource-accessing schemes
CN1101573C (en) Computer system
CN101057220A (en) System as well as method for managing memory space
CN101034383A (en) DMA controller and transmit method for implementing software/hardware reusing
CN103677959A (en) Virtual machine cluster migration method and system based on multicast
JP2007531145A (en) Method and system for transferring a budget in a limited budget usage approach
CN1922577A (en) Method and system for restrained budget use with controlled budget transfer

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C02 Deemed withdrawal of patent application after publication (patent law 2001)
WD01 Invention patent application deemed withdrawn after publication