发明名称 Method and device for scheduling communication schedulable unit
摘要 Communication schedulable units (CSUs) belonging to different owners in a radio communication device are scheduled to use multiple processors. The CSUs under different owners can be processed in parallel by the different processors. A global CSU list and an owner waiting list are maintained. The global CSU list may include the CSUs waiting to be processed and the CSUs are ordered according to the time stamps of the CSUs. The owner waiting list may include the owners that have no CSU being processed and the owners are ordered according to the time stamps of their respective earliest CSUs waiting to be processed in the global CSU list. When one of the processors finishes processing a first CSU of a first owner, a CSU to be processed next is scheduled according to the CSU time order and the CSU affinity, based on the global CSU list and the owner waiting list.
申请公布号 US9471372(B2) 申请公布日期 2016.10.18
申请号 US201314778033 申请日期 2013.03.21
申请人 Telefonaktiebolaget LM Ericsson (publ) 发明人 Wang Jun;Chen Begood
分类号 G06F9/54;G06F9/48;H04W72/12 主分类号 G06F9/54
代理机构 Myers Bigel & Sibley, P.A. 代理人 Myers Bigel & Sibley, P.A.
主权项 1. A method of scheduling communication schedulable units, CSUs, belonging to different owners in a radio communication device using multiple processors, wherein the CSUs can be processed in parallel by at least two of the processors, comprising: maintaining a global CSU list and an owner waiting list, wherein the global CSU list includes CSUs waiting to be processed and in the global CSU list, the CSUs waiting to be processed are ordered according to time stamps of the CSUs waiting to be processed, wherein the owner waiting list includes owners that have no CSU being processed by the processors and in the owner waiting list the owners that have no CSU being processed are ordered according to time stamps of their respective earliest CSUs waiting to be processed in the global CSU list; and when one of the processors finishes processing a first CSU of a first owner, scheduling a CSU to be processed next by the processor according to the order of the CSUs by the time stamps and CSU affinity, based on the global CSU list and the owner waiting list, wherein the scheduling comprises: obtaining a second CSU waiting to be processed that belongs to the first owner, the second CSU has a minimum time stamp among the CSUs waiting to be processed that belong to the first owner;locating a head owner from the owner waiting list, the head owner's earliest CSU waiting to be processed has a minimum time stamp among the owners in the owner waiting list;locating a third CSU in the global CSU list which is the head owner's earliest CSU waiting to be processed;calculating a disparity between a first time stamp of the second CSU and a second time stamp of the third CSU; andwhen the disparity that the first time stamp is later than the second time stamp exceeds a predefined threshold, inserting the first owner back to the owner waiting list according to the first time stamp, removing the head owner from the owner waiting list and processing the third CSU of the head owner by the processor, otherwise processing the second CSU by the processor.
地址 Stockholm SE