CN117785392A - Process scheduling method, device, equipment, storage medium and vehicle - Google Patents
Process scheduling method, device, equipment, storage medium and vehicle Download PDFInfo
- Publication number
- CN117785392A CN117785392A CN202211145141.3A CN202211145141A CN117785392A CN 117785392 A CN117785392 A CN 117785392A CN 202211145141 A CN202211145141 A CN 202211145141A CN 117785392 A CN117785392 A CN 117785392A
- Authority
- CN
- China
- Prior art keywords
- priority
- target
- request
- scheduling
- modifying
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 372
- 230000008569 process Effects 0.000 title claims abstract description 323
- 238000012545 processing Methods 0.000 claims description 14
- 238000004590 computer program Methods 0.000 claims description 13
- 238000010586 diagram Methods 0.000 description 13
- 238000004891 communication Methods 0.000 description 9
- 238000013507 mapping Methods 0.000 description 8
- 238000011084 recovery Methods 0.000 description 5
- 230000006870 function Effects 0.000 description 4
- 230000004048 modification Effects 0.000 description 4
- 238000012986 modification Methods 0.000 description 4
- 230000003287 optical effect Effects 0.000 description 4
- 230000009471 action Effects 0.000 description 3
- 230000001133 acceleration Effects 0.000 description 2
- 238000007792 addition Methods 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 230000008878 coupling Effects 0.000 description 1
- 238000010168 coupling process Methods 0.000 description 1
- 238000005859 coupling reaction Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 239000000835 fiber Substances 0.000 description 1
- 230000005055 memory storage Effects 0.000 description 1
- 230000002093 peripheral effect Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The embodiment of the application provides a process scheduling method, a device, equipment, a storage medium and a vehicle, wherein the process scheduling method comprises the following steps: when a target request sent by a first process to a second process is obtained, a first priority of the second process is obtained, and the target request comprises a target service; acquiring a target priority of a target request from a preset corresponding relation between the request and the priority; modifying the first priority of the second process to a target priority; the second process is scheduled with the target priority such that the second process processes the target traffic in the target request. According to the method and the device for scheduling the process, the scheduling priority of the process can be flexibly and finely adjusted according to the importance degree of the target service in the request, so that the process is scheduled more reasonably.
Description
Technical Field
The application belongs to the technical field of communication, and particularly relates to a process scheduling method, a device, equipment, a storage medium and a vehicle.
Background
In a computer system, a scheduler is required to schedule processes with different priorities, and the higher the priority, the more preferentially the processes are scheduled by the scheduler.
In the prior art, the priority of each process is pre-allocated, and when the scheduler schedules the process, the scheduler cannot flexibly and finely adjust the priority of the process, so that the process cannot be scheduled reasonably.
Disclosure of Invention
The embodiment of the application provides a process scheduling method, a device, equipment, a storage medium and a vehicle, which can solve the problem that the priority of a process cannot be flexibly and finely adjusted in the prior art.
In a first aspect, an embodiment of the present application provides a process scheduling method, where the process scheduling method includes:
when a target request sent by a first process to a second process is obtained, a first priority of the second process is obtained, and the target request comprises a target service;
acquiring a target priority of a target request from a preset corresponding relation between the request and the priority;
modifying the first priority of the second process to a target priority;
the second process is scheduled with the target priority such that the second process processes the target traffic in the target request.
In one embodiment, modifying the first priority of the second process to the target priority includes:
in the case that the target priority is higher than the first priority of the second process, the first priority of the second process is modified to the target priority.
In one embodiment, modifying the first priority of the second process to the target priority includes:
and modifying the first priority of the second process to be the target priority under the condition that the second process is in an inactive state.
In one embodiment, after the second process is scheduled with the target priority such that the second process processes the target traffic in the target request, the process scheduling method further comprises:
and when receiving the message of ending the processing of the target service, restoring the priority of the second process to the first priority.
In one embodiment, the target priority is lower than or equal to the priority of the first process.
In one embodiment, the process scheduling method further includes:
and in the case that the target priority is lower than or equal to the first priority, scheduling the second process with the first priority so that the second process processes the target service in the target request.
In a second aspect, an embodiment of the present application provides a process scheduling apparatus, including:
the acquisition module is used for acquiring the first priority of the second process when acquiring a target request sent by the first process to the second process, wherein the target request comprises a target service;
the acquisition module is also used for acquiring the target priority of the target request from the preset corresponding relation between the request and the priority;
the modification module is used for modifying the first priority of the second process into the target priority;
and the scheduling module is used for scheduling the second process according to the target priority so that the second process processes the target service in the target request.
In one embodiment, the modifying module is further configured to modify the first priority of the second process to the target priority if the target priority is higher than the first priority of the second process.
In one embodiment of the present invention, in one embodiment,
and the modification module is also used for modifying the first priority of the second process into the target priority under the condition that the second process is in an inactive state.
In one embodiment, the process scheduling apparatus further comprises a recovery module;
and the recovery module is used for recovering the priority of the second process to the first priority when receiving the message of ending the processing of the target service after the second process is scheduled with the second priority to enable the second process to process the target service in the request.
In one embodiment, the target priority is lower than or equal to the priority of the first process.
In one embodiment, the scheduling module is further configured to schedule the second process with the first priority, so that the second process processes the target service in the target request, if the target priority is lower than or equal to the first priority.
In a third aspect, an embodiment of the present application provides an electronic device, including: a processor and a memory storing computer program instructions;
the processor when executing the computer program instructions implements a process scheduling method as in any of the embodiments of the first aspect.
In a fourth aspect, embodiments of the present application provide a computer storage medium having stored thereon computer program instructions which, when executed by a processor, implement a process scheduling method as in any of the embodiments of the first aspect.
In a fifth aspect, embodiments of the present application provide a vehicle comprising at least one of:
the process scheduling apparatus of the second aspect;
an electronic device as in the third aspect;
the computer storage medium of the fourth aspect.
According to the process scheduling method, device, equipment, storage medium and vehicle, when the target request sent by the first process to the second process is obtained, the first priority of the second process is obtained, the target request comprises target service, and the target priority of the target request is obtained from the preset corresponding relation between the request and the priority, so that the mapping relation between the request and the priority can be preset according to the importance degree of the request, and the target priority of the target service requirement is sent to the second process through the target request. The first priority of the second process is modified to be the target priority, so that the second process is scheduled to process the target service in the target request according to the target priority, and the scheduling priority of the process can be flexibly and finely adjusted according to the importance degree of the request, so that the process is scheduled more reasonably.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings that are needed in the embodiments of the present application will be briefly described, and it is possible for a person skilled in the art to obtain other drawings according to these drawings without inventive effort.
FIG. 1 is a flow diagram of a process scheduling method according to one embodiment of the present application;
FIG. 2 is a schematic diagram of process priority changes provided by one embodiment of the present application;
FIG. 3 is a schematic diagram of a process scheduling apparatus according to an embodiment of the present application;
fig. 4 is a schematic structural diagram of an electronic device according to an embodiment of the present application.
Detailed Description
In order that the above objects, features and advantages of the present disclosure may be more clearly understood, a further description of aspects of the present disclosure will be provided below. It should be noted that, without conflict, the embodiments of the present disclosure and features in the embodiments may be combined with each other.
In the following description, numerous specific details are set forth in order to provide a thorough understanding of the present disclosure, but the present disclosure may be practiced otherwise than as described herein; it will be apparent that the embodiments in the specification are only some, but not all, embodiments of the disclosure.
It should be noted that in this document, relational terms such as "first" and "second" and the like are used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Moreover, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising one … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.
As described in the background, in a computer system, a scheduler is required to schedule processes with different priorities, and a process with a higher priority is scheduled by the scheduler more preferentially. The inventor discovers that in the prior art, the priority of each process is pre-allocated, and when the scheduler schedules the process, the scheduler cannot flexibly and finely adjust the priority of the process, so that the process cannot be reasonably scheduled. In order to solve the above-mentioned problems, the embodiments of the present application provide a process scheduling method, apparatus, device, and computer storage medium, where the process scheduling method may obtain, when a target request sent by a first process to a second process is obtained, a first priority of the second process, where the target request includes a target service, and obtain, from a preset correspondence between the request and the priority, a target priority of the target request, so that a mapping relationship between the request and the priority may be preset according to an importance degree of the request, and send, by the target request, the target priority of a target service requirement to the second process. The first priority of the second process is modified to be the target priority, so that the second process is scheduled to process the target service in the target request according to the target priority, and the scheduling priority of the process can be flexibly and finely adjusted according to the importance degree of the request, so that the process is scheduled more reasonably. The following first describes a process scheduling method provided in the embodiments of the present application, where the process scheduling method may be specifically executed by a scheduler.
Fig. 1 is a flow chart of a process scheduling method according to an embodiment of the present application.
As shown in fig. 1, the method specifically includes the following steps:
s110, when a target request sent by a first process to a second process is obtained, a first priority of the second process is obtained, and the target request comprises a target service.
The first process and the second process may be execution processes of programs in an operating system, and the first process sends a target request to the second process, where the target request may be an Inter-process communication (Inter-Process Communication, IPC) request. When a target request sent by a first process to a second process is acquired, a first priority of the second process is acquired, wherein the target request can comprise a target service, and the target service can be a specific service to be processed in the target request. The first priority may be a current scheduling priority of the second process, for example, when receiving a request sent by the process a to the process B, the current scheduling priority Pb of the process B is acquired to be 2.
As an example, when the process a sends a request to the process B through the kernel of the operating system, the process a first sends the request to the kernel of the operating system, where the request includes a service specifically processed by the process B. When the kernel receives the request, the current scheduling priority Pb of the process B is acquired.
S120, acquiring the target priority of the target request from the preset corresponding relation between the request and the priority.
The preset corresponding relation can be a mapping rule of a request and a priority set in advance by a user, and the preset corresponding relation comprises a target priority corresponding to the target request. For example, m types of requests are divided into n groups according to importance degrees, the n groups of requests are set to be different priorities, the corresponding relation between the requests and the priorities is obtained, and the corresponding relation is configured in a kernel of an operating system.
As one example, the air conditioner on request, the air conditioner off request, the acceleration request, and the turning request are divided into 2 groups according to importance degrees, wherein the air conditioner on request and the air conditioner off request are the first group, and the priority is 1; the acceleration request and the steering request are in the second group, and the priority is 0. In this way, the priority of the second group is higher than that of the first group, and the priority corresponding to the request in the first group is 1, and the priority corresponding to the request in the second group is 2, that is, the corresponding relation between the request and the priority is obtained. The priority corresponding to any request can be obtained from the correspondence. S130, modifying the first priority of the second process to be the target priority.
The first priority of the second process is the current priority of the second process, and the current priority of the second process is modified to be the target priority.
And S140, scheduling the second process according to the target priority so that the second process processes the target service in the target request.
After modifying the priority of the second process to the target priority, scheduling the second process with the target priority for the second process to process the target service in the target request.
In the embodiment of the present application, when the target request sent by the first process to the second process is obtained, the first priority of the second process is obtained, the target request includes the target service, and the target priority of the target request is obtained from the preset corresponding relationship between the request and the priority, so that the mapping relationship between the request and the priority can be preset according to the importance degree of the request, and the target priority of the target service requirement is sent to the second process through the target request. The first priority of the second process is modified to be the target priority, so that the second process is scheduled to process the target service in the target request according to the target priority, and the scheduling priority of the process can be flexibly and finely adjusted according to the importance degree of the request, so that the process is scheduled more reasonably.
In some embodiments, S120: modifying the first priority of the second process to the target priority may specifically include:
in the case that the target priority is higher than the first priority of the second process, the first priority of the second process is modified to the target priority.
And judging whether the first priority of the second process is lower than the target priority, and if the first priority is lower than the target priority (the target priority is higher than the first priority), modifying the first priority into the target priority.
As an example, when the kernel of the operating system receives a request sent by a process a to a process B, the current priority Pb of the process B is obtained, and the priority Pc corresponding to the request is obtained from a mapping table of the request and the priority, if the priority Pc is higher than the priority Pb, the priority Pc of the process B is modified to Pc by a scheduling function (e.g., a scheduler) of the kernel, and the process B is scheduled with the priority Pc.
In addition, based on the instruction p_cmd of the command priority carried in the request, the priority of the process B may be modified to pb_cmd (the higher of p_cmd and Pb is taken), and the process B may be scheduled with the higher of p_cmd and Pb. In addition, if no command priority instruction exists in the request, the priority of the process B is not influenced, and the process B is scheduled with the default priority Pb.
In the embodiment of the application, the first priority of the second process is modified to the target priority under the condition that the target priority is higher than the first priority of the second process, so that the priority of the process can be modified according to the process scheduling priority required by the request, the scheduling priority of the second process can be temporarily changed when the second process processes the request, and the flexibility of adjusting the scheduling priority of the process is improved.
In some embodiments, S120: modifying the first priority of the second process to the target priority may specifically include:
and modifying the first priority of the second process to be the target priority under the condition that the second process is in an inactive state.
The inactive state may be a dormant state of the second process, and the first priority of the second process is modified to the target priority if the second process is in the inactive state.
As an example, when the kernel of the operating system receives a request sent by the process a to the process B, it is determined whether the process B is in a sleep state, if so, the priority of the process B is modified to the priority Pc corresponding to the request by the scheduler in the kernel, and the process B is scheduled with the priority Pc.
In some embodiments, the first priority is compared with the target priority when the second process is in an inactive state, and the first priority of the second process is modified to the target priority when the target priority is higher than the first priority.
As an example, when the kernel of the operating system receives a request sent by a process a to a process B, it is determined whether the process B is in a sleep state, if so, the current priority Pb of the process B is compared with the priority Pc corresponding to the request by the scheduler in the kernel, and if the priority Pc is higher than the current priority Pb of the process B, the priority of the process B is modified to be the priority Pc, and the process B is scheduled with the priority Pc.
In the embodiment of the application, the first priority of the second process is modified to the target priority under the condition that the second process is in the non-working state, so that the current service of the second process is ensured not to be interrupted, and the process is more reasonably scheduled.
In some embodiments, at S140: the second process is scheduled with the target priority, so that after the second process processes the target service in the target request, the process scheduling method may further include:
and when receiving the message of ending the processing of the target service, restoring the priority of the second process to the first priority.
At the end of processing the target traffic in the target request, the priority of the second process is restored to the first priority before processing the target traffic of the target request.
As an example, as shown in fig. 2, the scheduler receives a request sent by a process a to a process B, acquires a priority Pc corresponding to the request from a mapping table of the request and modifies the process B to schedule with the priority Pc at a time T0. At time T1, the traffic processing in the request ends and process B reverts to its default priority Pb.
In this embodiment of the present application, after the second process is scheduled with the target priority, so that the second process processes the target service in the target request, when a message that the processing of the target service is finished is received, the priority of the second process is restored to the first priority, so that when the first process or other processes except the first process send the target request to the second process, the comparison with the first priority of the second process can be facilitated.
In some embodiments, the target priority is lower than or equal to the priority of the first process.
When the first process sends a target request to the second process, the target priority corresponding to the target request is set to be lower than or equal to the priority of the first process.
As an example, first, the process priorities P0 and P1 … … Pn are defined, the priorities are sequentially reduced, and assuming that the priorities of the process a and the process B are Pa and Pb, respectively, when the process a sends a request to the process B, the priority Pc corresponding to the request is set to satisfy Pa > =pc > =pn, that is, the priority of the request sent by the process a needs to be lower than or equal to the priority of the process a, and the request is transmitted to the scheduler.
In the embodiment of the present application, the target priority is lower than or equal to the priority of the first process, so that it can be avoided that the process with low priority can modify the priority of the process with high priority at will.
In some embodiments, the process scheduling method may further include:
and in the case that the target priority is lower than or equal to the first priority, scheduling the second process with the first priority so that the second process processes the target service in the target request.
If the target priority is lower than or equal to the first priority of the second process, the first priority is not modified, and the second process is still scheduled with the first priority.
As an example, the kernel of the operating system receives a request sent by the process a to the process B, and obtains the priority Pc corresponding to the request from the mapping table of the request and the priority, at this time, obtains the current priority Pb of the process B, compares the priority Pc with the current priority Pb of the process B through the scheduler in the kernel, and if the priority Pc is lower than or equal to the current priority Pb of the process B, does not modify the priority of the process B, and schedules the process B with the priority Pb.
In the embodiment of the application, the second process is scheduled with the first priority under the condition that the target priority is lower than or equal to the first priority, so that the second process processes the target service in the target request, and the process priority is not modified under the condition that the importance degree of the service in the specific request sent among the processes is not high, so that the adjustment of the accuracy process priority of the request is realized.
Fig. 3 is a schematic diagram illustrating a process scheduler 300 according to an example embodiment.
As shown in fig. 3, the process scheduling apparatus 300 may include:
the acquiring module 301 is configured to acquire a first priority of a second process when acquiring a target request sent by the first process to the second process, where the target request includes a target service;
the obtaining module 301 is further configured to obtain a target priority of the target request from a preset correspondence between the request and the priority;
a modifying module 302, configured to modify the first priority of the second process to a target priority;
a scheduling module 303, configured to schedule the second process with the target priority, so that the second process processes the target service in the target request.
In one embodiment, the modifying module 302 is further configured to modify the first priority of the second process to the target priority if the target priority is higher than the first priority of the second process.
In one embodiment, the modifying module 302 is further configured to modify the first priority of the second process to the target priority when the second process is in an inactive state.
In one embodiment, the process scheduler 300 may further include a recovery module;
and the recovery module is used for recovering the priority of the second process to the first priority when receiving the message of ending the processing of the target service after the second process is scheduled with the second priority to enable the second process to process the target service in the request.
In one embodiment, the target priority is lower than or equal to the priority of the first process.
In one embodiment, the scheduling module 303 is further configured to schedule the second process with the first priority, so that the second process processes the target service in the target request if the target priority is lower than or equal to the first priority.
Because, when the target request sent by the first process to the second process is obtained, the first priority of the second process is obtained, the target request includes the target service, and the target priority of the target request is obtained from the preset corresponding relation between the request and the priority, the mapping relation between the request and the priority can be preset according to the importance degree of the request, and the target priority of the target service requirement is sent to the second process through the target request. The first priority of the second process is modified to be the target priority, so that the second process is scheduled to process the target service in the target request according to the target priority, and the scheduling priority of the process can be flexibly and finely adjusted according to the importance degree of the request, so that the process is scheduled more reasonably.
Fig. 4 shows a schematic diagram of a hardware structure of an electronic device according to an embodiment of the present application.
A processor 401 may be included in an electronic device as well as a memory 402 in which computer program instructions are stored.
In particular, the processor 401 described above may include a Central Processing Unit (CPU), or an application specific integrated circuit (Application Specific Integrated Circuit, ASIC), or may be configured to implement one or more integrated circuits of embodiments of the present application.
Memory 402 may include mass storage for data or instructions. By way of example, and not limitation, memory 402 may comprise a Hard Disk Drive (HDD), floppy Disk Drive, flash memory, optical Disk, magneto-optical Disk, magnetic tape, or universal serial bus (Universal Serial Bus, USB) Drive, or a combination of two or more of the foregoing. Memory 402 may include removable or non-removable (or fixed) media, where appropriate. Memory 402 may be internal or external to the integrated gateway disaster recovery device, where appropriate. In a particular embodiment, the memory 402 is a non-volatile solid state memory.
The memory may include Read Only Memory (ROM), random Access Memory (RAM), magnetic disk storage media devices, optical storage media devices, flash memory devices, electrical, optical, or other physical/tangible memory storage devices. Thus, in general, the memory includes one or more tangible (non-transitory) computer-readable storage media (e.g., memory devices) encoded with software comprising computer-executable instructions and when the software is executed (e.g., by one or more processors) it is operable to perform the operations described with reference to methods in accordance with aspects of the present disclosure.
The processor 401 implements any of the process scheduling methods of the above embodiments by reading and executing computer program instructions stored in the memory 402.
In one example, the electronic device may also include a communication interface 403 and a bus 410. As shown in fig. 4, the processor 401, the memory 402, and the communication interface 403 are connected by a bus 410 and perform communication with each other.
The communication interface 403 is mainly used to implement communication between each module, device, unit and/or apparatus in the embodiments of the present application.
Bus 410 includes hardware, software, or both, coupling the components of the process scheduling device to each other. By way of example, and not limitation, the buses may include an Accelerated Graphics Port (AGP) or other graphics bus, an Enhanced Industry Standard Architecture (EISA) bus, a Front Side Bus (FSB), a HyperTransport (HT) interconnect, an Industry Standard Architecture (ISA) bus, an infiniband interconnect, a Low Pin Count (LPC) bus, a memory bus, a micro channel architecture (MCa) bus, a Peripheral Component Interconnect (PCI) bus, a PCI-Express (PCI-X) bus, a Serial Advanced Technology Attachment (SATA) bus, a video electronics standards association local (VLB) bus, or other suitable bus, or a combination of two or more of the above. Bus 410 may include one or more buses, where appropriate. Although embodiments of the present application describe and illustrate a particular bus, the present application contemplates any suitable bus or interconnect.
The electronic device may acquire the first priority of the second process based on when acquiring the target request sent by the first process to the second process, where the target request includes the target service to execute the process scheduling method in the embodiment of the present application, so as to implement the process scheduling method described in connection with fig. 1.
In addition, in combination with the process scheduling method in the above embodiment, the embodiment of the application may be implemented by providing a computer storage medium. The computer storage medium has stored thereon computer program instructions; the computer program instructions, when executed by a processor, implement any of the process scheduling methods of the above embodiments.
The embodiment of the invention also provides a vehicle which at least comprises at least one of the process scheduling device, the electronic equipment and the computer storage medium.
It should be clear that the present application is not limited to the particular arrangements and processes described above and illustrated in the drawings. For the sake of brevity, a detailed description of known methods is omitted here. In the above embodiments, several specific steps are described and shown as examples. However, the method processes of the present application are not limited to the specific steps described and illustrated, and those skilled in the art can make various changes, modifications, and additions, or change the order between steps, after appreciating the spirit of the present application.
The functional blocks shown in the above-described structural block diagrams may be implemented in hardware, software, firmware, or a combination thereof. When implemented in hardware, it may be, for example, an electronic circuit, an Application Specific Integrated Circuit (ASIC), suitable firmware, a plug-in, a function card, or the like. When implemented in software, the elements of the present application are the programs or code segments used to perform the required tasks. The program or code segments may be stored in a machine readable medium or transmitted over transmission media or communication links by a data signal carried in a carrier wave. A "machine-readable medium" may include any medium that can store or transfer information. Examples of machine-readable media include electronic circuitry, semiconductor memory devices, ROM, flash memory, erasable ROM (EROM), floppy disks, CD-ROMs, optical disks, hard disks, fiber optic media, radio Frequency (RF) links, and the like. The code segments may be downloaded via computer networks such as the internet, intranets, etc.
It should also be noted that the exemplary embodiments mentioned in this application describe some methods or systems based on a series of steps or devices. However, the present application is not limited to the order of the above-described steps, that is, the steps may be performed in the order mentioned in the embodiments, may be different from the order in the embodiments, or several steps may be performed simultaneously.
Aspects of the present disclosure are described above with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the disclosure. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, enable the implementation of the functions/acts specified in the flowchart and/or block diagram block or blocks. Such a processor may be, but is not limited to being, a general purpose processor, a special purpose processor, an application specific processor, or a field programmable logic circuit. It will also be understood that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware which performs the specified functions or acts, or combinations of special purpose hardware and computer instructions.
In the foregoing, only the specific embodiments of the present application are described, and it will be clearly understood by those skilled in the art that, for convenience and brevity of description, the specific working processes of the systems, modules and units described above may refer to the corresponding processes in the foregoing method embodiments, which are not repeated herein. It should be understood that the scope of the present application is not limited thereto, and any person skilled in the art can easily conceive various equivalent modifications or substitutions within the technical scope of the present application, which are intended to be included in the scope of the present application.
Claims (10)
1. A process scheduling method, comprising:
when a target request sent by a first process to a second process is obtained, obtaining a first priority of the second process, wherein the target request comprises a target service;
acquiring a target priority of the target request from a preset corresponding relation between the request and the priority;
modifying the first priority of the second process to the target priority;
and scheduling the second process with the target priority so that the second process processes the target service in the target request.
2. The method of claim 1, wherein modifying the first priority of the second process to the target priority comprises:
and modifying the first priority of the second process to the target priority in the case that the target priority is higher than the first priority of the second process.
3. The method of claim 1, wherein modifying the first priority of the second process to the target priority comprises:
and under the condition that the second process is in an inactive state, modifying the first priority of the second process to the target priority.
4. The method of claim 1, wherein after the scheduling of the second process with the target priority to cause the second process to process the target traffic in the target request, the method further comprises:
and when receiving the message of ending the processing of the target service, restoring the priority of the second process to the first priority.
5. The method of claim 1, wherein the target priority is lower than or equal to a priority of the first process.
6. The method according to claim 1, wherein the method further comprises:
and when the target priority is lower than or equal to the first priority, scheduling the second process with the first priority so that the second process processes the target service in the target request.
7. A process scheduling apparatus, the apparatus comprising:
the system comprises an acquisition module, a processing module and a processing module, wherein the acquisition module is used for acquiring a first priority of a second process when acquiring a target request sent by the first process to the second process, and the target request comprises a target service;
the acquisition module is further used for acquiring the target priority of the target request from a preset corresponding relation between the request and the priority;
a modifying module, configured to modify the first priority of the second process to the target priority;
and the scheduling module is used for scheduling the second process according to the target priority so that the second process processes the target service in the target request.
8. An electronic device, the device comprising: a processor and a memory storing computer program instructions; the processor reads and executes the computer program instructions to implement a process scheduling method according to any of claims 1-6.
9. A computer storage medium having stored thereon computer program instructions which, when executed by a processor, implement a process scheduling method according to any one of claims 1-6.
10. A vehicle, comprising at least one of:
the process scheduling apparatus of claim 7;
the electronic device of claim 8;
the computer storage medium of claim 9.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211145141.3A CN117785392A (en) | 2022-09-20 | 2022-09-20 | Process scheduling method, device, equipment, storage medium and vehicle |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211145141.3A CN117785392A (en) | 2022-09-20 | 2022-09-20 | Process scheduling method, device, equipment, storage medium and vehicle |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN117785392A true CN117785392A (en) | 2024-03-29 |
Family
ID=90382098
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211145141.3A Pending CN117785392A (en) | 2022-09-20 | 2022-09-20 | Process scheduling method, device, equipment, storage medium and vehicle |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117785392A (en) |
-
2022
- 2022-09-20 CN CN202211145141.3A patent/CN117785392A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN113852563B (en) | Message data transmission method and device, terminal equipment and readable storage medium | |
| CN114884912A (en) | Communication method, system, equipment and computer readable storage medium of SOA architecture | |
| CN117785392A (en) | Process scheduling method, device, equipment, storage medium and vehicle | |
| CN116708576A (en) | Service providing method, device, equipment and computer readable storage medium | |
| CN111698786A (en) | Power distribution method, device, equipment and storage medium | |
| CN114945038A (en) | Communication method, system, equipment and readable storage medium based on SOA architecture | |
| CN117667320A (en) | Task processing method, device, equipment, medium and vehicle | |
| EP2955677A1 (en) | Apparatus and method for processing card information | |
| CN114828218A (en) | Method for determining validity of reference signal transmission opportunity and user equipment | |
| CN114710450B (en) | Flow control method, device, equipment and computer storage medium | |
| CN117950729A (en) | Command execution method and device of RTOS (real time operating System), electronic equipment, medium and vehicle | |
| CN108519859B (en) | Data reading method, device, equipment and medium | |
| CN108965214B (en) | Data processing method, device and computer storage medium | |
| CN116931987A (en) | Vehicle-mounted controller updating method and device | |
| CN117749671A (en) | Data packet query method, device, equipment, storage medium and vehicle | |
| CN116049911B (en) | Method, device, equipment and computer storage medium for generating equipment identifier | |
| CN117134845A (en) | Interference identification method, device, equipment and computer readable storage medium | |
| CN116781621A (en) | Transaction flow limiting method, device, equipment and computer storage medium | |
| CN103605622A (en) | Method and equipment for data transmission | |
| CN118012651A (en) | Method, device, equipment, medium and vehicle for determining control quantity of hardware resources | |
| CN117149366A (en) | Task scheduling method, device, equipment and storage medium | |
| CN117992186A (en) | Interrupt processing method, device, equipment, storage medium and vehicle | |
| CN115543594A (en) | Storage resource allocation method, device, equipment and storage medium | |
| CN118068739A (en) | Scheduling method and device of electronic control unit and related equipment | |
| CN114217971A (en) | Resource space determination method, device, equipment and 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 |