43 results about "Semaphore" patented technology

Apparatuses, systems, and techniques to facilitate graph code synchronization between application programming interfaces. In at least one embodiment, one or more circuits are to perform an application programming interface (API) to cause graph code to wait on a semaphore used by another API.

Apparatuses, systems, and techniques to facilitate graph code synchronization between application programming interfaces. In at least one embodiment, one or more circuits are to perform an application programming interface (API) to cause graph code to wait on a semaphore used by another API.

Methods, systems, and devices for data management are described. A data management system (DMS) may provide backup and recovery services for customer computing systems or databases, which may involve scheduling jobs to perform the backup and recovery services. Each job may define a set of semaphores which may be acquired prior to execution of the job. The semaphores may be representative of an availability of computing resources associated with the DMS. Jobs may be grouped into job groups based on the semaphores associated with each job. Each job group may be scheduled independently by separate dispatchers or job schedulers. Within a job group, the associated dispatcher(s) may schedule jobs if the semaphore(s) associated with the job group are available. Within a job group, the associated dispatchers may refrain from dispatching additional jobs if the semaphore(s) for the job group are full until the semaphore(s) are available.

The device described herein, which provides an interface between a plurality of master devices and a slave device, includes: a first timer configured to begin timing when a first access request is received from a first master device via a bus, and to be reset when a semaphore is allocated to the first master device; a second timer configured to begin timing when a second access request is received from a second master device via the bus, and to be reset when a semaphore is allocated to the second master device; and a controller configured to provide a first message to the first master device via the bus when a first expiration interval is measured by the first timer.

The application provides a kind of detection method of inter-task mutual exclusion semaphore deadlock, including initialization of a task bitmap and an empty blocking bitmap;Mark a task on the blocking bitmap, judge if repeated marking, if so, it indicates that there is deadlock, otherwise enter detection;Mark other tasks waiting on the mutual exclusion semaphore of the task on the blocking bitmap, judge if repeated marking, if so, it indicates that there is deadlock;Check if the task holding the mutual exclusion semaphore is waiting for other mutual exclusion semaphores permanently, if not, the tasks related to the mutual exclusion semaphore are removed from the task bitmap, repeat the above steps to detect other tasks until the task bitmap is empty, indicating that there is no deadlock, and the detection ends.The method designed by the application is not only effective and efficient, but also can discover and solve the deadlock problem in time, ensuring the system continues to run.

The invention discloses a command processing method and device, a chip product, equipment and a storage medium, and relates to the technical field of computers. The method comprises the steps that a synchronization command is received, the synchronization command comprises address information and operation information, the address information is used for indicating storage positions of m semaphores, and m is an integer larger than 1; acquiring m semaphores according to the address information; according to the operation mode indicated by the operation information, the m semaphores are processed, a processing result is obtained, and the processing result is used for indicating the execution states of the commands corresponding to the m semaphores respectively. According to the method and the device, multiple semaphores can be triggered and acquired through the same synchronization command for processing, so that the storage access efficiency for the semaphores and the processing efficiency for the semaphores can be improved.

This invention discloses a method, apparatus, device, medium, and product for creating named semaphores. The method involves creating a named semaphore file; setting the size of the named semaphore file to the size of a preset data structure; the data structure including a semaphore object and atomic variables, the atomic variables being used to synchronize the creation and initialization actions of multiple processes simultaneously; mapping the named semaphore file to the memory space of the processes, allowing different processes to access and use the named semaphore according to the data structure through the mapped memory address; and calling a preset interface to check and initialize the data structure. Using this invention, the creation and initialization of named semaphores can be achieved without relying on file links, resulting in better compatibility and performance.

Apparatuses, systems, and techniques to perform an application programming interface (API) to add one or more graph nodes to a software graph, wherein the API is to cause a semaphore wait node to be added to a software graph based, at least in part, on a dependency type indicated by the API. In at least one embodiment, one or more nodes are added to a graph in accordance to one or more dependency types.

The invention provides a data processing method and device, electronic equipment and a storage medium. The method comprises the following steps: initializing a first semaphore and a second semaphore; calling a calculation thread to calculate the ith data block to obtain an ith calculation result; updating the value of the first semaphore to i; calling the first communication thread to load the (i + 1) th data block in the process of calling the calculation thread to calculate the ith data block, and acquiring (i-1) th network data; under the condition that the first communication thread obtains the (i-1) th network data, the second semaphore is updated to be i-1; when the first semaphore is greater than or equal to i and the second semaphore is greater than or equal to i-1, accumulating the ith calculation result and the (i-1) th network data to obtain ith accumulated data; and sending the ith accumulated data to the next computing node. According to the invention, the data calculation performance can be improved and the communication delay can be reduced.

The application discloses an AT instruction analysis method, a terminal and a computer readable medium, and relates to the field of electronic communication. The method comprises the following steps: reading an instruction line from a circular buffer queue ring_buf; under the premise that the instruction line data is correct, querying and calling an element matched with the data line in a URC table, executing a function corresponding to the element, releasing a second semaphore resp_notice, and completing the analysis of the AT instruction; when the URC table does not store the element matched with the data line, querying whether the last line of a string of a processing result fed back after the execution of the AT instruction by a data transmission module is a correct identifier OK or a failure or error identifier, if the correct identifier OK, marking a response state resp_status as successful and releasing the resp_notice semaphore, and completing the analysis of the AT instruction; if the failure or error identifier, marking the response state resp_status as a failure and releasing the resp_notice semaphore, and completing the analysis of the AT instruction. The application realizes the analysis of AT instructions of different data transmission modules.

A compiler creates a dependency graph for functions in an input program. The dependency graph includes nodes corresponding to commands within the functions and edges corresponding to dependencies between commands. The compiler performs forward reachability analysis on the dependency graph to eliminate redundant dependencies. The compiler also adds a minimum set of back edges to the dependency graph to enforce circular resource dependencies in the input program. Then, based on the contents of the dependency graph, the compiler assigns synchronization primitives (such as semaphores) provided by the multiprocessor computing system to commands within the functions of the input program.

The invention provides a method and a device for running a Lua plug-in under an RTEMS system, and the method comprises the steps: initializing a structural member variable which is originally prepared to be initialized through a pipe function and is used for representing whether a message queue is empty or not when the Lua plug-in initializes the message queue into a semaphore supported by the RTEMS system; the poll function is replaced by an operation performed on the semaphore. According to the method, the RTEMS operating system can run the Lua plug-in, the influence of pipe and poll functions is avoided, more memory space is not occupied, and the development workload is small.

This invention discloses a method for protecting inter-thread communication using semaphores in a Linux system, comprising the following steps: After the Linux system starts, semaphores S1~S2 are created. n Create threads T1~T 2n Create inter-thread semaphore protection flags F1~F n n is a positive integer; the semaphores S1~S2 are implemented using the system-provided sem_init function. n The initialization is performed using the system-provided pthread_create function to implement threads T1~T. 2n Initialization uses the system-provided assignment operator to set the inter-thread semaphore protection flags F1~F1. n Initialized to 0. This invention effectively solves the synchronization problem and false permission problem in inter-thread communication by adding an inter-thread semaphore protection flag and further determining whether it is really necessary to activate the thread of the communication object by judging the value of the inter-thread semaphore protection flag, thus ensuring the effectiveness and reliability of inter-thread communication.

The invention discloses an inter-process communication method, electronic equipment and a storage medium, and relates to the technical field of communication. According to the scheme, the method comprises the following steps: executing semaphore waiting operation for an associated theme in a shared memory in a receiving end process so as to enter a blocked state and release processing resources; in a sending end process, target communication data is written into a target theme in a shared memory, a semaphore associated with the target theme is triggered to be updated to generate a target event notification, so that all receiving end processes blocked in the semaphore exit a blocked state, and the target event notification is sent to the receiving end process in the receiving end process receiving the target event notification. And obtaining target communication data from the target theme. In the scheme, the receiving end process is kept in the blocked state when no data is processed, and processor resources are not occupied; meanwhile, semaphore notification and data transmission are both completed in the shared memory, data copying and context switching between a kernel mode and a user mode are avoided, and therefore low processor resource occupation and low communication delay are achieved.

A method for controlling a neural network circuit that is provided with a first memory, a convolution operation circuit that performs a convolution operation, a second memory, a quantization operation circuit, a second write semaphore, a second read semaphore, a third write semaphore, and a third read semaphore, wherein the method for controlling the neural network circuit involves making the convolution operation circuit implement a convolution operation based on the third read semaphore and the second write semaphore.

A method for serving machine learning (ML) model over at least two pipes includes defining a function that receives at least two process pipes as arguments, and defining another class. The other class is used for creating and storing future objects and setting the result from another thread. The method also includes releasing a semaphore to avoid overloading of a second pipe once the data is sent to the other thread, and writing an asynchronous function to a first pipe or an input pipe in order to send the data to the other thread.

A compiler creates a dependency graph for a function in an input program. The dependency graph includes nodes corresponding to commands in the function and edges that correspond to dependencies between the commands. The compiler performs a forward reachability analysis on the dependency graph to eliminate redundant dependencies. The compiler also adds a minimized set of back-edges to the dependency graph to enforce loop-carried resource dependencies in the input program. The compiler then allocates synchronization primitives provided by a multiprocessor computing system, such as semaphores, to the commands in the function of the input program based on the contents of the dependency graph.

Apparatuses, systems, and techniques to facilitate graph code synchronization between application programming interfaces. In at least one embodiment, one or more circuits are to perform an application programming interface (API) to cause graph code to wait on a semaphore used by another API.

The application discloses a scheduling method and device of asynchronous tasks, equipment, a storage medium and a program product, and relates to the technical field of servers. The method comprises the following steps: in response to receiving a processing request of a calculation task, generating task queue information corresponding to the calculation task; acquiring a first semaphore and a second semaphore corresponding to at least one type of asynchronous task, wherein the first semaphore is used for indicating the task quantity of the asynchronous tasks processed by a task processor, and the second semaphore is used for indicating the task quantity of the asynchronous tasks to be processed submitted by a calculation processor; determining whether the first semaphore and the second semaphore corresponding to the type of asynchronous task satisfy a preset condition variable, if yes, waking up an asynchronous task thread, reading task parameters corresponding to the type of asynchronous task from the task queue information through the asynchronous task thread, and executing the type of asynchronous task according to the task parameters. The method can improve the resource utilization rate of a server cluster.

The application discloses a construction method and device of an extended semaphore under a Linux environment, and belongs to the technical field of operating systems.The method comprises the following steps: multiplexing an XSI semaphore in a Linux operating system, extending a flag parameter of the XSI semaphore, setting the flag parameter to true, and forming an extended semaphore; wherein the extended semaphore is provided with a task processing mode attribute and a plurality of interfaces on the basis of the XSI semaphore; the task processing mode attribute represents that the extended semaphore accepts task access according to a task priority; the interfaces comprise a lower limit value setting interface, an upper limit value setting interface, a task waiting confirmation interface, a preemption interface, a task priority acquisition interface and an operation part success interface.The application supports manual extension of behaviors of the new semaphore, so that whether a task needs to wait for the semaphore can be flexibly determined according to actual conditions of a current system.

The invention provides an embedded real-time operating system-oriented high-reliability inter-thread synchronous communication method and related equipment, and belongs to the field of communication. The method comprises the following steps: initializing a synchronous resource and a thread portrait, and establishing a mapping table of a semaphore pool and a lock object; carrying out synchronization overhead modeling and estimation, and recording thread waiting time, lock occupation duration and switching times by using a sampling window to form dynamic statistical data; setting a synchronization performance threshold value and an abnormal logic judgment rule; co-scheduling of semaphores and locks is executed, thread requests are sorted in a combined mode according to priorities, waiting time and resource occupancy rates, and the semaphores are dynamically distributed; health assessment and adaptive optimization are carried out, and a semaphore distribution strategy and a lock priority are automatically adjusted according to a synchronization performance deviation value; and if abnormity is detected, the synchronization module triggers a protection mechanism, redistributes the thread scheduling table and sends out alarm information. According to the method and the device, the embedded real-time operating system can have higher reliability and self-adaptive capability in a high-concurrency environment.

A test data uploading method, device and system are disclosed. Based on a first test vector, a corresponding test board card is controlled to perform a first test operation, and the first test operation includes writing test output data corresponding to the first test operation into a first storage area of a memory of the test board card. During the execution of the first test operation by each test board card, in response to receiving a first semaphore, test output data in a second storage area of the memory of the test board card is synchronously written into shared memory, and the test output data in the second storage area is test output data corresponding to a second test operation performed before the first test operation. In response to the test output data corresponding to the second test operation being successfully written into the shared memory, a second semaphore is sent to an upper computer, and the upper computer reads the test output data corresponding to the second test operation from the shared memory according to the second semaphore, so that test data uploading is realized during the test process, and the data uploading efficiency is improved.

The application provides a method and medium for interface conversion from a VxWorks system to an embedded Linux system, which comprises: constructing a compatible layer in a user state, rewriting key system function APIs of the VxWorks, such as task management, message queue, semaphore and watchdog, and calling Linux native system functions or implementing corresponding logic by itself in the internal, and finally compiling the implementation code into a static library or a dynamic library. An application program only needs to link the library and include the corresponding header file, so as to be compiled and run in the embedded Linux system without modifying the core source code. The application realizes seamless transplantation in the user state without modifying the operating system kernel and configuration, significantly reduces the transplantation cost and system stability risk, and is suitable for various deployed Linux environments.

This invention provides a multi-loop energy metering method based on dynamic resource allocation using semaphores. The steps include: collecting multi-loop energy signal data, calculating dynamic priorities, determining system status, and outputting a multi-channel dynamically bound metering resource scheduling strategy. This invention, through differentiated adaptation between multi-resource reuse metering strategies and single-resource independent metering strategies, avoids idle sampling channels and computing units during idle periods, effectively reducing hardware configuration costs and adapting to the resource elasticity requirements of multi-loop scenarios. Furthermore, synchronous sampling across multiple channels during idle periods improves the reliability of metering data, while independent resource allocation during busy periods avoids data queuing and loss, ensuring metering accuracy and response speed under dynamically fluctuating load scenarios. Moreover, through dynamic priority and system status determination, it can flexibly adapt to various scenarios and meet collaborative scheduling requirements.

The invention discloses a data processing method for a heterogeneous multi-core processor. The data processing method comprises the following steps: establishing indexes of signal lamps of signal lamp controllers and slave core modules through a master core distribution signal lamp controller, and initializing a data exchange cache space of the slave core modules through the master core; acquiring communication data based on the transmission data and transmitting a notification signal through the slave core; based on the notification data, the received slave core obtains the sending data through the received slave core interrupt processing.

The invention discloses a PLC task scheduling method and device, electronic equipment and a storage medium. According to the specific implementation scheme, when the semaphore of a clock reference task is detected, a plurality of first-type tasks are triggered; and when it is detected that the first type of tasks meeting the half-cycle offset scheduling condition exist, performing half-cycle offset scheduling on the first type of tasks. According to the technical scheme, the first type of tasks meeting the half-cycle offset scheduling conditions are subjected to half-cycle offset scheduling, resource competition and scheduling conflicts caused by multi-task concurrence can be effectively avoided, and therefore the efficiency and reliability of PLC task scheduling can be improved.

Accelerating and improved fairness for semaphores is described. In one or more implementations, a computing device includes a plurality of cores and one or more computing resources, exclusive access to which is limited, e.g., to a single core at a time. In one or more implementations, the computing device also includes core selection circuitry configured to identify a first core from the plurality of cores exclusively accessing the one or more limited computing resources and configured to instruct a second core from the plurality of cores to release the exclusive access of the first core to the one or more computing resources.

Accelerating and improved fairness for semaphores is described. In one or more implementations, a computing device includes a plurality of cores and one or more computing resources, exclusive access to which is limited, e.g., to a single core at a time. In one or more implementations, the computing device also includes core selection circuitry configured to identify a first core from the plurality of cores exclusively accessing the one or more limited computing resources and configured to instruct a second core from the plurality of cores to release the exclusive access of the first core to the one or more computing resources.

The invention provides a file concurrent processing method and system and electronic equipment, and belongs to the technical field of file transmission, and the method comprises the following steps: determining a target concurrent level according to the number of available processing cores of the equipment; initializing a semaphore for controlling the concurrent task according to the target concurrent level; respectively operating a virtual thread for each to-be-processed file to be concurrent to obtain permission of the semaphore, and transmitting the to-be-processed file from the source storage position to the target storage position during the period of holding the permission to obtain a target file; after it is detected that all the virtual threads in the structured task domain are operated, processing results of all the target files are output. According to the file concurrent processing method based on the virtual thread and semaphore control, the overall efficiency and system stability of large-scale file concurrent processing are improved.

The device described herein, which provides an interface between a plurality of master devices and a slave device, includes: a first timer configured to begin timing when a first access request is received from a first master device via a bus, and to be reset when a semaphore is allocated to the first master device; a second timer configured to begin timing when a second access request is received from a second master device via the bus, and to be reset when a semaphore is allocated to the second master device; and a controller configured to provide a first message to the first master device via the bus when a first expiration interval is measured by the first timer.