CN110139320B - Method, device, medium and terminal for processing service conflict of multi-card communication terminal - Google Patents
Method, device, medium and terminal for processing service conflict of multi-card communication terminal Download PDFInfo
- Publication number
- CN110139320B CN110139320B CN201810108017.7A CN201810108017A CN110139320B CN 110139320 B CN110139320 B CN 110139320B CN 201810108017 A CN201810108017 A CN 201810108017A CN 110139320 B CN110139320 B CN 110139320B
- Authority
- CN
- China
- Prior art keywords
- service
- processing
- time
- queue
- conflict
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/04—Error control
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W88/00—Devices specially adapted for wireless communication networks, e.g. terminals, base stations or access point devices
- H04W88/02—Terminal devices
- H04W88/06—Terminal devices adapted for operation in multiple networks or having at least two operational modes, e.g. multi-mode terminals
Abstract
The present disclosure relates to a method, an apparatus, a medium and a terminal for processing a service conflict of a multi-card communication terminal, wherein the method comprises: determining whether a first service and a second service conflict, wherein the first service is any service in a service queue, the second service is a service to be inserted into the service queue, and the service queue is used for storing the services of the multiple cards; and when the first service is determined to conflict with the second service, inserting the second service into the service queue or deleting the second service according to a preset processing rule. Through the technical scheme, on one hand, the phenomenon of service preemption or interruption can not occur when the conflicting services are processed, and the use experience of a user is ensured. On the other hand, the maintenance of the high-level message and the service operation context which need to be responded in the prior art can not occur, the cache and the performance overhead are saved, the application range of the method is further widened, and the efficiency of service conflict processing is improved.
Description
Technical Field
The present disclosure relates to the field of mobile communications, and in particular, to a method, an apparatus, a medium, and a terminal for processing a service conflict of a multi-card communication terminal.
Background
Due to the imbalance of mobile communication development and different network coverage degrees of operators, the dual-card dual-standby mobile phone comes into operation. In the prior art, dual-card dual-standby is realized through a single-chip-based architecture, that is, each card independently supports various functions. And the network service of only one card can be executed at the same time, so when the dual-card dual standby is realized on the single chip, the phenomenon of service conflict between the dual cards can occur.
In the prior art, service conflict processing is mainly performed in the following manner:
firstly, the service conflict processing is carried out according to the priority of the service. In the method, the priority of each service in the terminal system must be preset, and then when two services conflict, the service with high priority is processed first, and the service with low priority is processed later. However, in this scheme, after the high-priority service seizes the resource, phenomena such as voice call drop or data call drop occur, which affect the user experience.
And secondly, performing service conflict processing according to a mechanism of 'suspending activation-resuming activation'. In the method, the high layer of a terminal protocol stack completes service filtering, then sends a 'pause activation request' and a 'resume activation request' to inform a physical layer of the protocol stack according to the filtering result, and the interior of the physical layer realizes resource release and field recovery of each module according to the received request. For example, when the service of the card 1 is running, if the card 2 also has a service to run at this time, the physical layer receives the "suspend activation request" of the card 1 through the service filtering of the higher layer of the protocol stack, at this time, the card 1 releases the current physical resource and saves the context of the current service running, and then switches to the card 2. After the service operation of the card 2 is completed, the physical layer receives the "activation resuming request" of the card 1, and at this time, the card 2 releases the physical resource and switches to the card 1 to continue to execute the service of the card 1. Therefore, in this scheme, the physical layer not only needs to add a large amount of resources to save the context of the current service, but also needs to continuously process the messages of the "suspend activation request" and the "resume activation request" from the higher layer, which has high requirements on the physical resources and performance of the terminal.
Disclosure of Invention
The purpose of the present disclosure is to provide a method, an apparatus, a medium and a terminal for processing a service conflict of a multi-card communication terminal.
In order to achieve the above object, the present disclosure provides a method for processing a service conflict of a multi-card communication terminal, where the method includes:
determining whether a first service and a second service conflict, wherein the first service is any service in a service queue, the second service is a service to be inserted into the service queue, and the service queue is used for storing the services of the multiple cards;
and when the first service is determined to conflict with the second service, inserting the second service into the service queue or deleting the second service according to a preset processing rule.
Optionally, the processing rule includes:
and when the first service and the second service conflict, if the first service is in a running state, deleting the second service.
Optionally, the method further comprises:
determining the processing priority of the first service and the second service;
the processing rule comprises:
when the first service and the second service conflict, if the first service is not in an operating state and the processing priority of the second service is higher than that of the first service, inserting the second service into the service queue;
and when the first service and the second service conflict, if the first service is not in the running state and the processing priority of the first service is higher than that of the second service, deleting the second service.
Optionally, the determining the processing priority of the first service and the second service includes:
acquiring the weight of the card corresponding to the first service and the second service respectively;
determining the processing priority of the first service according to the initial priority corresponding to the first service and the weight of the card corresponding to the first service;
and determining the processing priority of the second service according to the initial priority corresponding to the second service and the weight of the card corresponding to the second service.
Optionally, after inserting the second service into the service queue, the method further includes:
and deleting the first service which conflicts with the second service in the service queue.
Optionally, the inserting the second service into the service queue includes:
acquiring the initial execution time of the second service in a second network time base as a first initial execution time, wherein the second network time base is the network time base of a card corresponding to the second service;
converting the first initial execution time into an initial execution time under a unified time base as a second initial execution time;
and inserting the second service into the service queue according to the second initial execution time, wherein the services in the service queue are arranged in the sequence from early to late according to the respective initial execution times in the direction from the head of the queue to the tail of the queue.
Optionally, the determining whether the first service and the second service have conflicts includes:
under the condition that the cards corresponding to the first service and the second service are different, respectively determining the service processing time of the first service in a first network time base and the service processing time of the second service in a second network time base, wherein the service processing time comprises a starting execution time and an ending execution time, the ending execution time is the sum of an actual ending execution time of the service or the sum of the actual ending execution time and a preset time corresponding to the service, the first network time base is the network time base of the card corresponding to the first service, and the second network time base is the network time base of the card corresponding to the second service;
respectively converting the service processing time of the first service and the service processing time of the second service into service processing time under a unified time base;
determining whether there is a conflict in the service processing times of the first service and the second service at the unified time base.
According to a second aspect of the present disclosure, there is provided a service conflict processing apparatus of a multi-card communication terminal, the apparatus comprising:
a first determining module, configured to determine whether a first service and a second service conflict with each other, where the first service is any service in a service queue, the second service is a service to be inserted into the service queue, and the service queue is used to store services of the multiple cards;
and the processing module is used for inserting the second service into the service queue or deleting the second service according to a preset processing rule when the first determining module determines that the first service conflicts with the second service.
Optionally, the first processing module includes:
a first deletion submodule for deleting the first deletion submodule according to the processing rule,
and when the first service and the second service conflict, if the first service is in a running state, deleting the second service.
Optionally, the apparatus further comprises:
a second determining module, configured to determine processing priorities of the first service and the second service;
the first processing module comprises:
a first insertion submodule for inserting, in accordance with the processing rule,
when the first service and the second service conflict, if the first service is not in an operating state and the processing priority of the second service is higher than that of the first service, inserting the second service into the service queue;
a second deletion submodule for deleting the first deletion submodule according to the processing rule,
and when the first service and the second service conflict, if the first service is not in the running state and the processing priority of the first service is higher than that of the second service, deleting the second service.
Optionally, the second determining module includes:
the first obtaining submodule is used for obtaining the weight of the card corresponding to each of the first service and the second service;
the first determining submodule is used for determining the processing priority of the first service according to the initial priority corresponding to the first service and the weight of the card corresponding to the first service;
and the second determining submodule is used for determining the processing priority of the second service according to the initial priority corresponding to the second service and the weight of the card corresponding to the second service.
Optionally, the apparatus further comprises:
and the second processing module is used for deleting the first service which conflicts with the second service in the service queue after the first inserting sub-module inserts the second service into the service queue.
Optionally, the first plug-in sub-module comprises:
a second obtaining submodule, configured to obtain an initial execution time of the second service in a second network time base as a first initial execution time, where the second network time base is a network time base of a card corresponding to the second service;
the first conversion submodule is used for converting the first initial execution time into an initial execution time under a unified time base, and the initial execution time is used as a second initial execution time;
and the second inserting sub-module inserts the second service into the service queue according to the second initial execution time, wherein the services in the service queue are arranged in the sequence from early to late according to the respective initial execution times in the direction from the head of the queue to the tail of the queue.
Optionally, the first determining module includes:
a third determining sub-module, configured to determine, under a condition that cards corresponding to the first service and the second service are different, a service processing time of the first service in a first network time base and a service processing time of the second service in a second network time base, where the service processing times include a start execution time and an end execution time, the end execution time is a sum of an actual end execution time of the service or the actual end execution time and a preset time corresponding to the service, the first network time base is a network time base of the card corresponding to the first service, and the second network time base is a network time base of the card corresponding to the second service;
the second conversion submodule is used for respectively converting the service processing time of the first service and the service processing time of the second service into service processing time under a unified time base;
a fourth determining submodule, configured to determine whether there is a conflict between service processing times of the first service and the second service in the unified time base.
According to a third aspect of the present disclosure, there is provided a computer readable storage medium having stored thereon a computer program which, when executed by a processor, performs the steps of any of the methods of the first aspect described above.
According to a fourth aspect of the present disclosure, there is provided a multi-card communication terminal including:
a plurality of card slots, each for mounting a SIM card;
a memory having a computer program stored thereon; and
one or more processors, configured to execute the computer program in the memory, to implement any one of the above-mentioned service conflict processing methods for the multi-card communication terminal.
In the technical scheme, the services of multiple cards are managed through one service queue, so that the services of the multiple cards can be managed in a unified manner, and conflict judgment is facilitated. Therefore, the method can be suitable for multiple layers in a protocol stack and has a wide application range. And then, when the conflict between the first service in the service queue and the second service to be inserted into the service queue is determined, the second service is inserted into the service queue or deleted according to a preset processing rule, on one hand, the phenomenon of service preemption or service interruption can not occur when the conflicting service is processed, and the use experience of a user is ensured. On the other hand, the maintenance of the messages and the service operation context which need to respond to the high layer in the prior art can not occur, the cache and the performance expenditure are saved, the application range of the method is further widened, and the efficiency of service conflict processing is improved.
Additional features and advantages of the disclosure will be set forth in the detailed description which follows.
Drawings
The accompanying drawings, which are included to provide a further understanding of the disclosure and are incorporated in and constitute a part of this specification, illustrate embodiments of the disclosure and together with the description serve to explain the disclosure without limiting the disclosure. In the drawings:
fig. 1 is a flowchart of a service conflict processing method of a multi-card communication terminal according to an embodiment of the present disclosure;
FIG. 2 is a flow diagram of one example implementation of determining whether a conflict exists between a first service and a second service provided by the present disclosure;
FIG. 3 is an exemplary schematic diagram of a traffic queue provided by the present disclosure;
FIG. 4 is another exemplary schematic diagram of a traffic queue provided by the present disclosure;
fig. 5 is a block diagram of a service conflict processing apparatus of a multi-card communication terminal according to an embodiment of the present disclosure;
fig. 6 is a block diagram of a service conflict processing apparatus of a multi-card communication terminal according to another embodiment of the present disclosure;
fig. 7 is a block diagram of a second determination module of a service conflict processing apparatus of a multi-card communication terminal according to an embodiment of the present disclosure;
fig. 8 is a block diagram of a first determination module of a service conflict processing apparatus of a multi-card communication terminal according to an embodiment of the disclosure;
fig. 9 illustrates a block diagram of a multi-card communication terminal according to an exemplary embodiment of the present disclosure.
Detailed Description
The following detailed description of specific embodiments of the present disclosure is provided in connection with the accompanying drawings. It should be understood that the detailed description and specific examples, while indicating the present disclosure, are given by way of illustration and explanation only, not limitation.
In order to solve the above problem, in the present disclosure, a service conflict processing device is used to process a service with a conflict, and the service conflict processing device may be located in a physical layer, that is, may directly process a conflict of resource occupation occurring between services, or may be another layer in a protocol stack, such as an access layer, which is not limited in the present disclosure. Specifically, the traffic conflict processing apparatus may perform the following method.
Fig. 1 is a flowchart illustrating a method for processing a service conflict of a multi-card communication terminal according to an embodiment of the present disclosure. As shown in fig. 1, the method includes:
in S11, it is determined whether a first service and a second service conflict, where the first service is any service in a service queue, the second service is a service to be inserted into the service queue, the service queue is used to store services of the multiple cards, and optionally, the service queue may be implemented by a doubly linked list.
Optionally, fig. 2 is a flowchart illustrating an example implementation of determining whether a conflict exists between a first service and a second service. As shown in fig. 2, this step includes:
in S21, when the cards corresponding to the first service and the second service are different, respectively determining a service processing time of the first service in a first network time base and a service processing time of the second service in a second network time base, where the service processing time includes a start execution time and an end execution time, the end execution time is a sum of an actual end execution time of the service or the actual end execution time and a preset time corresponding to the service, the first network time base is a network time base of the card corresponding to the first service, and the second network time base is a network time base of the card corresponding to the second service.
Wherein, for the multi-card communication terminal, the plurality of cards may be in the same mode, for example, card 1 and card 2 are both in GSM (Global System for Mobile communication) mode; it may also be in different modes, for example, card 1 is in GSM mode and card 2 is in LTE (Long Term Evolution) mode. Due to different time structures in different modes, each card is clocked according to the network time base corresponding to the mode in which the card is located. For example, when the card 1 needs to perform voice service, the initial execution time and the used time length of the voice service of the card 1 in the network time base of the GSM mode can be determined. For another example, when the card 2 needs to read an MIB (master Information block) message or an SIB (System Information block) message, the initial execution time and the used time duration of the service in the network time base of the LTE mode may also be determined. The determination of the initial execution time and the used time duration of the service in the network time base of the card corresponding to the service is the prior art, and is not described herein again. In addition, the actual ending execution time of the service can also be determined based on the starting execution time and the used time length of the service.
In an embodiment, the end execution time may be an actual end execution time of the service, that is, a time determined according to a start execution time and a used time of the service. For example, under the network time base of the card corresponding to the service, the start execution time of the service is located at 3ms, and the used time duration is 1ms, then in this embodiment, the end execution time corresponding to the service is at 4ms (3+ 1).
In another embodiment, the ending execution time may be a sum of the actual ending execution time and a preset duration corresponding to the service. In the operation process of the service, the service switching also needs to consume time, so that the influence of the service switching on the service operation can be fully avoided by adding a preset time length to the service. In order to ensure the stability of service switching, different preset durations may be set according to different services, for example, the preset durations may be determined by pre-tuning and storing the corresponding relationship between the service and the preset durations. Illustratively, under the network time base of the card corresponding to the service, the start execution time of the service is at 3ms, the used duration is 1ms, the preset duration corresponding to the service is 1ms, and then in this embodiment, the end execution time corresponding to the service is at 5ms (3+1+ 1). Therefore, by the technical scheme, the service can be ensured to have no other service interference during operation, the smooth operation of the service is ensured, and sufficient time guarantee can be provided for the smooth switching of the service.
In S22, the service processing time of the first service and the service processing time of the second service are converted into service processing times under a unified time base, respectively.
Since each card is clocked according to the network time base corresponding to the mode in which the card is located, after the service processing time of the service in the network time base of the card corresponding to the card is determined, the service processing time needs to be converted into the service processing time in the unified time base.
Alternatively, the traffic processing time in a certain network time base may be converted into the traffic processing time in a unified time base by:
Dest_UT_time＝Function(MODE,Curfn_time,Destfn_time,CurUT_time)
wherein, Dest _ UT _ time represents the service processing time of the service under the unified time base;
MODE indicates the MODE of the card corresponding to the service, and illustratively, the MODE may be indicated by different numbers, respectively, such as "0" indicates "GSM MODE", "1" indicates "WCDMA (Wideband Code Division Multiple Access) MODE", "2" indicates "LTE-FDD (Long Term Evolution-Frequency Division duplex, Long Term Evolution of Frequency Division duplex) MODE", and "3" indicates "LTE-TDD (Long Term Evolution-Time Division duplex, Long Term Evolution of Time Division duplex) MODE";
curfn _ time represents the current time under the network time base of the card corresponding to the service;
the Destfn _ time represents the service processing time under the network time base of the card corresponding to the service;
CurUT _ time represents the current time under a unified time base.
Function represents the conversion method, specifically: the service conflict processing apparatus may acquire the current time CurUT _ time in the unified time base and the current time Curfn _ time in the network time base of the card corresponding to the service. Wherein CurUT _ time and Curfn _ time are different representations of the same time at different time bases. Then, according to the service processing time Destfn _ time of the service determined under the network time base of the card corresponding to the service and the current time Curfn _ time under the network time base, calculating the time difference Delta _ fn, that is:
Delta_fn＝Destfn_time-Curfn_time
the time difference Delta _ fn is generally represented by a Frame (subframe) or a slot (slot). Converting the time difference Delta _ fn under the network time base into a time difference Delta _ UT under a unified time base, wherein the conversion base numbers corresponding to different network time bases are different, for example, the time difference 2 subframe under the network time base of the WCDMA mode corresponds to the time difference of 4ms under the unified time base, and the time difference 2 subframe under the network time base of the LTE-TDD mode corresponds to the time difference of 2ms under the unified time base. The conversion base number is determined according to a mode corresponding to the network time base. After the time difference Delta _ UT in the unified time base is determined, the service processing time Dest _ UT _ time of the service in the unified time base is the sum of the current time CurUT _ time in the unified time base and the time difference Delta _ UT in the unified time base, that is:
Dest_UT_time＝CurUT_time+Delta_UT
after the service processing time of each service under the unified time base is determined through the above manner, whether the conflict exists between the services can be determined through the service processing time of the services.
Turning back to fig. 2, in S23, it is determined whether there is a conflict in the service processing times of the first service and the second service under the unified time base.
When determining whether a conflict exists between any service (i.e. a first service) in the service queue and a service to be inserted (i.e. a second service), if the service processing time of the second service overlaps with the service processing time of the first service, determining that the conflict exists between the first service and the second service.
In an embodiment, any service that does not perform collision judgment in the service queue may be determined as a first service, and if it is determined that a collision exists between the first service and a second service, the collision judgment is stopped, and if it is not determined that a collision exists between the first service and the second service, the first service is reselected until all services in the service queue perform collision judgment.
In another embodiment, the service queues are implemented by a doubly linked list, and the services in the service queues can be arranged in the order of the start execution time from early to late in the direction from the head of the queue to the tail of the queue. Illustratively, as shown in fig. 3, the traffic in the traffic queue corresponds to the nodes in the doubly linked list one to one. Each node in the bi-directional linked list may further include a prelatest pointer, in addition to the pre pointer pointing to the previous node and the next pointer pointing to the next node, where the prelatest pointer points to a node corresponding to a service whose execution time is latest before the current node and ends, that is, the latest execution time of the service corresponding to all nodes before the current node may be determined at the current node, so as to facilitate service management.
Different services belonging to the same card in the same mode can be processed in parallel, and the same card can only be in the same mode at the same time, so that different services corresponding to the same card can be processed in parallel at the same time, and conflict can not occur. Therefore, since the service processing time of each service is different, there may be a phenomenon that the end execution time of the current service is earlier than the end execution time of the previous service. As shown in FIG. 3, node A 2 The corresponding service is that the card 1 receives paging in WCDMA mode, node A 3 The corresponding service is that the card 1 performs the same frequency measurement in the WCDMA mode, although the node A 2 Corresponding service and node A 3 The service processing time of the corresponding service is overlapped, and the node A 3 Corresponding traffic ratio node A 2 The end execution time of the corresponding service is early. But is composed ofThe two services can be processed in parallel, so that the two services can be inserted into the service queue by considering that no conflict exists between the two services. Optionally, before determining whether the first service and the second service conflict, it may be determined whether the cards corresponding to the first service and the second service are the same, or it may be determined whether the cards corresponding to the first service and the second service are the same in a process of determining whether the first service and the second service conflict, which is not limited in this disclosure.
Illustratively, as shown in FIG. 3, under the unified time base, the node A in the traffic queue 1 The prelatest pointer of the corresponding service points to null, node A 2 The prelatest pointer of the corresponding service points to A 1 Node A 3 The prelatest pointer of the corresponding service points to A 2 Node A 4 The prelatest pointer of the corresponding service points to A 2 . The start execution time of the second service of a service to be inserted is at 9.2ms and the end execution time is at 11 ms. Therefore, when the first service is determined, the insertable position of the second service can be determined according to the comparison between the initial execution time of the second service and the initial execution time of each service in the service queue. Illustratively, the insertable location of the second service may be determined by dichotomy. As shown in fig. 3, the position to be inserted for the second service is node a 3 And node A 4 In the meantime. Illustratively, node A 4 The corresponding service is different from the card corresponding to the second service, and then the node A is connected 4 And determining whether time overlap exists between the first service and the second service by comparing the end execution time of the service pointed by the prelatest pointer of the first service with the start execution time of the second service and the relationship between the end execution time of the second service and the start execution time of the first service, so as to judge the conflict. When the ending execution time of the service pointed by the preLatest pointer in the first service is earlier than or equal to the starting time of the second service and the ending execution time of the second service is earlier than or equal to the starting execution time of the first service, determining the sum of the first service and the second serviceAnd if not, determining that the conflict exists between the first service and the second service. In this embodiment, it can be quickly determined that the latest ending execution time of the service corresponding to the node before the first service is 10ms (i.e., the ending execution time of the service corresponding to the node a 2) by using the prelatest pointer of the first service, and the starting execution time of the second service is 9.2ms, and if there is a time overlap, it is determined that there is a conflict between the first service and the second service. When the conflict judgment is carried out based on the prelatest pointer, the latest ending execution time of the business corresponding to each node before the current node in the business queue can be quickly determined, and the conflict judgment is carried out without comparing with the previous node one by one. Therefore, by the technical scheme, the position to be inserted of the second service can be quickly determined, the conflict judgment can be carried out on the first service and the second service, and the service range for carrying out the conflict judgment can be effectively reduced, so that the service conflict processing time is effectively saved, and the service conflict processing efficiency is improved.
In the above technical solution, since the time timing structures are different in different network time bases, the service processing time of the service in the network time base of the card corresponding to the service is converted into the service processing time in a uniform time base, and the service processing time of each service can be uniformly expressed, so that the accuracy of the collision judgment can be ensured. Meanwhile, whether conflict exists among the services is determined according to the service processing time of the services in the unified time base, and the efficiency of conflict judgment can be effectively improved.
In S12, when it is determined that the first service conflicts with the second service, the second service is inserted into the service queue or deleted according to a preset processing rule.
Optionally, the processing rule includes:
and when the first service and the second service conflict, if the first service is in a running state, deleting the second service.
Illustratively, the current traffic queue is as shown in fig. 3, under the unified time base, if the current time is at 3.2ms, the node a 1 The corresponding service is already in operationState, and the end execution time of the service is at 4 ms. If the initial execution time of a second service is 3.5ms, that is, the second service conflicts with the running service, at this time, the second service is deleted. By the technical scheme, the operation smoothness of the service in operation can be ensured, the phenomenon of cache occupation caused by service interruption or disconnection caused by service switching is effectively avoided, and the use experience of a user is improved. In addition, as the context of the running service does not need to be maintained, the complexity of the service conflict processing method can be further reduced, the maintenance cost is reduced, and the method is favorable for widening the applicability.
Optionally, the method further comprises:
determining the processing priority of the first service and the second service;
illustratively, one example implementation of the determining the processing priority of the first service and the second service is as follows:
and acquiring the weight of the card corresponding to the first service and the second service respectively.
And determining the processing priority of the first service according to the initial priority corresponding to the first service and the weight of the card corresponding to the first service.
And determining the processing priority of the second service according to the initial priority corresponding to the second service and the weight of the card corresponding to the second service.
For example, the user may set a level according to a usage requirement of each card, where each level corresponds to a different weight, or the user may directly set the weight of each card, which is not limited in this disclosure. For example, the user may set the ranks of card 1, card 2, and card 3 to 1, 2, and 3, respectively, with the weight for rank 1 being 0.8, the weight for rank 2 being 1, and the weight for rank 3 being 1.2.
Wherein the initial priority may be statically obtained. For example, the priority corresponding to each service may be preset, and the correspondence between the service and the priority may be stored. Therefore, the priority inquired according to the corresponding relation can be directly determined as the initial priority of the service, and the implementation method is simple and quick. Optionally, the initial priority may also be dynamically obtained. For example, the priority corresponding to each service may be preset, and the correspondence between the service and the priority may be stored. When the initial priority of the service is determined, the priority inquired according to the corresponding relation can be dynamically adjusted according to the current resource residual condition and/or the operating environment, and the adjusted priority is determined as the initial priority of the service.
Hereinafter, an implementation of determining the processing priority of the service according to the initial priority of the service and the weight of the card corresponding to the service will be described in detail.
In one embodiment, the processing priority of the service may be determined by determining the sum of the initial priority of the service and the weight of the card corresponding to the service. Illustratively, if the initial priority of the first service is 3, the weight is 0.8, the initial priority of the second service is 1, and the weight is 1.2, then the finally determined processing priority of the first service is 3.8 (i.e., 3+0.8), and the processing priority of the second service is 2.2. Accordingly, it may be determined that the processing priority of the first service is higher than the processing priority of the second service.
In another embodiment, the processing priority of the traffic may be determined by multiplying the initial priority of the traffic by the weight of the card to which the traffic corresponds. Illustratively, if the initial priority of the first service is 3, the weight is 0.8, the initial priority of the second service is 1, and the weight is 1.2, then the finally determined processing priority of the first service is 2.4 (i.e., 3 × 0.8), and the processing priority of the second service is 1.2. Accordingly, it may be determined that the processing priority of the first service is higher than the processing priority of the second service.
It should be noted that, in the actual processing process, when the initial priority of the service is set, the relationship between the initial priority of the service and the weight of the card corresponding to the service is fully considered, so as to ensure that the processing priorities of the services are not the same.
In the technical scheme, the processing priority of the service is determined according to the initial priority of the service and the weight of the card corresponding to the service, so that the priority of the service is considered, the priority processing sequence of the service of a certain card by a user is fully considered, the use requirements of the user are met, and the use experience of the user is improved.
Optionally, the processing rule includes:
and when the first service and the second service conflict, if the first service is not in the running state and the processing priority of the second service is higher than that of the first service, inserting the second service into the service queue.
Illustratively, the first service conflicts with the second service, and under the unified time base, the current time is 5ms, and the initial execution time of the first service is 6ms, that is, the first service is not yet running at this time. At this time, it is determined that the processing priority of the first service is 2, and the processing priority of the second service is 3, that is, the processing priority of the second service is higher than the processing priority of the first service, and at this time, the second service may be inserted into the service queue to indicate that the second service is executable. In this case, when the processing priority of the second service is higher than that of the first service, it indicates that the user prefers to process the second service preferentially. Therefore, when the first service is not in the running state, the second service can be inserted into the service queue, the phenomenon of unsmooth running caused by service switching can not occur, the problems of cache and large occupation of performance caused by service interruption can not occur, and the use requirements of users are met.
Illustratively, one example implementation of the inserting the second service into the service queue includes:
and acquiring the initial execution time of the second service in a second network time base as a first initial execution time, wherein the second network time base is the network time base of the card corresponding to the second service.
And converting the first starting execution time into a starting execution time under a unified time base to be used as a second starting execution time.
The manner how to determine the first start execution time of the service in the network time base of the card corresponding to the service and convert the start execution time into the second start execution time in the unified time base has been described in detail above, and is not described herein again.
And inserting the second service into the service queue according to the second initial execution time, wherein the services in the service queue are arranged in the sequence from early to late according to the respective initial execution times in the direction from the head of the queue to the tail of the queue.
For example, according to the second starting execution time of the second service queue, the insertable position of the second service in the service queue can be determined, then the second service is inserted at the position, and the pointer directions of the second service and nodes before and after the insertable position in the service queue are modified correspondingly.
Optionally, after inserting the second service into the service queue, the method further includes:
and deleting the first service which conflicts with the second service in the service queue.
Because the second service is inserted into the service queue and the first service and the second service conflict, the first service in the service queue cannot be completely operated or even cannot be operated. Therefore, deleting the first service can not only timely release the storage space in the service queue, but also determine the accuracy and effectiveness of service conflict processing due to the influence on other services when conflict judgment is carried out.
Alternatively, after inserting or deleting traffic in the traffic queue, it may be determined whether the pointing of the prestatest pointer of each node in the traffic queue needs to be updated.
Illustratively, as shown in fig. 3, Node represents a Node corresponding to a service, Start represents a Start execution time, and End represents an End execution time. And the time in each node is the service processing time under the unified time base. Node A 1 The initial execution time of the corresponding service is 3ms, and the end execution time is 4 ms; node A 2 The initial execution time of the corresponding service is 7ms, and the end execution time is 10 ms; node A 3 Initial execution of corresponding service8ms and 9ms for finishing execution time; node A 4 The start execution time of the corresponding service is at 12ms and the end execution time is at 14 ms. A service to be inserted (i.e., the second service) has a start execution time at 9.2ms and an end execution time at 11 ms. At this time, if the second service and the node A are determined 2 There is a conflict between the corresponding services (i.e., the first service). If the processing priority of the first service is 2 and the processing priority of the second service is 3, the second service may be inserted into the service queue according to the arbitration rule. In addition, the first service in the service queue may also be deleted. Illustratively, the traffic queue after traffic conflict handling is shown in fig. 4. Wherein, the node A corresponding to the second service 5 Inserting into the service queue and deleting the node A corresponding to the first service 2 And updating the pre pointer, the next pointer and the prelatest pointer of each related node in the service queue.
And when the first service and the second service conflict, if the first service is not in the running state and the processing priority of the first service is higher than that of the second service, deleting the second service.
In the technical scheme, when the first service conflicts with the second service, comprehensive service conflict processing is performed by combining the operation state and the processing priority of the service, so that on one hand, the service conflict processing is more refined, the call completing rate and the success rate of the data service are improved, the smoothness of service operation is ensured, and the user experience is improved.
Optionally, the second service is inserted into a service queue when it is determined that there is no conflict between the first service and the second service. The manner of inserting the second service into the service queue is described in detail above, and is not described herein again.
Optionally, whether the service processing time of the service in the service queue is expired may be checked at a predetermined time interval, so that the expired service may be deleted, the service in the service queue is guaranteed to be a service that is running or is to be run after the current time, resource occupation of the service queue by the expired service is avoided, and maintenance of the service queue is facilitated.
In summary, in the above technical solution, the services of multiple cards are managed through one service queue, so that the services of multiple cards can be managed in a unified manner, and the conflict judgment is facilitated. Therefore, the method can be suitable for multiple layers in a protocol stack and has a wide application range. And then, when the conflict between the first service in the service queue and the second service to be inserted into the service queue is determined, the second service is inserted into the service queue or deleted according to a preset processing rule, on one hand, the phenomenon of service preemption or service interruption can not occur when the conflicting service is processed, and the use experience of a user is ensured. On the other hand, the maintenance of the high-level message and the service operation context which need to be responded in the prior art can not occur, the cache and the performance overhead are saved, the application range of the method is further widened, and the efficiency of service conflict processing is improved.
The present disclosure also provides a device for processing service conflict of the multi-card communication terminal. Fig. 5 is a block diagram of a service conflict processing apparatus of a multi-card communication terminal according to an embodiment of the disclosure, and as shown in fig. 5, the apparatus 10 includes:
a first determining module 100, configured to determine whether a first service and a second service conflict, where the first service is any service in a service queue, the second service is a service to be inserted into the service queue, and the service queue is used to store services of the multiple cards;
a first processing module 200, configured to insert the second service into the service queue or delete the second service according to a preset processing rule when the first determining module 100 determines that the first service and the second service conflict.
Optionally, the first processing module 200 includes:
a first deletion submodule for deleting the first deletion submodule according to the processing rule,
and when the first service and the second service conflict, if the first service is in a running state, deleting the second service.
Optionally, as shown in fig. 6, the apparatus 10 further includes:
a second determining module 300, configured to determine processing priorities of the first service and the second service;
the first processing module 200 includes:
a first insertion submodule 201 for inserting, according to said processing rule,
when the first service and the second service conflict, if the first service is not in an operating state and the processing priority of the second service is higher than that of the first service, inserting the second service into the service queue;
a second deletion submodule 202 for deleting, according to the processing rule,
and when the first service and the second service conflict, if the first service is not in the running state and the processing priority of the first service is higher than that of the second service, deleting the second service.
Optionally, as shown in fig. 7, the second determining module 300 includes:
a first obtaining submodule 301, configured to obtain weights of cards corresponding to the first service and the second service, respectively;
a first determining submodule 302, configured to determine a processing priority of the first service according to an initial priority corresponding to the first service and a weight of a card corresponding to the first service;
the second determining submodule 303 is configured to determine the processing priority of the second service according to the initial priority corresponding to the second service and the weight of the card corresponding to the second service.
Optionally, the apparatus 10 further comprises:
and the second processing module is used for deleting the first service which conflicts with the second service in the service queue after the first inserting sub-module inserts the second service into the service queue.
Optionally, the first plug-in sub-module comprises:
a second obtaining submodule, configured to obtain an initial execution time of the second service in a second network time base as a first initial execution time, where the second network time base is a network time base of a card corresponding to the second service;
the first conversion submodule is used for converting the first initial execution time into an initial execution time under a unified time base, and the initial execution time is used as a second initial execution time;
and the second inserting sub-module inserts the second service into the service queue according to the second initial execution time, wherein each service in the service queue is arranged in the sequence from early to late according to the respective initial execution time in the direction from the head of the queue to the tail of the queue.
Optionally, as shown in fig. 8, the first determining module 100 includes:
a third determining sub-module 101, configured to determine, under the condition that the cards corresponding to the first service and the second service are different, a service processing time of the first service in a first network time base and a service processing time of the second service in a second network time base, where the service processing time includes a start execution time and an end execution time, the end execution time is a sum of an actual end execution time of the service or the actual end execution time and a preset time corresponding to the service, the first network time base is a network time base of the card corresponding to the first service, and the second network time base is a network time base of the card corresponding to the second service;
a second conversion sub-module 102, configured to convert the service processing time of the first service and the service processing time of the second service into service processing times in a unified time base, respectively;
a fourth determining submodule 103, configured to determine whether there is a conflict between service processing times of the first service and the second service in the unified time base.
Fig. 9 is a block diagram illustrating a multi-card communication terminal 700 according to an example embodiment. As shown in fig. 9, the multi-card communication terminal 700 may include: a plurality of card slots, each for mounting a SIM (Subscriber identity Module), a processor 701, and a memory 702. The multi-card communication terminal 700 may also include one or more of a multimedia component 703, an input/output (I/O) interface 704, and a communication component 705.
The processor 701 is configured to control the overall operation of the multi-card communication terminal 700, so as to complete all or part of the steps in the service conflict processing method of the multi-card communication terminal. The memory 702 is used to store various types of data to support the operation of the multi-card communication terminal 700, such data may include, for example, instructions for any application or method operating on the multi-card communication terminal 700, as well as application-related data. The Memory 702 may be implemented by any type of volatile or non-volatile Memory device or combination thereof, such as Static Random Access Memory (SRAM), Electrically Erasable Programmable Read-Only Memory (EEPROM), Erasable Programmable Read-Only Memory (EPROM), Programmable Read-Only Memory (PROM), Read-Only Memory (ROM), magnetic Memory, flash Memory, magnetic disk, or optical disk. The multimedia components 703 may include screen and audio components. Wherein the screen may be, for example, a touch screen and the audio component is used for outputting and/or inputting audio signals. For example, the audio component may include a microphone for receiving external audio signals. The received audio signal may further be stored in the memory 702 or transmitted through the communication component 705. The audio assembly also includes at least one speaker for outputting audio signals. The I/O interface 704 provides an interface between the processor 701 and other interface modules, such as a keyboard, mouse, buttons, etc. These buttons may be virtual buttons or physical buttons. The communication component 705 is used for wired or wireless communication between the multi-card communication terminal 700 and other devices. Wireless Communication, such as Wi-Fi, bluetooth, Near Field Communication (NFC), 2G, 3G, or 4G, or a combination of one or more of them, so that the corresponding Communication component 705 may include: Wi-Fi module, bluetooth module, NFC module.
In an exemplary embodiment, the multi-card communication terminal 700 may be implemented by one or more Application Specific Integrated Circuits (ASICs), Digital Signal Processors (DSPs), Digital Signal Processing Devices (DSPDs), Programmable Logic Devices (PLDs), Field Programmable Gate Arrays (FPGAs), controllers, microcontrollers, microprocessors or other electronic components, for performing the above-mentioned service conflict Processing method of the multi-card communication terminal.
In another exemplary embodiment, there is also provided a computer-readable storage medium including program instructions, which when executed by a processor, implement the steps of the above-described service conflict processing method of a multi-card communication terminal. The program instructions may be executed by the processor 701 of the multi-card communication terminal 700 to implement the service conflict handling method of the multi-card communication terminal.
The preferred embodiments of the present disclosure are described in detail with reference to the accompanying drawings, however, the present disclosure is not limited to the specific details of the above embodiments, and various simple modifications may be made to the technical solution of the present disclosure within the technical idea of the present disclosure, and these simple modifications all belong to the protection scope of the present disclosure. It should be noted that the various features described in the above embodiments may be combined in any suitable manner without departing from the scope of the invention. In order to avoid unnecessary repetition, various possible combinations will not be separately described in this disclosure.
In addition, any combination of various embodiments of the present disclosure may be made, and the same should be considered as the disclosure of the present disclosure as long as it does not depart from the gist of the present disclosure.
Claims (14)
1. A method for processing service conflict of a multi-card communication terminal is characterized by comprising the following steps:
determining whether a first service and a second service conflict, wherein the first service is any service in a service queue, the second service is a service to be inserted into the service queue, and the service queue is used for storing the services of the multiple cards;
when the first service is determined to conflict with the second service, inserting the second service into the service queue or deleting the second service according to a preset processing rule;
the inserting the second service into the service queue includes:
acquiring the initial execution time of the second service in a second network time base as a first initial execution time, wherein the second network time base is the network time base of a card corresponding to the second service;
converting the first initial execution time into an initial execution time under a unified time base as a second initial execution time;
and inserting the second service into the service queue according to the second initial execution time, wherein the services in the service queue are arranged in the sequence from early to late according to the respective initial execution times in the direction from the head of the queue to the tail of the queue.
2. The method of claim 1, wherein the processing rule comprises:
and when the first service and the second service conflict, if the first service is in a running state, deleting the second service.
3. The method according to claim 1 or 2, characterized in that the method further comprises:
determining the processing priority of the first service and the second service;
the processing rule comprises:
when the first service and the second service conflict, if the first service is not in an operating state and the processing priority of the second service is higher than that of the first service, inserting the second service into the service queue;
and when the first service and the second service conflict, if the first service is not in the running state and the processing priority of the first service is higher than that of the second service, deleting the second service.
4. The method of claim 3, wherein the determining the processing priority of the first traffic and the second traffic comprises:
acquiring the weight of the card corresponding to the first service and the second service respectively;
determining the processing priority of the first service according to the initial priority corresponding to the first service and the weight of the card corresponding to the first service;
and determining the processing priority of the second service according to the initial priority corresponding to the second service and the weight of the card corresponding to the second service.
5. The method of claim 1, wherein after inserting the second service into the service queue, the method further comprises:
and deleting the first service which conflicts with the second service in the service queue.
6. The method of claim 1, wherein the determining whether the first service and the second service have a conflict comprises:
under the condition that the cards corresponding to the first service and the second service are different, respectively determining the service processing time of the first service in a first network time base and the service processing time of the second service in a second network time base, wherein the service processing time comprises a starting execution time and an ending execution time, the ending execution time is the sum of an actual ending execution time of the service or the sum of the actual ending execution time and a preset time corresponding to the service, the first network time base is the network time base of the card corresponding to the first service, and the second network time base is the network time base of the card corresponding to the second service;
respectively converting the service processing time of the first service and the service processing time of the second service into service processing time under a unified time base;
determining whether there is a conflict in the service processing times of the first service and the second service at the unified time base.
7. A service conflict processing apparatus of a multi-card communication terminal, the apparatus comprising:
a first determining module, configured to determine whether a first service and a second service conflict with each other, where the first service is any service in a service queue, the second service is a service to be inserted into the service queue, and the service queue is used to store services of the multiple cards;
the first processing module is used for inserting the second service into the service queue or deleting the second service according to a preset processing rule when the first determining module determines that the first service and the second service have conflict;
the first processing module comprises:
a second obtaining submodule, configured to obtain an initial execution time of the second service in a second network time base as a first initial execution time, where the second network time base is a network time base of a card corresponding to the second service;
the first conversion submodule is used for converting the first initial execution time into an initial execution time under a unified time base, and the initial execution time is used as a second initial execution time;
and the second inserting sub-module inserts the second service into the service queue according to the second initial execution time, wherein each service in the service queue is arranged in the sequence from early to late according to the respective initial execution time in the direction from the head of the queue to the tail of the queue.
8. The apparatus of claim 7, wherein the first processing module comprises:
a first deletion submodule for deleting the first deletion submodule according to the processing rule,
and when the first service and the second service conflict, if the first service is in a running state, deleting the second service.
9. The apparatus of claim 7 or 8, further comprising:
a second determining module, configured to determine processing priorities of the first service and the second service;
the first processing module comprises:
a first insertion submodule for inserting, in accordance with the processing rule,
when the first service and the second service conflict, if the first service is not in an operating state and the processing priority of the second service is higher than that of the first service, inserting the second service into the service queue;
a second deletion submodule for deleting the first deletion submodule according to the processing rule,
and when the first service and the second service conflict, if the first service is not in the running state and the processing priority of the first service is higher than that of the second service, deleting the second service.
10. The apparatus of claim 9, wherein the second determining module comprises:
the first obtaining submodule is used for obtaining the weight of the card corresponding to each of the first service and the second service;
the first determining submodule is used for determining the processing priority of the first service according to the initial priority corresponding to the first service and the weight of the card corresponding to the first service;
and the second determining submodule is used for determining the processing priority of the second service according to the initial priority corresponding to the second service and the weight of the card corresponding to the second service.
11. The apparatus of claim 7, further comprising:
and the second processing module is used for deleting the first service which conflicts with the second service in the service queue after the first processing module inserts the second service into the service queue.
12. The apparatus of claim 7, wherein the first determining module comprises:
a third determining sub-module, configured to determine, under a condition that cards corresponding to the first service and the second service are different, a service processing time of the first service in a first network time base and a service processing time of the second service in a second network time base, where the service processing times include a start execution time and an end execution time, the end execution time is a sum of an actual end execution time of the service or the actual end execution time and a preset time corresponding to the service, the first network time base is a network time base of the card corresponding to the first service, and the second network time base is a network time base of the card corresponding to the second service;
the second conversion submodule is used for respectively converting the service processing time of the first service and the service processing time of the second service into service processing time under a unified time base;
a fourth determining submodule, configured to determine whether there is a conflict between service processing times of the first service and the second service in the unified time base.
13. A computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out the steps of the method according to any one of claims 1 to 6.
14. A multi-card communication terminal, comprising:
a plurality of card slots, each for mounting a SIM card;
a memory having a computer program stored thereon; and
one or more processors for executing a computer program in said memory, implementing the method of any of claims 1-6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810108017.7A CN110139320B (en) | 2018-02-02 | 2018-02-02 | Method, device, medium and terminal for processing service conflict of multi-card communication terminal |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810108017.7A CN110139320B (en) | 2018-02-02 | 2018-02-02 | Method, device, medium and terminal for processing service conflict of multi-card communication terminal |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110139320A CN110139320A (en) | 2019-08-16 |
| CN110139320B true CN110139320B (en) | 2022-09-02 |
Family
ID=67567184
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810108017.7A Active CN110139320B (en) | 2018-02-02 | 2018-02-02 | Method, device, medium and terminal for processing service conflict of multi-card communication terminal |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110139320B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112579652B (en) * | 2020-12-28 | 2024-04-09 | 咪咕文化科技有限公司 | Method and device for deleting cache data, electronic equipment and storage medium |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101184292A (en) * | 2007-12-13 | 2008-05-21 | 展讯通信（上海）有限公司 | Method of solving service collision of dual-card dual-standby mobile phone |
| CN101203005A (en) * | 2007-12-13 | 2008-06-18 | 展讯通信（上海）有限公司 | Method for solving single chip double card double mobile phone major-minor card wave carrier conflict |
| CN101217745A (en) * | 2008-01-11 | 2008-07-09 | 展讯通信（上海）有限公司 | A single chip dual-card dual-standby mobile telephone |
| CN101965055A (en) * | 2010-10-21 | 2011-02-02 | 展讯通信（上海）有限公司 | Method and device for solving mobile phone service conflict |
| CN101997996A (en) * | 2009-08-13 | 2011-03-30 | 华为技术有限公司 | Method and device for queuing routing |
| CN102883471A (en) * | 2012-08-30 | 2013-01-16 | 锐迪科科技有限公司 | Single-chip, multi-card and multi-standby mobile phone as well as conflict resolution method thereof |
| CN103906255A (en) * | 2012-12-28 | 2014-07-02 | 展讯通信（上海）有限公司 | Multi-card multi-standby communication terminal and receiving and sending conflict processing method and device thereof |
| WO2014113325A1 (en) * | 2013-01-16 | 2014-07-24 | Qualcomm Incorporated | Apparatus and method for mitigating voltage droop in dual-transceiver wireless communication device |
| CN104144406A (en) * | 2013-05-07 | 2014-11-12 | 马维尔国际有限公司 | Multi-mode multi-card mobile terminal and business conflict solution method and apparatus thereof |
| CN104684023A (en) * | 2013-12-03 | 2015-06-03 | 联芯科技有限公司 | Method and device for resolving dual-card-dual-standby service conflict in mobile terminal |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9084288B2 (en) * | 2013-03-14 | 2015-07-14 | Qualcomm Incorporated | Dual-SIM wireless communications device and method for mitigating receiver desense in dual-active operation |
| US9480102B2 (en) * | 2014-03-05 | 2016-10-25 | Apple Inc. | Resolving cycle conflicts between multiple RATs sharing a radio of a UE |
| US9544937B2 (en) * | 2014-03-27 | 2017-01-10 | Apple Inc. | Performing data communication using a first RAT while performing a voice call using a second RAT |
-
2018
- 2018-02-02 CN CN201810108017.7A patent/CN110139320B/en active Active
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101184292A (en) * | 2007-12-13 | 2008-05-21 | 展讯通信（上海）有限公司 | Method of solving service collision of dual-card dual-standby mobile phone |
| CN101203005A (en) * | 2007-12-13 | 2008-06-18 | 展讯通信（上海）有限公司 | Method for solving single chip double card double mobile phone major-minor card wave carrier conflict |
| CN101217745A (en) * | 2008-01-11 | 2008-07-09 | 展讯通信（上海）有限公司 | A single chip dual-card dual-standby mobile telephone |
| CN101997996A (en) * | 2009-08-13 | 2011-03-30 | 华为技术有限公司 | Method and device for queuing routing |
| CN101965055A (en) * | 2010-10-21 | 2011-02-02 | 展讯通信（上海）有限公司 | Method and device for solving mobile phone service conflict |
| CN102883471A (en) * | 2012-08-30 | 2013-01-16 | 锐迪科科技有限公司 | Single-chip, multi-card and multi-standby mobile phone as well as conflict resolution method thereof |
| CN103906255A (en) * | 2012-12-28 | 2014-07-02 | 展讯通信（上海）有限公司 | Multi-card multi-standby communication terminal and receiving and sending conflict processing method and device thereof |
| WO2014113325A1 (en) * | 2013-01-16 | 2014-07-24 | Qualcomm Incorporated | Apparatus and method for mitigating voltage droop in dual-transceiver wireless communication device |
| CN104144406A (en) * | 2013-05-07 | 2014-11-12 | 马维尔国际有限公司 | Multi-mode multi-card mobile terminal and business conflict solution method and apparatus thereof |
| CN104684023A (en) * | 2013-12-03 | 2015-06-03 | 联芯科技有限公司 | Method and device for resolving dual-card-dual-standby service conflict in mobile terminal |
Non-Patent Citations (1)
| Title |
|---|
| "双卡双待移动终端主辅卡倒换过程研究";赵建川 段红光;《数字通信》;20131225;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110139320A (en) | 2019-08-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108024270B (en) | Information sending method, unit and system | |
| CN110519709B (en) | Context management method and device | |
| CN109548109B (en) | Processing method and device for mismatching of UE and network state and storage medium | |
| JP2022513083A (en) | Time-dependent networking Communication methods and equipment | |
| CN107105427B (en) | Communication method and device based on channel SIM card | |
| US10455509B2 (en) | Energy efficient data handling for mobile devices | |
| CN107509240B (en) | Subscriber Identity Module control method, mobile terminal and computer readable storage medium | |
| CN109891830B (en) | Function scheduling method, device and system | |
| CN103167610A (en) | Intelligent resource control in multiple sim user equipment | |
| CN103167481B (en) | Periodic registration for many sim user upgrades | |
| US20220417944A1 (en) | Communication method and related apparatus | |
| CN108668331B (en) | Task scheduling method and device for multimode equipment | |
| CN110859012A (en) | Method, device and system for rate control | |
| US10740161B2 (en) | Broadcast message sending method and apparatus, and mobile terminal | |
| CN110139320B (en) | Method, device, medium and terminal for processing service conflict of multi-card communication terminal | |
| US9049580B2 (en) | QUALCOMM chat mobile terminal update and authentication method and mobile terminal | |
| CN113784419B (en) | Information sending method, unit and system | |
| CN113261249A (en) | Data transmission method, related equipment and computer storage medium | |
| CN103167452A (en) | Background paging monitoring for multiple SIM user equipment | |
| WO2021087811A1 (en) | Auxiliary information transmission method, apparatus, terminal, access network device and storage medium | |
| CN105009097A (en) | Message transmission device, message transmission method, and message transmission program | |
| CN111757386B (en) | Download control method and device | |
| WO2023050033A1 (en) | Service control timer control method and apparatus, device, and storage medium | |
| CN114071658B (en) | Registration method and device of terminal equipment | |
| WO2024011618A1 (en) | Resource activation method and apparatus, and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| CB02 | Change of applicant information | ||
| CB02 | Change of applicant information |
Address after: 100085 unit C, building C, lin66, Zhufang Road, Qinghe, Haidian District, Beijing Applicant after: Beijing Xiaomi pinecone Electronic Co.,Ltd. Address before: 100085 Beijing city Haidian District Qinghe Shun Yip things Park Building 3 unit A Applicant before: BEIJING PINECONE ELECTRONICS Co.,Ltd. |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant |