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 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: 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: 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, 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 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: 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: 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: 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: 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: 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: 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: 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: 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: 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.

Abstract: Examples provide a self-supervised language model for document-to-document similarity scoring and ranking long documents of arbitrary length in an absence of similarity labels. In a first stage of a two-staged hierarchical scoring, a sentence similarity matrix is created for each paragraph in the candidate document. A sentence similarity score is calculated based on the sentence similarity matrix. In the second stage, a paragraph similarity matrix is constructed based on aggregated sentence similarity scores associated with the first candidate document. A total similarity score for the document is calculated based on the normalize the paragraph similarity matrix for each candidate document in a collection of documents. The model is trained using a masked language model and intra-and-inter document sampling. The documents are ranked based on the similarity scores for the documents.

Abstract: A computer implemented system and method for a consumer based access control for identity information. The method and system involve receiving at an identity organization a request for registration and verification of the identity information and configuring a specific user selected policy for notification and authorization of such identity requests of a desired (or intended) identity service (or plurality of services) associated with the targeted user identification. Next, processing the request in a Joint Identity Information Service Network (JIISN) server framework for the detection and verification of a request against an active directory of users or organizations who have opted in for notification; computing the required action based on the configuration of the policies in one of the group consisting of: a JISN policy engine and a user remote mobile control system; communicating with a real time authorization server (e.g.

Abstract: A lock is applied automatically without any user involvement, to each of one or more data objects stored by the data processing system. Each of the one or more locks prevent deletion, by any user, of the one or more data objects within a predetermined time frame. A cloud garbage collector marks the one or more data objects for a) deletion, or b) for lock extension, the garbage collector scheduled to run periodically at a period that is less than the predetermined time frame. The deletion or the lock extension is executed for the one or more data objects, based on marks by the garbage collector. Other embodiments are described and claimed.

Abstract: A blood pressure measuring device includes a device main body; a curler configured to bend along a circumferential direction of a wrist of a living body, and configured to come into contact with a portion of the wrist at least between a dorsal side and a palmar side; a strap on the device main body, configured to cover an outer surface of the curler; a sensing cuff arranged in a region of the wrist where arteries exist; a rubber plate on a side of the sensing cuff nearer to the curler and configured to elastically deform; a pressing cuff between the curler and the rubber plate and configured to press the sensing cuff; and a cuff on a side of the curler nearer to the living body and arranged on the dorsal side of the wrist.

Abstract: In various aspects, a data transfer discovery and analysis system may query an entity computing system to identify access credentials for third-party computing systems and scan each access credential to determine associated permissions provided by each access credential on the entity computing system. The data transfer discovery and analysis system may further inspect access logs to identify actual data transfers between the entity computing system and third-party computing systems as well as other access activity associated with each of the credentials. The system can generate and store a mapping of all actual data transfers (e.g., based on the access log data) and potential data transfers (e.g., based on particular access permissions) between/among the entity computing system and the third-party computing systems.

Abstract: Described herein is a computer implemented method for maintaining a plurality of issues, each issue having an associated rank value, the rank values of the plurality of issues defining an order of the plurality of issues. The method comprises receiving a rank operation request to change the rank of a subject issue; determining relevant issues to the rank operation request; and attempting to acquire locks on each of the relevant issues. In response to successfully acquiring locks on each of the relevant issues a new rank value for the subject issue is calculated and saved.

Abstract: Disclosed are systems, methods and computer-readable media for controlling and managing the identification and provisioning of resources within an on-demand center as well as the transfer of workload to the provisioned resources. One aspect involves creating a virtual private cluster within the on-demand center for the particular workload from a local environment. A method of managing resources between a local compute environment and an on-demand environment includes detecting an event associated with a local compute environment and based on the detected event, identifying information about the local environment, establishing communication with an on-demand compute environment and transmitting the information about the local environment to the on-demand compute environment, provisioning resources within the on-demand compute environment to substantially duplicate the local environment and transferring workload from the local-environment to the on-demand compute environment.

Abstract: An information handling system includes a non-volatile storage device communicatively coupled to a boot processor and an application processor. The boot processor, prior to the execution of a hang sensitive transaction, stores information associated with the hang sensitive transaction at a memory device. The application processor is configured to detect a catastrophic failure of the hang sensitive transaction. In response to the detection of the catastrophic failure, the application processor retrieves the information stored at the memory device and store the information at the non-volatile storage device.

Abstract: Techniques are provided for utilizing snapshot longevity information to manage snapshots in a snapshot-enabled storage system. A snapshot management system generates a snapshot volume tree which comprises snapshots associated with a given storage volume. The snapshot management system obtains a snapshot policy associated with the given storage volume, which comprises a snapshot creation and retention schedule that specifies retention lifespans of the snapshots. The snapshot policy is evaluated to automatically determine and assign respective longevity ranking values for the snapshots within the snapshot volume tree, wherein the longevity ranking value of a given snapshot represents a retention lifespan of the given snapshot as compared to retention lifespans of other snapshots as represented by their respective longevity ranking values.

Abstract: An information handling system to wirelessly transmit and receive data may include a base chassis including a metal C-cover and a D-cover, the metal C-cover to house a speaker grill, the speaker grill covering a speaker to emit audio waves; a speaker grill platform antenna formed within the C-cover from a portion of the speaker grill to emit a target radio frequency (RF), including: a slot formed around the portion of the speaker grill to form a peninsula on the speaker grill that is physically separated from the C-cover; a cavity formed behind the peninsula between the C-cover and the D-cover, the cavity including walls formed around the back side of the peninsula to electrically isolate the cavity; a printed circuit board assembly (PCBA) including: an antenna front end circuit operatively coupled to the speaker grill to excite the speaker grill and dynamically switch frequencies based on the target frequency to be emitted by the speaker grill platform antenna; and a contact pin directly coupling an excitati

Abstract: Disclosed herein are a distributed system and a method for operating the distributed system. The method for operating a distributed system including a server and multiple clients includes acquiring, by a first client of the multiple clients, a lock on a shared resource using a first table of the server and a second table of the client, and releasing, by the first client, a lock on the shared resource using the first table and the second table, wherein the first table is a lock (DSLock) table for storing information about a distributed shared resource, and the second table is a data structure (DSLock_node) table for a lock request.

Abstract: Methods and systems for distributed transaction processing include assigning portions of a logical unit of work to one or more transaction participants. Resource usage information relating to the portions of the logical unit of work is tracked from the respective one or more transaction participants. A last participant is determined based on the tracked resource usage information using a processor. The logical unit of work is resolved. Resolving the logical unit of work includes sending a prepare flow to each of the transaction participants except the last participant to optimize resolution efficiency.

Abstract: A request to perform a batch of operations is provided to a distributed database. The request comprises instructions for validating a condition. An association between the request and a unique identifier is stored. An item in the distributed database is locked and the condition is validated. The system that initiates processing of the batch of operations. A second request, comprising the identifier, is received. The second request is responded to by providing information indicative of the status of processing the first request, based on the stored association. The lock is released when processing of the first request has completed.

Abstract: The subject matter of this specification can be embodied in, among other things, a computer system that includes a first processor system configured to communicate with a network, a second processor system configured to control a process, and a third processor system configured to selectively operate in a first configuration and a second configuration, wherein the third processor system is configured to selectively block predetermined types of communications from the first processor system to the second processor system in the first configuration, and the third processor system is configured to permit the predetermined types of communications from the first processor system to the second processor system in the second configuration.

Abstract: A method includes integrating a file system recovery log layer in a file system. The file system buffers data in a cyclical manner, and transforms all incoming random requests into a series of synchronous sequential updates. The method determines a length value of a write transaction byte-range for a received write transaction. Upon the length value exceeding a threshold value, data for the write transaction byte-range is written to permanent storage in the file system. Upon the length value being less than the threshold value, the data for the write transaction byte-range is written to a recovery log that is stored in the file system recovery log layer. The threshold value is changed dynamically while the file system is mounted.

Abstract: Direct read in clustered file systems is described herein. A method as described herein can include determining, for a write operation on a resource stored by a data storage system, as initiated by an initiator node, a reference count for the resource, the reference count comprising a number of target storage regions of the data storage system to be modified by write data during the write operation; facilitating conveying, from the initiator node to a lock coordinator node, the reference count for the resource; facilitating conveying, from the initiator node to respective participant nodes that are respectively assigned to the target storage regions, the write data and a key value for the write operation; and facilitating causing the respective participant nodes to convey respective notifications that comprise the key value in response to the respective participant nodes writing the write data to the target storage regions.

Abstract: The present application provides a method, a cluster system, an electronic device for operating a device, and a readable storage medium, involving the technical field of clusters. Sequential data operations on the communication device is implemented through the cooperation between the first cluster and the second cluster. The first nodes in the first cluster compete for the first distributed lock to implement sequential storage of the data operation requests. The second nodes in the second cluster compete for the second distributed lock to obtain the stored data operation requests sequentially, and complete the data operations on the target communication device.

Abstract: Various systems and methods are provided for using various in-core and on-disk data structures to improve the file creation process through the use of previously-occupied inodes. For example, one method involves updating an in-core data structure in response to receiving a command to delete a first file, such that a first node is assigned to the first file, the in-core data structure is stored in a non-persistent computer-readable storage medium, the in-core data structure comprises a plurality of entries, each of the entries comprises information identifying a respective inode of a plurality of inodes as being available, and the updating the in-core data structure comprises storing information regarding the first inode in a first entry of the plurality of entries; and creating a second file, where the creating comprises assigning the first inode to the second file using the information regarding the first inode stored in the first entry.