Electrical computers and digital processing systems: multicomput – Computer-to-computer data routing – Least weight routing
Patent
1994-11-18
2000-11-14
Banankhah, Majid A.
Electrical computers and digital processing systems: multicomput
Computer-to-computer data routing
Least weight routing
709102, G06F 946
Patent
active
061483222
ABSTRACT:
The present invention provides a processing unit with an improved ability to coordinate the execution of multiple tasks with varying priorities. Tasks to be executed are assigned both a request condition and a terminating condition, with the processing unit initiating execution of the task with the highest priority whose request condition is satisfied. In general, the processing unit terminates an executing task once the terminating condition of that task is satisfied, and then initiates execution of the next highest-priority task with a satisfied request condition. However, the processing unit may abort execution of a task (other than the highest-priority task) if the request condition of a higher-priority task becomes satisfied. Moreover, the processing unit ensures the highest-priority task does not monopolize system resources by tracking the elapsed execution time and terminating the highest-priority task if this elapsed time exceeds a predetermined maximum, in which case the processing unit initiates execution of the next highest priority task with a satisfied request condition.
REFERENCES:
patent: 4084228 (1978-04-01), Dufond et al.
patent: 4145735 (1979-03-01), Soga
patent: 4414624 (1983-11-01), Summer, Jr. et al.
patent: 4488258 (1984-12-01), Struger et al.
patent: 4779194 (1988-10-01), Jennings et al.
patent: 5065310 (1991-11-01), Stone
patent: 5465335 (1995-11-01), Anderson
patent: 5504881 (1996-04-01), Sirurget
patent: 5528513 (1996-06-01), Vaitzblit et al.
IBM Technical Disclosure Bulletin, vol. 19, No. 11, Apr. 1977, C.J. Duggan, Jr.: Programmable Priority for Cycle Steal.
Katcher et al, Engineering and Analysis of Fixed Priority Schedulers, IEEE Trans. on Soft. Engineering, Sep. 1993, V:19, I9 pp. 920-934.
Sprunt et al, Exploiting Unused Periodic Time for aPeriodic Service Using the Extended Priority Exchange Algorithm, 1988, pp. 251-258.
Chipalkatti et al, Scheduling Policies for Real-Time and Non-Real-Time Traffic in a Statistical Multiplexer, Infocom 89 pp. 774-783.
DEC/OSF/I, Digital Equipment Corporation, 1993-1994, pp. 1-262, 1-275.
Teraoka et al, Virtual Network: Towards Location Transparent Communication in Large Distributed Systems, Sony, Jun. 13, 1990.
Khanna et al, Real-Time Scheduling in Sonos 5.0, Usenix, 92.
DEC OSF/I Vax System V to Dec. OSf/I Migration Guide Mar. 1993 pp. 1-1.4.
Sunos Version 5.5.1 Reference Manual, Priocntl(2) Command, 14 pages, 1990.
Sand Manfred
Trummer Georg
Banankhah Majid A.
Siemens Aktiengesellschaft
LandOfFree
Processing unit with an improved ability to coordinate the execu does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Processing unit with an improved ability to coordinate the execu, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Processing unit with an improved ability to coordinate the execu will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2075238