CN108021449A - One kind association journey implementation method, terminal device and storage medium - Google Patents
One kind association journey implementation method, terminal device and storage medium Download PDFInfo
- Publication number
- CN108021449A CN108021449A CN201711251988.9A CN201711251988A CN108021449A CN 108021449 A CN108021449 A CN 108021449A CN 201711251988 A CN201711251988 A CN 201711251988A CN 108021449 A CN108021449 A CN 108021449A
- Authority
- CN
- China
- Prior art keywords
- journey
- association
- stack
- work
- main
- 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.)
- Granted
Links
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/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
- G06F9/5011—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resources being hardware resources other than CPUs, Servers and Terminals
- G06F9/5016—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resources being hardware resources other than CPUs, Servers and Terminals the resource being the memory
-
- 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/48—Program initiating; Program switching, e.g. by interrupt
- G06F9/4806—Task transfer initiation or dispatching
- G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
Abstract
The present invention relates to one kind association journey implementation method, terminal device and storage medium, in the method, comprise the following steps：S10：Main association's journey is created in thread, into S20；S20：Main association's journey wait-for-response asynchronous event, until when asynchronous event occurs, main association's journey is hung up, into S30；S30：Association's journey block of information of corresponding work association journey is read, creating corresponding work according to information stack method in the block assists journey, into S40；S40：After the completion of the journey processing of work association, main association's journey is switched back into according to the type of the stack method of work association journey, returns to S20 afterwards.The present invention is by classifying association Cheng Jinhang, the running stack allocative decision different to different types of association Cheng Caiyong, obtains the balance of high operational efficiency and low memory usage, the more preferable demand for supporting large-scale concurrent server-side.
Description
Technical field
The present invention relates to field of computer technology, is situated between more particularly, to one kind association journey implementation method, terminal device and storage
Matter.
Background technology
With the development of the Internet, applications, the rapid growth of Internet user, to application software, the server-side performance of website
It is it is required that higher and higher.Serve end program needs to meet the performance requirements such as low delay, high concurrent, high stability, while needs to meet
The exploitation demands such as development efficiency is high, maintainability is strong.Traditional high performance service end program generally uses multi-process or multithreading skill
Art improves the handling capacity of single server.Multithreading can improve program response, improve the utilization rate of multi-core CPU, real
The problems such as concurrently execution of existing logical process, but thread synchronization processing, thread resources compete, is difficult to deal carefully with, a thread
There is exception and be easy to cause program crashing, influence the stabilization of system, there is also larger performance loss for the frequent switching of thread.It is more
Process technology has while parallel logic disposal ability is realized, different inter-process data seperating safeties are high, and process occurs
It is abnormal not influence other processes, the advantage such as simple is programmed in process, but the resource overhead for creating maintenance process is huge, between process
The transmission of data is also comparatively laborious.For these problems, present serve end program programming introduces association's journey technology, and association's journey is thread
Timesharing technology of sharing so that single thread can handle multiple logic tasks at the same time, and Asynchronous Programming is converted into synchronous programming, without
Any lock operation, simplifies programming complexity while program concurrency is improved, improves program feature.
It is scheduling scheme in a kind of thread to assist journey, it is believed that it is a kind of User space thread, it possesses as thread
Independent register context and running stack.The realization of association's journey mainly has two schemes：One kind is divided first when being and creating association's journey
With complete stack space, only switch stack register, abbreviation independent stack scheme when assisting journey switching；Another scheme is all association's journeys
A running stack is shared, the data copied when assisting journey to cut off in running stack preserve, and data duplication is returned again when assisting journey switchback
Running stack, referred to as shared stack scheme.
Independent stack scheme has the characteristics of association's journey handover overhead is low, however, to ensure that association's journey can support most of function
Local variable distribution, multilayer function call and association's journey hang up recovery characteristics, and association's journey running stack cannot distribute too small.In association's journey
Actual use in it is most of can't use so big memory headroom, cause greatly memory headroom to waste.With each association
Exemplified by journey distribution 256K stack spaces, 4G memory computers are maximum to support 16384 association's journeys, and million grades or even thousand are supported with one process
The application demand of ten thousand grades of association's journeys is far apart.Shared stack scheme preserves the truly empty using memory of running stack when assisting journey to switch
Between, possess high memory usage, but storage allocation is needed when preserving stack space, memory is copied, causes greatly property
Energy expense, so existing association's journey implementation can not meet the performance requirement at high performance service end.
The content of the invention
To solve the above-mentioned problems, the present invention is intended to provide a kind of association's journey implementation method, terminal device and storage medium, lead to
Cross to association's Cheng Jinhang classification, the running stack allocative decision different to different types of association Cheng Caiyong, and model selection is provided and is connect
Mouthful, for it is some need long when work frequent switching association's journey stack allocative decision is actively set, obtain high operational efficiency with it is low interior
The balance of utilization rate is deposited, the more preferable demand for supporting large-scale concurrent server-side.
Concrete scheme is as follows：
One kind association journey implementation method, association's journey include main association's journey and work association two class of journey, and the work assists journey according to it
Stack method is respectively set as work association's journey using shared stack and the work association journey using independent stack, and specific implementation step is as follows：
S10：Main association's journey is created in thread, into S20；
S20：Main association's journey wait-for-response asynchronous event, until when asynchronous event occurs, main association's journey is hung up, into S30；
S30：Association's journey block of information of corresponding work association journey is read, creating corresponding work according to information stack method in the block assists
Journey, into S40；
Wherein：Work association journey has three kinds of establishment modes according to the type of its stack method：
Mode 1：When work association's journey assists journey for new work, i.e., does not have created work association journey before, work is set to assist
The stack related register of journey shares stack using work association journey；
Mode 2：When work association journey is to assist journey using the existing work of shared stack method, the work is copied from heap memory
Make association's journey stack data to shared stack, association's journey register data of resuming work, sets stack related register to be shared using work association journey
Stack；
Mode 3：When work association journey is to assist journey using the existing work of independent stack method, stack related register uses should
Work association journey independent operating stack, association's journey register data of resuming work；
S40：After the completion of the journey processing of work association, main association's journey is switched back into, returns to S20 afterwards；
Wherein：Work association journey switches back into main association's journey has three kinds of modes according to the type of the stack method of work association journey：
Mode 1：When work association journey switches back into main association's journey in the case of need not being saved, cleaning association journey block of information, recovers
Main association's journey register data, sets stack related register to use main association's journey independent operating stack；
Mode 2：Work association journey is suspended using shared stack mode when switching to main association's journey, and it is true to calculate journey institute of work association
The shared stack size used, distributes equal size heap memory block, copies in data to the heap distributed that work association journey shellfish is shared in stack
In depositing, work association journey register data is preserved, recovers main association's journey register data, sets stack related register only using main association's journey
Vertical stack；
Mode 3：Work association journey is suspended using independent stack mode when switching to main association's journey, in the corresponding heap of distribution independent stack
Counterfoil, marks the heap memory block to assist journey independent stack for the work, and copy work assists journey to share the data in stack to newly assigned heap
In memory block, work association journey register data is preserved, recovers main association's journey register data, sets stack related register to use main association
Journey independent stack.
Further, main association's journey is created in initialization, is only responsible for response asynchronous event, is not related to the specific of event
Processing, possesses complete independent stack, data need not copy in stack.
Further, created described in step S10 main association's journey include based on assist journey to distribute independent register context and solely
Vertical stack space, while distribute the work for being used to share work association journey and assist journey to share stack and heap space.
Further, the heap space is used for preserving association's journey block of information, including the stack address of independent stack, association's journey type, with
And including sharing stack address, the association's journey type of stack.
Further, work association's journey uses shared according to work association's journey of the setting means setting acquiescence of its stack method
Stack, the work that setting needs to be suspended repeatedly assist journey to use independent stack.
Further, association's journey block of information storage inside has the type of the corresponding stack method of work association journey.
One kind association Cheng Shixian terminal devices, including memory, processor and be stored in the memory and can be in institute
The computer program run on processor is stated, the processor realizes that the embodiment of the present invention is above-mentioned when performing the computer program
Method the step of.
A kind of computer-readable recording medium, the computer-readable recording medium storage have computer program, the meter
Calculation machine program realizes the step of above-mentioned method of the embodiment of the present invention when being executed by processor.
The present invention has been carried out specific aim optimization to existing association's journey application model, has been given tacit consent to assisting journey using as above technical solution
It is classified, different handover schemes is used to different classes of formed, and provide and interface is set so that programming personnel is programming
When can according to application specific logic control association journey handover scheme, greatly improve association journey memory usage and switching efficiency,
The handling capacity upper limit of serve end program is improved, there is high availability for large concurrent Demand and service end.
Brief description of the drawings
Fig. 1 show the step schematic diagram of the embodiment of the present invention one.
Fig. 2 show the flow diagram of the embodiment of the present invention one.
Embodiment
To further illustrate each embodiment, the present invention is provided with attached drawing.These attached drawings are that the invention discloses one of content
Point, it can coordinate the associated description of specification to explain the operation principles of embodiment mainly to illustrate embodiment.Coordinate ginseng
These contents are examined, those of ordinary skill in the art will be understood that other possible embodiments and advantages of the present invention.In figure
Component be not necessarily to scale, and similar element numbers are conventionally used to indicate similar component.
In conjunction with the drawings and specific embodiments, the present invention is further described.
Embodiment one：
The embodiment of the present invention one provides a kind of association's journey implementation method, as shown in Figure 1, it is described in the embodiment of the present invention one
Association's journey implementation method flow diagram, the method may include following steps：
S10：Main association's journey is created in thread, into S20.
It is described
The thread is the thread for responding asynchronous event.
Association's journey is a kind of lightweight thread of user class, each to assist Cheng Jun to possess the register context and stack of oneself,
When assisting the scheduling switching of journey, the register context and stack of the association's journey being switched will be preserved, and in association's journey switchback,
Recover the register context and stack being previously saved.
The register context is to perform the related various registers of the process, including program register, processor shape
The value composition of state register, stack pointer and general register, wherein program register give the next finger that CPU will be performed
The virtual address of order；Processor status register gives machine the hardware state associated with the process；Stack pointer is directed toward next
The current address of item, and general register is then used for the parameter transmission between different execution patterns.
The heap space is used for preserving association's journey block of information, including the stack address of independent stack, association's journey type, and including shared
Stack address, the association's journey type of stack.
Association's journey is divided into main association's journey and work association two class of journey, and main association's journey is created in initialization, and it is asynchronous to be only responsible for response
Event, is not related to the specific processing of event, possesses complete independent stack, data need not copy in stack.
The main association's journey of establishment assists journey to distribute independent register context and independent stack space, same time-division based on including
The work association journey for being used in shared work association journey shares stack and heap space.
S20：Main association's journey wait-for-response asynchronous event, until when asynchronous event occurs, main association's journey is hung up, into S30.
Main association's journey, which is hung up, to be included preserving main association's journey register data.
S30：Association's journey block of information of corresponding work association journey is read, creating corresponding work according to information stack method in the block assists
Journey, into S40.
Work association journey is responsible for the specific processing logic of event, and two kinds of stack methods can be used to share stack and solely for work association journey
Vertical stack.Work association's journey is created by main association's journey, and acquiescence is using shared stack, and most of work association journey is all until work terminates all without quilt
Hang up, be not suspended the performance loss that would not be produced and be produced when shared stack method is hung up, therefore can expire very well using shared stack
Sufficient performance requirement.A few thing association Cheng Keneng is suspended repeatedly under partial picture, just work association journey must be arranged to make at this time
It is minimum with independent stack method, the performance loss of independent stack method.Independent stack method committed memory space is big, therefore the work given tacit consent to
Journey is assisted using shared stack, it is necessary to which the work association journey being suspended repeatedly uses independent stack.
The shared stack shares a stack space for all association's journeys, and when assisting journey called, its information is stored in stack sky
In, when when the association, journey is suspended, the data preserved in its stack space are separately stored in corresponding heap space.The stack space is used for
Store the information of another called association's journey.
The independent stack has corresponding stack space for each association's journey, and the information such as its all local variable all can be complete
Whole is stored in the stack space.
Association's journey block of information storage inside has the type of the corresponding stack method of work association journey.
The corresponding stack method of work association journey includes the use of independent stack and using shared stack.
Work association journey has three kinds of establishment modes according to the type of its stack method：
Mode 1：When work association's journey assists journey for new work, i.e., does not have created work association journey before, work is set to assist
The stack related register of journey shares stack using work association journey；
Mode 2：When work association journey is to assist journey using the existing work of shared stack method, the work is copied from heap memory
Make association's journey stack data to shared stack, association's journey register data of resuming work, sets stack related register to be shared using work association journey
Stack；
Mode 3：When work association journey is to assist journey using the existing work of independent stack method, stack related register uses should
Work association journey independent operating stack, association's journey register data of resuming work.
S40：After the completion of the journey processing of work association, main association's journey is switched back into, returns to S20 afterwards.
Work association journey switches back into main association's journey has three kinds of modes according to the type of its stack method：
Mode 1：When work association journey switches back into main association's journey in the case of need not being saved, cleaning association journey block of information, recovers
Main association's journey register data, sets stack related register to use main association's journey independent operating stack；
Mode 2：Work association journey is suspended using shared stack mode when switching to main association's journey, and it is true to calculate journey institute of work association
The shared stack size used, distributes equal size heap memory block, copies in data to the heap distributed that work association journey shellfish is shared in stack
In depositing, work association journey register data is preserved, recovers main association's journey register data, sets stack related register only using main association's journey
Vertical stack；
Mode 3：Work association journey is suspended using independent stack mode when switching to main association's journey, in the corresponding heap of distribution independent stack
Counterfoil, marks the heap memory block to assist journey independent stack for the work, and copy work assists journey to share the data in stack to newly assigned heap
In memory block, work association journey register data is preserved, recovers main association's journey register data, sets stack related register to use main association
Journey independent stack.
A pair of existing association's journey application model of the embodiment of the present invention has carried out specific aim optimization, has given tacit consent to association Cheng Jinhang and has divided
Class, to it is different classes of formed use different handover schemes, and provide set interface enable programming personnel programming when according to
The handover scheme of application specific logic control association journey, greatly improves the memory usage and switching efficiency of association's journey, improves clothes
The handling capacity upper limit for end program of being engaged in, has high availability for large concurrent Demand and service end.
Embodiment two：
The present invention also provides one kind to assist Cheng Shixian terminal devices, including memory, processor and is stored in the storage
In device and the computer program that can run on the processor, the processor realize this hair when performing the computer program
Step in the above method embodiment of bright embodiment one.
Further, as an executable scheme, association's Cheng Shixian terminal devices can be desktop PC, pen
The computing devices such as note sheet, palm PC and cloud server.Association's Cheng Shixian terminal devices may include, but be not limited only to, place
Manage device, memory.It will be understood by those skilled in the art that the composition structure of above-mentioned association Cheng Shixian terminal devices is only to assist journey real
The example of existing terminal device, does not form the restriction to assisting Cheng Shixian terminal devices, can include more more or fewer than above-mentioned
Component, either combines some components or different components, such as association's Cheng Shixian terminal devices can also be defeated including inputting
Go out equipment, network access equipment, bus etc., it is not limited in the embodiment of the present invention.
Further, as an executable scheme, alleged processor can be central processing unit (Centran
Processing Unit, CPU), it can also be other general processors, digital signal processor (Digitan Signan
Processor, DSP), it is application-specific integrated circuit (Appnication Specific Integrated Circuit, ASIC), existing
Into programmable gate array (Fiend-Programmabne Gate Array, FPGA) or other programmable logic device, discrete
Door or transistor logic, discrete hardware components etc..General processor can be that microprocessor or the processor also may be used
To be any conventional processor etc., the processor is the control centre of association's Cheng Shixian terminal devices, is connect using various
Mouth and connection entirely assist the various pieces of Cheng Shixian terminal devices.
The memory can be used for storing the computer program and/or module, and the processor is by running or performing
The computer program and/or module being stored in the memory, and the data being stored in memory are called, described in realization
Assist the various functions of Cheng Shixian terminal devices.The memory can mainly include storing program area and storage data field, wherein, deposit
Storing up program area can storage program area, the application program needed at least one function；Storage data field can be stored according to mobile phone
Use created data etc..In addition, memory can include high-speed random access memory, non-volatile deposit can also be included
Reservoir, such as hard disk, memory, plug-in type hard disk, intelligent memory card (Smart Media Card, SMC), secure digital
(Secure Digitan, SD) block, flash card (Fnash Card), at least one disk memory, flush memory device or other
Volatile solid-state part.
The present invention also provides a kind of computer-readable recording medium, the computer-readable recording medium storage has computer
The step of program, the computer program realizes the above method of embodiment of the present invention when being executed by processor.
If module/unit that association's Cheng Shixian terminal devices integrate realized in the form of SFU software functional unit and as
Independent production marketing in use, can be stored in a computer read/write memory medium.Based on such understanding, sheet
All or part of flow in above-described embodiment method is realized in invention, and relevant hardware can also be instructed by computer program
To complete, the computer program can be stored in a computer-readable recording medium, and the computer program is by processor
During execution, it can be achieved that the step of above-mentioned each embodiment of the method.Wherein, the computer program includes computer program code,
The computer program code can be source code form, object identification code form, executable file or some intermediate forms etc..Institute
Stating computer-readable medium can include：Can carry any entity or device of the computer program code, recording medium,
USB flash disk, mobile hard disk, magnetic disc, CD, computer storage, read-only storage (ROM, Read-Onny Memory), arbitrary access
Memory (RAM, Random Access Memory), electric carrier signal, telecommunication signal and software distribution medium etc..Need
It is bright, the content that the computer-readable medium includes can according in jurisdiction legislation and patent practice requirement into
The appropriate increase and decrease of row, such as in some jurisdictions, according to legislation and patent practice, computer-readable medium does not include electricity and carries
Ripple signal and telecommunication signal.
Although specifically showing and describing the present invention with reference to preferred embodiment, those skilled in the art should be bright
In vain, do not departing from the spirit and scope of the present invention that the appended claims are limited, in the form and details can be right
The present invention makes a variety of changes, and is protection scope of the present invention.
Claims (8)
1. one kind association journey implementation method, it is characterised in that：Association's journey includes main association's journey and work association two class of journey, the work association
Journey is respectively set as work association's journey using shared stack according to its stack method and journey, specific implementation step are assisted in the work using independent stack
It is rapid as follows：
S10：Main association's journey is created in thread, into S20；
S20：Main association's journey wait-for-response asynchronous event, until when asynchronous event occurs, main association's journey is hung up, into S30；
S30：Association's journey block of information of corresponding work association journey is read, creating corresponding work according to information stack method in the block assists journey,
Into S40；
Wherein：Work association journey has three kinds of establishment modes according to the type of its stack method：
Mode 1：When work association's journey assists journey for new work, i.e., does not have created work association journey before, work is set to assist journey
Stack related register shares stack using work association journey；
Mode 2：When work association journey is to assist journey using the existing work of shared stack method, work association is copied from heap memory
For journey stack data to shared stack, association's journey register data of resuming work, sets stack related register to share stack using work association journey；
Mode 3：When work association journey is to assist journey using the existing work of independent stack method, stack related register uses the work
Journey independent operating stack is assisted, association's journey register data of resuming work；
S40：After the completion of the journey processing of work association, main association's journey is switched back into, returns to S20 afterwards；
Wherein：Work association journey switches back into main association's journey has three kinds of modes according to the type of the stack method of work association journey：
Mode 1：When work association journey switches back into main association's journey in the case of need not being saved, cleaning association journey block of information, recovers main association
Journey register data, sets stack related register to use main association's journey independent operating stack；
Mode 2：Work association journey be suspended using shared stack mode switch to it is main association journey when, calculate the work association journey truly use
Shared stack size, distribute equal size heap memory block, copy work association journey shellfish and share data in stack into the heap memory distributed,
Work association journey register data is preserved, recovers main association's journey register data, sets stack related register to use main association's journey independent stack；
Mode 3：Work association journey is suspended using independent stack mode when switching to main association's journey, the corresponding heap memory of distribution independent stack
Block, marks the heap memory block to assist journey independent stack for the work, and copy work association journey is shared in data to the newly assigned heap in stack
In counterfoil, work association journey register data is preserved, recovers main association's journey register data, sets stack related register to use main association's journey
Independent stack.
2. association's journey implementation method according to claim 1, it is characterised in that：Main association's journey is created in initialization, only
It is responsible for response asynchronous event, is not related to the specific processing of event, possesses complete independent stack, data need not copy in stack.
3. association's journey implementation method according to claim 1, it is characterised in that：Main association's journey is created described in step S10 to be included
Based on assist journey to distribute independent register context and independent stack space, while distribute the work association for being used for sharing work association journey
Journey shares stack and heap space.
4. association's journey implementation method according to claim 3, it is characterised in that：The heap space is used for preserving association's journey information
Block, including the stack address of independent stack, association's journey type, and including sharing stack address, the association's journey type of stack.
5. association's journey implementation method according to claim 1, it is characterised in that：Journey setting according to its stack method is assisted in the work
Determine mode and set work association's journey of acquiescence using shared stack, the work that setting needs to be suspended repeatedly assists journey to use independent stack.
6. association's journey implementation method according to claim 1, it is characterised in that：Association's journey block of information storage inside has work
Assist the type of the corresponding stack method of journey.
7. one kind association Cheng Shixian terminal devices, including memory, processor and it is stored in the memory and can be described
The computer program run on processor, it is characterised in that the processor realizes such as right when performing the computer program
It is required that the step of 1~6 the method.
8. a kind of computer-readable recording medium, the computer-readable recording medium storage has computer program, its feature exists
In realization is such as the step of claim 1~6 the method when the computer program is executed by processor.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711251988.9A CN108021449B (en) | 2017-12-01 | 2017-12-01 | Coroutine implementation method, terminal equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711251988.9A CN108021449B (en) | 2017-12-01 | 2017-12-01 | Coroutine implementation method, terminal equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108021449A true CN108021449A (en) | 2018-05-11 |
| CN108021449B CN108021449B (en) | 2020-07-31 |
Family
ID=62078388
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711251988.9A Active CN108021449B (en) | 2017-12-01 | 2017-12-01 | Coroutine implementation method, terminal equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108021449B (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111190569A (en) * | 2019-12-30 | 2020-05-22 | 中国科学技术大学 | Homomorphic encryption unloading method based on Intel QAT |
| CN111427584A (en) * | 2020-04-14 | 2020-07-17 | 北京达佳互联信息技术有限公司 | Method, device and equipment for generating executable file |
| CN111767159A (en) * | 2020-06-24 | 2020-10-13 | 浙江大学 | Asynchronous system calling system based on coroutine |
| CN112346835A (en) * | 2020-10-22 | 2021-02-09 | 上海瀚之友信息技术服务有限公司 | Scheduling processing method and system based on coroutine |
| CN113608843A (en) * | 2021-07-08 | 2021-11-05 | 广东开放大学（广东理工职业学院） | Coroutine implementation method and system |
| CN115586980A (en) * | 2022-10-09 | 2023-01-10 | 维塔科技(北京)有限公司 | Remote procedure calling device and method |
| CN116737366A (en) * | 2023-05-15 | 2023-09-12 | 广州汽车集团股份有限公司 | Processing method and device of shared stack, electronic equipment and storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20160321045A1 (en) * | 2015-04-28 | 2016-11-03 | Microsoft Technology Licensing, Llc | Compiler optimization of coroutines |
| CN106390453A (en) * | 2016-08-31 | 2017-02-15 | 腾讯科技（深圳）有限公司 | Game system and game processing method |
| CN106980546A (en) * | 2016-01-18 | 2017-07-25 | 阿里巴巴集团控股有限公司 | A kind of task asynchronous execution method, apparatus and system |
-
2017
- 2017-12-01 CN CN201711251988.9A patent/CN108021449B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20160321045A1 (en) * | 2015-04-28 | 2016-11-03 | Microsoft Technology Licensing, Llc | Compiler optimization of coroutines |
| CN106980546A (en) * | 2016-01-18 | 2017-07-25 | 阿里巴巴集团控股有限公司 | A kind of task asynchronous execution method, apparatus and system |
| CN106390453A (en) * | 2016-08-31 | 2017-02-15 | 腾讯科技（深圳）有限公司 | Game system and game processing method |
Non-Patent Citations (1)
| Title |
|---|
| 刘书健: "基于协程的高并发的分析与研究", 《中国优秀硕士学位论文全文数据库信息科技辑》 * |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111190569A (en) * | 2019-12-30 | 2020-05-22 | 中国科学技术大学 | Homomorphic encryption unloading method based on Intel QAT |
| CN111190569B (en) * | 2019-12-30 | 2022-05-13 | 中国科学技术大学 | Homomorphic encryption unloading method based on Intel QAT |
| CN111427584A (en) * | 2020-04-14 | 2020-07-17 | 北京达佳互联信息技术有限公司 | Method, device and equipment for generating executable file |
| CN111767159A (en) * | 2020-06-24 | 2020-10-13 | 浙江大学 | Asynchronous system calling system based on coroutine |
| CN112346835A (en) * | 2020-10-22 | 2021-02-09 | 上海瀚之友信息技术服务有限公司 | Scheduling processing method and system based on coroutine |
| CN112346835B (en) * | 2020-10-22 | 2022-12-09 | 上海瀚之友信息技术服务有限公司 | Scheduling processing method and system based on coroutine |
| CN113608843A (en) * | 2021-07-08 | 2021-11-05 | 广东开放大学（广东理工职业学院） | Coroutine implementation method and system |
| CN113608843B (en) * | 2021-07-08 | 2023-08-25 | 广东开放大学（广东理工职业学院） | Coroutine implementation method and system |
| CN115586980A (en) * | 2022-10-09 | 2023-01-10 | 维塔科技(北京)有限公司 | Remote procedure calling device and method |
| CN116737366A (en) * | 2023-05-15 | 2023-09-12 | 广州汽车集团股份有限公司 | Processing method and device of shared stack, electronic equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108021449B (en) | 2020-07-31 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108021449A (en) | One kind association journey implementation method, terminal device and storage medium | |
| TWI694339B (en) | Blockchain consensus method, equipment and system | |
| US11256749B2 (en) | Graph data processing method and apparatus, and system | |
| US8631410B2 (en) | Scheduling jobs in a cluster having multiple computing nodes by constructing multiple sub-cluster based on entry and exit rules | |
| CN102541640B (en) | Cluster GPU (graphic processing unit) resource scheduling system and method | |
| CN104881466B (en) | The processing of data fragmentation and the delet method of garbage files and device | |
| CN108549583B (en) | Big data processing method and device, server and readable storage medium | |
| CN106033373A (en) | A method and a system for scheduling virtual machine resources in a cloud computing platform | |
| CN105159841B (en) | A kind of internal memory migration method and device | |
| CN105608162B (en) | Document handling method and device | |
| CN103365726A (en) | Resource management method and system facing GPU (Graphic Processing Unit) cluster | |
| CN112825042A (en) | Resource management method and device, electronic equipment and storage medium | |
| CN106407231A (en) | A data multi-thread export method and system | |
| US9317340B2 (en) | Intelligent virtual machine (VM) re-location | |
| Perwej | The ambient scrutinize of scheduling algorithms in big data territory | |
| CN107943423A (en) | The management method and computer-readable recording medium of storage resource in cloud system | |
| CN104050193A (en) | Message generating method and data processing system for realizing method | |
| CN109271247A (en) | Memory Optimize Method, device, computer installation and storage medium | |
| CN107528871A (en) | Data analysis in storage system | |
| CN105930202B (en) | A kind of virtual machine migration method of three threshold values | |
| CN102209016A (en) | Data processing method, device and data processing system | |
| US20240005446A1 (en) | Methods, systems, and non-transitory storage media for graphics memory allocation | |
| CN104156316A (en) | Hadoop cluster batch processing method and system | |
| CN113382075A (en) | Enterprise information management platform, management method, electronic device and storage medium | |
| Sutherland et al. | Cooperative Concurrency Control for Write-Intensive Key-Value Workloads |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |