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, the method comprises the following steps: - 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 only owners that have no CSU being currently 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 based on the order of the CSUs by the time stamps in the global CSU list and the owner waiting list, wherein the scheduling comprises: - determining 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 the time stamp of the second CSU and the time stamp of the third CSU; and - when the time stamp of the second CSU is later than the time stamp of the third CSU and the disparity exceeds a predefined threshold, inserting the first owner in the owner waiting list according to the time stamp of the second CSU, removing the head owner from the owner waiting list and processing the third CSU by the processor, otherwise processing the second CSU by the processor. - 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 only owners that have no CSU being currently 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 based on the order of the CSUs by the time stamps in the global CSU list and the owner waiting list, wherein the scheduling comprises: - determining 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 the time stamp of the second CSU and the time stamp of the third CSU; and - when the time stamp of the second CSU is later than the time stamp of the third CSU and the disparity exceeds a predefined threshold, inserting the first owner in the owner waiting list according to the time stamp of the second CSU, removing the head owner from the owner waiting list and processing the third CSU by the processor, otherwise processing the second CSU by the processor. - determining 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 the time stamp of the second CSU and the time stamp of the third CSU; and - when the time stamp of the second CSU is later than the time stamp of the third CSU and the disparity exceeds a predefined threshold, inserting the first owner in the owner waiting list according to the time stamp of the second CSU, removing the head owner from the owner waiting list and processing the third CSU by the processor, otherwise processing the second CSU by the processor.