| 摘要 |
PROBLEM TO BE SOLVED: To reliably process a factor to be early processed timewise among the factors processed according to the priority order. SOLUTION: Timers 23a-23d counting the prescribed time set to a plurality of factors A-D are provided. When process requests are concurrently given from at least two or more factors of the factors A-D, a priority encoder 22 reports, to a processor 21, that the factor having the highest priority order in them should be processed. The priority encoder 22 judges whether there is a factor reaching the prescribed time or not in other factors concurrently sending process requests based on the count data of the timers 23a-23d. When a pertinent factor exists, the priority encoder 22 rearranges the order of the factor to the highest order in the priority order, thereby the factor can be processed next time with first priority.
|
