97 results about "Spin locks" patented technology

A lock / unlock mechanism to control concurrent access to objects in a multi-threaded computer processing system comprises two parts: a thread pointer (or thread identifier), and a one-bit flag called a "Bacon bit". Preferably, when an object is not locked (i.e., no thread has been granted access to the object), the thread identifier and Bacon bit are set to 0. When an object is locked by a particular thread (i.e., the thread has been granted access to the object), the thread identifier is set to a value that identifies the particular thread; if no other threads are waiting to lock the object, the Bacon bit is set to 0; however, if other threads are waiting to lock the object, the Bacon bit is set to "1', which indicates the there is a queue of waiting threads associated with the object. To lock an object, a single CompareAndSwap operation is preferably used, much like with spin-locks; if the lock is already held by another thread, enqueueing is handled in out-of-line code. To unlock an object, in the normal case, a single CompareAndSwap operation may be used. This single operation atomically tests that the current thread owns the lock, and that no other threads are waiting for the object (i.e., the Bacon bit is "0'). A global lock is preferably used to change the Bacon bit of the lock. This provides an lock / unlock mechanism which combines many of the desirable features of both spin locking and queued locking, and can be used as the basis for a very fast implementation of the synchronization facilities of the Java language.

A queue-based spin lock with timeout allows a thread to obtain contention-free mutual exclusion in fair, FIFO order, or to abandon its attempt and time out. A thread may handshake with other threads to reclaim its queue node immediately (in the absence of preemption), or mark its queue node to allow reclamation by a successor thread.

The system and methods described herein may be used to implement NUMA-aware locks that employ lock cohorting. These lock cohorting techniques may reduce the rate of lock migration by relaxing the order in which the lock schedules the execution of critical code sections by various threads, allowing lock ownership to remain resident on a single NUMA node longer than under strict FIFO ordering, thus reducing coherence traffic and improving aggregate performance. A NUMA-aware cohort lock may include a global shared lock that is thread-oblivious, and multiple node-level locks that provide cohort detection. The lock may be constructed from non-NUMA-aware components (e.g., spin-locks or queue locks) that are modified to provide thread-obliviousness and / or cohort detection. Lock ownership may be passed from one thread that holds the lock to another thread executing on the same NUMA node without releasing the global shared lock.

The invention discloses an automatic detachment and installation system of a container fixed spin lock. The system comprises a control device and a placing platform, the middle of the placing platform protrudes to form container carrying platforms used for supporting the middle of the bottom surface of a container, and the four corners of the container are impending; locating stoppers are arranged on the placing platform or at the outer side of the placing platform, and the locating stoppers are used for limiting the placing position of the container on each container carrying platform; a circle of horizontal transmission devices are arranged around the placing platform, spin lock locating holes are formed in the horizontal transmission devices, multiple intelligent mechanical arms are arranged at the outer sides of the horizontal transmission devices, and the intelligent mechanical arms are capable of picking up the spin locks on the horizontal transmission devices automatically and installing the spin locks into the lock holes of each container. By using the system, automatic installation and detachment of the fixed spin locks used for the container can be achieved, the number of field personnel can be greatly reduced, the labor cost is lowered, meanwhile, the safety management level of a wharf is promoted, and the working efficiency is improved.

The present invention relates to a processor system. The processor system is made up of a multithread control unit for selectively making switching among said threads to be executed in an arithmetic unit, a loop predicting unit for predicting a loop of an instruction string on the basis of a processing history of a branch instruction in the thread, and a loop detecting unit for, when the loop predicting unit predicts the loop, detecting the loop on the basis of an instruction. When the loop detecting unit detects the loop, the multithread control unit making the switching from the thread, which is in execution in the arithmetic unit, to a different thread. This prevents a wait condition stemming from the loop from interfering with the execution of other threads without retouching software.

Methods and apparatus involve monitoring spin locks for guest devices. Fully virtualized guests have multiple virtual processors configured under the scheduling control of a hypervisor on a physical hardware platform. The hypervisor posts On CPU and CR3 load information to shared communications pages for each of the processors. A monitoring module in the guest device monitors the pages to ascertain forward progress of the processors. If forward progress is being made, the virtual processors continue to spin. If not, the CPU's control is variously relinquished. The monitoring module typifies a kernel driver so that the guest can maintain an unmodified operating system. Ticket spin locks, and their ordering, are also considered as are computations for lock owners. Other features contemplate computing systems and computer program products, to name a few.

The invention relates to a locking method of a spin lock, comprising the following steps: the spin lock is detected to be in an un-held state; an inner core task acquires the spin lock; a procedure code mark in the inner core task is written into a lock value storage area; the lock value storage areas is used for storing the lock values of the spin lock. Correspondingly, the embodiment of the invention also discloses a locking device and a computer system of the spin lock. By the procedure code mark written into the inner core task in the storage area which represents the lock value of the spin lock, the embodiment can quickly locate the position of an error according to the information in the storage area when the spin lock is dead locked, and shortens the adjustment cycle greatly while occupying a relatively small space of the system.

The system and methods described herein may be used to implement NUMA-aware locks that employ lock cohorting. These lock cohorting techniques may reduce the rate of lock migration by relaxing the order in which the lock schedules the execution of critical code sections by various threads, allowing lock ownership to remain resident on a single NUMA node longer than under strict FIFO ordering, thus reducing coherence traffic and improving aggregate performance. A NUMA-aware cohort lock may include a global shared lock that is thread-oblivious, and multiple node-level locks that provide cohort detection. The lock may be constructed from non-NUMA-aware components (e.g., spin-locks or queue locks) that are modified to provide thread-obliviousness and / or cohort detection. Lock ownership may be passed from one thread that holds the lock to another thread executing on the same NUMA node without releasing the global shared lock.

The invention discloses a method for implementing a spin lock in a database. The method for implementing the spin lock in the database is characterized by comprising the following steps of: storing two global variables, namely a spin lock variable and an ID variable in a shared memory, and initializing the two variables as 0 when a system is initialized; and memorizing a current spin lock holdingthread by using a high storage value of spin lock variables, and implementing automatic unlocking of the spin lock according to the storage value when the lock holding thread is abnormal and exits tocause deadlock. By the method, possible deadlock when multiple tasks compete with the same spin lock is avoided, and the spin lock can protect the operation on a data structure for a long time and can process the deadlock problem caused by the abnormal end of a locking thread in the period by changing a locking flow and a deadlock judgment flow.

The invention discloses automatic container loading and unloading equipment with fixing spin locks. The automatic container loading and unloading equipment comprises a container accommodating platform, limit stops, at least two intelligent manipulators and a control device; the container accommodating platform is a convex plate, a protruded portion of the container accommodating platform is used for supporting the bottom surface of a container, and four corners of the container are suspended owing to a sunken portion of the container accommodating platform; the limit stops are mounted on the accommodating platform or on the outer side of the accommodating platform, and are used for limiting accommodated positions of the container on the accommodating platform; the intelligent manipulators are respectively positioned on the left side and the right side of the accommodating platform and are used for detaching the spin locks positioned at the four corners of the bottom of the container or mounting the spin locks in lock holes at the bottom of the container; and the control device is connected with the intelligent manipulators and controls action tracks of the intelligent manipulators. During usage, the automatic container loading and unloading equipment has the advantages that the fixing spin locks used by the container can be automatically mounted and detached, the quantity of field operators is greatly reduced, the safety management level of a wharf is improved while the labor cost is lowered, and the work efficiency is improved.

A method, in a computer system having a centralized spin lock controller arrangement, for managing a spin lock between a first processor and a second processor. The first processor holds the spin lock, the second processor contends for the spin lock, and the spin lock is implemented using a line of memory. The method includes invalidating a first private copy of the line that is held by the first processor. The method further includes providing a second private copy of the line to the second processor even before the first processor releases the spin lock, thereby preventing the second processor from requesting for a private copy of the line again while the spin lock is still held by the first processor.

A variable flip angle (VFA) MRI (magnetic resonance imaging) spin echo train is designed and / or implemented. For example, a target train of detectable spin-locked NMR (nuclear magnetic resonance) echo signal amplitudes may be defined and a corresponding designed sequence of variable amplitude (i.e., variable NMR nutation angle) RF refocusing pulses may be determined for generating that target train of spin echoes in an MRI sequence (e.g., used for acquiring MRI data for a diagnostic imaging scan or the like). Such a designed VFA sequence may be output for study and / or use by an MRI system sequence controller.

The invention discloses an automatic disassembling and assembling system for a container spin lock. The system is arranged on a transfer platform of a shore crane and comprises a container parking and containing platform, an industrial robot, robot walking mechanisms and a clamp; the container parking and containing platform is arranged on the transfer platform of the shore crane; the robot walking mechanisms are arranged at the two ends of the transfer platform; the industrial robot is installed on the robot walking mechanisms; and the clamp is installed at the tail end of the industrial robot. The automatic disassembling and assembling system is low in cost, high in automation degree, accurate and efficient.

A method for controlling a software lock acquirable by processors in a plurality of nodes of a multiprocessing system is disclosed. The method comprises a first processor of a first node of the plurality of nodes acquiring the lock, and the first processor selectively releasing the lock in a first state that allows other processors within the first node to acquire the lock but that prevents processors in a remote node of the plurality of nodes from obtaining the lock. In another embodiment, a method comprises a first processor of a first node attempting to acquire the lock, the first processor determining whether another processor within the same node is remotely spinning on the lock, and the first processor remotely spinning on the lock in response to determining that another processor in the same node is not remotely spinning on the software lock.

The invention discloses a method and a system for dispatching high-performance parallel applications on a cloud platform. The method comprises: setting a virtual machine type; acquiring network data packet information and spin lock information, and sending the information to a host machine; the host machine obtaining an information processing function according to a Hypercall call number, obtaining spin lock count and network data packet count, and according to the spin lock count, determining a single-node virtual machine synchronization demand, and according to the network data packet count, determining a span-node virtual machine synchronization request; according to the virtual machine type, the network data packet count, the spin lock count, and a synchronization request signal, determining a vCPU in a vCPU queue, the vCPU being called to operate next time. The system comprises a virtual machine information acquisition module, an information processing module, a virtual CPU dynamic allocation module, and a virtual CPU dispatching module. Through distinguishing a virtual machine of high-performance applications and a virtual machine of common applications, and making all related vCPU operate at the same time, the method solves a problem of frequent synchronization delay of high-performance calculation on a parallel application of a cloud platform.

An apparatus, program product and method support the deallocation of a data structure in a multithreaded computer without requiring the use of computationally expensive semaphores or spin locks. Specifically, access to a data structure is governed by a shared pointer that, when a request is received to deallocate the data structure, is initially set to a value that indicates to any thread that later accesses the pointer that the data structure is not available. In addition, to address any thread that already holds a copy of the shared pointer, and thus is capable of accessing the data structure via the shared pointer after the initiation of the request, all such threads are monitored to determine whether any thread is still using the shared pointer by determining whether any thread is executing program code that is capable of using the shared pointer to access the data structure. Once this condition is met, it is ensured that no thread can potentially access the data structure via the shared pointer, and as such, the data structure may then be deallocated.

A retractable locking device for container train comprises a support module, a spin lock module and a limit plate module. The support module comprises a mounting base plate and a vertical through hole which is formed in the mounting base plate. A guiding side plate is arranged on each side of the vertical through hole and positioning grooves are formed in the top end of the guiding side plates. The spin lock module comprises a lock cylinder rod passing through the vertical through hole and a lock head cap is arranged on the top of the lock cylinder rod. A lock base block is sleevingly connected with the lock cylinder rod below the lock head cap. A driven block sleeve which is capable of passing through the vertical through hole is fixed on the bottom part of the lock base block and is provided with block sleeve tooth. A moving push ring is arranged on the lock cylinder rod and is provided with push ring tooth and the push ring tooth is capable of engaging with the block sleeve tooth. An operating handle is hinged at the bottom end of the lock cylinder rod. The limit plat module comprises a steel support, the steel support is hinged to a rotating handle, and a clamping slot limit plate which is capable of cooperating with the operating handle is arranged on the rotating handle. According to this arrangement, the locking requirements for containers in transportation can be achieved and the efficiency of loading and unloading can be improved. The retractable locking device is simple in structure without influencing the previous structure and performance of trains.

One embodiment of the present invention sets forth a technique for synchronization between two or more processors. The technique implements a spinlock acquire function and a spinlock release function. A processor executing the spinlock acquire function advantageously operates in a low power state while waiting for an opportunity to acquire spinlock. The spinlock acquire function configures a memory monitor to wake up the processor when spinlock is released by a different processor. The spinlock release function releases spinlock by clearing a lock variable and may clear a wait variable.

Described is an enhanced application of a fast kernel trap, or kernel function call, in combination with a kernel system call providing a system of handling complications during kernel thread operations. In the event of a complication during kernel function call processing, the kernel function call promotes to a system call. If the kernel function call holds a spin lock at the time of promotion, the spin lock is released. Kernel function call processing is divided into phases and a phase identifier is provided to the system call. To avoid repeating processing steps already performed by the kernel function call, system call processing begins at the phase where the complication occurred. When the system call processing reaches a suspend phase, the system call will demote to a kernel function call and release its kernel stack.

The invention discloses a container spreader with a novel spin lock mechanism. The container spreader comprises a spreader body and a controller which is installed on the spreader body. The spreader body is provided with an expansion bracket structure, a connecting rod assembly and a spin lock oil cylinder. Spin locks are arranged at the two ends of the connecting rod assembly, and the spin lock oil cylinder is installed on the connecting rod assembly. The container spreader further comprises a closed-state sensor, an opened-state sensor and a baffle installed on the connecting rod assembly. When the baffle makes contact with the closed-state sensor, the closed-state sensor sends locking control signals to the controller, and the controller drives the connecting rod assembly through the spin lock oil cylinder so as to drive the spin locks and a container to be locked. When the baffle makes contact with the opened-state sensor, the opened-state sensor sends unlocking control signals to the controller, and the controller drives the connecting rod assembly through the spin lock oil cylinder so as to drive the spin locks and the container to be separated. According to the container spreader with the novel spin lock mechanism, spin lock state detection is adopted for monitoring the spin lock operation state; and through matching of the container detection, the safety problems caused by the disorderly spin lock state are solved, and accordingly complete machine safety is improved.

Methods and apparatus involve monitoring spin locks for guest devices. Fully virtualized guests have multiple virtual processors configured under the scheduling control of a hypervisor on a physical hardware platform. The hypervisor posts On CPU and CR3 load information to shared communications pages for each of the processors. A monitoring module in the guest device monitors the pages to ascertain forward progress of the processors. If forward progress is being made, the virtual processors continue to spin. If not, the CPU's control is variously relinquished. The monitoring module typifies a kernel driver so that the guest can maintain an unmodified operating system. Ticket spin locks, and their ordering, are also considered as are computations for lock owners. Other features contemplate computing systems and computer program products, to name a few.

The invention provides a container transport vehicle and a spin lock mechanism thereof. The spin lock mechanism comprises a lock head mechanism and a lock head control mechanism, and the lock head mechanism comprises a lock head seat, a connecting seat, a lock head and a driving piece. The lock head base is fixed to a frame of the container transport vehicle and sleeves the upper portion of the periphery of the lock head, the connecting base sleeves the lower portion of the periphery of the lock head and can rotate relative to the lock head base, and the lock head is fixedly connected with theconnecting seat, is rotatably connected with the lock head seat and upwards exceeds the lock head seat. The driving piece is connected with the connecting seat and drives the connecting seat to rotate so as to drive the lock head to rotate relative to the lock head seat to open and close the lock head, and the lock head control mechanism is fixed to the frame of the container transport vehicle, and the driving piece is automatically controlled to drive the lock head to rotate to switch the opening and closing of the lock head by automatically detecting whether a container is borne on the frame or not.

The invention discloses a dynamic PLE (pause loop exit) technology based virtual machine co-scheduling method which includes monitoring running states of all virtual machines to acquire average wait time needed for waiting for the spin-lock of each virtual machine, and regulating PLE parameters dynamically according to the average wait time so as to be adaptable to the current system running state; meanwhile, when the PLE is triggered by VCPUs(virtual central processing units), on the basis of the dynamic PLE technology, upgrading all VCPUs, running in a kernel mode, of corresponding virtual machines to heads of corresponding physical CPU running queues so as to realize synchronous running of the group of VCPUs in the next scheduling period. The dynamic PLE technology and the virtual machine co-scheduling are combined so that the problems such as busy time of the VCPUs of the virtual machines due to the fact that spin-lock holders are seized are solved and integral performance of the virtual machines and the system is improved effectively.

The invention puts forward a parallel scheduling method for satellite-borne multi-core SoC (System on a Chip) task-level load balance. The method comprises the following steps that: a multi-core TCB (Task Control Block) is taken as a node to construct a global task scheduling queue; when a scheduler module is initialized, four idle tasks with a lowest priority are created and are added into a global task scheduling queue OSTaskRdyList; the scheduler module is operated in parallel on a plurality of processor cores of the multi-core SoC system; the scheduler module adopts a spin lock to access the global task scheduling queue OSTaskRdyList, and a task T1 with a highest current priority is obtained from the global task scheduling queue OSTaskRdyList; and the scheduler module searches an idle processor core or operates the processor core of the task of the lowest priority, and the task with the highest priority is scheduled to the processor core. By use of the method, the problem that multiple tasks are subjected to balanced distribution and parallel operation on the multi-core SoC is solved, and the calculating and processing efficiency of the multi-core SoC is drastically improved.

The invention discloses a reconfigurable fault-tolerant starting method for a multicore operating system. The reconfigurable fault-tolerant starting method for the multicore operating system comprises the following steps that a synchronizing signal is set as initial state; a spin lock is set to be unoccupied; after each processor core finishes initialization, the spin lock is applied; the processor core which successfully applies for the spin lock enters an inter-core mutual exclusion critical zone, and the rest processor cores are blocked on the spin lock; a self processor core ID (identity) is set as a main core ID number by the processor core which successfully applies for the spin lock first, the synchronizing signal is set, and then the spin lock is released; the processor cores which subsequently successfully apply for the spin lock are known as slave cores by a read value, the processor core corresponding to a main core ID is a main core, and the spin lock is released; after the main core finishes the initialization of a memory, bus equipment and the inner core of the operating system, an inter-core synchronizing signal is set to start the slave cores, and therefore the main core and the slave core simultaneously begin to schedule tasks. According to the reconfigurable fault-tolerant starting method for the multicore operating system, which is disclosed by the invention, other processor cores still can be normally started to operate when the main core fails, and the reliability of a multi-core computer is improved.

The invention discloses a method and a system for detecting deadlock of a linux user mode spin lock. The method comprises: packaging a data structure of the user mode spin lock; packaging an interface of the user mode spin lock, introducing a lockdep kernel deadlock detection function, and compiling to generate a spin lock deadlock detection library file; when a user mode program is compiled, introducing the spin lock deadlock detection library file, and detecting whether the spin lock of the user mode program has the deadlock problem; if the spin lock of the user mode program has the deadlock problem, inputting deadlock information; if the spin lock of the user mode program does not have the deadlock problem, continuing to execute the user mode program. Visually, in the embodiment, by calling a kernel lockdep code, detection on deadlock of the user mode spin lock is implemented, and deadlock of the user mode C program can be effectively detected out.

The invention discloses an implementation method of spin lock as multi-core CPU accessing resources. The method comprises following steps: resource to be accessed is provided with a resource lock and a spin lock is generated for self use when any CPU accesses resources; inner structures of the resource lock and the spin lock comprise a first memory unit and a second memory unit, wherein the first memory unit is used for identifying lock label and the second memory unit is used for saving a next lock address; before any CPU accesses resources, the first memory unit of the resource lock is set as null, and the second memory unit is set as resource lock itself so that the resource lock forms a self-loop linked list by itself; locking and unlocking are performed when any CPU accesses resources. The implementation method of the spin lock provides a resource lock for each shared resource; when the shared resource use right is not occupied, each resource lock forms a one-way circulation linked list. The adoption of the self-loop linked list mechanism reduces complexity of program design and the use efficiency of system shared resource is increased.

The invention discloses a spin lock fixing device capable of locking a longitudinally or horizontally placed shelter. The spin lock fixing device comprises a fixed seat, a spring bolt and a lock nut, wherein the fixed seat comprises a fixed seat baseplate and a spring bolt support block, a vertical through hole is formed in the center of the spring bolt support block, a first groove and a second groove, which are vertical to each other and have the same width, are formed in the top end of the spring bolt support block, and the fixed seat is fixed on a vehicle platform. The spring bolt comprises a spring bolt head part, a rectangular lug boss and a spring bolt rod part, and the width of the rectangular lug boss is respectively matched with the width of the first groove or the width of the second groove. The rectangular lug boss is embedded in the first groove or the second groove, so that the spring bolt is located in the spring bolt support block, and the lock nut is screwed on the lower end of the spring bolt rod part. According to the spin lock fixing device, the rectangular lug boss at the lower side of the spring bolt head part is conveniently embedded in the first groove or the second groove, so that the spring bolt can enter a shelter corner fitting to lock the shelter corner fitting, and the difficulty of incapability of locating and locking the existing horizontally placed shelter on the vehicle platform is solved.

The invention discloses a corner fitting of a container. The corner fitting comprises a main body 1 and a protrusion portion 2, wherein the main body 1 is provided with hanging holes, the protrusion portion 2 is provided with a fixing structure, the main body 1 is defined by a top face 11, a bottom face 12, a pair of end faces 13 and a pair of side faces 14, a cavity 15 which is used for containing a spin lock is arranged inside the main body 1, and the protrusion portion 2 is arranged on one end face 13 of the main body 1. The corner fitting has the advantages that an end hole is arranged on the protrusion portion, and thicknesses of working surfaces of hanging holes on the main body is not affected; various different fixing structures can be arranged on the protrusion portion and can meet transportation requirements flexibly; and two hanging holes are arranged to correspond to side direction fixing of different dimension requirements respectively, so that the application range of the corner fitting is wide.

The invention discloses a FreeRTOS task running method and device based on a multi-core CPU, relates to the technical field of embedded real-time operating systems, and enables a FreeRTOS real-time operating system to support multi-task running of the multi-core CPU. According to the main technical scheme, if a target core preempts a spin lock to access a global task ready table, a first task can be determined according to the priority of tasks in the global task ready table and a core task ready table of the target core, tasks which are not bound with the core are stored in the global task ready table, and each core has a core task ready table corresponding to the core and stores tasks bound with the core; the target core runs the first task and releases the spin lock; and when the target core runs the first task, if other cores preempt the spin lock to access the global task ready table, the second task can be determined according to the priority of the tasks in the global task ready table and the own core task ready table, and the second task is run.