Telecommunications job scheduling

Details Telecommunications job scheduling Telecommunications job scheduling

1998-06-19

2002-08-13

Banankhah, Majid (Department: 2151)

Electrical computers and digital processing systems: multicomput

Computer-to-computer data routing

Least weight routing

C709S241000, C709S224000, C709S226000

Reexamination Certificate

active

06434589

ABSTRACT:

REFERENCE TO MICROFICHE APPENDIX
A microfiche appendix consisting of 59 frames is included as part of the specification. The appendix includes material subject to copyright protection. The copyright owner does not object to the facsimile reproduction of the appendix, as it appears in the Patent and Trademark Office patent file or records, but otherwise reserves all copyright rights.
BACKGROUND OF THE INVENTION
This invention relates generally to telecommunications job scheduling.
Many systems can be characterized as offering different classes of resources that process different classes of jobs. These resource classes often vary in their job processing capabilities. Similarly, job class characteristics can vary such that only a restricted set of resource classes can process a particular job. Scheduling allocates a particular resource for processing a job. The pairing of job to resource can strongly affect system performance. That is, different scheduling assignments can result in faster or slower processing of a incoming job.
SUMMARY OF THE INVENTION
In general, in one aspect, the invention features a computer-based method of scheduling a first job for processing by a resource. The method proceeds by identifying resources capable of processing the first job and selecting a second job for rescheduling from jobs currently being processed by the identified resources such that the second job can be processed by resources other than the identified resources. Scheduling further includes scheduling the first job for processing by the resource currently processing the second job and rescheduling the second job.
The invention may continue by identifying resources capable of processing the second job and selecting a third job for rescheduling from jobs currently being processed by the identified resources such that the third job can be processed by resources other than the identified resources. The scheduling can proceed by scheduling the second job for processing by the resource currently processing the third job and rescheduling the third job.
The system may select a job for rescheduling by selecting the job that can be processed by the greatest number of resources other than the identified resources. Enforcement of the scheduling may be contingent upon successful rescheduling.
In one example implementation the resources are communication frequencies while the jobs are wireless communication transmitted over the communication frequencies. In another example implementation the resources are communication subchannels while the jobs are information being transmitted by the communication subchannels having corresponding priority ratings.
The invention may offer one or more of the following advantages. The invention dynamically determines a new scheduling configuration that can both continue processing jobs currently being processed and begin processing a new job if any such configuration exists. Further, switching to the new configuration requires few hand-offs of jobs between processors. Additionally, the system can ensure that a job being processed is not terminated or delayed once some resource has begun processing the job.


REFERENCES:
patent: 4646286 (1987-02-01), Reid et al.
patent: 4837760 (1989-06-01), Reid et al.
patent: 5029158 (1991-07-01), Reid et al.
patent: 5239673 (1993-08-01), Nalorjan
patent: 5742825 (1998-04-01), Mathur et al.
patent: 5826081 (1998-10-01), Zolnowsky
Eriksson, H., “Capacity Improvement by Adaptive Channel Allocation”, Globecom 1988, Hollywood, FL, Nov. 1988.
Zhang, M. et al., “Comparisons of Channel-Assignment Strategies in Cellular Mobile Telephone Systems”, IEEE Trans. on Vehicular Technology, vol. 38, No. 4, Nov. 1989.
Del Re, E. et al., “Handover and Dynamic Channel Allocation Techniques in Mobile Cellular Networks”, IEEE Trans. on Vehicular Technology, vol. 44, No. 2, May 1995.
Zander, J. et al., “Asymptotic Bounds on the Performance of a Class of Dynamic Channel Assignment Algorithms” IEEE Journal on Sel. Areas in Comm., vol. 11, No. 6, Aug. 1993.
Zander, J. et al., “Capacity Allocations and Channel Assignment In Cellular Radio Systems Using Reuse Partitioning”, Elect. Letters, vol. 28, No. 5, Feb. 1992.
Nettleton, R. et al., “A High Capacity Assignment Method For Cellular Mobile Telephone Systems”, 39th IEEE Vehicular Technology Conf., San Francisco, CA, May 1989.
Siller, Jr. et al., “SONET/SDH A Sourcebook of Synchronous Networking” Section 3, pp. 129-207, IEEE Press Marketing, 1996.

Affiliated with

Also associated with

Rating

Telecommunications job scheduling does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Telecommunications job scheduling, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Telecommunications job scheduling will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2900995