Patent classifications
G06F2209/522
SYSTEMS AND METHODS FOR QUEUE CONTROL BASED ON CLIENT-SPECIFIC PROTOCOLS
The present disclosure generally relates to controlling access to resources by selectively processing requests stored in a task queue to prioritize certain requests over others, thereby preventing automated scripts from accessing the resources. More specifically, the present disclosure relates to a normalization and prioritization system for controlling access to resources by queuing resource requests based on a client-defined normalization process that uses one or more data sources.
Systems and methods for queue control based on client-specific protocols
The present disclosure generally relates to controlling access to resources by selectively processing requests stored in a task queue to prioritize certain requests over others, thereby preventing automated scripts from accessing the resources. More specifically, the present disclosure relates to a normalization and prioritization system for controlling access to resources by queuing resource requests based on a client-defined normalization process that uses one or more data sources.
SYSTEMS AND METHODS FOR RECOVERY WITH A DISTRIBUTED LOCK MANAGER
A system is disclosed. A node may include a resource. A lock manager may include storage for a data structure for a lock. The data structure may include a first identifier for the resource, a second identifier for an application, and a status for the lock.
Systems and methods for queue control based on client-specific protocols
The present disclosure generally relates to controlling access to resources by selectively processing requests stored in a task queue to prioritize certain requests over others, thereby preventing automated scripts from accessing the resources. More specifically, the present disclosure relates to a normalization and prioritization system for controlling access to resources by queuing resource requests based on a client-defined normalization process that uses one or more data sources.
METHOD FOR PROMPTING MESSAGE IN TERMINAL AND TERMINAL
The disclosure provide a method for prompting a message in a terminal and a terminal. The terminal includes multiple operating systems and a management system. The management system is configured to manage the multiple operating systems. The management system includes a cross-system application database. The method includes: when a first operating system in the multiple operating systems runs in a foreground, and a second operating system in the multiple operating systems runs in a background, if the second operating system receives a first message of a first application in the second operating system, sending, by the second operating system, a notification message to the management system; storing, by the management system, the notification message into the cross-system application database; and listening, by the first operating system, on the cross-system application database, and outputting a prompt of the first message when listening and obtaining the notification message.
Contended lock request elision scheme
A system and method for network traffic management between multiple nodes are described. A computing system includes multiple nodes connected to one another. When a home node determines a number of nodes requesting read access for a given data block assigned to the home node exceeds a threshold and a copy of the given data block is already stored at a first node of the multiple nodes in the system, the home node sends a command to the first node. The command directs the first node to forward a copy of the given data block to the home node. The home node then maintains a copy of the given data block and forwards copies of the given data block to other requesting nodes until the home node detects a write request or a lock release request for the given data block.
LOCK MANAGER
In some examples, a lock manager may receive a lock release message from a processor. The lock release message may identify a lock that synchronizes control of a shared resource. The lock manager may determine, for the lock identified in the lock release message, multiple processors contending to acquire the lock and select a particular processor among the multiple processors to acquire the lock.
SYSTEMS AND METHODS FOR QUEUE CONTROL BASED ON CLIENT-SPECIFIC PROTOCOLS
The present disclosure generally relates to controlling access to resources by selectively processing requests stored in a task queue to prioritize certain requests over others, thereby preventing automated scripts from accessing the resources. More specifically, the present disclosure relates to a normalization and prioritization system for controlling access to resources by queuing resource requests based on a client-defined normalization process that uses one or more data sources.
MANAGING LOCK LEASES TO AN EXTERNAL RESOURCE
According to examples, an apparatus may include a processor and a memory on which is stored machine readable instructions that are to cause the processor to store a copy of an external resource on the apparatus, transmit a request for renewal of a lock lease for the external resource, and based on a failure to receive a reply to the renewal request, enter the apparatus into a state in which: the processor processes a new operation on the stored copy of the external resource, and following a determination that the lock lease is lost, the processor outputs a notification that the apparatus lost the lock lease.
Asynchronous and idempotent distributed lock interfaces
Methods and apparatus for distributed locking interfaces are disclosed. A state manager implements programmatic interfaces for distributed locking operations. In response to a queue-for-lock request for a registry element received via an interface, the state manager provides to the requester, a reference to a first asynchronous computation. The first asynchronous computation comprises an insertion of a lock request into a queue of waiters for a lock on the element. In response to a blocking request for a result of the computation, the state manager transmits, after the lock request has been inserted into the queue of waiters, a notification of the insertion of the request. The notification in turn includes a reference to a second asynchronous computation. The second asynchronous computation comprises a grant of the lock on the particular element to the requester.