Distributed Lock Reverse Automatic Unlock Method in Low-Code Development Platform

Abstract

The present invention discloses a method for automatically unlocking distributed locks in reverse order in a low-code development platform, which includes the following steps: Step S1: When arranging a process, create a last-in-first-out queue A, parse the execution process, generate distributed locks for each distributed lock node of the execution process, and add each distributed lock node to the queue A in sequence; Step S2: Provide a final execution mechanism for the distributed locks, and unlock each distributed lock node in the queue A in reverse order in the order of last-in-first-out. In the present invention, when arranging a process, there is no need to set an unlocking node, and only need to unlock each distributed lock node in the queue A in reverse order in sequence; the arrangement process is simplified, and the execution speed of the process is also greatly improved.

Description

Technical Field

[0001] The present invention relates to the field of computer software, and particularly to a method for automatically unlocking distributed locks in reverse order in a low-code development platform. Background Art

[0002] In China, low-code development platforms have also developed rapidly in recent years, such as Huawei's AppCube, Alibaba's Yida, and UFIDA's YonBuilder. So, what is a low-code development platform?

[0003] As the name implies, low-code means that developers write very little code and use visual arrangement tools such as interfaces, logics, and objects provided by the low-code platform to complete a large amount of development work, reducing the uncertain factors in software development, thereby greatly improving the development efficiency, enabling enterprises to reduce development costs and prices, lower technical and personnel thresholds, quickly innovate applications, achieve rapid trial and error, and agile iteration.

[0004] Low-code platforms mainly provide the ability to quickly develop applications for the following two types of personnel:

[0005] 1. Business personnel. By providing a large number of interface templates, business templates, process templates, and object models, business personnel can quickly assemble application systems in a building-block manner according to actual business needs, thus achieving rapid application innovation.

[0006] 2. Software development engineers. Through the capabilities of page arrangement tools and process arrangement, developers can componentize and microservice a large number of existing services on the platform and then write a small amount of code to implement the application management system they want.

[0007] In low-code development platform programming, when concurrent operations are performed on some common resources, locks need to be added. If locking and unlocking appear in the same arrangement process at the same time, and if a process needs to add n locks, then there will also be n unlocking nodes. The excessive number of nodes increases the complexity of the process.

[0008] Therefore, there are defects in the prior art and improvements are needed. Summary of the Invention

[0009] The technical problem to be solved by the present invention is to provide a method for automatically unlocking distributed locks in reverse order in a low-code development platform.

[0010] The technical solution of the present invention is as follows: A method for automatically unlocking distributed locks in reverse order in a low-code development platform, comprising the following steps: Step S1: When arranging the process, create a last-in-first-out queue A, parse the execution process, generate distributed locks for each distributed lock node of the execution process, and add each distributed lock node to the queue A in sequence; Step S2: Provide the final execution mechanism of the distributed lock, and unlock each distributed lock node in the queue A in reverse order in the order of last-in-first-out.

[0011] Applied to the above technical solution, in the method for automatically unlocking distributed locks in reverse order, in step S1, for each thread of the arranged process, create a last-in-first-out queue A, and after adding each distributed lock node to the queue A in sequence, save the queue A to its corresponding thread.

[0012] Applied to each of the above technical solutions, in the method for automatically unlocking distributed locks in reverse order, in step S2: The final execution mechanism of the distributed lock is that whether the process execution is normal or failed, each distributed lock node in the queue A of each thread will be unlocked in reverse order in the order of last-in-first-out.

[0013] The beneficial effects of the present invention are as follows:

[0014] The present invention creates a last-in-first-out queue A for each thread of the arranged process, and each distributed lock node is added to the queue A in sequence; in this way, in the arranged process, there is no need to set up unlocking nodes anymore, and only need to unlock each distributed lock node in the queue A in reverse order; the arranged process is simplified, and the process execution speed is also greatly improved. Detailed implementation mode

[0015] The following specific embodiments will describe the present invention in detail.

[0016] This embodiment provides a method for automatically unlocking distributed locks in reverse order in a low-code development platform, comprising the following steps: Step S1: When arranging the process, create a last-in-first-out queue A, parse the execution process, generate distributed locks for each distributed lock node of the execution process, and add each distributed lock node to the queue A in sequence; Step S2: Provide the final execution mechanism of the distributed lock, and unlock each distributed lock node in the queue A in reverse order in the order of last-in-first-out.

[0017] In step S1, for each thread of the arranged process, create a last-in-first-out queue A, and after adding each distributed lock node to the queue A in sequence, save the queue A to its corresponding thread.

[0018] In the step S2, the final execution mechanism of the distributed lock is that whether the process execution is normal or fails, the distributed lock nodes in the queue A of each thread are unlocked in reverse order according to the order of first in last out.

[0019] The automatic unlocking solution provided by the present invention is to add the locks to a last in first out queue A according to the execution order of the process. After the end node of the process is executed, the distributed locks in the queue A are unlocked in turn, that is, the unlocking operation is performed in the reverse order of locking.

[0020] The main steps are as follows:

[0021] Parse the execution process. When a distributed lock node is encountered, while generating the lock, add it to a last in first out queue A, and the information of this queue A is stored in the current thread.

[0022] Provide the final execution mechanism of the distributed lock, that is, whether the process execution is normal or fails, the locks in the queue A of the current thread need to be unlocked in turn.

[0023] The present invention creates a last in first out queue A for each thread of the orchestration process, and each distributed lock node is added to the queue A in order; thus, in the orchestration process, there is no need to set an unlocking node anymore, and only the distributed lock nodes in the queue A need to be unlocked in reverse order; the orchestration process is simplified, and moreover, the process execution speed is also greatly improved.

[0024] The above are only the preferred embodiments of the present invention and are not used to limit the present invention. Any modifications, equivalent replacements, and improvements made within the spirit and principle of the present invention shall be included in the protection scope of the present invention.

Claims

1. A method for automatically unlocking distributed locks in reverse order in a low-code development platform, characterized in that, it includes the following steps: Step S1: When arranging the process, create a last-in-first-out queue A, parse the execution process, generate distributed locks for each distributed lock node of the execution process, and add each distributed lock node to the queue A in sequence; Step S2: Provide the final execution mechanism of the distributed lock, and unlock each distributed lock node in the queue A in reverse order in the order of last-in-first-out; In the step S1, for each thread of the arranged process, create a last-in-first-out queue A. After adding each distributed lock node to the queue A in sequence, save the queue A to its corresponding thread; In the step S2: The final execution mechanism of the distributed lock is that whether the process execution is normal or fails, each distributed lock node in the queue A of each thread will be unlocked in reverse order in the order of last-in-first-out.