Abstract: A system includes a processor and a memory including instructions that are executable for causing the processor to perform operations. The operations include accessing a new component value and a set of inner heaps. Each inner heap of the set of inner heaps includes a sorted set of components originating from a plurality of component sources. The operations further include assigning the new component value to a first inner heap of the set of inner heaps. In response to assigning the new component value to the first inner heap, the operations include sorting the first inner heap to identify a maximum or minimum value of the first inner heap. In response to determining that the new component value changes the maximum or minimum value of the first inner heap, the operations include updating an outer heap to include a reference to the new component value of the first inner heap.

Abstract: An apparatus and a method for recovering from a fault on a device, the method performed at the device comprising: initiating, with a bootloader, a recovery mechanism in response to detection of a fault with a first application, where the recovery mechanism comprises: obtaining, from storage on the device, location information identifying a first storage location for recovery software; obtaining, from the first storage location, the recovery software; obtaining, using the recovery software, a software update from a second storage location.

Abstract: A system and method that preserves consistency of corporate data including interdependent corporate data in a globally distributed environment.

Abstract: A system and method schedule work within a workflow with defined process goals. A plurality of work queues are defined that comprise work items. The plurality of work queues are associated with one or more links between a parent work queue and at least one child work queue to form at least one work process. At least one work process goal is defined for each work process. A work schedule to achieve the work process goals is generated.

Abstract: Methods, systems, and computer readable media for lock-free communications processing at a network node are disclosed. One method occurs at a first network node configured to add messages to a plurality of queues, wherein each of the plurality of queues is accessed by one of a plurality of threads. The method comprises receiving a first message associated with a first mobile subscriber; determining that the first message is associated with a first partition key; assigning, based on the first partition key, the first message to a first queue of the plurality of queues, wherein the first queue includes messages associated with the first mobile subscriber and wherein the first queue is accessible by a first thread of the plurality of threads; and processing, by the first thread, messages of the first queue in a first in, first out order.

Abstract: A system and method schedule work within a workflow with defined process goals. A plurality of work queues are defined that comprise work items. The plurality of work queues are associated with one or more links between a parent work queue and at least one child work queue to form at least one work process. At least one work process goal is defined for each work process. A work schedule to achieve the work process goals is generated.

Abstract: Embodiments provide cloud-based identity management by receiving a request to perform an identity management service that includes real-time tasks and near-real-time tasks. Embodiments synchronously execute the real-time tasks by accessing at least one microservice using a corresponding application programming interface (“API”). Embodiments asynchronously execute the near-real-time tasks by offloading the near-real-time tasks to one or more message queues.

Abstract: System and method for managing migration of global variables on processing system during live program updates, including creating a shared data segment is created in a physical memory of the processing system, binding a logical address space of a first global variable data segment for a first version of a program to a physical address of the shared data segment, and binding a logical address space for a second global variable data segment for an update version of the program to the physical address of the shared data segment. The first global variable data segment and the second global variable data segment exist concurrently and each map to common global variables stored in the shared data segment.

Abstract: A concurrency-restricting lock may divide a set of threads waiting to acquire the lock into an active circulating set (ACS) that contends for the lock, and a passive set (PS) that awaits an opportunity to contend for the lock. The lock, which may include multiple constituent lock types, lists, or queues, may be unfair over the short term, but improve throughput of the underlying multithreaded application. Culling and long-term fairness policies may be applied to the lock to move excess threads from the ACS to the PS or promote threads from the PS to the ACS. These policies may constraint the size or distribution of threads in the ACS (which may be NUMA-aware). A waiting policy may avoid aggressive promotion from the PS to the ACS, and a short-term fairness policy may move a thread from the tail of a list or queue to its head.

Abstract: A mechanism is provided in a data processing system for automatically throttling the rate of service provided by a Web application programming interface (API) for a software service. A flow controller executing on the data processing system assigns a queue to each consumer of the software service. Responsive to receiving a current request for the software service from a given consumer of the software service, a flow controller executing on the data processing system adds the current request to a given queue assigned to the given consumer. The flow controller sends a next request from the given queue to the Web API based on a licensed rate of service of the given consumer.

Abstract: Certain database structures and operations are recognized in order to generate hints for a tiered storage array. Historical snapshots of a database data dictionary are searched for patterns corresponding to the structures and operations. After a structure or operation is identified, a corresponding set of extents is identified. Logic predicts future activity associated with the extents, and a corresponding hint is provided to the storage array. Statistical information associated with the identified structure or operation may be maintained and updated to facilitate prediction of activity.

Abstract: A system and method schedule work within a workflow with defined process goals. A plurality of work queues are defined that comprise work items. The plurality of work queues are associated with one or more links between a parent work queue and at least one child work queue to form at least one work process. At least one work process goal is defined for each work process. A work schedule to achieve the work process goals is generated.

Abstract: Systems and methods for generating a transaction lifecycle output using a transaction lifecycle (TL) computer system are provided herein. The TL computer system includes a memory device for storing data and a processor in communication with the memory device. The processor is programmed to receive transaction data associated with a transaction being processed over a payment network. The transaction data includes authorization data, clearing data, and fraud data. The processor is also programmed to generate the transaction lifecycle output by processing the authorization data, the clearing data, and the fraud data. The transaction lifecycle output includes output data organized by pre-defined stages of the transaction.

Abstract: A system provides cloud-based identity and access management. The system receives a request to perform an identity management service, and accesses a microservice based on the identity management service. The system determines one or more real-time tasks and one or more near-real-time tasks that are required to be executed to complete the identity management task. The system synchronously executes the one or more real-time tasks by the microservice, and sends the one or more near-real-time tasks to a queue to be asynchronously executed.

Abstract: In a multiprocessor system, a central memory synchronization module coordinates memory synchronization requests responsive to memory access requests in flight, a generation counter, and a reclaim pointer. The central module communicates via point-to-point communication. The module includes a global OR reduce tree for each memory access requesting device, for detecting memory access requests in flight. An interface unit is implemented associated with each processor requesting synchronization. The interface unit includes multiple generation completion detectors. The generation count and reclaim pointer do not pass one another.

Abstract: Systems and methods for managing data, such as metadata or indexes for index databases. In one exemplary method, different processing priorities are assigned to different indexing tasks based upon the origin of the task. In another exemplary method, indexing tasks are processed in a first mode when a data processing system is in a first power state and indexing tasks are processed in a second mode when the data processing system is in a second power state.

Abstract: A system and computer program product for resetting of memory locks in a transactional memory system. The system includes a processor setting at least one new memory lock during execution of a transaction that acquires access to a region of memory. The new memory lock indicates that the transaction and its associated thread have exclusive temporary access to the memory region. The system further includes the processor determining if a first in first out (FIFO) memory lock register is full of memory locks and, in response to the FIFO memory lock register being full, a memory lock is removed from a tail position of the FIFO memory lock register. The removed memory lock is reset to return to a transactional memory state and the new memory lock is added to a head position in the FIFO memory lock register.

Abstract: Systems and methods for redistributing data in a relational database are disclosed. In one embodiment, the database includes a plurality of rows of data distributed across a plurality of slices of a table in the database. The database system is configured to distribute the rows of data across the slices according to a first function based on one or more columns of the table. The database system monitors at least one database statistic indicative of variation in a distribution of the rows of data across the slices and detects a redistribution condition based on the at least one monitored database statistic. The database system is further configured to respond to the detected redistribution condition by redistributing the rows of data across the slices according to a second function based on a different number of columns than the first function.

Abstract: The present disclosure includes methods and apparatuses that include write command overlap detection. A number of embodiments include receiving an incoming write command and comparing a logical address of the incoming write command to logical addresses of a number of write commands in a queue using a tree data structure, wherein a starting logical address and/or an ending logical address of the incoming write command and a starting logical address and/or an ending logical address of each of the number of write commands are associated with nodes in the tree data structure.

Abstract: A method and system that enables operation of a file system-based queue that supports the efficient and fair distribution of messages among a plurality of processors.

Abstract: Systems, methods and computer program products for assigning tasks to threads in a server process, where many threads require access to limited resources, are described herein. The system includes one or more programmable queues. Enqueued in each queue are a plurality tuples that correspond to tasks. The invention attempts to match the tuples with command processing resources and database command resources, as needed and available. Once a tuple is fully populated, the tuple is dequeued and assigned to a thread for processing. After processing of the tuple is complete, its command processing resource and any database command resource are enqueued to make them available to other tuples.

Abstract: Implementations of the present disclosure include providing a suggested social circle includes generating a list of contacts who, based on first predetermined criteria, are to be considered for potential inclusion in a social circle to be suggested to a particular user and generating an edge and vertex-weighted graph representation that indicates a strength of the particular user's affinity to each of the contacts. A set of vertices in the graph that has a high overall score based on predetermined factors is identified. After determining that the contacts corresponding to the identified set of vertices should be presented as a suggested social circle to the particular user, social circle data corresponding to the suggested social circle is transmitted, to a client device associated with the particular user, to display a representation of the suggested social circle on the client device.

Abstract: To achieve long running batch updates, a transaction aggregator layer and one or more data aggregation queues, such as a command queue, are placed between one or more clients and a database. Writes go to the database aggregator layer and are enqueued in the appropriate data aggregation queue, which may be allocated by transaction. Committing the transaction drains the queue and writes the contents of the queue in one transaction-like update to the database. By using the transaction logic in the transaction aggregator layer, transaction-like behavior may be achieved that allows both updates and transactions to scale with less impact on database servers.

Abstract: A method and apparatus for facilitating answering a query on a database. Example embodiments include: accessing a database tree having a plurality of nodes; receiving a set of input variable values, a non-empty set of output variables, and information indicative of a node in the database tree; determining a traversal cost based on the node and the set of input variable values; determining a lower bound based on the node and the set of input variable values, wherein the lower bound corresponds to an upper-bound probability estimate based on one or more of the plurality of nodes and the set of input variable values; pruning one or more of the plurality of nodes based on the traversal cost, the lower bound, and a pruning bound; and returning a result including a non-empty set of output variable values based on the set of input variable values, the node, the traversal cost, and the lower bound.

Abstract: Scalable systems and methods for near real time processing of a substantial volume of event data streams are disclosed. A concurrent throughput receiver is coupled to an input of a processor for receiving the substantial volume of event data streams, and implementing substantially concurrent throughput of the substantial volume of event data streams. The systems and methods may provide for real time application monitoring, such as by aggregating information to a distributed cache from a plurality of entities, where the entities are structured in a nodal hierarchy, and summarizing to a summary database the information from the nodal hierarchy into summary level statistics for each of the nodes of the nodal hierarchy.

Abstract: Embodiments are provided for updating a playlist that has been added to a playback queue in response to changes to the playback queue. The playback queue may be associated with a zone of a network media system such that items in the playback queue are to be rendered by the zone. The playlist may include one or more items playable by the zone, and may be stored separately from where the playback queue is maintained. Embodiments are also provided for updating a playback queue in response to modifications to a playlist included in the playback queue. In some cases, a user modifying the playlist or playback queue may be prompted upon making the modifications whether to also apply the modification to the playback queue or playlist, respectively.

Abstract: A method allows one to store in a parallel way branches and nodes of a hierarchy into a database by creating queues. Each queue has a status and a unlock item indicating if a superior node has already been stored. A process looks up these indicators and performs according to commands received from a first process control of the queues.

Abstract: A system and method for receiving and tracking a plurality of transactions and distributing the transactions to at least two replication queues over a network. The system and method comprise a global queue for storing a number of the received transactions in a first predetermined order. The system and method also comprise a sequencer coupled to the global queue for creating a copy of each of the transactions for each of said at least two replication queues and for distributing in a second predetermined order each said copy to each of said at least two replication queues respectively, said copy containing one or more of the received transactions.

Abstract: Both live and offline transcoding of media is managed for storage in a cache. Requests for media are made by a client on a network and media taken from the cache and transcoded for delivery to the client. Media is also transcoded and stored in memory during idle request in anticipation of future requests during idle transcoder time between client requests. A prioritizer manages at least offline transcoding requests. A high priority queue operates at a higher priority than the low priority queue. The high priority queue receives live transcoding requests from a client on the network. A low priority queue receives offline transcoding requests. A media transcoder primarily transcodes media in accordance with requests from the high priority queue for delivery to a client on the network and then secondarily transcodes media in accordance with requests from the low priority queue when the high priority queue is empty.

Abstract: An event tap associated with a server, such as a Web server, at a machine can transform a server event into a tuple, select a database node for the tuple, and place the tuple in a queue for that database node, and then flush the queue periodically directly into database nodes. The use of an event tap can thus reduce the computational burden on the database while keeping the server event data in the database relatively fresh.

Abstract: A system includes creation of a first resource queue indicating an order of resources stored in a memory, the order based on respective timestamps associated with the stored resources, association of the first resource queue with a first queue timestamp, reception of a first command to deallocate a first amount of stored resources from the memory, determination that a first stored resource indicated by the first resource queue is associated with a timestamp earlier than the first queue timestamp, deallocation of the first stored resource from the memory, reception of a second command to deallocate a second amount of stored resources from the memory, determination that the first resource queue indicates no stored resources which are associated with a timestamp earlier than the first queue timestamp, and, in response to the determination that the first resource queue indicates no stored resources which are associated with a timestamp earlier than the first queue timestamp, creation of a second resource queue in

Abstract: A method and apparatus for queuing FBNs of received write blocks for a file to a queuing data structure for assigning LBNs to the FBNs is described herein. A queuing data structure may comprise a modified binary search tree, such as a modified red-black search tree. Each node of a queuing data structure may comprise a base field for storing a base FBN and a range field for storing a range value comprising X bits. The range field of a single node may represent a range of two or more FBNs (“FBN range”), the FBN range being based on the base FBN. Each FBN in the FBN range may have a corresponding bit in the range field, the base FBN corresponding to a “base bit” in the range field. The value of the corresponding bit in the range field may indicate whether the FBN has been received.

Abstract: An approach is provided for prioritizing transmission of messages from a telemetry device. A first information element is stored in a device log. A determination is made whether the first information element includes a first priority level indication, and the first information element is stored in a first data structure when it is determined that the first information element includes the first priority level indication. A second information element is stored in the device log. A determination is made whether the second information element includes a second priority level indication, and the second information element is stored in a second data structure when it is determined that the second information element includes the second priority level indication.

Abstract: A system, method and data structure for processing basic client application data types to add thereto extension types and priority levels adapted for use by each of a plurality of set top box classes.

Abstract: An indication of refusal of a lock request is received with a first operation identifier for a resource that is already locked with a lock associated with a second operation identifier from an agent that controls the resource, wherein the agent returns a value that determines how long the lock request is to stay on the queue. The lock request is placed in a queue with a lock queue timeout period based on the value from the agent. The lock request is reissued if the lock associated with the second operation identifier has been released and the lock request reaches a position of the queue from which the lock request is processed within the lock queue timeout period. The lock request is re-queued if the reissued lock request is not granted based on how many times the lock request has been previously placed in the queue.

Abstract: A method for high-speed scheduling and arbitration of events for computing and networking is disclosed. The method includes the software and hardware implementation of a unique data structure, known as a pile, for scheduling and arbitration of events. According to the method, events are stored in loosely sorted order in piles, with the next event to be processed residing in the root node of the pile. The pipelining of the insertion and removal of events from the piles allows for simultaneous event removal and next event calculation. The method's inherent parallelisms thus allow for the automatic rescheduling of removed events for re-execution at a future time, also known as event swapping. The method executes in O(1) time.

Abstract: The present invention is embodied in an online-like transaction processing method and system for processing account information contained in batch process files, the method including: reading at least one batch file containing a plurality of records, each of the plurality of records being related to an associated one of a plurality of accounts; identifying which of the plurality of records relate to same ones of the plurality of accounts; identifying one of the accounts; and, processing all of the records identified as relating to the one of the accounts together and independent of processing any of the records relating to any other of the plurality of accounts.

Abstract: A method of operating a telecommunications node (28) through which packets of differing priority are conveyed comprises receiving plural data packets from a source external (26) to the node, the plural data packets including both ordinary packets and a priority packet; and storing the plural data packets in a queue structure (36) in order of arrival so that the priority packet is read out of the queue structure before the ordinary packets are read out of the queue structure (36), thereby expediting output of the priority packet from the node relative to the ordinary packets.

Abstract: A file system can be provided in a capture system to efficiently read and write captured objects. In one embodiment, such a file system includes a plurality of queues to queue captured objects to be written to a disk, each queue being associated with one of a plurality of object types, and each queue containing captured objects of the type associated with each queue. A scheduler can be provided to select one of the plurality of queues, and a block manager to select a partition of a disk, the partition being associated with the object type of the captured objects in the selected queue. A disk controller configured to write contiguous blocks of data from the selected queue to the selected partition is connected to the block manager to enable writing to a disk.

Abstract: In print systems based on data reception from a server, it takes much time to receive data of a large size. Therefore systems have been developed in which data is divided before being received. However, if divided data items are received by a print device while temperature adjustment or calibration is performed for an engine of the device, the divided data items are not immediately printed, resulting in a long print time. A print device sequentially receives divided data items if the print device is in a printable status. Otherwise, the print device simultaneously receives the divided data items in a plurality of sessions.

Abstract: Systems and methods for reslicing data in a representation of a relational database are disclosed. In one embodiment, the database includes a representation including a first slice. The database system creates a plurality of new slice and to create a plurality of write queues. The database system copies units of data in the first slice to the new slices according to a distribution function. The distribution function determines, for each unit of data in the first slice, one of the new slices into which to copy the unit of data. The database system asynchronously writes one or more actions of a set of one or more asynchronous database transactions to the first slice when copying the data in the first slice to the new slices. The database asynchronously enqueues the one or more actions of the set of asynchronous database transactions in the write queues according to the distribution function.

Abstract: Resource acquisition requests for a filesystem are executed under user configurable metering. Initially, a system administrator sets a ratio of N:M for executing N read requests for M write requests. As resource acquisition requests are received by a filesystem server, the resource acquisition requests are sorted into queues, e.g., where read and write requests have at least one queue for each type, plus a separate queue for metadata requests as they are executed ahead of any waiting read or write request. The filesystem server controls execution of the filesystem resource acquisition requests to maintain the ratio set by the system administrator.

Abstract: A system includes creation of a first resource queue indicating an order of resources stored in a memory, the order based on respective timestamps associated with the stored resources, association of the first resource queue with a first queue timestamp, reception of a first command to deallocate a first amount of stored resources from the memory, determination that a first stored resource indicated by the first resource queue is associated with a timestamp earlier than the first queue timestamp, deallocation of the first stored resource from the memory, reception of a second command to deallocate a second amount of stored resources from the memory, determination that the first resource queue indicates no stored resources which are associated with a timestamp earlier than the first queue timestamp, and, in response to the determination that the first resource queue indicates no stored resources which are associated with a timestamp earlier than the first queue timestamp, creation of a second resource queue in

Abstract: Systems and methods for reslicing data in a representation of a relational database are disclosed. In one embodiment, the database includes a representation including a first slice. The database system creates a plurality of new slice and to create a plurality of write queues. The database system copies units of data in the first slice to the new slices according to a distribution function. The distribution function determines, for each unit of data in the first slice, one of the new slices into which to copy the unit of data. The database system asynchronously writes one or more actions of a set of one or more asynchronous database transactions to the first slice when copying the data in the first slice to the new slices. The database asynchronously enqueues the one or more actions of the set of asynchronous database transactions in the write queues according to the distribution function.

Abstract: Graphical user interfaces and method for building Boolean queries and viewing search results using search cells, combination cells, toolbar, and menu bar. Search cells are movable within a workspace and contain a text field, facet type designation, advanced button, and hit count. Categories are chosen using a category walker. Combination cells, a Boolean combination of two or more selected search cells, are also movable and contain a combine icon, hit count, and an expression field. The Boolean query is depicted in a folder tree hierarchy, where search folders are shown within combination folders, which are represented as logical AND, OR, or MINUS folder icons. An applet in a browser accesses a server through the Internet.

Abstract: Systems and methods for managing data, such as metadata or indexes for index databases. In one exemplary method, different processing priorities are assigned to different indexing tasks based upon the origin of the task. In another exemplary method, indexing tasks are processed in a first mode when a data processing system is in a first power state and indexing tasks are processed in a second mode when the data processing system is in a second power state.

Abstract: A system for performing integrated searches and actions is disclosed. The system may include a search engine configured to generate a search result or report in response to a search query. The system may also include a queue manager coupled with the search engine. The queue manager may be configured to receive the search result or report from the search engine. The queue manager may also be configured to assign files in the search result or report to one or more service provider queues according to an action profile. The system may also include one or more nodes coupled with the one or more service provider queues. The one or more nodes may be configured to perform one or more actions on one or more files in the one or more service provider queues according to the action profile.

Abstract: What is disclosed is a novel system and method for configuring a client print queue in a networked printing environment. In one embodiment, a client print queue corresponding to a server print queue is initialized on a client device. The server print queue is configured with a default location of a configuration file that contains at least one print queue configuration parameter. In response to a command at the client device to utilize the client print queue, the client device receives the default location of the configuration file and retrieves at least one print queue configuration parameter from the configuration file. The client print queue is then configured, also in response to the command at the client device to utilize the client print queue, according to the retrieved at least one print queue configuration parameter.

Abstract: Users are enabled to quickly and easily associate records representing entities such as themselves, other users, contacts, accounts, teams/groups, and similar ones employing a record of the association and assign each entity a role or other attributes as a part of this association. Relationship records and attributes preserving entity association information allow teamwork, communication, and collaboration for effective management of business processes. The records and attributes also enable visualization and facilitate deeper understanding of the relationships between people, data, and business processes.

Abstract: Methods, systems and apparatus, including computer program products, for propagating data across shards of a database system are described. According to one method, a first request that includes instructions to place a second request in a queue of a second shard is placed in a queue of a first database shard, and the change is committed to the records of the first shard. A queue processor polling the queue fetches and dispatches the first request, placing the second request in a queue of a second database shard. The second request includes instructions for making the change to the second shard. A queue processor of the second database shard polls the queue of the second database, fetches the second request, and dispatches it to make the change on the second database shard.