40 results about "Semaphore" patented technology

An ordered semaphore management subsystem and method for use in an application system which includes a plurality of processors competing for shared resources each of which is controlled by a unique semaphore. The subsystem generates an ordered semaphore field (OSF) corresponding to each processor in a linked list of processors and assigns one of four statuses to the OSF depending on the position the processor occupies in the linked list of processors competing for the shared resources. The four states are (1) semaphore head (SH); (2) behind semaphore head (BSH); (3) semaphore head behind (SHB); and (4) skip (Skip). Only the SH processor is allocated the semaphore when requested. A processor not in the SH state will be denied the semaphore even if is available to assure sequential access.

A method, executed by a computer, for inter-process communication in a multi-tenant environment includes creating an advertisement file for each tenant, determining that a semaphore is greater than zero, searching for a response file, and decrementing the semaphore. Detecting the response file may enable the specific tenant to establish a connection with an attachment process, and as a result, the semaphore may be reset to a value of zero. In one embodiment, a plurality of synchronization files are locked prior to incrementing the semaphore and unlocked in response to detecting the response file. Another method includes counting the targets to provide a target count, incrementing a semaphore to the target count, creating a response file, and establishing a connection with the specific target. A computer program product and computer system corresponding to the methods are also disclosed herein.

The invention discloses a mutual exclusion and semaphore cell block of a multi-core processor satisfying SystemC syntax, which comprises a logic circuit achieved according to the function codes of sc_mutex (name), sc_mutex.lock(), sc_mutex.trylock(), sc_mutex.unlock(), sc_semaphore.wait(), sc_semaphore.trywait(), sc_semaphore.post(), sc_semaphore(init_value), sc_semaphore(name, init_value) of the SystemC syntax, wherein the logic circuit is used for sending signals for activating and pausing the processor to a controller at runtime of the processor cores, and allows a mapping algorithm of a software development tool to recombine a plurality of mutual exclusion and semaphore cells positioned at different processing units so as to finish the functions of an sc_mutex or sc_semaphore syntax unit defined by a SystemC language. By applying the mutual exclusion and semaphore cell block, local resources can be applied to the resource sharing and the synchronization between any plurality of processing units and between the processing unites and peripherals.

A processor having a limited amount of local memory for storing code and / or data utilizes a program stored in external memory. The program stored in external memory is configured into blocks which can be loaded individually into the local memory for execution. Queuing the individual blocks of code allows the program to be executed by the processor and also facilitates loading of the subsequent code to be executed. A semaphore system can be utilized to indicate which blocks of local memory are available / unavailable. The system can support the interaction of multiple independent programs in external memory.

A semaphore handle is retrieved from a symbol-handle table, which stores a semaphore handle of a semaphore controlling a resource in association with a resource symbol included in a semaphore operation command issued by a task. In case of an “Acquire semaphore” command, the semaphore indicated by the retrieved semaphore handle is acquired, and the resource managed by the acquired semaphore is assigned to the task that issued the “Acquire semaphore ” command. In case of a “Release semaphore” command, the semaphore indicated by the retrieved semaphore handle is released, and the resource managed by the semaphore is released from the task that issued the “Release semaphore” command.

A cybersecurity solution for preventing malware from infecting a computing device or a computer resource on the computing device. The solution can include detecting a computer resource process running or attempting to run on an operating system and comparing details of the computer resource process against an authorized processes database containing details of previously run computer resources processes to determine if the computer resource process is running or attempting to run for a first time on the operating system. The solution can include adding, during a learning mode, the details of the computer resource process to the authorized processes database when it is determined that the computer resource process is running or attempting to run for the first time on the operating system, and suspending, during a protect mode, the computer resource process from running on the operating system when it is determined that the computer resource process is running or attempting to run for the first time on the operating system. The details of the computer resource process can include at least one of semaphore data, mutex data or atom data for the computer resource process.

A V-operation not performed atomically for each data element or storage space that becomes available in a FIFO or a P-operation is not performed atomically for each request for a data element or a storage space in the FIFO but rather one V-operation is performed after m data elements or m storage spaces have become available in the FIFO or one P-operation is performed after m requests for data elements or m requests for storage spaces have been received. Upon using these P-operations, i.e. performing said request operations in bursts rather than atomically, cases may occur where less data elements or storage spaces are available in said FIFO buffer than needed or requested by a consumer process, e.g. a reading or a writing process. A P-operation is performed by requesting m data elements or m storage spaces for m data elements. The P-operation will only be blocked completely, if no data elements or storage spaces are available in the FIFO buffer, i.e. the semaphore counter being zero. However, if there are data elements or storage spaces available in the FIFO buffer, i.e. the semaphore counter is greater than zero, the value of the available data elements or storage spaces for data elements, i.e. the count of the semaphore counter, and the value m of the P- request operation are compared and the minimum value of said two values is selected. If there are more data elements or storage spaces available in said FIFO buffer than requested by said P-operation, the value m of the requested data elements or storage spaces for data elements is selected as the actual available decrement of said semaphore counter. However, if there are less data elements or storage spaces available in said FIFO buffer than requested by said P-operation, the value of the available data elements or storage spaces for data elements is selected as the actual available decrement dec. The actual decrement dec of said semaphore counter is finally output.

The invention discloses a method for supporting remote semaphore configuration. The method comprises the steps that S1, a remote server selects a correspondingly configured BIN file according to requirements and issues the BIN file to a TBOX; S2, the TBOX analyzes the correspondingly configured BIN file and issues the BIN file to the ECU through the CAN network; S3, the ECU executes a corresponding CAN communication process; S4, the TBOX communicates with the ECU through a CAN network and obtains related semaphore; and S5, the TBOX uploads the obtained related semaphore to a remote server, andthe remote server analyzes the related semaphore into actual semaphore data according to the configuration file. According to the method for supporting remote semaphore configuration, the semaphore can be changed without upgrading software, inconvenience in use and fault risks due to frequent software upgrading are avoided, and the method has the advantage of flexible configuration.

The invention provides a mutual exclusion semaphore abnormal blocking auxiliary analysis method and system and a storage medium, and the method comprises the steps: 1, carrying out the lock operation of a corresponding mutual exclusion semaphore when a thread occupies a shared resource, recording wait information before the lock, and adding the wait information into a wait list; step 2, after the lock, recording lock information, and deleting wait information from the wait list at the same time; 3, after the shared resources are accessed, unlock operation is carried out on the semaphore, and then lock information is cleared; 4, each semaphore forms a table record, and the table records are recorded in a memory in real time and recorded in a flash at regular time; and 5, when an exception occurs, determining the semaphore and the code of the problem by checking the table record information. The method has the beneficial effects that the method is used for monitoring the abnormal blocking condition of the semaphore in real time, and meanwhile, problem points can be quickly positioned.

The invention discloses a global semaphore implementation method based on a multi-core multi-processor parallel system. The method comprises the following steps: each processing core performs system initialization and maps a shared storage space through SRIO; each processing core creates a thread, initializes the thread, and establishes a mapping table of the thread and local semaphore; a global semaphore is created from a global semaphore buffer pool corresponding to a processing core to which the thread belongs, and the global semaphore information is filled into a global semaphore name table; and when the thread is suspended on a waiting queue of a global semaphore or is unsuspended, the thread is suspended or unsuspended through a semaphore proxy mechanism. Through a semaphore agent mechanism, the global semaphore is realized by utilizing a software method, the method can be used for occasions of thread synchronization and mutual exclusion among multi-core multiprocessors, and theproblems of thread synchronization and mutual exclusion at the same moment on a multi-core multiprocessor parallel system are solved.

The invention discloses a method for diagnosing no response of equipment in an embedded system. The method specifically comprises the steps of storing and printing the running position of the TASK, triggering a diagnosis process by utilizing a BOOT pin, and diagnosing RTOS system scheduling. Through the combination of the above means and the combination of the assembly code and the C language code, the cause of the problem can be quickly positioned. For example, a certain TASK in the system uses a binary semaphore but does not release the binary semaphore, and the other TASKs continue to applyfor using the semaphore, because the TASKs cannot obtain the semaphore, the TASKs are suspended, and at the moment, the phenomenon that the system does not respond is shown. At the moment, developerscan diagnose by using the above several modes.

The invention provides a control method and system for realizing semaphore order preservation in systemverilog, which determines whether the current request source is waiting according to the value of a static variable, and determines whether the current request source is interrupted according to whether the value in the associative array is a special value. Implement order-preserving control of semaphore. The present invention constructs encapsulation classes, sets static variables, associative arrays, checks the function of returning key quantity and order preservation function, when requesting to apply for a key, according to the record value in the associative array, it is determined whether the previous request is blocked, so as to decide the present invention. Whether the second request is interrupted, so as to ensure the processing order of the request, solve the hidden defects of semaphore in the existing systemverilog and the situation that may cause the request to be out of order, make full use of the life cycle of static variables and the built-in associative array can be added at any time Or delete the characteristics of the element, supervise and effectively control the key return of the semaphore and the request for the key.

The invention discloses a multi-state multi-semaphore serial feedback method, which comprises the following steps of: firstly finishing an initialization program, then starting a feedback output period, firstly marking an operation state, and distinguishing a normal state and a fault state by a marking signal of the operation state according to the length of high level time; after operation state marking is completed, signal levels are generated at intervals of a period of time, then the semaphore state is marked, and marking signals of the semaphore state represent different states through different duty ratios; after the semaphore state flag is completed, a feedback output period is completed by the signal level at intervals of a period of time; and repeating the process, and continuing to finish the next feedback output cycle. The multi-semaphore feedback circuit can perform feedback output on the multi-semaphore with various states for each semaphore so as to report the current semaphore state, does not need a plurality of peripheral expansion interfaces, and is low in cost and easy to implement.

The invention discloses a random denoising statistical method and system based on cumulative semaphore, and the method comprises the steps: carrying out the quick traversal of a statistical time period historical sample set, and summarizing sample features; in combination with the sample features, processing noise data, and synchronously updating the historical sample set and the sample features; according to the updated sample features, summarizing accumulation results from the updated historical sample set; and according to the sample features, the updated historical sample set, the sample features and the summarized accumulation result, designing an accumulation signal measurement point statistical algorithm device, performing traversing to generate the sample features, processing the noise data according to the noise type, updating the sample features and the historical sample set, and performing re-summarizing to generate a correct accumulation result. According to the user request parameter, the noise data is automatically identified, the noise data is processed according to the noise type, the correct accumulation result is summarized and counted, the human intervention cost is reduced, and the statistical efficiency and accuracy are improved.

The invention belongs to the technical field of vxworks systems, and particularly relates to an operating lever serial port drive design method based on a semaphore event under a vxworks system. The method comprises the following steps: reading operating lever serial port configuration information; initializing a serial port equipment use environment; analyzing the serial port data to obtain a force-sensitive adjustment coordinate sent by the operating lever; and setting a screen coordinate reporting event according to the semaphore. Compared with the prior art, the operating lever serial portdriver based on the semaphore event has the advantages that the operating lever force-sensitive coordinates are transmitted through the semaphore event according to the characteristics of a system platform and the characteristics of serial port data of operating lever equipment under the application scene that the system is vxworks. The operating lever serial port drive loading process is simplified, an operating lever moving event is converted into a semaphore event according to operating lever serial port data characteristics, and a screen coordinate interface is provided for an upper-layerapplication program.

The invention discloses a message collaborative normalization processing method based on a multi-source control application layer of a Linux system, and the method comprises the steps: achieving a one-to-one mapping relation between a communication interface and a thread according to the thread and semaphore provided by the Linux system, completing the receiving processing through an independent thread, and building a processing response bridge through the semaphore; according to the method, data receiving, content analysis and corresponding processing links of a communication source are effectively isolated from one another, when data of various communication interfaces are abnormal, positions can be conveniently and rapidly locked, problem reasons can be conveniently and rapidly found out, the research and development period of products is shortened, and the design efficiency, robustness and reliability of the products are remarkably improved.

A method, executed by a computer, for inter-process communication in a multi-tenant environment includes creating an advertisement file for each tenant, determining that a semaphore is greater than zero, searching for a response file, and decrementing the semaphore. Detecting the response file may enable the specific tenant to establish a connection with an attachment process, and as a result, the semaphore may be reset to a value of zero. In one embodiment, a plurality of synchronization files are locked prior to incrementing the semaphore and unlocked in response to detecting the response file. Another method includes counting the targets to provide a target count, incrementing a semaphore to the target count, creating a response file, and establishing a connection with the specific target. A computer program product and computer system corresponding to the methods are also disclosed herein.

The invention provides an instruction splitting method and device and electronic equipment. The method is applied to a forwarding layer of a distributed server, and comprises the following steps: receiving a to-be-split instruction, and determining a semaphore of the instruction; wherein the instruction comprises a plurality of key value pairs, and the semaphore represents a processing stage of the instruction; splitting the instruction, and sending the split instruction to a plurality of servers; receiving processing results sent by the plurality of servers, and determining whether the instruction is processed or not based on the semaphore; and if the processing is completed, summarizing a plurality of processing results to obtain a final processing result, and sending the final processing result. When the instruction is split and processed, the processing stage of the instruction is determined through the semaphore, and whether the split instruction is completely processed or not can be determined according to the semaphore. In the mode, distributed processing of the instruction can be realized through instruction splitting, so that uniform processing of the split instruction is ensured, and the instruction processing efficiency is improved.

The invention discloses a semaphore mechanism based on a [mu] C / OS-II system, and the semaphore mechanism protects shared resources, and divides semaphores into a reading mechanism and a writing mechanism. When semaphores are created, attributes such as a read task table, an event waiting table and a semaphore state are distributed to the semaphores. When one read task occupies the semaphore, the priority of the task is stored in the read task table, the occupied state of the semaphore is changed, other tasks which want to read the shared resources still can apply for the read semaphore, and tasks which want to write the shared resources do not apply for the semaphore, so that reading and reading sharing, read-write mutual exclusion and write-write mutual exclusion are realized. And the priority of the tasks in the read task table can be improved to avoid the condition of priority inversion, so that the problems that the overhead is relatively high due to the fact that the tasks are frequently suspended in a mutual exclusion semaphore mechanism in a mu C / OS-II system and a writer waits for a long time in a read / write semaphore mechanism are solved, and the execution efficiency of communication between the tasks is further improved.

The present invention provides an interface function positioning method, device and network equipment. The network device runs multiple threads, the first thread in the multiple threads obtains the semaphore used to access the data through the interface function, and accesses the data through the semaphore, and the second thread to access the data needs to wait for the semaphore to be released. , obtain the semaphore and access the data, the network device allocates a corresponding signal stack for each thread, the signal stack is used to store the semaphore acquired by the thread, the method includes: judging whether the top semaphore of the signal stack corresponding to the first thread is not Deadlock; if the semaphore at the top of the stack is deadlocked, find the interface function corresponding to the semaphore at the top of the stack from the correspondence between the locally recorded semaphore and the interface function; determine the interface function corresponding to the semaphore at the top of the stack as the problem interface function. Through the present invention, the problem interface function can be quickly located.

The present application relates to a task processing process monitoring method, device, computer equipment and storage medium. Involving in the field of abnormality monitoring, the method includes: generating tasks to be processed; adding the tasks to be processed to the task processing queue of the semaphore; Add to the entry node of the thread, obtain the task information of the task to be processed at the entry node; generate the first semaphore operation record according to the first semaphore operation and task information; execute the pending task entering the thread, when the task processing is completed, obtain Execution result information; release the semaphore license, and obtain the second semaphore operation; generate a second semaphore operation record according to the execution result information and the second semaphore operation; generate a task according to the first semaphore operation record and the second semaphore operation record Execution log. By adopting the method, the process monitoring can be more comprehensive, and the abnormal location can be more accurate and rapid.

The invention discloses a method for cancelling time-consuming operation and blocking asynchronous conversion. The method comprises the following steps: creating a time-consuming operation thread; establishing a two-state semaphore for the time-consuming operation thread; enabling any thread to modify the two-state model quantity state into a signal so as to send a cancel request; and enabling the time-consuming operation thread to detect cancel by monitoring or querying a two-state semaphore state. Meanwhile, any blocking function can be converted into an asynchronous function or a UI blocking function for use. According to the method and system for cancelling time-consuming operation and blocking asynchronous conversion, the cancelling request and the blocking asynchronous conversion have business independence. The cancel request is sent to the thread executing the time-consuming operation only by using a uniform interface, and a special cancel interface does not need to be provided for different services, objects and operations. And the time-consuming operation can be realized only by providing a blocking interface instead of asynchronous and UI blocking interfaces.

A database system populates various fields with information from a plurality of data sources which is matched to geographic and segment information for different reference identifiers. A series of data unions provide a selectable result set. A selection of elements from the selectable result set are used to generate qualifiers that are monitored in real time to determine when the qualifiers have been satisfied in order to set a semaphore allowing access to the selection of elements.

The invention provides a user mode timer implementation method based on semaphore mechanism. The method is used for solving the problem of overtime callback of a timer of a user mode application program. A kernel timer management unit, the semaphore mechanism and the user mode timer management unit are included. By adopting the semaphore mechanism-based user mode timer implementation method provided by the invention, the kernel timer can call the timeout callback function set by the user mode in the user mode after the timing time is up, so that the user mode callback function is prevented from being directly called in the kernel mode, and the security of the kernel mode is protected.

In certain aspects of the disclosure, an apparatus includes first and second semaphore registers disposed in a first power domain. A common address bus is coupled to the first and second semaphore registers, and a semaphore lock is disposed in the first power domain and coupled to the first and second semaphore registers. The semaphore lock is controlled by the first and second semaphore registers, and controls whether a signal from a second power domain is permitted to propagate to the first power domain. The first and second semaphore registers may be associated with first and second register addresses, respectively, which are selected to provide a substantially maximized Hamming distance between them. The first and second semaphore registers may have a write order expectation enforced between them.

The invention provides an inter-process communication method and device based on a shared memory and electronic equipment. The method comprises the steps of providing a first interface, and enabling the first interface to execute the following operations in response to a first call request of a first process: if a write judgment condition in the first call request is not met, adding 1 to a first reference count, unlocking, carrying out P operation on a first semaphore, and entering a write waiting state; during waiting, if it is judged that the writable available amount of the message queue interval is greater than 0 based on the first semaphore and a write judgment condition in the first call request is met, exiting; and providing a second interface, and enabling the second interface to execute the following operation in response to a second calling request of the second process: conducting V operation on the first semaphore of the message queue interval of the second process based on the value of the first reference count so as to enable other processes in the waiting state to be awakened. Therefore, the waiting process releases the system resources, then the waiting process is awakened through the V operation of the first semaphore, and the communication efficiency of the system is improved.