Abstract: The present disclosure provides a risk assessment method of water inrush in tunnels constructed in water-rich grounds. The method includes the following steps: simulating a tunnel excavation process by finite element software MIDAS GTS NX and fluid-structure interaction; according to a research method of control variables, analyzing effects of a groundwater level, an elastic modulus and advanced pipe shed grouting on the stability of surrounding rock, and improving an algorithm of a radial basis function (RBF) neural network using a Grey Relation Analysis (GRA)-based Partitioning Around Medoid (PAM) clustering algorithm to assess risks of water inrush occurring in Qingdao area.

Abstract: The present disclosure provides a multi-factor quantitative analysis method for deformation of a neighborhood tunnel. The method includes the following steps: analyzing monitoring data generated at a tunnel site; simulating collapse occurring at a shallow buried section of a tunnel; determining the degree of influence of each factor on the tunnel and a stratum; and determining quantitative influence of each factor on tunnel deformation. The present disclosure can not only provide an accurate theoretical basis for the construction of the shallow buried section of the small-distance tunnel, but also guarantee safety and cost saving during tunnel construction.

Abstract: A computer implemented method of data compression using a hardware accelerator includes submitting a request to compress or decompress a data segment using a compression or decompression thread. The method also includes compressing or decompressing the data segment using a hardware accelerator, and performing inline polling of the hardware accelerator to determine whether the hardware accelerator has completed compressing or decompressing the data segment. The inline polling and the compressing or decompressing are performed in a single thread. The method also includes submitting a wakeup command to a segment thread in response to determining that the hardware accelerator has completed compressing or decompressing the data segment.

Abstract: A deduplication pipeline method to enable shorter overall latency, servicing of multiple calls in parallel, and implementing higher data compression ratio. The method includes receiving user data for storage, performing deduplication operation on the data to obtain non-duplicative data, buffering the non-duplicative data in persistent memory, and accepting next user data for deduplication processing. In parallel to receiving the next user data, operating a co-processor to asynchronously compressing the data stored in the persistent memory and storing the compressed data in RAID.

Abstract: A method for task scheduling includes, if it is determined that there is an idle task scheduling token, causing a first computing resource in a computing system to acquire the idle task scheduling token as a first task scheduling token to execute a first task in a task queue. If it is determined that a second task having a higher priority than the first task is to be executed, the first computing resource is to discard the first task scheduling token to switch from executing the first task to executing the second task. If it is determined that the execution of the second task is finished, the first computing resource is to retrieve the first task scheduling token to continue the execution of the first task.

Abstract: A method, an electronic device, and a computer program product for inputting and outputting data is disclosed. The method includes receiving a target I/O request for a storage device from an application, determining that a first offset or a second offset is greater than zero, and generating a plurality of I/O requests based on the target address. The I/O requests include a first I/O request for a first data segment in target data and at least one other I/O request for other data segments in the target data. For the first I/O request, the method includes executing a direct I/O operation on the first data segment by bypassing a cache associated with the storage device.

Abstract: A method, a device, and a computer program product for resource scheduling is disclosed. The method includes determining a job initiated by a virtual machine. The job requests to invoke at least one virtual function in a set of virtual functions associated with the virtual machine and each virtual function in the set of virtual functions is configured to utilize an accelerator resource to provide a single type of acceleration service. The method further includes determining, based on a job type of the job, a first accelerator resource allocated to the at least one virtual function. The accelerator resources required by the virtual functions invoked by the job may then be guaranteed, improving the execution efficiency of the job.

Abstract: Embodiments of the present disclosure relate to a method, an electronic device, and a computer program product for data processing. According to an exemplary implementation of the present disclosure, a method for data processing includes: determining a type of target data associated with an access request, the type including at least one of: computation data type, recovery data type, and hot data type; selecting, based on the type, a target access mode of a storage device associated with the target data from a direct access mode and a block device mode; and causing the storage device to access the target data in the target access mode. As a result, good management of quality of service can be achieved for storage devices.

Abstract: A computer implemented method of data compression using a hardware accelerator includes submitting a request to compress or decompress a data segment using a compression or decompression thread. The method also includes compressing or decompressing the data segment using a hardware accelerator, and performing inline polling of the hardware accelerator to determine whether the hardware accelerator has completed compressing or decompressing the data segment. The inline polling and the compressing or decompressing are performed in a single thread. The method also includes submitting a wakeup command to a segment thread in response to determining that the hardware accelerator has completed compressing or decompressing the data segment.

Abstract: Embodiments of the present disclosure relate to a method, an electronic device, and a computer program product for data processing. According to an exemplary implementation of the present disclosure, a method for data processing includes: determining a type of target data associated with an access request, the type including at least one of: computation data type, recovery data type, and hot data type; selecting, based on the type, a target access mode of a storage device associated with the target data from a direct access mode and a block device mode; and causing the storage device to access the target data in the target access mode. As a result, good management of quality of service can be achieved for storage devices.

Abstract: A deduplication pipeline method to enable shorter overall latency, servicing of multiple calls in parallel, and implementing higher data compression ratio. The method includes receiving user data for storage, performing deduplication operation on the data to obtain non-duplicative data, buffering the non-duplicative data in persistent memory, and accepting next user data for deduplication processing. In parallel to receiving the next user data, operating a co-processor to asynchronously compressing the data stored in the persistent memory and storing the compressed data in RAID.

Abstract: Embodiments of the present disclosure relate to a method, a device, and a computer program product for managing data transfer. A method for managing data transfer is provided, including: if determining that a request to transfer a data block between a memory and a persistent memory of a data storage system is received, obtaining a utilization rate of a central processing unit of the data storage system; and determining, from a first transfer technology and a second transfer technology and at least based on the utilization rate of the central processing unit, a target transfer technology for transferring a data block between the memory and the persistent memory, the first transfer technology transferring data through direct access to the memory, and the second transfer technology transferring data through the central processing unit. Therefore, the embodiments of the present disclosure can improve the data transfer performance of the storage system.

Abstract: Embodiments of the present disclosure relate to a method, a device, and a computer program product for managing data transfer. A method for managing data transfer is provided, including: if determining that a request to transfer a data block between a memory and a persistent memory of a data storage system is received, obtaining a utilization rate of a central processing unit of the data storage system; and determining, from a first transfer technology and a second transfer technology and at least based on the utilization rate of the central processing unit, a target transfer technology for transferring a data block between the memory and the persistent memory, the first transfer technology transferring data through direct access to the memory, and the second transfer technology transferring data through the central processing unit. Therefore, the embodiments of the present disclosure can improve the data transfer performance of the storage system.

Abstract: Apparatus having corresponding methods and tangible computer-readable media comprise: an input module to receive a bitstream representing data words encoded according to a variable-length code; a peek module to select a peek block comprising a predetermined number of consecutive bits in the bitstream; and a decoder to provide a plurality of the data words based on the peek block.

Abstract: Inverse transforms used in video and image compression/decompression, such as DCT/IDCT used in MPEG-2 and MPEG-4, or the integer transforms used in H.264, are usually calculated with fast algorithms, which only take advantage of the symmetry existing in the transform matrix but ignores the peculiarities in the input data. While these kind of fast algorithms can apply to both forward and inverse transforms, they tend to be inefficient in calculating inverse transforms. In inverse transforms, most of the coefficients become zero after quantization, this invention takes advantage of this fact to further simplify the general fast algorithm and speed up the calculation.

Abstract: Apparatus having corresponding methods and tangible computer-readable media comprise: an input module to receive a bitstream representing data words encoded according to a variable-length code; a peek module to select a peek block comprising a predetermined number of consecutive bits in the bitstream; and a decoder to provide a plurality of the data words based on the peek block.

Abstract: Inverse transforms used in video and image compression/decompression, such as DCT/IDCT used in MPEG-2 and MPEG-4, or the integer transforms used in H.264, are usually calculated with fast algorithms, which only take advantage of the symmetry existing in the transform matrix but ignores the peculiarities in the input data. While these kind of fast algorithms can apply to both forward and inverse transforms, they tend to be inefficient in calculating inverse transforms. In inverse transforms, most of the coefficients become zero after quantization, this invention takes advantage of this fact to further simplify the general fast algorithm and speed up the calculation.