CN109976920A - A kind of implementation method and device of the concurrent type frog control for educating operating system - Google Patents
A kind of implementation method and device of the concurrent type frog control for educating operating system Download PDFInfo
- Publication number
- CN109976920A CN109976920A CN201910126415.6A CN201910126415A CN109976920A CN 109976920 A CN109976920 A CN 109976920A CN 201910126415 A CN201910126415 A CN 201910126415A CN 109976920 A CN109976920 A CN 109976920A
- Authority
- CN
- China
- Prior art keywords
- concurrent
- request
- threshold value
- page data
- educating
- 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 42
- 230000015654 memory Effects 0.000 claims description 34
- 238000004590 computer program Methods 0.000 claims description 12
- 238000004891 communication Methods 0.000 claims description 4
- 238000005516 engineering process Methods 0.000 description 4
- 238000012545 processing Methods 0.000 description 4
- 230000006870 function Effects 0.000 description 3
- 230000008569 process Effects 0.000 description 3
- 238000003780 insertion Methods 0.000 description 2
- 230000037431 insertion Effects 0.000 description 2
- 230000001360 synchronised effect Effects 0.000 description 2
- 230000008859 change Effects 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 238000000151 deposition Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000006073 displacement reaction Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000005611 electricity Effects 0.000 description 1
- 230000000977 initiatory effect Effects 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 230000003446 memory effect Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000000926 separation method Methods 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/54—Interprogram communication
- G06F9/547—Remote procedure calls [RPC]; Web services
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/10—Services
- G06Q50/20—Education
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/02—Protocols based on web technology, e.g. hypertext transfer protocol [HTTP]
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Theoretical Computer Science (AREA)
- Software Systems (AREA)
- Physics & Mathematics (AREA)
- Tourism & Hospitality (AREA)
- General Physics & Mathematics (AREA)
- Educational Technology (AREA)
- General Health & Medical Sciences (AREA)
- Educational Administration (AREA)
- Computer Networks & Wireless Communication (AREA)
- General Engineering & Computer Science (AREA)
- Health & Medical Sciences (AREA)
- Economics (AREA)
- Signal Processing (AREA)
- Human Resources & Organizations (AREA)
- Marketing (AREA)
- Primary Health Care (AREA)
- Strategic Management (AREA)
- General Business, Economics & Management (AREA)
- Electrically Operated Instructional Devices (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The implementation method and device that the concurrent type frog that the invention discloses a kind of for educating operating system controls, method include: to obtain the number of concurrent threshold value of page data request;The page data request for obtaining active client, judges whether the number of concurrent of page data request is greater than number of concurrent threshold value;If number of concurrent is greater than number of concurrent threshold value, page data request is pushed into spare execution stack;If number of concurrent is less than or equal to number of concurrent threshold value, page data request is pushed into execution stack, initiates to request according to execution stack, and request results are back to client.For the embodiment of the present invention by one new spare stack of setting, the request that will exceed current number of concurrent is pushed into the call stack, when current call stack occurs idle, then the queue of spare stack is put into spare call stack and is handled, reduce the concurrent pressure of server.
Description
Technical field
The present invention relates to field of communication technology more particularly to a kind of realizations that the concurrent type frog for educating operating system controls
Method and device.
Background technique
Educating operating system is the education type operating system based on operating system, and student and teacher can register in systems
Corresponding account realizes interacting between student and teacher.
Projects module in existing education operating system is more and more, and multiple concurrently asking can occur simultaneously in a page
It asks, when the page handles multiple work simultaneously, the multiple requests issued to server can be caused stress to server, will cause clothes
Business device collapse brings inconvenience so that the corresponding page collapses for user's use.
Therefore, the existing technology needs to be improved and developed.
Summary of the invention
In view of above-mentioned deficiencies of the prior art, the purpose of the present invention is to provide a kind of for educating the concurrent of operating system
The implementation method and device of formula control, it is intended to which the page for solving to educate in the prior art in operating system handles multiple work simultaneously
When, the problem of be easy to causeing server crash.
Technical scheme is as follows:
A kind of implementation method that the concurrent type frog for educating operating system controls, which comprises
Obtain the number of concurrent threshold value of page data request;
The page data request for obtaining active client, judges whether the number of concurrent of page data request is greater than number of concurrent threshold
Value;
If number of concurrent is greater than number of concurrent threshold value, page data request is pushed into spare execution stack;
If number of concurrent is less than or equal to number of concurrent threshold value, page data request is pushed into execution stack, is initiated according to execution stack
Request, and request results are back to client.
Optionally, before the number of concurrent threshold value for obtaining page data request, comprising:
A spare stack is preset, the spare stack is used to carry the page data request beyond number of concurrent threshold value.
Optionally, before the number of concurrent threshold value for obtaining page data request, comprising:
The number of concurrent threshold value of page data request is configured in advance.
Optionally, if the request Concurrency number is less than or equal to number of concurrent threshold value, request is pushed into execution stack, initiates to ask
It asks, and request results is back to client, comprising:
If request Concurrency number is less than or equal to number of concurrent threshold value, current concurrent quantity is counted, and will current concurrent quantitative value
Add 1;
Page data request is pushed into execution stack, initiates to request to server according to execution stack;
Acquisition request is as a result, and return to client for request results.
Optionally, the acquisition request as a result, and by request results back to after client, comprising:
Client handles request results;
Current number of concurrent is obtained, current number of concurrent is subtracted 1.
Optionally, the current number of concurrent of statistics, after subtracting 1 for current number of concurrent, comprising:
Page data request is destroyed, releasing memory;
Judge whether current number of concurrent is greater than number of concurrent threshold value;
If current number of concurrent is greater than number of concurrent threshold value, continue waiting for calling;
If current number of concurrent is less than or equal to number of concurrent threshold value, the request for taking out spare execution stack is executed.
Optionally, if the current number of concurrent is less than or equal to number of concurrent threshold value, take out the request of spare execution stack into
Row executes, comprising:
If current number of concurrent is less than or equal to number of concurrent threshold value, inquire whether spare execution stack has pending request;
If spare execution stack has pending request, the request of spare execution stack and execution are taken out;
If spare execution stack does not have pending request, the information of two execution stacks, releasing memory are removed.
Further embodiment of this invention additionally provides a kind of realization device that the concurrent type frog for educating operating system controls, institute
Stating device includes at least one processor;And
The memory being connect at least one described processor communication;Wherein,
The memory is stored with the instruction that can be executed by least one described processor, and described instruction is by described at least one
A processor executes, so that at least one described processor is able to carry out the above-mentioned concurrent type frog control for educating operating system
Implementation method.
Another embodiment of the present invention additionally provides a kind of non-volatile computer readable storage medium storing program for executing, which is characterized in that
The non-volatile computer readable storage medium storing program for executing is stored with computer executable instructions, and the computer executable instructions are by one
Or multiple processors are when executing, and it is above-mentioned for educating the concurrent of operating system to may make that one or more of processors execute
The implementation method of formula control.
Another embodiment of the invention provides a kind of computer program product, and the computer program product includes depositing
The computer program on non-volatile computer readable storage medium storing program for executing is stored up, the computer program includes program instruction, works as institute
When stating program instruction and being executed by processor, the processor is made to execute the above-mentioned concurrent type frog control for educating operating system
Implementation method.
The utility model has the advantages that implementation method and dress that the concurrent type frog that the invention discloses a kind of for educating operating system controls
It sets, compared with the prior art, by one new spare stack of setting, the request that will exceed current number of concurrent pushes away the embodiment of the present invention
Enter the call stack, when current call stack occurs idle, then the queue of spare stack is put into spare call stack and is handled, reduce clothes
The business concurrent pressure of device.
Detailed description of the invention
Present invention will be further explained below with reference to the attached drawings and examples, in attached drawing:
Fig. 1 is a kind of process for the implementation method preferred embodiment that the concurrent type frog for educating operating system controls of the present invention
Figure;
Fig. 2 is a kind of hardware for the realization device preferred embodiment that the concurrent type frog for educating operating system controls of the present invention
Structural schematic diagram.
Specific embodiment
To make the purpose of the present invention, technical solution and effect clearer, clear and definite, below to the present invention further specifically
It is bright.It should be appreciated that the specific embodiments described herein are merely illustrative of the present invention, it is not intended to limit the present invention.Below
The embodiment of the present invention is introduced in conjunction with attached drawing.
Referring to Fig. 1, Fig. 1 is that a kind of implementation method that the concurrent type frog for educating operating system controls of the present invention is preferably real
Apply the flow chart of example.As shown in Figure 1, itself comprising steps of
Step S100, the number of concurrent threshold value of page data request is obtained;
Step S200, the page data request for obtaining active client, judges whether the number of concurrent of page data request is big
S300 is thened follow the steps if more than number of concurrent threshold value in number of concurrent threshold value, if being less than or equal to number of concurrent threshold value, is thened follow the steps
S400;
Step S300, page data request is pushed into spare execution stack;
Step S400, page data request is pushed into execution stack, initiates to request according to execution stack, and request results are returned
To client.
When it is implemented, it is existing education operating system in projects module it is more and more, a page it sometimes appear that
Multiple concurrent page data requests, be easy to cause server crash.Therefore active client is being obtained in the embodiment of the present invention
Page data request, the number of concurrent threshold value of pre-set page data request is obtained, to obtain the place of current server
Reason state, if whether the number of concurrent of page data request is greater than number of concurrent threshold value, if page request number of concurrent is greater than number of concurrent
Threshold value illustrates that the processing capacity of server cannot handle current page request number of concurrent.If page request number of concurrent be less than etc.
In number of concurrent threshold value, then illustrate that the processing capacity of server is capable of handling current concurrent all page requests.
Therefore work as and detect that page request number of concurrent is less than or equal to number of concurrent threshold value, then page data request is put into execution
Stack, processor successively take out the data of execution stack, execute to the data of execution stack, are asked according to execution stack to server initiation
It asks, and request results is back to client.
Further, before the number of concurrent threshold value for obtaining page data request, comprising:
A spare stack is preset, the spare stack is used to carry the page data request beyond number of concurrent threshold value.
When it is implemented, a spare stack is preset, for carrying the request for exceeding number of concurrent.Spare stack is as a kind of
Data structure is a kind of Special Linear table that can only carry out insertion and delete operation at one end.It is according to principle first-in last-out
Storing data, the data being introduced into are pressed into stack bottom, last data in stack top, when needing to read data since stack top bullet
Data out (the last one data is read out by first).There is stack memory effect to be not required to in the insertion and delete operation of stack
Change bottom of stack pointer.
Further, before the number of concurrent threshold value for obtaining page data request, comprising:
The number of concurrent threshold value of page data request is configured in advance.
When it is implemented, being configured in advance to number of concurrent threshold value, such as number of concurrent threshold value is denoted as maxLimit,
MaxLimit may be configured as 5.
Further, if request Concurrency number is less than or equal to number of concurrent threshold value, request is pushed into execution stack, initiates request,
And request results are back to client, comprising:
If request Concurrency number is less than or equal to number of concurrent threshold value, current concurrent quantity is counted, and will current concurrent quantitative value
Add 1;
Page data request is pushed into execution stack, initiates to request to server according to execution stack;
Acquisition request is as a result, and return to client for request results.
When it is implemented, setting 0 for current number of concurrent initial value in advance, the request API, API of active client are obtained
(Application Programming Interface, application programming interface) is some functions predetermined, purpose
It is to provide the ability that application program and developer are able to one group of routine of access based on certain software or hardware, and is not necessarily to access originator
Code, or understand the details of internal work mechanism.Judge whether API is readjustment form, if request API is readjustment form, automatically
It is converted into promise form.Promise object is the message for transmitting asynchronous operation.If request API is not to adjust back shape
Formula then initiates request API, and judges whether current request number of concurrent is greater than threshold value, if request Concurrency number is less than or equal to number of concurrent
Threshold value counts current number of concurrent, current concurrent quantitative value+1, will request push-in execution stack, initiate request, request terminate successfully or
Failure;Request results are returned into client.
In some other embodiments, acquisition request as a result, and by request results back to after client, comprising:
Client handles request results;
Current number of concurrent is obtained, current number of concurrent is subtracted 1.
When it is implemented, client process request results, count current number of concurrent, current number of concurrent -1 is executed
Number of concurrent afterwards.
Further, current number of concurrent is counted, after subtracting 1 for current number of concurrent, comprising:
Page data request is destroyed, releasing memory;
Judge whether current number of concurrent is greater than number of concurrent threshold value;
If current number of concurrent is greater than number of concurrent threshold value, continue waiting for calling;
If current number of concurrent is less than or equal to number of concurrent threshold value, the request for taking out spare execution stack is executed.
When it is implemented, page data request is destroyed, releasing memory;Continue to judge whether current number of concurrent is greater than concurrently
Number threshold value;
If current number of concurrent is greater than number of concurrent threshold value, continue waiting for calling, until number of concurrent is less than or equal to number of concurrent
After threshold value, the request of spare execution stack is executed;
If current number of concurrent is less than or equal to number of concurrent threshold value, the request for taking out spare execution stack is executed.
Further, if current number of concurrent is less than or equal to number of concurrent threshold value, the request for taking out spare execution stack is carried out
It executes, comprising:
If current number of concurrent is less than or equal to number of concurrent threshold value, inquire whether spare execution stack has pending request;
If spare execution stack has pending request, the request of spare execution stack and execution are taken out;
If spare execution stack does not have pending request, the information of two execution stacks, releasing memory are removed.
When it is implemented, request is destroyed, releasing memory inquires whether current number of concurrent is greater than threshold value, if so, continuing
It waits;If not, inquiring whether spare execution stack has pending request, if it is, first that takes out spare execution stack is asked
It asks, then counts current concurrent quantity, request is pushed into execution stack, initiates request by current concurrent quantitative value+1, and request terminates successfully
Or failure;Request results are returned into client, client process request results count the current number of concurrent of current concurrent quantity
Amount -1, if not, removing the information of two execution stacks, releasing memory is completed.
By above method embodiment it is found that the reality that the concurrent type frog that the present invention provides a kind of for educating operating system controls
Existing method, by the number of concurrent threshold value for obtaining page data request;The page data request for obtaining active client, judges the page
Whether the number of concurrent of request of data is greater than number of concurrent threshold value;If number of concurrent is greater than number of concurrent threshold value, page data request is pushed away
Enter spare execution stack;If number of concurrent is less than or equal to number of concurrent threshold value, page data request is pushed into execution stack, according to execution stack
Request is initiated, and request results are back to client.The embodiment of the present invention will exceed and be worked as by one new spare stack of setting
The request of preceding number of concurrent is pushed into the call stack, is put into spare tune when current call stack occurs idle, then by the queue of spare stack
It is handled in stack, reduces the concurrent pressure of server.
The realization device that the concurrent type frog that another embodiment of the present invention provides a kind of for educating operating system controls, such as Fig. 2
Shown, device 10 includes:
One or more processors 110 and memory 120 are introduced in Fig. 2 by taking a processor 110 as an example, are located
Reason device 110 can be connected with memory 120 by bus or other modes, in Fig. 2 for being connected by bus.
Processor 110 is used for the various control logics of finishing device 10, can be general processor, Digital Signal Processing
Device (DSP), specific integrated circuit (ASIC), field programmable gate array (FPGA), single-chip microcontroller, ARM (Acorn RISC
) or other programmable logic device, discrete gate or transistor logic, discrete hardware component or these components Machine
Any combination.In addition, processor 110 can also be any conventional processors, microprocessor or state machine.Processor 110 can also
To be implemented as calculating the combination of equipment, for example, the combination of DSP and microprocessor, multi-microprocessor, one or more micro- places
Manage device combination DSP core or any other this configuration.
Memory 120 is used as a kind of non-volatile computer readable storage medium storing program for executing, can be used for storing non-volatile software journey
Sequence, non-volatile computer executable program and module, as being used to educate the concurrent of operating system in the embodiment of the present invention
The corresponding program instruction of implementation method of formula control.Processor 110 is stored in non-volatile soft in memory 120 by operation
Part program, instruction and unit, thereby executing the various function application and data processing of device 10, i.e. the realization above method is real
Apply the implementation method of the concurrent type frog control for educating operating system in example.
Memory 120 may include storing program area and storage data area, wherein storing program area can store operation dress
It sets, application program required at least one function;Storage data area, which can be stored, uses created data etc. according to device 10.
It can also include nonvolatile memory in addition, memory 120 may include high-speed random access memory, for example, at least one
A disk memory, flush memory device or other non-volatile solid state memory parts.In some embodiments, memory 120 can
Choosing includes the memory remotely located relative to processor 110, these remote memories can pass through network connection to device 10.
The example of above-mentioned network includes but is not limited to internet, intranet, local area network, mobile radio communication and combinations thereof.
One or more unit is stored in memory 120, when being executed by one or more processor 110, is held
The implementation method of the concurrent type frog control for educating operating system in the above-mentioned any means embodiment of row, for example, more than executing
Method and step S100 to step S400 in Fig. 1 of description.
The embodiment of the invention provides a kind of non-volatile computer readable storage medium storing program for executing, computer readable storage medium is deposited
Computer executable instructions are contained, which is executed by one or more processors, for example, executing above retouch
Method and step S100 to step S400 in the Fig. 1 stated.
As an example, non-volatile memory medium can include that read-only memory (ROM), programming ROM (PROM), electricity can
Programming ROM (EPROM), electrically erasable ROM (EEPROM) or flash memory.Volatile memory can include as external high speed
The random access memory (RAM) of buffer memory.By illustrate it is beautiful unrestricted, RAM can with such as synchronous random access memory (SRAM),
Dynamic ram, (DRAM), synchronous dram (SDRAM), double data rate SDRAM (DDR SDRAM), enhanced SDRAM
(ESDRAM), many forms of Synchlink DRAM (SLDRAM) and directly Rambus (Lan Basi) RAM (DRRAM) etc
It obtains.The disclosed memory assembly or memory of operating environment described herein be intended to include these and/or it is any
Other are suitble to one or more of the memory of type.
Another embodiment of the invention provides a kind of computer program product, and computer program product includes being stored in
Computer program on non-volatile computer readable storage medium storing program for executing, computer program include program instruction, when program instruction quilt
When processor executes, the processor is made to execute the reality of the concurrent type frog control for educating operating system of above method embodiment
Existing method.For example, executing the method and step S100 to step S400 in Fig. 1 described above.
Embodiments described above is only schematical, wherein as illustrated by the separation member unit can be or
It may not be and be physically separated, component shown as a unit may or may not be physical unit, it can
It is in one place, or may be distributed over multiple network units.Can select according to actual needs part therein or
Person's whole module achieves the purpose of the solution of this embodiment.
By the description of above embodiment, those skilled in the art can be understood that each embodiment can be by
Software adds the mode of general hardware platform to realize, naturally it is also possible to pass through hardware realization.Based on this understanding, above-mentioned technology
Scheme substantially in other words can be embodied in the form of software products the part that the relevant technologies contribute, the computer
Software product can reside in computer readable storage medium, such as ROM/RAM, magnetic disk, CD, including some instructions to
So that a computer electronic equipment (can be personal computer, server or network electronic devices etc.) executes each reality
The method for applying certain parts of example or embodiment.
Among other things, such as " can ', " energy ", " possibility " or " can be with " etc conditional statement unless in addition specific
Ground is stated or is otherwise understood in context as used, is otherwise generally intended to convey particular implementation energy
Including (however other embodiments do not include) special characteristic, element and/or operation.Therefore, such conditional statement is generally
It is not intended to imply that feature, element and/or operation are all needed one or more embodiments or one anyway
Or multiple embodiments must include for determining these features, element in the case where being with or without student's input or prompt
And/or the logic whether operation is included or will be performed in any particular implementation.
The content described in the present description and drawings herein includes being capable of providing for educating operating system
Concurrent type frog control implementation method and device example.It certainly, can not be for the purpose of the various features of the description disclosure
Come describe each of element and/or method it is envisioned that combination, it can be appreciated that, disclosed feature it is many in addition
Combination and displacement be possible., it will thus be apparent that without departing from the scope or spirit of the present disclosure can
Various modifications are made to the disclosure.In addition, or in alternative solution, the other embodiments of the disclosure are to the specification and drawings
The considerations of and the disclosure as presented herein practice in may be obvious.It is intended that this specification and attached
Example proposed in figure is considered illustrative and not restrictive in all respects.Although using herein specific
Term, but they are used and are not used in the purpose of limitation in general and descriptive sense.
Claims (10)
1. a kind of implementation method that the concurrent type frog for educating operating system controls, it is characterised in that, the described method includes:
Obtain the number of concurrent threshold value of page data request;
The page data request for obtaining active client, judges whether the number of concurrent of page data request is greater than number of concurrent threshold value;
If number of concurrent is greater than number of concurrent threshold value, page data request is pushed into spare execution stack;
If number of concurrent is less than or equal to number of concurrent threshold value, page data request is pushed into execution stack, initiates to request according to execution stack,
And request results are back to client.
2. the implementation method of the concurrent type frog control according to claim 1 for educating operating system, which is characterized in that institute
Before stating the number of concurrent threshold value for obtaining page data request, comprising:
A spare stack is preset, the spare stack is used to carry the page data request beyond number of concurrent threshold value.
3. according to claim 1 for educating the implementation method of the concurrent type frog control of operating system, which is characterized in that described
Before the number of concurrent threshold value for obtaining page data request, comprising:
The number of concurrent threshold value of page data request is configured in advance.
4. the implementation method of the concurrent type frog control according to claim 1 for educating operating system, which is characterized in that institute
If stating request Concurrency number less than or equal to number of concurrent threshold value, request is pushed into execution stack, initiates request, and request results are returned
To client, comprising:
If request Concurrency number is less than or equal to number of concurrent threshold value, current concurrent quantity is counted, and currently concurrent quantitative value will add 1;
Page data request is pushed into execution stack, initiates to request to server according to execution stack;
Acquisition request is as a result, and return to client for request results.
5. the implementation method of the concurrent type frog control according to claim 4 for educating operating system, which is characterized in that institute
State acquisition request as a result, and by request results back to after client, comprising:
Client handles request results;
Current number of concurrent is obtained, current number of concurrent is subtracted 1.
6. the implementation method of the concurrent type frog control according to claim 5 for educating operating system, which is characterized in that institute
The current number of concurrent of statistics is stated, after subtracting 1 for current number of concurrent, comprising:
Page data request is destroyed, releasing memory;
Judge whether current number of concurrent is greater than number of concurrent threshold value;
If current number of concurrent is greater than number of concurrent threshold value, continue waiting for calling;
If current number of concurrent is less than or equal to number of concurrent threshold value, the request for taking out spare execution stack is executed.
7. the implementation method of the concurrent type frog control according to claim 3 for educating operating system, which is characterized in that institute
If stating current number of concurrent is less than or equal to number of concurrent threshold value, the request for taking out spare execution stack is executed, comprising:
If current number of concurrent is less than or equal to number of concurrent threshold value, inquire whether spare execution stack has pending request;
If spare execution stack has pending request, the request of spare execution stack and execution are taken out;
If spare execution stack does not have pending request, the information of two execution stacks, releasing memory are removed.
8. a kind of realization device that the concurrent type frog for educating operating system controls, which is characterized in that described device includes at least
One processor;And
The memory being connect at least one described processor communication;Wherein,
The memory is stored with the instruction that can be executed by least one described processor, and described instruction is by described at least one
It manages device to execute, so that at least one described processor is able to carry out, claim 1-7 is described in any item to operate system for educating
The implementation method of the concurrent type frog control of system.
9. a kind of non-volatile computer readable storage medium storing program for executing, which is characterized in that the non-volatile computer readable storage medium
Matter is stored with computer executable instructions, when which is executed by one or more processors, may make institute
State the reality that one or more processors perform claim requires the described in any item concurrent type frog controls for educating operating system of 1-7
Existing method.
10. a kind of computer program product, which is characterized in that the computer program product includes being stored in non-volatile calculating
Computer program on machine readable storage medium storing program for executing, the computer program include program instruction, when described program instruction is processed
When device executes, the processor perform claim is made to require the described in any item concurrent type frog controls for educating operating system of 1-7
Implementation method.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201910126415.6A CN109976920A (en) | 2019-02-20 | 2019-02-20 | A kind of implementation method and device of the concurrent type frog control for educating operating system |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201910126415.6A CN109976920A (en) | 2019-02-20 | 2019-02-20 | A kind of implementation method and device of the concurrent type frog control for educating operating system |
Publications (1)
Publication Number | Publication Date |
---|---|
CN109976920A true CN109976920A (en) | 2019-07-05 |
Family
ID=67077073
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201910126415.6A Pending CN109976920A (en) | 2019-02-20 | 2019-02-20 | A kind of implementation method and device of the concurrent type frog control for educating operating system |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN109976920A (en) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN112052264A (en) * | 2020-08-05 | 2020-12-08 | 北京五八信息技术有限公司 | Business data query method and device, electronic equipment and readable storage medium |
WO2021232992A1 (en) * | 2020-05-22 | 2021-11-25 | 京东方科技集团股份有限公司 | Processing method for device change of state, apparatus, and non-transitory computer readable storage medium |
Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP0471282A3 (en) * | 1990-08-13 | 1993-09-15 | Hewlett-Packard Company | Maintaining consistency of cached data in a database system |
CN102999377A (en) * | 2012-11-30 | 2013-03-27 | 北京东方通科技股份有限公司 | Service concurrent access control method and device |
CN104461710A (en) * | 2014-12-12 | 2015-03-25 | 北京国双科技有限公司 | Method and device for processing tasks |
CN106547566A (en) * | 2016-11-24 | 2017-03-29 | 恒生电子股份有限公司 | Communications service process pool management method and system |
CN107544849A (en) * | 2017-09-30 | 2018-01-05 | 北京天元创新科技有限公司 | A kind of WEB server concurrency management method and system |
CN108881368A (en) * | 2018-04-22 | 2018-11-23 | 平安科技(深圳)有限公司 | High concurrent service request processing method, device, computer equipment and storage medium |
-
2019
- 2019-02-20 CN CN201910126415.6A patent/CN109976920A/en active Pending
Patent Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP0471282A3 (en) * | 1990-08-13 | 1993-09-15 | Hewlett-Packard Company | Maintaining consistency of cached data in a database system |
CN102999377A (en) * | 2012-11-30 | 2013-03-27 | 北京东方通科技股份有限公司 | Service concurrent access control method and device |
CN104461710A (en) * | 2014-12-12 | 2015-03-25 | 北京国双科技有限公司 | Method and device for processing tasks |
CN106547566A (en) * | 2016-11-24 | 2017-03-29 | 恒生电子股份有限公司 | Communications service process pool management method and system |
CN107544849A (en) * | 2017-09-30 | 2018-01-05 | 北京天元创新科技有限公司 | A kind of WEB server concurrency management method and system |
CN108881368A (en) * | 2018-04-22 | 2018-11-23 | 平安科技(深圳)有限公司 | High concurrent service request processing method, device, computer equipment and storage medium |
Cited By (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2021232992A1 (en) * | 2020-05-22 | 2021-11-25 | 京东方科技集团股份有限公司 | Processing method for device change of state, apparatus, and non-transitory computer readable storage medium |
US11822935B2 (en) | 2020-05-22 | 2023-11-21 | Boe Technology Group Co., Ltd. | Processing method and apparatus of device status change and non-transitory computer-readable storage medium |
CN112052264A (en) * | 2020-08-05 | 2020-12-08 | 北京五八信息技术有限公司 | Business data query method and device, electronic equipment and readable storage medium |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US7272834B2 (en) | Method for continuous I/O request processing in an asynchronous environment | |
US5632015A (en) | Computer program product to efficiently process diverse result sets returned by a stored procedure | |
CN110351342A (en) | Service order processing method, device, computer equipment and storage medium | |
DE60219674T2 (en) | A distributed speech recognition system and method of operating the same | |
KR101557212B1 (en) | Method, sharing platform, and system for sharing image-editing action | |
CN109947569A (en) | Bind method, apparatus, terminal and the storage medium of core | |
CN105893320A (en) | Remote task function calling method oriented at multi-core processor | |
CN109976920A (en) | A kind of implementation method and device of the concurrent type frog control for educating operating system | |
CN110597634B (en) | Data processing method and device and computer readable storage medium | |
CN111062723B (en) | Virtual account transfer method, device, system and storage medium | |
CN107544849A (en) | A kind of WEB server concurrency management method and system | |
CN111026768A (en) | Data synchronization method and device capable of realizing rapid loading of data | |
CN108519987A (en) | A kind of data persistence method and apparatus | |
CN114005225B (en) | Storage method and device of intelligent cabinet and pickup method and device of intelligent cabinet | |
CN109064311A (en) | Batch based on online mode is withholdd processing method and processing device | |
CN109726007A (en) | A kind of container layout quota management method and device and container arranging system | |
CN103514164A (en) | Data migration method and system | |
CN109542638A (en) | A kind of document handling method and device based on educational system | |
CN110018887A (en) | Task schedule and Resource Management Algorithm on a kind of Reconfigurable Platform | |
CN107819855A (en) | A kind of message distributing method and device | |
CN110019487A (en) | A kind of database connection management method and device | |
CN111294377A (en) | Network request sending method of dependency relationship, terminal device and storage medium | |
CN108958930A (en) | Processing method, device and the equipment of container resource | |
CN111176848B (en) | Cluster task processing method, device, equipment and storage medium | |
CN108009226A (en) | Promotion content display implementation method based on intelligent terminal application and intelligent terminal |
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 | ||
RJ01 | Rejection of invention patent application after publication |
Application publication date: 20190705 |
|
RJ01 | Rejection of invention patent application after publication |