Huawei Technologies Co., Limited

Xie Miao

Wei Fang

Tao Hou

Chengke Wang

Jiang Zhong

Kaixu Xia

Yuming Wu

Fangzhou Lu

Yongjun Wei

Yijing Wang

Data writing methods and computing devices are provided. An example data writing method is applied to a computer system, and the computer system includes a file system and a flash memory-based storage system. The example data writing method includes obtaining a target logical address, where the target logical address is an address allocated from a first logical block to target data to be written into the flash memory-based storage system, the first logical block is one of multiple logical blocks in the file system, and the flash memory-based storage system includes multiple physical blocks. It is determined that the target logical address belongs to the first logical block. The target data is written into a first physical block based on a correspondence between the first logical block and the first physical block, where the first physical block is one of the multiple physical blocks.

Data writing method and apparatus for flash memory-based system

This application provides a system architecture switching method and apparatus. The method includes: when a system architecture needs to be switched, transforming a first system architecture into a second system architecture, where the first system architecture represents a system architecture before switching; and providing a service for a user by using the second system architecture. Dynamic switching of a system architecture is implemented by using a transformable system architecture, so that switching of different architectures can be implemented by using only one system architecture. Therefore, only code for implementing the system architecture is required, and code overheads can be reduced in comparison with a conventional technology.

System architecture switching method and apparatus

A memory swapping method and apparatus are provided. The method includes: selecting n to-be-swapped-out pages; compressing the n to-be-swapped-out pages into n compressed blocks, and buffering the n compressed blocks in a compressed data buffer area; organizing at least one of the n compressed blocks into m to-be-written units; and writing the m to-be-written units into a swap area of a non-volatile storage device in a maximum of m batches, where at least one of the m to-be-written units is stored in a segment of continuous space in the swap area. The method reduces a quantity of write times during memory swapping, thereby prolonging a service life of the non-volatile storage device.

Memory swapping method and apparatus

An I/O request scheduling method includes storing received I/O requests into a plurality of queues, where each queue corresponds to at least one process group, each process group includes one or more processes, and a received I/O request is stored into a queue corresponding to a process group to which a process corresponding to the I/O request belongs, and dispatching the I/O requests in the plurality of queues to an I/O device, where a quantity of I/O requests from a high-priority queue is greater than a quantity of I/O requests from a low-priority queue during one dispatching procedure.

Growing community of inventors

Hangzhou, China

Xie Miao