Abstract: A method for detecting a deadlock of a database management system and recovering from the deadlock includes: updating data stored in a first server and a second server; determining whether the database management system is in a deadlock state by comparing data of the first server with data of the second server; and recovering from the deadlock state by changing data of the first server or the second server so that the data of the first server and the second server are identical.

Abstract: An electronic system includes an auxiliary processor. The auxiliary processor includes a remapping device which receives data through a direct memory access (DMA, a register unit which stores the data, and processing logic which transmits operating status information to the remapping device. The remapping device remaps position information in which the data is stored in the register unit on the basis of the operating status information.

Abstract: An integrated circuit includes protected container access control logic to perform a set of access control checks and to determine whether to allow a device protected container module (DPCM) and an input and/or output (I/O) device to communicate securely through one of direct memory access (DMA) and memory-mapped input/output (MMIO). The DPCM and the I/O device are allowed to communicate securely if it is determined that at least the DPCM and the I/O device are mapped to one another, an access address associated with the communication resolves into a protected container memory, and a page of the protected container memory into which the access address resolves allows for the aforementioned one of DMA and MMIO. In some cases, a Security Attributes of Initiator (SAI) or security identifier may be used to obtain a DPCM identifier or attest that access is from a DPCM mapped to the I/O device.

Abstract: Embodiments of the present disclosure establish unlock codes for groups of physical locks and include a single code reset or override device to render the combination of each lock settable. In embodiments, based on a request to reset a first unlock code associated with one of the physical locks, a replacement unlock code is generated and transmitted to a mobile communications device, whereupon the first unlock code can be changed to the replacement unlock code.

Abstract: A processing system monitors and synchronizes parallel execution of workgroups (WGs). One or more of the WGs perform (e.g., periodically or in response to a trigger such as an indication of oversubscription) a waiting atomic instruction. In response to a comparison between an atomic value produced as a result of the waiting atomic instruction and an expected value, WGs that fail to produce a correct atomic value are identified as being in a waiting state (e.g., waiting for a synchronization variable). Execution of WGs in the waiting state is prevented (e.g., by a context switch) until corresponding synchronization variables are released.

Abstract: Disclosed are apparatuses, systems, and methods for providing a programmatic control channel for granting or denying access to user data. In one embodiment, a method is disclosed comprising receiving an input stream of data including user data and a first regulatory control channel (RCC) data structure; building a final RCC data structure based on the first RCC data structure and a stored RCC data structure; retrieving a regulatory query context (RQC) from a data requestor; applying one or more Boolean operators to the final RCC data structure and the RQC to obtain an evaluation result; and executing the downstream processing if the evaluation result comprises a passing evaluation result.

Abstract: Computer based systems and methods allow collaborative shopping for and/or designing of (e.g., customization) consumer products, such as articles of footwear, apparel, athletic equipment, etc., by plural users using different computing devices. The users' computing devices may be in communication with one another in various manners, such as over networked connections (e.g., a local area network (LAN), a wide area network (WAN), an internet connection, etc.); via peer-to-peer communications; through a common server or combination of servers that establish a communications link; etc.). The various parties may participate in an on-line or other computer communicative session to create and buy customized products. Additionally, user interfaces for providing these collaborative sessions are described.

Abstract: Techniques lock a storage area in a storage system including a first storage node and a second storage node. Such techniques involve adjusting a value of at least one of a first counter at the first node and a second counter at the second node in response to receiving a data access request for the storage area at at least one of the first node and the second node. Such techniques further involve allocating a lock flag to the first node in response to a ratio of the value of the first counter to the value of the second counter being greater than a first threshold, the lock flag indicating that the storage area is locked by the first node. Accordingly, storage resources required by nodes that are accessed more frequently in statistics are effectively reduced, and the efficiency of applying stripe lock reduction are improved.

Abstract: Various embodiments of the present invention provide methods, apparatuses, systems, computing devices, computing entities, and/or the like for facilitating efficient and effective execution of database management operations. For example, various embodiments of the present invention describe techniques for performing one or more database update operations given a concurrent write request group for a database using P concurrent request processor computing nodes, a match result serialization queue, and a centralized match result serializer computing node.

Abstract: A method performed by a data storage apparatus of maintaining filesystem object attributes in connection with a plurality of drivers is provided. Each driver of the plurality is configured to operate on a respective set of filesystem objects. The method includes (a) for each driver of the plurality, creating a respective driver-specific storage volume; (b) storing, within each driver-specific storage volume, attributes specific to respective filesystem objects operated on by the driver of that driver-specific storage volume; and (c) while operating a particular driver of the plurality on a particular filesystem object, using values of the stored attributes specific to that particular filesystem object operated on by that particular driver. An apparatus, system, and computer program product for performing a similar method are also provided.

Abstract: The disclosed subject matter relates to systems, methods, and media for media session concurrency management with recurring license renewals. More particularly, the disclosed subject matter relates to using recurring license renewals for concurrent playback detection and concurrency limit enforcement for video delivery services and managing server resources for handling such recurring license renewals.

Abstract: Generic Concurrency Restriction (GCR) may divide a set of threads waiting to acquire a lock into two sets: an active set currently able to contend for the lock, and a passive set waiting for an opportunity to join the active set and contend for the lock. The number of threads in the active set may be limited to a predefined maximum or even a single thread. Generic Concurrency Restriction may be implemented as a wrapper around an existing lock implementation. Generic Concurrency Restriction may, in some embodiments, be unfair (e.g., to some threads) over the short term, but may improve the overall throughput of the underlying multithreaded application via passivation of a portion of the waiting threads.

Abstract: Techniques are provided for supporting a lookup structure for a file system implementing hierarchical reference counting. A write operation to write data to a page maintained by the file system is received. A lookup within a lookup structure is performed using information related to the page in order to identify a lookup entry within the lookup structure. A hash generation count within the lookup entry is compared to a file system info generation count within a file system info object for a volume associated with the page. In response to the lookup entry generation count not matching the file system info generation count, a file system tree of the file system is traversed to determine a reference count for the page, and the write operation is implemented based upon the reference count. Otherwise, the lookup entry is utilized to access the page for processing the write operation.

Abstract: Memory devices might include an array of memory cells, a register, and a controller for access of the array of memory cells. The controller might be configured to autonomously perform background operations on the array of memory cells in response to the register storing a first value, and prohibit autonomous performance of the background operations on the array of memory cells in response to the register storing a second value different than the first value. The memory devices might be in communication with a host.

Abstract: A method of enabling memory access freedom from interference (FFI) rules, comprising: determining a first safety privilege access ID (PrivID) for a first component of a system (e.g., based on Automotive Safety Integrity Level (ASIL) attributes of tasks executed by the first component); determining a first access attribute for a first software task executing on the first component; receiving, at a first firewall component of the system, a request from the first software task to access a first memory region of a second component of the system, wherein the request specifies the first PrivID and the first access attribute; and determining, by the first firewall component, whether to permit the first software task to access the first memory region based on the first PrivID, the first access attribute, and the first memory region.

Abstract: Chunked data transfers may include: receiving, from an initiator, a read command for first data stored in a storage system; allocating a first buffer of a predefined size; until all of the first data has been sent to the initiator: loading a portion of the first data from the storage system into the first buffer; and sending, to the initiator, the portion of the first data in the first buffer.

Abstract: In accordance with an embodiment, described herein is a system and method for transaction recovery in a multitenant application server environment. At least one resource manager associated with a partition can be designated as a determiner resource for that partition only, in order to support eliminating transaction logs (TLOG) in processing a two-phase commit transaction. A transaction manager can prepare all other resource managers in the mid-tier transactional system before the determiner resource. Furthermore, the transaction manager can rely on the list of outstanding transactions to be committed that is provided by the determiner resource for recovering the transaction. The transaction manager can commit an in-doubt transaction returned from a resource manager that matches the list of in-doubt transactions returned from the determiner resource. Otherwise, the transaction manager can roll back the in-doubt transaction.

Abstract: Container data can be prefetched in data storage systems. For example, a computing device can determine a first container to be activated subsequent to an execution of a second container that is in an execution phase. The computing device can access a description specifying a data object for activating the first container. The computing device can receive the data object for the first container from a storage device using the description. The computing device can store the data object in a memory device prior to an end of the execution of the second container for subsequent use in an activation of the first container.

Abstract: A system includes a hardware compare and swap (CAS) module communicatively coupled to a bus, the CAS module to perform an atomic operation in response to a first request from a first request agent for the atomic operation to be performed on a data value that is shared among a plurality of request agents and obtain a first result value. The atomic operation includes initiating a CAS command via the bus. The CAS module performs the atomic operation in response to a second request from a second request agent and obtains a second result value. Responsive to determining a failure to successfully process one or more of the first request or the second request, the hardware CAS module repetitively performs the atomic operation, for one or more of the first request or the second request.

Abstract: A method, computer program product, and computing system for receiving a plurality of lock sequences associated with a plurality of objects of the computing device. A plurality of matrices may be generated for each lock sequence of the plurality of lock sequences, thus defining a plurality of lock sequence matrix towers. The plurality of lock sequence matrix towers may be combined, thus defining a combined lock sequence matrix tower. One or more lock sequence conflicts may be identified within the plurality of lock sequences based upon, at least in part, the combined lock sequence matrix tower.

Abstract: A firewall host uses a shared memory to pass arguments to, and receive results from, a remote procedure executing on a locally coupled network processing unit that offloads processing for the firewall.

Abstract: The technology described herein is directed towards reducing resource-related messages in a distributed locking system in which exclusive locks can be granted. Requests for a resource lock or range thereof received during an interval are queued, along with lock release messages. The queue is processed after the interval to update the resource state, which can result in a reduction in messages. In one example, separate lock request messages received during an interval from the same requestor for two or more consecutive resource ranges are combined, whereby a single lock grant message for the combined resource ranges is sent instead of one for each request. In another example, if in an interval a lock request for a resource/range is received before a lock release, the lock is released before the lock request message is processed. This avoids sending a lock release request message to the previous owner.

Abstract: Devices and techniques for programmable atomic operator resource locking are described herein. A request for a programmable atomic operator (PAO) can be received at a memory controller that includes a programmable atomic unit (PAU). Here, the request includes an identifier for the PAO and a memory address. The memory addressed is processed to identify a lock value. A verification can be performed to determine that the lock value indicates that there is no lock corresponding to the memory address. Then, the lock value is set to indicate that there is now a lock corresponding to the memory address and the PAO is invoked based on the identifier for the PAO. In response to completion of the PAO, the lock value is set to indicate that there is no longer a lock corresponding to the memory address.

Abstract: This disclosure describes a group-based communication system comprising a group-based communication server and a group-based communication repository. The group-based communication server manages access control parameter discrepancies between a group-based communication channel and a requested resource that is disposed in communication with the group-based communication channel.

Abstract: This specification provides data processing methods, apparatuses and devices. In embodiments of the specification, table data includes a state identifier for indicating whether a target table is in a use state or an idle state. Therefore, after an occupying-table request is received, the table data can be obtained, and the state of the target table can be determined from the state identifier in the table data. If the target table is in the idle state, the table data is locked; after the state identifier is updated to the use state, the table data is released; and occupying-table data of the target table is generated to respond to the occupying-table request.

Abstract: A system for increasing the speed and reducing the time to obtain a required amount of data, from a secondary storage device, for a digital computer, BASED UPON measures to improve the time efficiency of I/O request processing by improving the timing and sequence of transfers, thus improving the efficiency of mass storage devices.

Abstract: A first data accessor acquires a lock associated with a critical section. The first data accessor initiates a help session associated with a first operation of the critical section. In the help session, a second data accessor (which has not acquired the first lock) performs one or more sub-operations of the first operation. The first data accessor releases the lock after at least the first operation has been completed.

Abstract: A data storage device includes one or more memory device and a controller that is DRAM-less coupled to the one or more memory devices. The controller is configured to receive a command from a host device, begin execution of the command, and receive an abort request command for the command. The command includes pointers that direct the data storage device to various locations on the data storage device where relevant content is located. Once the abort command is received, the content of the host pointers stored in the data storage device RAM are changed to point to the HMB. The data storage device then waits until any already started transactions over the interface bus that are associated with the command have been completed. Thereafter, a failure completion command is posted to the host device.

Abstract: Methods and systems for Internet Protocol (IP) address allocation optimization. A method includes a data collector collecting IP address information from sources of IP address inventory and an optimization controller generating a data set from the collected IP address information, minimizing IP address allocations for network components in a network using IP address allocation and IP address utilization for a network component from the data set, minimizing IP address inventory costs using IP address inventory and IP address utilization from the data set and IP address transactional costs, tracking the IP address inventory, sending configuration information to network component(s) to change respective IP address allocations based on minimized IP address allocation, sending transaction information to IP address provider(s) to change the IP address inventory based on minimized IP address inventory costs, and performing the above on a defined interval.

Abstract: Methods, systems and apparatus for providing a value indicating a judgment of whether a human or an autonomic computer application operating a client computer is interacting with a server, by: receiving data from the client computer including active data relating to interactions of the client computer with a website of the server and passive data of the client computer; analyzing received data from the client computer for indication of a human operating the client computer, wherein the analyzing includes analyzing the received data in conjunction with model data based on human interactions from a prior session with the same website and developing a first analysis value; determining that the first analysis value fails to meet a first analysis predetermined criteria; and providing a request for further data from the client computer based on the determination that the first analysis value fails to meet the first analysis predetermined criteria.

Abstract: Methods, systems and apparatus, e.g., non-transitory machine readable medium having stored thereon instructions, for providing a value indicating a judgment of whether a human or an autonomic computer application operating a client computer is interacting with a server, by operations comprising: receive data from the client computer including active data relating to interactions of the client computer with a website of the server and passive data of the client computer; analyze received data from the client computer for indication of a human operating the client computer, wherein the analyzing includes analyzing the received data in conjunction with model data based on human interactions from a prior session with the same website and developing a first analysis value; and provide a request for further data from the client computer when the first analysis value fails to meet the first analysis predetermined criteria.

Abstract: The subject technology performs a locking operation on a first set of keys by a first statement of a first transaction. The subject technology determines that a conflict occurred between the first statement and a second transaction. The subject technology determines that the second transaction has yet to complete after a predetermined period of time. The subject technology performs a deadlock detection process where the subject technology stores a key and value in a table indicating the first transaction and the second transaction, detects, based at least in part on a graph traversal of the table starting from the first transaction, a cycle between the first transaction and the second transaction, and determines that the first transaction is a youngest transaction in the detected cycle. The subject technology ceases execution of the first transaction in response to the first transaction being a youngest transaction in a detected cycle.

Abstract: Configuration information indicating that one or more stream consumers are granted read-only access to contents of a shared-access data stream is stored at a stream management service. A virtual stream associated with the shared-access stream may be established. In response to a read request directed to the virtual stream, contents of a particular record of the shared-access data stream are provided.

Abstract: In some embodiments, an instance of a distributed database can be configured at a first compute device within a set of compute devices that implements the distributed database via a network. A database convergence module can define a first event linked to a first set of events and receive, from a second compute device from the set of compute devices, a second event (1) defined by the second compute device and (2) linked to a second set of events. The database convergence module can define a third event linked to the first event and the second event. The database convergence module can identify an order associated with a third set of events based at least on the first set of events and the second set of events, and store in the instance of the distributed database the order associated with the third set of events.

Abstract: Database log writing is based on log pipeline contention. A determination is made as to whether contention in writing data to a log pipeline, which is used in writing data from memory to storage, is at a prespecified level. Based on determining that the contention in writing the data to the log pipeline is at the prespecified level, a split operation is automatically performed to create a new log pipeline.

Abstract: Methods, systems and apparatus for assessing the likely status of an operator of a computing device interacting with a server as a human operator or an autonomic computer application, such as a “bot” are described herein. By monitoring at least some data, e.g., biometric data, generated at the client computing device, a comparison can be made between the monitored data and model data relating to human interaction with the computing device. The results of the comparison can lead to a value that represents the likelihood that the monitored data results from human interaction.

Abstract: According to one embodiment of the present disclosure, a first set of file system objects included in performing a requested file system operation is identified in response to a request to perform a file system operation. An update intent corresponding to the requested file system operation is inserted into a data structure associated with each identified file system object. Each file system object corresponding to the corresponding data structure is modified as specified by the update intent in that data structure. After modifying the file system object corresponding to the corresponding data structure, the update intent is removed from that data structure.

Abstract: In a non-volatile memory controlling device, a first doorbell region is exposed to a configuration space of a host interface and updated when the host issues an input/output (I/O) request command to the host memory. A fetch managing module fetches the command from the host memory in response to an event signal generated when the first doorbell region is updated. A data transferring module checks a location of the host memory based on request information included in the command, and performs a transfer of target data for the I/O request between the host memory and the non-volatile memory module. A completion handling module writes a completion request in the host memory and handles an interrupt when the data transferring module completes to process the I/O request. A second doorbell region is exposed to the configuration space and updated when the I/O service is terminated by the host.

Abstract: A mobile communications device is provided with a tagging module that tags outgoing communications. Upon receiving the tagged communication, a communications provider requests from a registered owner service identified in the tag whether the mobile communications device identified in the tag is registered with the registered owner service. Upon receiving confirmation from the registered owner service that the mobile communications device is registered with the service, the communications provider provides information regarding the location of the mobile communications device to the registered owner service.

Abstract: Emulating scratchpad functionality using caches in processor-based devices is disclosed. In one aspect, each cache line within a cache of a processor-based device is associated with a corresponding scratchpad indicator indicating whether the corresponding cache line is exempt from the replacement policy used to select a cache line for eviction. Upon receiving data that corresponds to a memory access operation indicated as requiring scratchpad functionality, the cache controller stores the data in a cache line of the cache, and then sets the corresponding scratchpad indicator for the cache line. Subsequently, the cache controller emulates scratchpad functionality by allowing conventional memory read and write operations to be performed on the cache line, but does not apply its replacement policy to that cache line when selecting a cache line as a candidate for eviction. In this manner, the cache line may remain in the cache for use as scratchpad memory by software.

Abstract: A system and method for blocking path detection is provided. A job comprises tasks with at least some of the tasks dependent on other task(s). Each task is assigned to an ownership team. At a particular point in execution of the job, states of tasks of the job are identified. The states include one of three mutually exclusive states: waiting for another task/finished, in progress, and, blocked. When all the tasks with identified states of in progress or blocked are assigned to a particular ownership team, the particular ownership team is identified as on a blocking path. An action can be performed regarding the blocking path, for example, selected in accordance with policy-defined response actions such as generating an incident, escalating an existing incident, and/or sending a notification (e.g., an accumulated time on the blocking path can be calculated for each team with team(s) notified when certain threshold(s) are exceeded).

Abstract: Computer based systems and methods allow collaborative shopping for and/or designing of (e.g., customization) consumer products, such as articles of footwear, apparel, athletic equipment, etc., by plural users using different computing devices. The users' computing devices may be in communication with one another in various manners, such as over networked connections (e.g., a local area network (LAN), a wide area network (WAN), an internet connection, etc.); via peer-to-peer communications; through a common server or combination of servers that establish a communications link; etc.). The various parties may participate in an on-line or other computer communicative session to create and buy customized products. Additionally, user interfaces for providing these collaborative sessions are described.

Abstract: Techniques are disclosed to manage use of a global pool of memory comprising at least a portion of the runtime-managed heap. A request to reserve use of a portion of the global pool of memory is received from each of a plurality of transactions comprising a transactional workload of a database management system. A corresponding portion of the global pool of memory is allocated to each of at least a subset of the requesting transactions, to be used as a local pool of memory available to be used by the transaction to process the transaction.

Abstract: A system includes storage of data into a target memory location allocated to a target leaf node of a tree-based index structure, the target leaf node being a child node of a parent node of the tree-based index structure, where the tree-based index structure comprises one or more other leaf nodes which are child nodes of the parent node, and each of the target leaf node and the one or more other leaf nodes is associated with a plurality of allocated memory locations, incremental identification of all unused allocated memory locations between a first allocated memory location of a left-most one of the target leaf node and the one or more other leaf nodes and a last used allocated memory location of a right-most one of the target leaf node and the one or more other leaf nodes, and movement of data stored in the target leaf node and the one or more other leaf nodes into the identified unused allocated memory locations.

Abstract: Techniques are disclosed relating to lock wait tracing. A computer system may operate a database that includes a lockable object. The computer may maintain a lock wait queue that stores an indication of processes waiting to acquire a lock on the lockable object. The computer system may store trace records for those processes that, upon releasing a respective lock on the lockable object when another process is waiting in the lock wait queue, have been in contention for the respective lock for over a threshold amount of time. The computer system may present ones of the trace records that identify a timeline that is usable to determine a set of processes that contributed to a delay in a process acquiring a lock on the lockable object.

Abstract: Creating point-in-time versions of files for applications at a storage system includes maintaining at the storage system a data structure correlating each of a plurality of applications with files for each of the applications and correlating each of the files with portions of the data storage system, using the data structure to determine specific files for a particular one of the applications for which a point-in-time version is being created, using the data structure to determine specific portions of the storage system corresponding to the specific files, suspending writes to the specific portions, completing previous writes to the specific portions following suspending writes, and performing a snapshot of the specific files following completing previous writes. The portions of the data storage may be extents. A host may provide information to the storage system to correlate applications with files and to correlate files with portions of the data storage system.

Abstract: Systems, apparatuses, and methods related to three tiered hierarchical memory systems are described herein. A three tiered hierarchical memory system can leverage persistent memory to store data that is generally stored in a non-persistent memory, thereby increasing an amount of storage space allocated to a computing system at a lower cost than approaches that rely solely on non-persistent memory. An example apparatus may include a persistent memory, and one or more non-persistent memories configured to map an address associated with an input/output (I/O) device to an address in logic circuitry prior to the apparatus receiving a request from the I/O device to access data stored in the persistent memory, and map the address associated with the I/O device to an address in a non-persistent memory subsequent to the apparatus receiving the request and accessing the data.

Abstract: Facilitating exclusive local locks on a distributed file system is provided herein. An embodiment relates to a node device of a cluster of node devices. The node device can comprise a processor and a memory that stores executable instructions that, when executed by the processor, facilitate performance of operations. The operations can comprise determining at least one resource is to be removed from a cache of the node device. The operations also can comprise implementing an exclusive local lock over a defined lock. The defined lock can indicate interest in the at least one resource by other node devices of the cluster of node devices other than the node device. Further, the operations can comprise removing the at least one resource from the cache. The other node devices are not notified of the removing.

Abstract: Method, apparatus and system for real-time virtual network function orchestration in Real-time Cloud Infrastructure. The method comprises the step of updating and reporting CPU core RT performance; sending CPU and NUMA information; moving the IRQs from RT CPUset to Non-RT CPUset based on the CPU pool information response, and reporting the completion of IRQ clearance; moving the system tasks and OS background processes to Non-RT CPUset based on the CPU pool information response, and reporting the completion of system tasks clearance; clearing the known indeterminism sources based on the CPU pool information response, and reporting the completion of indeterminism sources clearance. The implementation of the method and apparatus improves that with support of NFV, edge cloud can speed new service deployment and achieve resource sharing among different services which allows operators to provision fewer resources.

Abstract: A computer-implemented method for use with a database computer system including a database data set that includes machine readable data in the form of a plurality of records, the computer-implemented method comprising: (i) defining a plurality of sets of permission rule(s); (ii) receiving a first user profile for a first user; (iii) establishing a plurality of user identities to the first user; (iv) generating a plurality of tokens; and (v) for each given user identity of the first user, adding a given token of the plurality of tokens to the first user profile and associating the given user identity and the given token.