Patent US8526460B2 successfully refreshed from Google Patents.
← Back to Patent Explorer
US8526460B2 Active / In Force US ⏱️ 1.9 years remaining

Systems and methods for scheduling asynchronous tasks to residual channel space

Assignee: Harris Corp
•
Filing: 2008-10-01
•
Granted: 2013-09-03
•
Expires: 2028-10-01
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract Systems ( 100 )/methods ( 1000 ) for allocating performance of data service tasks (DST- 1 , . . . , DST- 30 ) of a defined duration or data volume among time frames ( 202 1-1 , 202 1-2 , . . . , 202 1-N , . . . , 202 17-1 , 202 17-2 , . . . , 202 17-N ) defined in separate communication channels ( 200 1 , . . . , 200 17 ). Each time frame has a predetermined duration and number of time chips ( 302 1-1 , 302 1-2 , . . . , 302 1-26624 ). The methods involve allocating portions of the time frames to synchronous type data service tasks (STDSTs). STDSTs (DTS- 1 , . . . , DST- 14 , DST- 16 , . . . , DST- 18 , DST- 20 , . . . , DST- 30 ) must be communicated in consecutive time chips of a single channel. The methods also involve allocating residual channel space portions of the time frames to asynchronous type data service tasks (ATDSTs). ATDSTs (DST- 15 , DST- 19 ) do not require data to be communicated in consecutive time chips of a single channel.

Inventors

  • 👤 Richard Booton

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-24 18:56
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/46; G06F9/48; G06F9/4806; G06F9/4843; G06F9/4881; G06F9/4887; H; H04; H04L; H04L69/00; H04L69/28

Claims Analysis

Total Claims: 20
Claim 1
Independent Claim 224 words
A method for allocating performance of a set of data service tasks of a defined duration or data volume among a plurality of time frames respectively defined in a plurality of separate communication channels, each of said separate communication channels comprising a different frequency band, where each of said time frames is of a predetermined duration and is subdivided into a predetermined number of time chips, comprising: first allocating, in a communication device, portions of said plurality of time frames to a plurality of synchronous type data service tasks which must be communicated in consecutive time chips of a single communication channel; second allocating, in said communication device, a plurality of residual channel space portions of said plurality of time frames remaining after said first allocating, to a plurality of asynchronous type data service tasks which do not require data to be communicated in consecutive time chips of a single communication channel; wherein said second allocating includes determining two or more combinations of said plurality of residual channel space portions which are of sufficient duration for being allocated to a first one of said asynchronous type data service tasks and allocating said first one of said asynchronous type data service tasks to said combination which has the least collective channel capacity capable of servicing said first one of said asynchronous type data service tasks.
Claim 2
Independent Claim 224 words
A method for allocating performance of a set of data service tasks of a defined duration or data volume among a plurality of time frames respectively defined in a plurality of separate communication channels, each of said separate communication channels comprising a different frequency band, where each of said time frames is of a predetermined duration and is subdivided into a predetermined number of time chips, comprising: first allocating, in a communication device, portions of said plurality of time frames to a plurality of synchronous type data service tasks which must be communicated in consecutive time chips of a single communication channel; second allocating, in said communication device, a plurality of residual channel space portions of said plurality of time frames remaining after said first allocating, to a plurality of asynchronous type data service tasks which do not require data to be communicated in consecutive time chips of a single communication channel; wherein said second allocating includes determining two or more combinations of said plurality of residual channel space portions which are of sufficient duration for being allocated to a first one of said asynchronous type data service tasks and allocating said first one of said asynchronous type data service tasks to said combination which has the least collective channel capacity capable of servicing said first one of said asynchronous type data service tasks.
Claim 3
Dependent Claim 42 words
The method according to claim 1 , further comprising prior to said first allocating step, ordering said plurality of synchronous type data service tasks in accordance with said defined duration or said data volume of each said synchronous type data service task.
Claim 4
Dependent Claim 64 words
The method according to claim 1 , further comprising performing said first allocating step in accordance with a first to fit type allocation method in which said synchronous data services tasks are assigned to said time frames without regard to said defined duration or said data volume, except when said defined duration or said data volume exceeds a remaining capacity in a time frame.
Claim 5
Dependent Claim 57 words
The method according to claim 1 , further comprising performing said first allocation step in accordance with a best fit allocation method in which said synchronous data services tasks are assigned to said time frames in accordance with an ordering based on said data volume or said defined duration of each said synchronous type data service task.
Claim 6
Dependent Claim 41 words
The method according to claim 1 , wherein said second allocating includes allocating a first one of said plurality of asynchronous type data service tasks to at least two non-consecutive residual channel space portions in at least two different communication channels.
Claim 7
Dependent Claim 36 words
The method according to claim 1 , wherein at least one of said one or more combinations comprises residual channel space portions in at least two different communications channels of said plurality of separate communication channels.
Claim 8
Independent Claim 214 words
A method for allocating performance of a set of data service tasks of a defined duration or data volume among a plurality of time frames respectively defined in a plurality of separate communication channels, each of said separate communication channels comprising a different frequency band, where each of said time frames is of a predetermined duration and is subdivided into a predetermined number of time chips, comprising: first allocating, in a communication device, portions of said plurality of time frames to a plurality of synchronous type data service tasks which must be communicated in consecutive time chips of a single communication channel; second allocating, in said communication device, a plurality of residual channel space portions of said plurality of time frames remaining after said first allocating, to a plurality of asynchronous type data service tasks which do not require data to be communicated in consecutive time chips of a single communication channel, said second allocating step including determining one or more combinations of said plurality of residual channel space portions which are of sufficient duration for being allocated to at least a first one of said asynchronous type data service tasks, and further comprising determining if said combination of said plurality of residual channel space portions contains overlapping time chips in different time frames.
Claim 9
Independent Claim 214 words
A method for allocating performance of a set of data service tasks of a defined duration or data volume among a plurality of time frames respectively defined in a plurality of separate communication channels, each of said separate communication channels comprising a different frequency band, where each of said time frames is of a predetermined duration and is subdivided into a predetermined number of time chips, comprising: first allocating, in a communication device, portions of said plurality of time frames to a plurality of synchronous type data service tasks which must be communicated in consecutive time chips of a single communication channel; second allocating, in said communication device, a plurality of residual channel space portions of said plurality of time frames remaining after said first allocating, to a plurality of asynchronous type data service tasks which do not require data to be communicated in consecutive time chips of a single communication channel, said second allocating step including determining one or more combinations of said plurality of residual channel space portions which are of sufficient duration for being allocated to at least a first one of said asynchronous type data service tasks, and further comprising determining if said combination of said plurality of residual channel space portions contains overlapping time chips in different time frames.
Claim 10
Dependent Claim 44 words
The method according to claim 7 , further comprising relocating at least one residual channel space portion within at least one of said time frames if said combination of said plurality of residual channel space portions contain overlapping time chips in different time frames.
Claim 11
Independent Claim 278 words
A system for allocating performance of a set of data service tasks of a defined duration or data volume among a plurality of time frames respectively defined in a plurality of separate communication channels, each of said separate communication channels comprising a different frequency band, where each of said time frames is of a predetermined duration and is subdivided into a predetermined number of time chips, comprising: at least one processing element configured to (a) allocate portions of said plurality of time frames to a plurality of synchronous type data service tasks which must be communicated in consecutive time chips of a single communication channel, and (b) allocate a plurality of residual channel space portions of said plurality of time frames remaining after allocating portions of said plurality of time frames to said plurality of synchronous type data service tasks, to a plurality of asynchronous type data service tasks which do not require data to be communicated in consecutive time chips of a single communication channel; at least one transceiver device coupled to the at least one processing element and configured to transmit data associated with said synchronous type data service tasks and said asynchronous type data service tasks, wherein said allocating of said plurality of residual channel space portions comprises determining two or more combinations of said plurality of residual channel space portions which are of sufficient duration for being allocated to a first one of said asynchronous type data service tasks and allocating said first one of said asynchronous type data service tasks to said combination which has the least collective channel capacity capable of servicing said first one of said asynchronous type data service tasks.
Claim 12
Independent Claim 278 words
A system for allocating performance of a set of data service tasks of a defined duration or data volume among a plurality of time frames respectively defined in a plurality of separate communication channels, each of said separate communication channels comprising a different frequency band, where each of said time frames is of a predetermined duration and is subdivided into a predetermined number of time chips, comprising: at least one processing element configured to (a) allocate portions of said plurality of time frames to a plurality of synchronous type data service tasks which must be communicated in consecutive time chips of a single communication channel, and (b) allocate a plurality of residual channel space portions of said plurality of time frames remaining after allocating portions of said plurality of time frames to said plurality of synchronous type data service tasks, to a plurality of asynchronous type data service tasks which do not require data to be communicated in consecutive time chips of a single communication channel; at least one transceiver device coupled to the at least one processing element and configured to transmit data associated with said synchronous type data service tasks and said asynchronous type data service tasks, wherein said allocating of said plurality of residual channel space portions comprises determining two or more combinations of said plurality of residual channel space portions which are of sufficient duration for being allocated to a first one of said asynchronous type data service tasks and allocating said first one of said asynchronous type data service tasks to said combination which has the least collective channel capacity capable of servicing said first one of said asynchronous type data service tasks.
Claim 13
Dependent Claim 64 words
The system according to claim 9 , wherein said at least one processing element is further configured to order said plurality of synchronous type data service tasks in accordance with said defined duration or said data volume of each said synchronous type data service task, prior to allocating portions of said plurality of time frames to said plurality of synchronous type data service tasks.
Claim 14
Dependent Claim 85 words
The system according to claim 9 , wherein said at least one processing element is further configured to allocate portions of said plurality of time frames to said plurality of synchronous type data service tasks in accordance with a first to fit type allocation method in which said synchronous data services tasks are assigned to said time frames without regard to said defined duration or said data volume, except when said defined duration or said data volume exceeds a remaining capacity in a time frame.
Claim 15
Dependent Claim 78 words
The system according to claim 9 , wherein said at least one processing element is further configured to allocate portions of said plurality of time frames to said plurality of synchronous type data service tasks in accordance with a best fit allocation method in which said synchronous data services tasks are assigned to said time frames in accordance with an ordering based on said data volume or said defined duration of each said synchronous type data service task.
Claim 16
Dependent Claim 44 words
The system according to claim 9 , wherein said processing element is further configured to allocate a first one of said plurality of asynchronous type data service tasks to at least two non-consecutive residual channel space portions in at least two different communication channels.
Claim 17
Dependent Claim 36 words
The system according to claim 9 , wherein at least one of said one or more combinations comprises residual channel space portions in at least two different communications channels of said plurality of separate communication channels.
Claim 18
Independent Claim 266 words
A system for allocating performance of a set of data service tasks of a defined duration or data volume among a plurality of time frames respectively defined in a plurality of separate communication channels, each of said separate communication channels comprising a different frequency band, where each of said time frames is of a predetermined duration and is subdivided into a predetermined number of time chips, comprising: at least one processing element configured to (a) allocate portions of said plurality of time frames to a plurality of synchronous type data service tasks which must be communicated in consecutive time chips of a single communication channel, and (b) allocate a plurality of residual channel space portions of said plurality of time frames remaining after allocating portions of said plurality of time frames to said plurality of synchronous type data service tasks, to a plurality of asynchronous type data service tasks which do not require data to be communicated in consecutive time chips of a single communication channel; at least one transceiver device coupled to the at least one processing element and configured to transmit data associated with said synchronous type data service tasks and said asynchronous type data service tasks, wherein said at least one processing element is further configured to determine one or more combinations of said plurality of residual channel space portions which are of sufficient duration for being allocated to at least a first one of said asynchronous type data service tasks and for determining if said combination of said plurality of residual channel space portions contains overlapping time chips in different time frames.
Claim 19
Independent Claim 266 words
A system for allocating performance of a set of data service tasks of a defined duration or data volume among a plurality of time frames respectively defined in a plurality of separate communication channels, each of said separate communication channels comprising a different frequency band, where each of said time frames is of a predetermined duration and is subdivided into a predetermined number of time chips, comprising: at least one processing element configured to (a) allocate portions of said plurality of time frames to a plurality of synchronous type data service tasks which must be communicated in consecutive time chips of a single communication channel, and (b) allocate a plurality of residual channel space portions of said plurality of time frames remaining after allocating portions of said plurality of time frames to said plurality of synchronous type data service tasks, to a plurality of asynchronous type data service tasks which do not require data to be communicated in consecutive time chips of a single communication channel; at least one transceiver device coupled to the at least one processing element and configured to transmit data associated with said synchronous type data service tasks and said asynchronous type data service tasks, wherein said at least one processing element is further configured to determine one or more combinations of said plurality of residual channel space portions which are of sufficient duration for being allocated to at least a first one of said asynchronous type data service tasks and for determining if said combination of said plurality of residual channel space portions contains overlapping time chips in different time frames.
Claim 20
Dependent Claim 53 words
The system according to claim 15 , wherein said at least one processing element is further configured to relocate at least one residual channel space portion within at least one of said time frames if said combination of said plurality of residual channel space portions contain overlapping time chips in different time frames.

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2016-09-02 2017-03-04 2017-09-03 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2020-09-02 2021-03-04 2021-09-03 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2024-09-02 2025-03-04 2025-09-03 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag