TW201112125A - Method and system for operating an instance of a data structure - Google Patents

Abstract

The invention provides a method and system for operating an instance of a data structure. The method comprises the following operations. Request a weak lock of a first lock for at least one lock free capable operation to operate the instance of the data structure. In response to obtaining the weak lock for the at least one lock free capable operation, perform the at least one lock free capable operation to operate the instance of the data structure. Request a strong lock of the first lock for one lock free incapable operation to operate the instance of the data structure. In response to obtaining the strong lock for the one lock free incapable operation, perform the lock free incapable operation to operate the instance of the data structure. According to the method and the system, the efficiency is improved for operating instances of a data structure.

Description

201112125 VI. Description of the invention: [Technical field to which the invention pertains] In particular, the present invention relates to a method and system for developing and processing a multi-threaded software entity for operating a data structure. [Prior Art]: With the rapid development of microelectronics technology over the past two decades, computer == and capacity have increased significantly. More computing resources mean that you can do more in parallel. Therefore, the parallel system is playing an increasingly important role in the processing of parallelism. Parallel software development in information = in order to execute the program or program in the computing system. Sequence steps related to program execution. ' Threads. The thread is the instruction set, or the program pulls: the order;: 3 one or more programs " stand by the execution of a stubborn χ, 疋 zone slave. You can take a look at the -U. Therefore, the 勐 processing program, from the 4... 仃 基本上 basically is a light “negative” to perform the task in the early program. Usually, filial piety will be responsible for the scheduling and execution of several threads. : For a data organization solution, such as records or data Arrays as capital; or to perform operations on the data. The actual structure of the data structure - the process of "--------- Entities that process data structures typically use multithreaded handlers in the system resource family. This can be done in -program (four) # „ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ Improve system efficiency during the same period of time. It is used in a variety of tasks. However, the schedule of threads must be considered 143290.doc 201112125 If the right schedule is not suitable, it is known and executed sequentially to enable execution. The thread completes the task between 5J-time. The program will make mistakes or cause unreasonable results. Compared with the software, it is difficult to develop multi-threaded software. 'So there is no suitable synchronization mechanism with parallel system structure, causing unpredictable The error. As of the thread software, that is, based on the lock, there may be defects in the program that may be contradictory between multiple threads. In particular, if the parallel access to the shared data structure will be used today, two methods are used to develop The method and the lock-free method. The idiom stylization (4) method is a shackle to synchronize the access to the shared resource. Such as mutual exclusion - β 吟 flag (difficult coffee e) and off Keypad 2; -Ο11) Synchronization base 71 is a program that can be used by the programmer to ensure that the program's scores are not executed at the same time (otherwise the shared memory structure will be destroyed) =: If - the thread tries to get the other thread If there is a lock, the thread will block the 'until the lock is released. For example, a number of threads are executed in a specific order. If you have to order the thread in order, you can use the thread lock. The basics of the locks are as follows: executor and execution _ will operate two function cores separately, and must be executed before tB, and can be entered into the waiting setting by scheduling, and there is no slave in Ba. It is started from the wait setting. This will be executed in the order of 8 before execution, and will be executed after a. Straightening, it is simple for the common machine 2 for processing synchronization between programs or threads. In parallel computing environments for high-performance applications, the mutex is not scalable when the material is locked and many threads are executed in parallel. Parallel access to shared data requires complex improvements in 143290.doc 201112125 Lock strategy to schedule will be ' ^ ^ Shiyan There is no contradictory operation. It is difficult to maintain a good pregnancy. There may be hidden problems, such as deadlock or reverse priority. For many reasons, it is not desirable to seal the anchor / _ / The reason is that the lockout is blocked. The obvious reason is that when the execution/implementation is blocked, 'it can't do anything during this time. If the light is blocked, the person who is holding the priority task or the immediate task is not hopeful. Stopping its progress. In addition, specific disturbances between locks can lead to error states such as deadlocks, livelocks, and priority reversals. The use of locks also involves coarse-grained locking of the opportunity to significantly reduce parallelism. A trade-off between fine-grained locks that are more carefully designed and more prone to errors. The lock-free method is a choice of multi-thread software development and processing. Use the atomic primitives provided by the hardware 3. The singer is used to write without locks and etc. These primitive primitives can be found in the most popular hardware instruction set. The most notable aspect of a partially incomplete primitive is "Comparative and K is usually referred to as "CAS"). It requires three arguments: the old value of the memory and the new value. If the address contains an old value, the old value is replaced with the new value. Otherwise, the old value is not changed. The key is that the hardware ensures that this "comparison and swap" operation is performed atonucally. The success of this operation is then reported back to the program using the value 丄 or 0. This allows the algorithm to read the data, modify the data, and write back the data (only when there are no other threads to modify the data at the same time). Both of the above methods have the advantages and disadvantages shown in the following table. 143290.doc 201112125 Scalability Stability Development Difficulties based on locks ____ Poor. The thread needs to wait a while before entering and leaving the critical section.

- Threads. —▼ I I», -t/vtj *«g j·His thread is still in the 捍B 2 often with the f algorithm (mechanism) completely i

Z Accident t (S i, L: The execution efficiency of these operations is low. It is often necessary to verify that the correct inter-thread is executed.) He & lock +

Fraser refers to a hybrid scheme based on the 2004 ^Keir Fraser lock (see ractical l〇c)c r performance-time performance feedback to the root 4reedom). It can then be used like a pre-competition & Dynamically selecting which one to use using the degree of synchronization primitives [Summary] The execution period distribution and switching of 1. In view of the shortcomings of the prior art, the present invention contemplates methods and systems of entities.托 托 — — — — — — — — — — — — — — — — — — — — — — — — — — — — — — — — — — — — — — — — — — — — — — — — — — — — — — — — — — — The real lock of the data structure, the execution of the at least one wounded "the weak entity of the operation without the lock ability; the request for the supply of a non-summer - the operation of the data structure is a lock-free lock to operate The entity of the data structure. The strong lock of the operation of one of the first locks of the vehicle, the execution = should be obtained for the entity that does not have the structure of the lock-free operation. ^ No lock-free capability Operation The present invention also provides an operating resource comprising: a weak lock module, which is used for a system of technology/°#. The system is one of the first locks, and the first lock has a lock-free capability. From the %, the data is surnamed m ^ α leaves, and the structure is constructed; the implementation has 143290.doc 201112125 lock-free operation operation & * · 4, which is used to respond to the acquisition of the at least No lock ability, shake 祚 # # 22 & ^ operation with r "row At least one has the ability to lock-free I naked to operate data gentleman broadcast Xilu: ja* - strong lock module, which is used to request the operation of the structure without the lock-free ability; and the implementation does not borrow 1 lock One of the strong locks is a module that does not have the ability to operate without locks, and the second lock is used to obtain the lock-free ability to obtain the strong lock for the operation without the lock-free operation. The entity that operates to manipulate the data structure. The foregoing method (4) of the present invention can improve the efficiency of the carcass of the operational data structure. [Embodiment] The data structure is a kind of data organization solution, such as a record or data array '^ to facilitate data analysis or perform operations on the data. The physical structure of the data structure ^ the data structure - the implementation of the object. The common method for the structure of data structures or data structures related to multi-thread processing is to ensure the correctness of the data structure in multiple threads or to ensure the correct operation of the entity of the data structure. lock. The lock theory itself or the lock mechanism used by the present invention to protect the data structure with locks is similar to the lock theory or lock mechanism used in the prior art. For example, for a material structure H that needs to acquire a lock before processing, (4) can be processed only after the lock is pure. The embodiment of the invention differs from the prior art in two aspects, namely, which operation requires a lock and which lock is required. Moreover, another embodiment in accordance with the present invention may allow an operation to perform different operations after obtaining different locks. This is different from the prior art. The following will be described with reference to the drawings. Different prior art techniques apply different strategies (when under what circumstances locks are required). 143290.doc 201112125 For example, a lock-based order or operation. Therefore, it is safe to use locks to protect all processes to ensure the security of the relevant data structure. However, the expandability is not good. For example, please refer to the extension chart ==: based on the lock method _, there are four rows, then the other three execution two: broken: line. If al gets the lock and starts holding the lock. [After al completes execution, it releases its receivers, picks up the other three executors, and sings the executors of the locks. So with 31 classes, therefore, the other threads will be blocked. 4 Into the critical part and the time period of leaving the key part. The thread needs to be the main class> complex thread class 4. The algorithm or mechanism of the thread is similar to the sequential execution of I. Judged in the line. Lack and block other good locks. ',, and ' as shown in Figure 2a, the stability of the lock-based method is not shown in Figure 2a. In the abnormal abort in the prior art lock-based method, the abort with the lock thread (e.g., la) Will block its second line. For example, if the thread la is a deadlock' and it holds a hold, the other waiting threads will not have to wait for a long time. * Two first::::: One detailed implementation system... Example B example Finding, first stacking has the following configuration. In the prior art, it is not safe to have multiple threads or threads that will be executed in parallel. And example 1 i α

Top: Node sizerint H3290.doc 201112125 j ensures the correctness of the operation of the heap #, the prior art system based on the lock method (10) k: L〇ckType). For example, the entity that is stacked causes the lock to request a lock before performing an operation on the stack. The lock operation or thread is processed to process the stack, and the locks are released after the handler is completed, and other threads that need to process the stack will be blocked. These blocked threads can attempt to acquire a lock until it acquires a lock. Example 2

--- Adjust the mother's operation (for example, Push(), P〇P() or cloneO) ^1〇ck-1〇ck()at^^^^ ^l〇c^ 〇0 Allows only one thread to process the stack. According to an embodiment of the present invention, as shown in Example 3 below, a method of setting a read lock and a write lock can be used (similar to the previous (4) - a lock containing a weak lock rL〇Ck: WeakLock and a strong lock. A number of operations/executions are weakly allowed during the same time period to allow only one operation/execution to obtain a strong lock, and it is not allowed to obtain a weak lock and a strong lock during the segment to perform a weak lock or strong lock operation. Parallel execution of a plurality of operations for obtaining a weak lock of the first lock, as shown in FIG. 1b, @2b, and FIG. 4a. During the period in which the operation of obtaining the strong lock is processed, other operations for processing the stack will A blocked obstruction operation may attempt to acquire a lock. For example, during a period of periodically attempting to obtain a weak lock operation, the J43290.doc 201112125 operation will be blocked, and other requests for weak locks will be blocked. A weak lock. Similarly, 'the blocked operation can try to get a strong sales, set the culvert lock, for example, periodically to try to obtain a strong lock. Example 3 Stacking entity: wLock: WeakLock —-----sLock.'StrongLnrir - - top-TMnH A ----------------- --- Figure lb illustrates the mechanism of the prior art lock-free implementation method. The purpose of the lock-free method is to overcome the scalability of the lock-based method. The shortcomings of the good. As shown in the figure, in the lock-free method, the efficiency of multiple threads, b2, w (four) good threads or programs can be executed in parallel. The non-shot method is not only good scalability, but also stable. Figure 2b illustrates the abort in the prior art lock-free implementation method. As shown in Figure 2b, 'If the thread bl is aborted', other threads bi, b3, and b4 will still be executed. It is difficult to develop a lock-free method. The execution-free algorithm (or mechanism) of a lock-free method is usually completely different from the sequential algorithm (or mechanism). It usually needs to verify the correctness of the complex logic of the thread. In addition, the execution of this operation The efficiency is very low. According to the embodiment of the invention, the parallel execution mechanism of the lock-free method and the sequential execution mechanism of the lock-based method are integrated for multi-thread processing. Those skilled in the art understand that it can be hard. Body, operating system or application Set the protection scope of the lock. In the prior art, by setting the weak lock (wl〇ck: WriteL〇ck) and the strong lock (wL〇ck: WriteL 〇 之 = = domain or functional domain, a plurality of Operations with weak locks can perform their operations in parallel, 143290.doc 201112125 and a strong lock operation will perform its operations exclusively. As is familiar to those skilled in the art, the method is similar to the prior art and can be used in hardware and work. The system or application sets the protection threshold or p-domain of the weak lock and the strong lock. Therefore, 'a plurality of operations with weak locks can perform their operations in parallel' and the operation with strong locks will exclusively perform the operations in the 3 It is shown that, by setting the weak pin r τ t, the above figure is weakly locked (wLock: WmeL〇ck) and strong lock (wLock: WriteLock), and the protection field of the strong lock (wLock: WriteLock) is a fly-of-flight b domain. Execution of its choice, __, ', and a strong lock operation will perform its operations exclusively. In this situation, the slick brother T 4 ensures the scalability, stability or characteristics of the development of the multi-processing process by an additional mechanism. Figure 3 illustrates a method of operating an entity of a data structure in accordance with an embodiment of the present invention. At step S1 00, the method gate is started. At step suo, the operation of the entity of the lean structure is classified into the operation of the non-locking capability and the operation of the non-presentation. As described in the following paragraph ^, the plural kinds of parties (4) are used to understand the (4) points (4) of the entities of the Lai structure and the non-locking ability to operate as a heat learner. This step can be borrowed. It is executed by the software development tool 戋θ# execution period environment, and can be independent of step 812〇'S丨6〇. In addition, the function of the lock can be configured during the program or execution period, ten-generation ship (for example, as described above: in hardware, operating systems or applications). Allow multiple # during the same period + Ά tj knife is J to obtain the first lock weak lock, allow to obtain the first lock strong lock, not allowed in the same - period ^ to obtain the first lock weak lock and strong lock ; in which, a plurality of operations of the weak lock are performed in parallel. The operation performed by the lock-free operation with A lock can be I43290.doc 201112125 Contains write operations. In other words, according to an embodiment of the present invention, an operation with a lock-free capability may only include a read operation, and a knowledge of having a (four) force may include a write operation. In addition, the film in the above description is "the first = the real" refers to the lock. The use of "the first" is only for the reference to two mistakes: Lv, 帛一锁" in the context of the reference to the above mentioned " The first 」"' to avoid the use of "locks" would confuse the "lock" mentioned above or the "weak lock" mentioned in the text. At step S120, the first etching of the operation of the at least - and - the weak lock of the lock (four) is requested. If the other operation has obtained the weak lock of the first lock, the operation of the at least - and _ ^ ^ ready lock-free capability is allowed to obtain the strong lock of the at least the first-locked lock, and the operation of the lock will be blocked until the operation The strong lock is released. It will be appreciated by those skilled in the art that locks in accordance with embodiments of the present invention are used in conjunction with other lock assignment mechanisms, such as a mechanism or the like. °, according to the priority of the lock assigned in step SU0, in response to the acquisition of at least one of the weak locks, the implementation of the at least one,,,,,,,,,,,,,,,,,,, To operate the information, -. Constructed entity. According to the invention, in the case of a falling ϋ~m example, a lock-free capability can be performed only for a read operation, and a certain lock-free operation can be performed according to the present invention. The method can be further included. In response to the non-locking capability, the weak lock is released. In the case of step S14 0, the book does not have the strong lock of the first lock of the operation without lock capability to operate the structure of the data structure. The other right operation has obtained the first 143290.doc -13. 201112125 blocking the weak or strong lock', then the operation without the lock-free ability will be affected until the weak lock or strong lock is released. The action = ΓΓ 'in response to the acquisition of an entity that does not have the ability to lock-free: the operation of the non-lock-capable operation to operate the data into the body. According to another embodiment of the present invention, the method can further scoop the ::::: non-locking operation operation data structure to release the bare lock. At step S160, the method ends. Those skilled in the art will appreciate that steps 5120 through 8160 = the solution and will be implemented directly in the brother or tool software by the above described strong and weak locks. The entity of the data structure refers to the embodiment of the data structure. Ο-(4) is a commonly used data structure. Other commonly used data; 2 sequential string msequential (four), tree, chart and jump,: 3, ,,. "Listing" is a concatenated string structure. Linked Columns - Nodes have metrics that point to the next-node. The data structure "% of the work usually includes adding elements, deleting" sounds; 钗 兀, ergonomics: and sorting... In one embodiment of the invention, an entity is illustrated; the string contains a plurality of elements. 1 One embodiment can use a strong lock and a weak lock to protect - a different kind of weak lock and strong lock protection material or functional domain, a plurality of operations with weak lock can perform its operation in parallel, and a 'ϋ# ^ /J: -V' 1J, Jto. , ^ Operations with strong locks will perform their operations exclusively. For jobs with lock-free capabilities, you can use weak locks to perform their operations in parallel. Strong locks are available for non-lock-capable operations for exclusive access, and the device is 143290.doc •14· 201112125 for accessing the List. Next, an example is given to describe the operation with lock-free capability and the operation without lock-free capability. In the following embodiment, the operation add is an operation with no lock capability, the operation remove is a lock-free operation, and the operation sort is an operation without a lock-free capability. After the operation add gets the weak lock of the List - after the operation remove, the weak lock of the List can also be obtained. Therefore, the operation add and the operation remove can be performed in parallel. Will not allow parallel execution of the operation sort and operation add or operation remove 0 class List { private Lock weaklock, stronglock ; public List() {

WeakStrongLock wslock=new WeakStrongLock(); weaklock=wslock. weaklockQ; stronglock=wslock.stronglock(); } In the above program, first define the List category, then use private lock weaklock, stronglock to define the lock on the List category. At the beginning of the program, a lock is generated WeakStrongLock wslock=new WeakStrongLock() ′ which contains the weak lock weaklock=wslock.weaklock() and the strong lock stronglock=wslock.stronglock(). Public void add(Object obj){ try{ weaklock. lock(); // do the lock free add 143290.doc -15- 201112125 } finally { weaklock.unlock(); } } In the above program, used to add objects The operation add of obj to List may contain one or more operations that are not partially complete. Therefore, the operation add is an operation with no lock capability. When the operation add is to be executed, the weak lock is first requested with weaklock.lock(). In response to obtaining a weak lock, execute the lock-free operation add to add the object obj to List; in response to the completion operation, weaklock.unlock() will release the weak lock. If the strong lock of the lock is obtained by another operation or thread, the operation add will be blocked. Thus, the operation of add can obtain the requested weak lock only after the strong lock is released. Public void remove(Object obj){ try{ weaklock.lock(); // do the lock free remove } finally{ weaklock.unlockQ; } } In the above program, the operation remove used to delete the object obj from the List contains one or Multiple non-partial operations. Therefore, the operation remove is a lock-free operation. When the operation will be removed, first ask for a weak lock with 143290.doc -16- 201112125 weaklock.lockO. In response to obtaining a weak lock, a lock-free operation remove is performed to add objects obj to Ust; and in response to the completion operation, weaklock.unlocko will release the weak lock. If the strong lock of the lock is obtained by another operation or thread, the operation remove will be blocked. Thus, only after the strong lock is released, the remove can be operated to obtain the requested weak lock. However, if the weak lock of the lock is obtained by another operation or thread, then operating remove can obtain another weak lock of the lock. Public void sort() { try{ stronglock.lock(); // do sorting } finally{ stronglock.unlock(); In the above program, the operation sort for sorting the object 〇bj in the category List cannot be divided into predefined ones. One or more operations that are not partially complete. The number of operations that are not necessarily partially completed will vary depending on the number of elements in the List. Therefore, the operation sort is an operation that does not have a lock-free capability. When the operation sort is to be executed, the strong lock is first requested with stronglock l〇ck(). In response to obtaining a strong lock, the operation does not have the lock-free operation s〇rt; and in response to the completion of the operation, stronglock.unlock〇 will release the weak lock. If the strong or weak lock of the lock is obtained by other operations or threads, the operation s〇rt will be accepted. On 143290.doc 201112125 疋 Only in strong or weak locks are released against 铋 4- JtA- strong lock. After the release, the sort can be obtained by the sort. Figure 3] α ^

For the data structure: T has the benefit lock 2 class into the operation without lock ability and does not, ...., step S11 贞 operation of Bao Baoli. According to one of the aspects of the present invention, the non-locking algorithm is required to be a lock-free ability. * ^ The 5 hai-classification is not part of the... The second lock-free algorithm requires a knife. The number of operations gx β is not beneficial... When the number of cranes is ,, the operation is classified into two devices without lock... operation. In the present invention, the helmet is only used, when the tube, t, and only u~r are constant, and the number of the constant and the data knife 4 is inserted into the operation of the eight charms, ' If the number of elements of the entity of ° 4 is irrelevant, then the lock algorithm needs to be used, and the right--there is nothing to be done, and the number and the entity of the data structure are The number, classified as not and prepared ', related, then the operation of a single operation without lock ability. The possession of an entity with no data to the data structure defines a number of non-partial parts that can be divided into helmets containing pre-structured entities, preferably, operations that complete the data. The operations of entities that are 1 to 5 incapable of the data structure cannot be divided into a predefined number = no lock-free capability. For example, the operation that cannot be partially completed, Litian # + only needs a τ π in the case of processing List, adding ~ 仅 only ^ can not be partially completed π 素 and remove A 7C element only needs to be - 143290.doc 201112125 or two operations that cannot be partially completed. Therefore, these two operations can be classified as operations with no lock capability. And the operation of the List s. The number of elements in the reading data structure is related to 'therefore, it is an operation that does not have the ability to lock. can. The push or P〇P in the stack is classified as an operation with no lock and lock, and the frame for adding the map will be classified as an operation without lockability. In the prior art of the present invention, a lock-based method uses a lock for protection. This data structure is secure but has low scalability. If the data structure - some operations can be unlocked and safe for multiple threads, for example, add () and ust. Ve(). Other operations are not safe for multiple threads, for example, for ^). The use of data structures is limited. When using methods that are not safe for the thread, the programmer must be careful to treat the safe time, and it is not safe to call the thread during this safe time. This mode requires more attention from the programmer, so development efficiency and execution efficiency will be affected. According to the p embodiment of the present invention, if the number of units to be modified by the operation is constant, the operation is classified as having a lock-free capability and fine-grained; if the number of memory units to be modified by the operation is continued - Operations are classified as operations that do not have lock-free capabilities. According to another embodiment of the present invention, the number of memory cells to be modified by the operation without lock capability is independent of the number of elements of the entity of the data structure; the number of memory cells having operational modifications without lock capability and The number of primes in the data structure is related. Preferably, the memory unit having the lock-free capability is smaller than the add-to-snap operation. The operation of the memory lock-capable capability is greater than the twin or two non-subsequent words. 143290.doc .19- 201112125 For the above example for processing List, the add-element only needs to correct the metric in the original Llst; and deleting an element only needs to correct the original List 2 - or both metrics. Therefore, these two operations can be classified into and prepared for operation. For the element of sorting one, the number of elements in the correction (2) is proportional to the number of elements, so it is an operation that does not have a lock-free month & force. Λ According to another embodiment of the present invention, in the processing of the first one, in the processing of the same data, for the same performance efficiency and in the lock of the data structure, ... lock ... meaning, then - in the mode The difference in efficiency is less than the predetermined wide-mother-operation classification as an operation with no lock capability; otherwise, the parent operation is classified as ρ slave, which has no lock-up capability. Preferably, in the early thread processing, in the case of the right, the operation, if the performance efficiency in the same entity of the w... is in the lock-based mode < performance efficiency The difference is 55 times, the operation of the material in each material. No, the thousand mother # is classified as having a lock-free operation. Each operation is classified as having no lock-free capability. Each operation of the material structure can be locked, and the other is only applied to the peptide, and the other is based on the implementation of the lock. In the example of ^^τ., Wo j· is used to process the List 4. The operation of adding the element and deleting the element are similar to the implementation based on the lock. Therefore, the efficiency of the knowledge is not the ability to lock. ^Two operations are classified as having a work. The sorting used for Ust2 is very low, so it will be..., lock implementation efficiency. This is classified as not having a helmet lock, and is added for the operation of locking the moon. This is low. The efficiency of the lock-free embodiment is very high. 143290.doc 201112125 According to another embodiment of the present invention, the port shown in FIG. 3 allows a plurality of operations/executors to be respectively: , 颂的弱锁,分楛楛

An operation obtains a strong lock of the first lock, and does not allow - D ^ 获得 to obtain a weak lock and a strong lock of the first lock during the 冋-time period; wherein, the plurality of operations obtained are performed in parallel. Among them, the weak lock J ^ step of the method of FIG. 3 includes: in response to the operation of the data having the lock-free capability, the operation of the data, ~ 0 ^ bamboo, ·, °, the release of the weak lock; in response to the lack of lock-free ability The operation has been manipulated to release a strong lock. Figure 4 and Figure 4b (4) According to the material - the effect of the implementation of the material. In Figure 4a, two or more operations with lock-free capability can be performed in a flat stroke. In this case, '- or multiple operations that do not have lock-free capability are blocked. For example, the operations such as add〇 and rem〇ve() shown in Fig. 4a in parallel and without the lock-free operation such as () are blocked. In the map, one or more operations that do not have the ability to lock are not performed in parallel, while other operations that do not have the ability to lock without lock and the operation without lock are blocked. Sequential execution of the slap in the map, etc., while other operations that do not have the ability to lock and the lock-capable operations add () and remove () are blocked. In the prior art, there are many benefits in the lock-free approach, and it is difficult to develop such methods. Therefore, the lock-free mechanism is usually used for simple operations. For example, the following operations operate on the entity of the data structure (linking the serial (10) members). Class List{ public void add(Object obj); public void remove(Object obj); 143290.doc -21 . 201112125 public void sortQ; It is not difficult to implement a lock-free mechanism on the add() and remove() methods. Add() is used to add an element' public void add(Object obj) to add an object element for the Ust class, and the add for this List can be called by other thread operations. removeO is used to delete elements, pubHc v〇id rem〇ve(〇bje^ 〇bj) means to delete object elements from the List category, and __ for this heart can be called by other thread operations. S〇rt() is used to sort elements, puWc void sort〇 represents the object elements of the sorted list, and is used for this List "s(10) can be called by other thread operations. However, it is difficult to implement a lock-free mechanism for the (10) call method. The reason is that the entity list of the data structure usually contains a plurality of elements. Therefore, during the sorting of Li-like elements, if other threads add object elements to the List or remove the object elements from the List, a contradiction will arise. Yu Yu, the natural method is to use locks to protect s〇rt(). Therefore, the code is rewritten as follows. Class List{ public void add(Object obj); public void remove(Object obj); public synchronized void sortQ; } public synchronized void s〇n() means that the execution of the buckle requires the i〇ck unlock pair. In this case, s〇rt() is corrected by the synchronization method. When the operation is to be performed, the lock is first attempted; the operation is performed after the lock is acquired; and the lock is released after the sort operation is performed. Therefore, only one thread is allowed to enter 143290.doc 201112125 This method calls sort at any time. However, the above method is not correct. If another thread is trying to delete a node with the remove method when one thread enters the sort method, the sort method may fail. This is because the add() method may sometimes provide the sort() method. In addition, although the sort() method is locked, add is unlock-free. This allows add to be executed at any time. There may be contradictions. Therefore, the secure version will use the following method, where all operations are performed using the synchronous (or locked) method. Class List{ public synchronized void add(Object obj); public synchronized void remove(Object obj); public synchronized void sort(); } The above public synchronized void add(Obj ect obj) means that the lock is required to execute add. Public synchronized void remove (Object obj) means that the lock unlock pair is required to execute remove. List is now safe. However, all three methods are protected with a lock. Thus, as shown in Figures 1 and 2, only one thread is allowed to enter one of the above three methods. In Figure 1, a simple operation acquires a mutex and blocks other operations to obtain a mutex. In Figure 2, a complex operation acquires a mutex and blocks other operations to obtain a mutex. This mode prevents parallel execution of software execution. Figures 5a and 5b illustrate prior art operational performance as compared to an embodiment of the present invention. Prior art applications were based on lock operations. In Figure 5a, because add() needs to perform a write operation instead of just a read operation, the time period m at which 143290.doc -23- 201112125 add() is executed requires = lock other operations with a lock. In the figure pair, because the line operates as #0 instead of just the read operation, other operations are blocked with locks during the execution and time periods. The present invention also provides a method for the entity corresponding to the entity of the operational data structure described above. The system comprises: a weak lock module, which is used for seeking the weak lock of the first lock of at least the operation data _, the backup ', and the lock capability in June, and the lock is capable of being locked. The operation module has a weak lock body for responding to obtaining the right--- performing the at least-lock-free operation. Strong ^..., the operation of the lock capability to operate the real structure of the data structure 'strong lock mode Group, which is used for bite + Λ The first L is used to solve the problem - the lock of the first lock that does not have the ability to lock-free operation to operate the data structure. The operation of the ability and execution does not have the ability to lock. H, and 'in response to obtaining a strong lock on the knowledge of a force that does not have a lock-free month b. ^ ^ ^ Hai does not have the ability to operate without locks to fall into a poor structure of the entity β Ρ乂铞 Among them, the weak lock module and the strong lock module. ^ ^ Operation in the same time-time configuration. Allow multiple slaves to obtain the first lock weak operation to obtain the first lock charm "v lock #only - a weak lock and a strong lock of the lock - the first operation is obtained during the period, in which the plural of the weak lock of the first lock is executed in parallel System: the step-by-step includes the blocking module 'The blocking module enters the step-by-step=in response to the execution of the operation without the lock-free capability, and the block-off request is the strongest lock; and in response to the execution, the blockade喑犮坌 ^ , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , The group is further configured ^ ^ a ^ u should be in the entity with the structure of the lock-free ability, release the weak lock '· and strongly lock the module into the structure of the entity, release the strong lock. The operation of the force has been operated 'Operation performed by a lock-free operation may include a write operation. The system may further include an operation classification of the entity that operates the substructure. (4) Two is used to divide the operation 1 of the data lock capability _ and: lock: force Operation and not available... • Knife_Group In-Step Configuration to classify the operation of the entity of the data structure into a lock-free operation and not with the above-mentioned two::: or a combination thereof Operation without lock capability. Compared with the prior art, this issue The lock-based method is integrated to expand the ιΓ文, and the lock-free (four) code can be executed in parallel, which has good scalability, but is difficult to program. The good η based on the lock method is not only easy to understand and program When it is in the thread, it is parallel... "Without lock operation, the operation with lock-free ability can be confirmed = D = multiple characteristics and variable consistency - to ensure that the field can not be partially completed and to perform without lock-free ability Falling and other non-locking knives are used in a timely manner, using strong locks to ensure companionship, ..., and eight-capacity lock-free operation to complete the characteristics and variable consistency of the 摅太Γ. According to the y method of the present invention, when there is only a simple method without complicated operation, an entity having an early data structure can be executed in parallel. Bo (4). A strong lock can be used to perform operations when performing operations to manipulate complex methods of data structures. 4 If necessary, it will not be blocked without lock. 143290.doc • 25· 201112125 The present invention also provides a storage medium or signal_, which contains instructions for performing the method according to the present invention. While the invention has been described and illustrated with reference to the preferred embodiments of the embodiments of the present invention, it will be understood that various changes may be made in the form and details without departing from the spirit and scope of the invention. BRIEF DESCRIPTION OF THE DRAWINGS Figure la illustrates the mechanism of the lock-based method in the prior art. Figure lb illustrates the mechanism of the lock-free method in the prior art; Figure 2a illustrates the abort in the lock-based method of the prior art; Figure 2b Illustrating an abort in the lock-free method of the prior art; FIG. 3 illustrates a method according to the present invention; an operational performance of an embodiment of an operational data structure of an embodiment; and a prior art compared to an embodiment Figures 4a and 4b illustrate the performance of the present invention as illustrated in Figures 5a and 5b of the present invention. [Main component symbol description] a 1 Thread a2 Thread a3 Thread a4 Thread bl Thread b2 Thread b3 Thread b4 Thread 143290.doc •26·

Claims (1)

201112125 VII. Patent application scope: 1 . A method for operating an entity of a data structure, comprising: a weak request to at least one lock of a first lock having a lock-free operation to operate the entity of the data structure; The weak operation of the data node is in response to obtaining the at least one lock-free capability lock, performing the at least one lock-free operation to construct the entity; the lock one strong lock request is not capable of lock-free capability The operation of the entity to operate the data structure; and, in response to obtaining the strong lock operation for the non-lock-free operation, the non-lock-free operation to operate the data structure 0 ～ 奴 锞 获得 获得 获得 获得 获得 获得 获得 获得 获得 获得 获得 获得 获得 获得 获得 获得 获得 获得 获得 获得 获得 获得 获得 获得 获得 获得 获得 获得 获得 获得 获得 获得 获得 获得 获得 获得 获得 获得 获得 获得 获得 获得 获得 获得 奴Strong lock; wherein, the plurality of operations for obtaining the first are performed in parallel.颂< I 3. 4. The method of claim 2, further comprising: responding to the operation of the lock that does not have the lock-free capability; the operation of the corresponding force, the request for the first lock One = no; there is no other operation of the strong lock of the first lock. The method of reading or reading the St method further comprises: in response to the entity having the lock-operated structure, releasing the (four) 143290.doc 201112125: the data structure should be operated in the operation without the lock-free capability The entity releases the strong lock. ^ : The method of claim 1 wherein the operation performed by the lock-free operation may include a write operation. 6·=The method of claim 1, the step-by-step includes: classifying the operation of the data structure into a non-locking energy operation. And the method of not having the lock-free energy 7_, such as the request item li6, wherein if the number of operations that are not partially completed by the algorithm is one, the operation is classified as having no lock capability. The operation; if: The number of operations required for the lock-free algorithm is not the operation of the force of the I-cut. Knife face does not have no lock energy 8 · If the request item 7 $ ancient. Need not to Λ ^ ', one of the right one operation without lock algorithm °. The number of operations performed by the division is a constant, and the number of elements of the division is 1 ^ and the number of elements of the data and the number of elements of the body is classified as ... The operation of the ability; and the operation of the _ lock-free algorithm is not required to do the same - the number of the number of the elements of the state of the P-knife 7L into the right-hand day, the X-based structure of the actual, then Classify the S-operation as the operation of the capability. In order to not have no lock 9. If the request item 1 ^. method ', the operation of the data structure, the operation without lock capability can be divided into the operation including the predefined number of operations. The number of derogatory ones cannot be partially completed. 143290.doc 201112125 10. The method of claim 7, wherein the operation of the data structure without lock capability can be divided into ' ° ' η 珉 1 to 5 non-partial operations. π·If the number of memory cells modified in any of the items 1 to 6 is double-horse*, the operation is divided into operations with lock-free capability. - The number of 5 hais of the memory file that is modified by operation is not a constant, and the operation of the 锁心锁能力. ',备..., 12. If the method of requesting 丨i, the pot ^', the temple is equipped with no The number of the memory unit modified by the operation of the lock capability is different from the number of the element of the entity that is inferior to the structure of the lock; the memory to be modified by the operation without the lock, ... The number of 兀 is related to the data structure of the entity ~ the number of elements of the entity. 13. If the method of research is used, the operation of the eight-capacity-free operation can save less than one word of the unit.桠祚 次 双 , , 该 该 该 该 该 该 该 该 该 该 14. 14. 14. 14. 14. 14. 14. 14. 14. 14. 14. 14. 14. 14. 14. 14. 14. 14. 14. 14. 14. 14. 14. 14. 14. 14. 14. 14. 14. 14. 14. 14. 14. In a single thread processing, the same for the data structure Each operation of the entity - ", the efficiency efficiency in the lock-free mode and the _ lock-based mode: the difference in the efficiency of the month b is less than a box of the fixed value, the value of the $ π pre-existing value, then the operation is classified as The operation of the benefit lock capability; otherwise, the operation, "', the operation. "The class is a method that does not have the lock-free capability κ such as the request item u", in a single-thread processing, for the data structure The operation-class-in-operation-in-the-benefit mode has a performance difference of less than μ times in the performance of a lock-based mode, and the operation is classified as having a lock-free ability. 143290.doc 201112125 16. 17 18. 19. Otherwise: classify the operation as an operation that does not have lock-free capabilities. An operating system structure-physical system comprising: a weak lock module for requesting an entity that has at least one lock-capable operation - a lock - a weak lock to operate the data structure; A module having a lock-free operation for performing the at least one lock-free operation to operate the f-structure by obtaining the weak lock of a lock-free operation The entity; the strong lock module 'is used to request the pair - the lock that does not have the lock-free operation, one of the locks to lock the entity to operate the data structure; and the second operation that does not have the lock-free capability The module is configured to perform the entity that does not have the power to operate the data structure in response to the strong lock that is not capable of operation without lock capability. , the system of item 1 'which makes the weak lock module and the strong lock module enter a first =, and state · allows a plurality of operations to obtain the weak lock of the lock during the same period, allowing only - The operation obtains the strong lock of the first lock not in the same period: the first lock-weak lock and the action are obtained. . , in the 'parallel execution of the first lock to obtain the weak lock of the first lock:: the death of the system! 7 further includes a lock module, the blockade model is configured in 7 steps to: in response to the execution of the non-existence Locking ability 2: The lock requests the strong lock-operation of the first-lock; and responds to: the operation without the lock capability, the block request for the first-lock is the same as the lock or the fourth lock The other operations of (4). The system of member 16, wherein the weak lock module is further configured to: M3290.doc 201112125 responsive to the entity having the lock-free operation that has operated the data structure, releasing the weak lock; and the strong lock module Further configured to respond to the non-lock-capable operation of the entity that has operated the t-material structure, releasing the strong lock. 20. The method of claim 16, wherein the operations can include a write operation. Execution by the lock-free operation 21. The system of claim 16 further comprising - operating the operation of the entity of the data structure and having no lock-free operation. An operation classification module, which is classified as having a lock-free capability A such as: a system of claim 21, wherein the operation classification module is advanced by any of the methods of claims 7 to 5 - ^ The operation of the entity is classified as having 5 operations that are omnipotent, combined, and non-lockable. Locking ability I43290.doc