Abstract: Disclosed are techniques for wireless communication. In an aspect, UE communicates data associated with a communication session over a first RAT (e.g., LTE, NR, WLAN, etc.) in accordance with a first set of performance parameters (e.g., codec, QoS, bitrate, bandwidth, etc.). UE performs, during the communication session, an inter-RAT handover from the first RAT to a second RAT (e.g., LTE, NR, WLAN, etc.). UE transmits a re-INVITE over the second RAT in response to the inter-RAT handover. UE receives an indication of a second set of performance parameters (e.g., codec, QoS, bitrate, bandwidth, etc.) in response to the re-INVITE. UE communicates data associated with the communication session over the second RAT in accordance with the second set of performance parameters.

Abstract: An enzymatically produced ?-glucan oligomer/polymer compositions is provided. The enzymatically produced ?-glucan oligomer/polymers can be derivatized into ?-glucan ether compounds. The ?-glucan oligomers/polymers and the corresponding ?-glucan ethers are cellulose and/or protease resistant, making them suitable for use in fabric care and laundry care applications. Methods for the production and use of the present compositions are also provided.

Abstract: In an example, a computer-implemented method for natural language query translation comprises: receiving, by one or more processors, a natural language query; processing, by the one or more processors, the natural language query to identify an intent and a variable of the natural language query; converting, by the one or more processors, the identified variables into low-level variables; combining the identified intent and the low level variables to form a database expression; querying, by the one or more processors, a database storing flight information, using the database expression; and creating, by the one or more processors, at least one graphical representation based on a result of the querying of the database.

Abstract: In an example, a computer-implemented method for natural language query translation comprises: receiving, by one or more processors, a natural language query; processing, by the one or more processors, the natural language query to identify an intent and a variable of the natural language query; converting, by the one or more processors, the identified variables into low-level variables; combining the identified intent and the low level variables to form a database expression; querying, by the one or more processors, a database storing flight information, using the database expression; and creating, by the one or more processors, at least one graphical representation based on a result of the querying of the database.

Abstract: Systems, methods, and/or devices are used to manage a storage system. In one aspect, the method includes receiving, from a host to which a storage device of the storage system is operatively coupled, a request to perform a first memory operation on one or more memory devices of the storage device. The method includes determining a count of credits corresponding to the first memory operation. If a current count of credits in the first credit pool is greater than or equal to the count of credits corresponding to the first memory operation and a current count of credits in the second credit pool is greater than or equal to the count of credits corresponding to the first memory operation, the method includes: performing the first memory operation; and decrementing the first and second credit pools according to the count of credits corresponding to the first memory operation.

Abstract: A storage device and method enable processing of un-map commands. In one aspect, the method includes (1) determining whether a size of an un-map command satisfies (e.g., is greater than or equal to) a size threshold, (2) if the size of the un-map command satisfies the size threshold, performing one or more operations of a first un-map process, wherein the first un-map process forgoes (does not include) saving a mapping table to non-volatile memory of a storage device, and (3) if the size of the un-map command does not satisfy the size threshold, performing one or more operations of a second un-map process, wherein the second un-map process forgoes (does not include) saving the mapping table to non-volatile memory of the storage device and forgoes (does not include) flushing a write cache to non-volatile memory of the storage device.

Abstract: A storage device and method enable processing of un-map commands. In one aspect, the method includes (1) determining whether a size of an un-map command satisfies (e.g., is greater than or equal to) a size threshold, (2) if the size of the un-map command satisfies the size threshold, performing one or more operations of a first un-map process, wherein the first un-map process forgoes (does not include) saving a mapping table to non-volatile memory of a storage device, and (3) if the size of the un-map command does not satisfy the size threshold, performing one or more operations of a second un-map process, wherein the second un-map process forgoes (does not include) saving the mapping table to non-volatile memory of the storage device and forgoes (does not include) flushing a write cache to non-volatile memory of the storage device.

Abstract: Systems, methods, and/or devices are used to manage a storage system. In one aspect, the method includes receiving, from a host to which a storage device of the storage system is operatively coupled, a request to perform a first memory operation on one or more memory devices of the storage device. The method includes determining a count of credits corresponding to the first memory operation. If a current count of credits in the first credit pool is greater than or equal to the count of credits corresponding to the first memory operation and a current count of credits in the second credit pool is greater than or equal to the count of credits corresponding to the first memory operation, the method includes: performing the first memory operation; and decrementing the first and second credit pools according to the count of credits corresponding to the first memory operation.

Abstract: Methods and structure for task management in storage controllers of a clustered storage system. An initiator storage controller of the clustered storage system ships I/O requests for processing to a target storage controller of the system. Responsive to a need to abort a previously shipped I/O request, the initiator storage controller transmits a task management message to the target storage controller. The task management message identifies one or more previously shipped I/O requests to be aborted. The target storage controller processes the received task management message in due course of processing requests and completes processing for the aborted previously shipped request in an orderly manner. Resources associated with the aborted previously shipped requests are release within both controllers.

Abstract: Methods and structure for load balancing of background tasks between storage controllers are provided. An exemplary active storage controller comprises a front-end interface that receives host Input/Output (I/O) requests directed to a logical volume, a back-end interface that couples with one or more of storage devices provisioning the logical volume, and a control unit. The control unit processes the host I/O requests directed to the logical volume, identifies a background processing task distinct from the host I/O requests and related to the logical volume, and assigns the background processing task to a passive storage controller for processing.

Abstract: Methods and structure for improved buffer management in a storage controller. A plurality of processes in the controller each transmits buffer management requests to buffer management control logic. A plurality of reserved portions and a remaining non-reserved portion are defined in a shared pool memory managed by the buffer management control logic. Each reserved portion is defined as a corresponding minimum amount of memory of the shared pool. Each reserved portion is associated with a private pool identifier. Each allocation request from a client process supplies a private pool identifier for the associated buffer to be allocated. The buffer is allocated from the reserved portion if there sufficient available space in the reserved portion identified by the supplied private pool identifier. Otherwise, the buffer is allocated if sufficient memory is available in the non-reserved portion. Otherwise the request is queued for later re-processing.

Abstract: Methods and system are provided for exposing logical volumes to host systems and storage controllers in a consistent manner across a clustered storage system. One embodiment is a storage controller. The storage controller is operable to communicate with other storage controllers within the clustered storage system. The storage controller is further operable to generate a proposed Logical Unit Number (LUN) for a logical volume provisioned at the storage devices, and to communicate with each of the other storage controllers within the clustered storage system requesting that the other storage controllers determine if the proposed LUN is in use. If the proposed LUN is not in use, then storage controller assigns the proposed LUN to the logical volume. If the LUN is in use, then the storage controller generates a new proposed LUN and re-tries communication with the other storage controllers until a unique LUN is found.

Abstract: Methods and system are provided for exposing logical volumes to host systems and storage controllers in a consistent manner across a clustered storage system. One embodiment is a storage controller. The storage controller is operable to communicate with other storage controllers within the clustered storage system. The storage controller is further operable to generate a proposed Logical Unit Number (LUN) for a logical volume provisioned at the storage devices, and to communicate with each of the other storage controllers within the clustered storage system requesting that the other storage controllers determine if the proposed LUN is in use. If the proposed LUN is not in use, then storage controller assigns the proposed LUN to the logical volume. If the LUN is in use, then the storage controller generates a new proposed LUN and re-tries communication with the other storage controllers until a unique LUN is found.

Abstract: Methods and structure for task management in storage controllers of a clustered storage system. An initiator storage controller of the clustered storage system ships I/O requests for processing to a target storage controller of the system. Responsive to a need to abort a previously shipped I/O request, the initiator storage controller transmits a task management message to the target storage controller. The task management message identifies one or more previously shipped I/O requests to be aborted. The target storage controller processes the received task management message in due course of processing requests and completes processing for the aborted previously shipped request in an orderly manner. Resources associated with the aborted previously shipped requests are release within both controllers.

Abstract: Methods and structure for load balancing of background tasks between storage controllers are provided. An exemplary active storage controller comprises a front-end interface that receives host Input/Output (I/O) requests directed to a logical volume, a back-end interface that couples with one or more of storage devices provisioning the logical volume, and a control unit. The control unit processes the host I/O requests directed to the logical volume, identifies a background processing task distinct from the host I/O requests and related to the logical volume, and assigns the background processing task to a passive storage controller for processing.

Abstract: Methods and structure for improved buffer management in a storage controller. A plurality of processes in the controller each transmits buffer management requests to buffer management control logic. A plurality of reserved portions and a remaining non-reserved portion are defined in a shared pool memory managed by the buffer management control logic. Each reserved portion is defined as a corresponding minimum amount of memory of the shared pool. Each reserved portion is associated with a private pool identifier. Each allocation request from a client process supplies a private pool identifier for the associated buffer to be allocated. The buffer is allocated from the reserved portion if there sufficient available space in the reserved portion identified by the supplied private pool identifier. Otherwise, the buffer is allocated if sufficient memory is available in the non-reserved portion. Otherwise the request is queued for later re-processing.