Patents
Literature
Hiro is an intelligent assistant for R&D personnel, combined with Patent DNA, to facilitate innovative research.
Hiro

37results about How to "Solve the deadlock problem" patented technology

Network equipment configuration method, client, server and network system

ActiveCN102148817AMeet the requirements of concurrent configurationImprove operation concurrencyData switching networksData setNetworked system
The invention discloses a network equipment configuration method, a client, a server and a network system, which belong to the field of network communication. The method comprises the following steps of: receiving a configuration submission request from the client, and caching configuration information in the configuration submission request; submitting the configuration information into a candidate dataset, and running and validating the configuration information to a running configuration database by using the candidate dataset; in a configuration conflict, updating a fundament dataset based on the current running configuration dataset; and acquiring the cached configuration information, re-executing the cached configuration information on the new fundamental dataset, running and validating the re-executed configuration information to the running configuration data set; and returning an execution result to the client. By the method, the client, the server and the network system, the requirements of concurrent configuration of a plurality of users are met, the operation concurrency of the plurality of users is improved, and the problems of low user concurrency and deadlock produced in overall locking or partial locking processing in the prior art are solved.
Owner:HUAWEI TECH CO LTD

Method for preventing abnormal deadlock of main unit during access to shared devices

The invention discloses a method to avoid abnormal deadlock of a host computer in accessing shared device. The host computer sets an access conflict mark for the shared devices. When the low priority task accesses the shared device, and requires whether operation achieving mark of the shared devices is set as 1 in a circular manner, the host computer interrupts a service routine or a high priority task interrupts the lower one and accesses the shared devices, and requires whether operation achieving mark of the shared devices is set as 1, the host computer cleans the mark as 0 and sets the access conflict mark as 1. Along interruption returns or task re-transfer, the low priority task is executed continuously, and detects the operation achieving mark that is 0, the access conflict mark that is 1, the host computer escapes circular requirement (or the task enters deal circle, causing deadlock), re-accesses the shared devices. The technical solution of the invention can avoid the deadlock. Because of simple and reliable method, the invention is in particular applied to the embedded system field with a low-performance processor and inadequate memory resources.
Owner:CHENGDU SUPERXON COMM TECH CO LTD

Inter-process thread mutex method

The invention relates to an inter-process thread mutex method. The inter-process thread mutex method comprises following steps: vying for mutex information by multiple threads and initializing mutex information by a successful thread; when obtaining mutex information by the successful thread and utilizing mutex information to lock a critical zone; obtaining a lock of mutex information by the thread after locking operation and visiting shared resources; waiting by other threads at the same time; parting the critical zone after the threads run out of shard resources; and continuing to compete for mutex information by other threads and repeating above steps. The inter-process thread mutex method has following beneficial effects: combined with a semaphore mechanism, atomicity of locking and unlocking is ensured; the method has thread safety and helps to effectively solve the problem of garbage value obtained by mutex information; abnormity is avoided when garbage value is obtained by using threads; the deadlocking problem is also overcome when the self body asks for a lock during locking; and the problem of unlocking out of limits of authority is avoided.
Owner:CSSC SYST ENG RES INST

Method for restricting parallel execution of shell script

The invention discloses a limit shell script parallel executing method in the linux and unix platform, which comprises the following steps: using script mode processor to write request into pipe when the shell script needs to be executed; reading the request through token mode processor at the other end of pipe sequently; transmitting the token to the shell script according to the sequence of request when the token is free until the token is finished; obtaining the process permitting operation of token; exiting the execution if not obtaining the process of token. The invention guides token concept to realize 'serialization' of multi-process in the critical area through linux pipe, which uses single locking detecting script to detect the locking to solve the locking problem effectively without using multi-parallel process to operate one token.
Owner:ZTE CORP

Path scheduling method and device, background server and storage medium

The invention relates to the technical field of robots, and provides a path scheduling method and device, a background server and a storage medium. The method includes the following steps: receiving and generating a first navigation path from the current position of a first robot to a first preset task point of the first robot according to an obstacle processing request; acquiring the current navigation path of a second robot; when there is a conflict between the current navigation path and the first navigation path, generating a second navigation path from the current position of the second robot to a second preset task point of the second robot; and when there is no conflict between the second navigation path and the first navigation path, sending the first navigation path and the secondnavigation path to the first robot and the second robot respectively. Through reasonable scheduling of the moving path of a robot encountering an obstacle and the moving path of a robot encounteringno obstacle, the 'deadlock' problem of swarm robots in the same map is solved.
Owner:广州安商智能科技有限公司

Link state delivery method and device of packet transport network

The invention discloses a link state delivery method and a device of a packet transport network. The method comprises the following steps: a home-terminal service provider edge PE receives a client layer signal failure message (CSF) from a far end PE for the first time; the physical port of the home-terminal user network interface (UNI) is closed; the far-end link of a home terminal indicates a position site, wherein the far-end link indication site is used for indicating that the link state from a far-end CE to the far-end PE is disconnected. The invention discloses a link state delivery device of a packet transport network. In the invention, the far-end link indication site is additionally arranged on a UNI physical port and is used for recording that the disconnection of the UNI physical port of a CE-PE link is caused by the home terminal or the far end; and when the UNI physical port disconnection is caused by home terminal or the far end, the signal failure message is not triggered to the far end so as to avoid the phenomenon that two ends continuously send the signal failure message, solve the problem of deadlock and improve system reliability.
Owner:ZTE CORP

Multi-behavior fused enzyme numerical membrane control method for mobile robot in unknown environment

The invention discloses a multi-behavior fused enzyme numerical membrane control method for a mobile robot in unknown environment. The method comprises the following steps such as: calculating a linear distance and an angle of the target and the robot, determining an environment in which the robot is located, determining whether the linear distance between the robot and the target is a historicalminimum, determining whether the target and an obstacle or a wall surface are on the same side of the robot, performing multi-behavior selection, performing the selection behavior, and determining whether the mobile robot reaches the target. By combining an enzyme numerical membrane system and a multi-behavior fusion algorithm, and introducing the determination of the distance between the robot and the target and the determination that whether the target and the obstacle or the wall surface are on the same side of the robot, the multi-behavior fused enzyme numerical membrane control method fora mobile robot in unknown environment solves the deadlock problem and detour problem of autonomous walking in the unknown environment of the mobile robot to a certain extent. An enzyme numerical membrane controller is used to fuse a multi-behavior controller to enable the robot to adapt to complex environments.
Owner:SOUTHWEST JIAOTONG UNIV

Branch node type path scheduling method, apparatus, background server and first robot

The invention relates to the technical field of robots, and provides a branch node type path scheduling method, an apparatus, a background server and a first robot. The method comprises the followingsteps: receiving an obstacle processing request sent by the first robot; judging whether the obstacle is a second robot or not based on the obstacle processing request; sending a waiting instruction to the first robot to enable the first robot to execute the waiting instruction if the obstacle is the second robot, and waiting for a preset time at a current position of the first robot; and sendingan avoidance instruction to the first robot to enable the first robot to execute the avoiding instruction, so as to avoid the obstacle if the obstacle is not the second robot. According to the branchnode type path scheduling method, the apparatus, the background server and the first robot, moving paths of a plurality of robots are planned into branch node type paths, obstacles are uniformly and reasonably avoided in the background, thereby avoiding the deadlock problems that the plurality of robots is blocked to each other and the paths are constantly planned.
Owner:GUANGZHOU DREAM ONE ROBOT AUTOMATION CO LTD

I2C bus communication control method and device, equipment and storage medium

The invention discloses an I2C bus communication control method. The method aims at solving the problem of I2C bus deadlock caused by abnormal reset of I2C main equipment in the I2C data transmissionprocess in the prior art. The method is based on a controller connected to an I2C bus between an I2C master device and an I2C slave device. The controller monitors the transmission process that the I2C master device sends I2C data to the I2C slave device through the I2C bus; in the transmission process, when the I2C master device is abnormal, a notification signal is sent to the I2C slave device to enable the I2C slave device to release the receiving state, so that the SDA signal of the I2C bus is recovered to a high level, occupation of the I2C bus is released in time, and therefore the I2C deadlock phenomenon can be avoided or released. The invention further discloses a communication control device and equipment of the I2C bus and a storage medium, which have the above beneficial effects.
Owner:INSPUR BUSINESS MACHINE CO LTD

Dense storage container scheduling method and device and electronic equipment

The invention provides a dense storage container scheduling method and device and electronic equipment, and the method comprises the steps: determining a to-be-scheduled container and a destination ofthe to-be-scheduled container based on an obtained to-be-executed task; determining a first path according to the current position and the destination of the to-be-dispatched container, wherein the first path comprises the position where the robot needs to pass when the robot transports the to-be-dispatched container from the current position to the edge position of the current block in the current block to which the current position belongs; and controlling the robot to convey the to-be-dispatched container to the edge position from the current position through the first path, and then conveying the to-be-dispatched container to the destination from the edge position. By means of the mode, the operation collaboration of all the robots in intensive warehousing operation can be effectivelyimproved; conflict and disorder of multiple robots during task execution are avoided, the problem of blockage or deadlock among the robots is solved, and the problem that the robots are blocked by other containers during task execution is solved, so that the operation efficiency of intensive storage is improved.
Owner:BEIJING KUANGSHI ROBOTICS TECH CO LTD

Lockless multithreading data synchronization method

The invention discloses a lockless multithread data synchronization method. The method includes the following steps that A, a main thread receives information and dispatches and processes information; B, whether child threads are in the suspended state or not is judged, if yes, the step C is executed, and if not, no operation is executed; C, the main thread creates a queue 1, files in the queue 1 are copied to a queue 2, and then data in the queue 1 are eliminated; D, a signal object is set through the main thread to be in the state with signals; E, the child threads obtain signals, traverse files in the queue 2 and circularly call and load objects, and the created objects are inserted into a queue 3; F, whether the child threads are in the suspended state or not is judged, if yes, the step G is executed, and if not, no operation is executed; G, data in the queue 3 are copied to a queue 4 through the main thread, and the data in the queue 3 are eliminated; H, the created objects are inserted into the queue 1, and the signal object is set to be in the state with signals. By means of the lockless multithread data synchronization method, the problem that deadlock phenomenon happens to access objects of the main thread and the child threads is solved.
Owner:WUXI FANTIAN INFORMATION TECH

Deadlock unlocking method

The invention provides a deadlock unlocking method, which comprises the following steps that data in each running service process are backed up in real time; when the deadlock of the service processes occurs, all of the service processes are terminated, and all of the service processes are restarted; during the service process initialization, the backed up data are restored into each service process, each service process normally runs, and in addition, the service processing starts. The method has the advantages that the data of each service process are backed up in real time, the data are restored in real time after the restarting of each service process due to deadlock, the service is started, and the deadlock problem is simply and efficiently solved.
Owner:PHICOMM (SHANGHAI) CO LTD

Multi-robot path planning method and device

The invention discloses a multi-robot path planning method and device, and belongs to the technical field of robot path planning, and the method comprises the steps: constructing a grid environment according to a robot channel environment, and carrying out the environment reconstruction of a cross point graph through reserving channel cross points; through a heuristic A * algorithm, performing one-time optimal path planning on a single robot in the cross point map environment; according to the primary optimal path, planning all channels in the cross point map environment as one-way streets; for the one-way streets, through the heuristic A * algorithm, carrying out secondary optimal path planning on a single robot in the cross point map environment; and aiming at the secondary optimal path, reconstructing a grid environment to obtain an optimal path in the grid environment. The defect that deadlock is caused by robot conflicts in channels in a traditional heuristic algorithm is overcome.
Owner:ZHEJIANG UNIV

Message storage scheduling method and apparatus

The invention discloses a message storage scheduling method. The method comprises steps of obtaining to-be-scheduled messages; according to preset write-in conditions, storing the to-be-scheduled messages of the same characteristic information in the same storage array; storing the corresponding relation between the characteristic information of the to-be-scheduled messages and address information in the storage array in a cache array; obtaining current entry information of each storage array, wherein the current entry information is a valid bit information group used for indicating whether or not messages in each storage array can be scheduled to enter a processing module; when the current entry information is valid by indication, messages of the corresponding storage array can enter the processing module by scheduling; and according to preset scheduling rules, reading the to-be-scheduled messages from a valid storage array indicated by the current entry information for entering the processing module. The invention solves the problem that block and deadlock may occur when messages of the same characteristic information are processed at the same time, and is advantaged by being convenient to operate and high in reliability.
Owner:INSPUR BEIJING ELECTRONICS INFORMATION IND

Dynamic application program updating method for vehicle-mounted embedded equipment

PendingCN113204356AResolving Function Semantic AmbiguitySolve multi-thread resource deadlockVersion controlSoftware deploymentIn vehicleEmbedded system
The invention relates to a dynamic application program updating method for vehicle-mounted embedded equipment, and belongs to the technical field of ECU dynamic updating. The remote server compares the program information reported by the automobile ECU with the existing latest program version of the ECU and sends an instruction that the ECU of the automobile is about to be updated to the TBOX of the automobile where the ECU needing to be updated is located, the TBOX sends the updating packet to the ECU through the CAN bus after receiving the updating packet, the ECU waits for the TBOX to send an updating instruction after receiving the updating packet, and the ECU starts to perform dynamic updating after receiving the updating instruction of the TBOX, and the updating is completed. The method has the advantages that software updating can be completed under the condition that operation of an original program is not affected, original data are protected from being lost, and the problems of function semantic ambiguity and multi-thread resource deadlock are solved.
Owner:JILIN UNIV

A method for realizing hot plugging and hot plugging and electronic equipment

ActiveCN103164379BSolve the problem that hot plugging cannot be realizedSolve the problem of hot pluggingElectric digital data processingElectric equipmentEmbedded system
The invention discloses a method for achieving hot pull and hot plug and electronic devices. The method for achieving hot pull and hot plug is applied to a first device which is connected with a second device through an inter-integrated circuit (I2C) bus. The first device is provided with M I2C components which are connected on the I2C bus based on the I2C protocol. The second device is provided with N I2C components which are connected on the I2C bus on the basis of the I2C protocol. The M and the N are integral numbers larger than zero. The method includes the steps of obtaining error information which carries out I2C communication with the second device, carrying out ergodic operations on the M I2C components and the N I2C components on the basis of the error information, obtaining a great amount of feedback information on the basis of the ergodic operations, and determining that the I2C bus between the first device and the second device is switched off when the condition that the great amount of feedback information all comes from the M I2C components is determined.
Owner:LENOVO (BEIJING) LTD

Account transfer method and device, storage medium and equipment

The embodiment of the invention provides an account transfer method and device, a storage medium and equipment, and belongs to the technical field of computers. The method comprises the following steps: receiving a transfer request containing transfer parameters sent by a business party, wherein the transfer parameters comprise a deposit account, a withdrawal account, a transfer amount and an order number; judging whether the transfer parameters meet transfer requirements or not; when the account transfer parameter meets the account transfer requirement, adding the account transfer request into a money output queue to wait for executing money output operation; adding the transfer request into a deposit queue to wait for performing deposit operation after the deposit operation is performed on the deposit account corresponding to the transfer request; and returning an order number and a transaction serial number corresponding to the transfer request to the business party after the deposit operation is executed on the deposit account corresponding to the transfer request. The embodiment of the invention is suitable for a transfer processing process.
Owner:BEIKE TECH CO LTD

Monitoring answer processing method on basis of double correlation chains

The invention relates to a monitoring answer processing method on the basis of double correlation chains. A missing buffer MB is set in a Cache and memory commands in a Cache pipeline, which cannot be completed in one step, are stored into the buffer MB; the memory commands comprise local memory commands and remote monitoring commands; the local memory commands are memory commands sent to the Cache by a core; the remote monitoring commands are monitoring commands sent by a directory controller; a local correlation chain is established for the local memory commands and the memory commands with the same address enter the local correlation chain and wait for the execution of the previous memory commands with the same address; and a monitoring chain is established for monitoring access entering the buffer MB and the monitoring commands with the same address enter the monitoring correlation chain and wait for the execution of the previous memory commands with the same address. The invention can solve the problem of the condition of deadlock or livelock so as to avoid command repetition, and can efficiently solve the problem of a monitoring response processing sequence.
Owner:NAT UNIV OF DEFENSE TECH

Control message sending method and device

The present invention provides a method and device for sending a control message, wherein the method includes: a first network-side edge device PE receiving a first control message from a second PE, wherein the first control message is used to communicate with the first The state of the physical port of the first access circuit AC connected to the PE is set to a predetermined state; the first PE sends a second control message to the second PE according to the predetermined state and the actual state of the physical port of the first AC, wherein the first The second control message is used to control the state of the physical interface of the second AC connected to the second PE. The present invention solves the deadlock problem of end-to-end fault transmission existing in the related art, and further achieves the effect of avoiding the deadlock problem of end-to-end fault transmission.
Owner:ZTE CORP

Multi-robot intelligent traffic control method and device

The invention discloses a multi-robot intelligent traffic control method and device, and the method comprises the steps: carrying out the collision detection and deadlock detection when a robot applies for a next element, wherein the deadlock detection is used for judging whether the robot will form a deadlock with other robots after the robot applies for the next element; and when it is judged that the collision detection and / or the deadlock detection are / is not passed, prohibiting the application passing the robot. According to the method and device, whether deadlock is formed when the multiple robots act at the same time or not can be automatically judged, the deadlock phenomenon is completely avoided, the traffic efficiency is improved, and human intervention is reduced.
Owner:HANGZHOU YIWU TECH CO LTD

A lock-free multi-thread data synchronization method

The invention discloses a lockless multithread data synchronization method. The method includes the following steps that A, a main thread receives information and dispatches and processes information; B, whether child threads are in the suspended state or not is judged, if yes, the step C is executed, and if not, no operation is executed; C, the main thread creates a queue 1, files in the queue 1 are copied to a queue 2, and then data in the queue 1 are eliminated; D, a signal object is set through the main thread to be in the state with signals; E, the child threads obtain signals, traverse files in the queue 2 and circularly call and load objects, and the created objects are inserted into a queue 3; F, whether the child threads are in the suspended state or not is judged, if yes, the step G is executed, and if not, no operation is executed; G, data in the queue 3 are copied to a queue 4 through the main thread, and the data in the queue 3 are eliminated; H, the created objects are inserted into the queue 1, and the signal object is set to be in the state with signals. By means of the lockless multithread data synchronization method, the problem that deadlock phenomenon happens to access objects of the main thread and the child threads is solved.
Owner:WUXI FANTIAN INFORMATION TECH

A multi-robot path planning method and device

This application discloses a multi-robot path planning method and device, which belong to the technical field of robot path planning. The A* algorithm is used to plan an optimal path for a single robot in the intersection graph environment; according to the optimal path, plan all passages in the intersection graph environment as one-way streets; for the one-way Road, through the heuristic A* algorithm, plan the quadratic optimal path for a single robot in the intersection graph environment; for the quadratic optimal path, rebuild the grid environment to obtain the grid The optimal path in grid environment. Solve the shortcomings of traditional heuristic algorithms that cause deadlock due to robot conflicts in the channel.
Owner:ZHEJIANG UNIV

Path scheduling method, device, background server and storage medium

The present invention relates to the field of robot technology, and provides a path scheduling method, device, background server and storage medium, the method includes: receiving and generating a first schedule from the current position of the first robot to the first robot according to the obstacle handling request Set the first navigation path of the mission point; obtain the current navigation path of the second robot; when there is a path conflict between the current navigation path and the first navigation path, generate a second preset mission point from the current position of the second robot to the second robot the second navigation path; when there is no path conflict between the second navigation path and the first navigation path, send the first navigation path and the second navigation path to the first robot and the second robot respectively. The invention solves the "deadlock" problem of group robots in the same map by reasonably dispatching the moving paths of robots encountering obstacles and robots not encountering obstacles.
Owner:广州安商智能科技有限公司

An Intelligent Routing Decision-Making Method Based on DDPG Reinforcement Learning Algorithm

ActiveCN110611619BImprove equalization performanceSolve the congestion problem caused by unbalanced traffic distributionData switching networksNeural learning methodsRouting modelPathPing
The present invention proposes an intelligent routing decision-making method based on reinforcement learning, and specifically relates to an intelligent routing decision-making method based on DDPG reinforcement learning algorithm, which aims to design intelligent routing decisions by using reinforcement learning to balance the equivalent path traffic load, To improve the ability of the network to handle burst traffic, the present invention adopts an experience decision-making mechanism based on sampling probability, and the experience with poorer performance has a greater probability of being selected, thereby improving the training efficiency of the algorithm. In addition, adding noise to the neural network parameters is beneficial to the exploration of the system and improves the performance of the algorithm. The implementation steps are: 1) constructing the network topology; 2) constructing the network topology G 0 3) Construct a routing decision model based on the DDPG reinforcement learning algorithm; 4) Initialize the traffic demand matrix DM and the equivalent path traffic ratio matrix PM; 5) Iterate the routing decision model based on reinforcement learning train. The present invention can be used in scenarios such as a data center network.
Owner:XIDIAN UNIV +1

Message sending control method, processing method, device and system

Embodiments of the present invention provide a packet sending control method, and a processing method, device and system. The method comprises: a packet sending control device obtaining available space information of a receiving channel corresponding to each packet of a first protocol type in a receiving end device, and sending an indication packet of a second protocol type carrying the available space information to a packet sending processing device, so that the packet sending processing device performs, according to the available space information, sending control on the packet of the first protocol type sent from a sending end device. With the packet sending control method provided by the embodiment of the present invention, the packet sending processing device performs, according to the available space information, sending control on the packet sent from the sending end device, and sends the packet only when the available space information of the packet is valid, thereby effectively avoiding a deadlock problem caused by non-matching virtual channels during conversion of packets between different protocols.
Owner:XFUSION DIGITAL TECH CO LTD

Balanced domain division method for software defined network

The invention discloses a software defined network oriented balanced domain division method, and aims to provide a balanced domain division method which is fast in convergence, high in efficiency and capable of reducing network control time delay and improving network performance. The method is realized through the following technical scheme: after a network topology, a node position, a pre-estimated traffic matrix and a maximum scale allowed by a single domain are given, executing an initial domain division stage based on a K-means algorithm framework, and traversing initialized distributed domain center nodes by using a width-first graph; repeatedly carrying out distance-first domain growth and domain center node updating; executing a quotient graph-based local tuning stage on the basis of an initial domain division result, converting local tuning performed by movement of domain boundary nodes in adjacent domains in the domain division result into a quotient graph, and repeatedly searching a negative weight ring or calculating a minimum cost path on the quotient graph obtained by conversion of the domain division result; and the target function is optimized and the absolute balance of the domain scale is ensured until no negative weight ring exists in the quotient graph and the domain division result reaches the absolute balance.
Owner:10TH RES INST OF CETC
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products