Abstract: A neural network optimization method includes receiving a model file of a to-be-optimized neural network; obtaining a search space of a target neural network architecture based on the model file of the to-be-optimized neural network, where the search space includes a value range of each attribute of each neuron in the target neural network architecture; obtaining the target neural network architecture based on the search space; training the target neural network architecture based on the model file of the to-be-optimized neural network, to obtain a model file of a target neural network; and providing the model file of the target neural network to a user.

Abstract: This application provides a neural architecture search method, applied to a search system. The search system includes a generator and a searcher. The method includes: The generator generates a plurality of neural network architectures based on a search space; the searcher obtains evaluation indicator values of a plurality of child models obtained based on the plurality of neural network architectures on first hardware; and the searcher determines, based on the neural network architectures corresponding to the plurality of child models and the evaluation indicator values of the plurality of child models on the first hardware, a first target neural network architecture that meets a preset condition. In this way, different initial child model training processes are decoupled, and a neural architecture search process is decoupled from an initial child model training process, so that search duration is reduced and search efficiency is improved.

Abstract: Techniques, which provide visual representations, involve displaying, in a first display area, a plurality of first visual representations indicating a plurality of storage nodes in a storage system, the plurality of storage nodes in the storage system having data replication relations, and the data replication relations including: replication of first data at a first storage node to one or more second storage nodes, and/or replication of second data at one or more second storage nodes to the first storage node. The techniques further involve displaying, in the first display area, a plurality of second visual representations indicating a plurality of data replication relations between the plurality of storage nodes. Accordingly, respective storage nodes in the storage system in a topology view can be visualized, and data replication relations between the respective storage nodes can be clearly described.

Abstract: Task management techniques, in a storage system, involve: dividing a task to be processed into a plurality of child tasks, so that a processing time required by each of the plurality of child tasks is same, the number of the plurality of child tasks being a first number; dividing a progress to be reported and being associated with the processing of the task into a plurality of child progresses, the number of the plurality of the child progresses being a second number, the second number being less than the first number, and each of the plurality of child progresses having a same value; and associating, based on the first and the second number, and according to a predetermined mapping between the plurality of child progresses and the plurality of child tasks, each of the plurality of child progresses with a respective child task of the plurality of child tasks.

Abstract: Techniques, which provide visual representations, involve displaying, in a first display area, a plurality of first visual representations indicating a plurality of storage nodes in a storage system, the plurality of storage nodes in the storage system having data replication relations, and the data replication relations including: replication of first data at a first storage node to one or more second storage nodes, and/or replication of second data at one or more second storage nodes to the first storage node. The techniques further involve displaying, in the first display area, a plurality of second visual representations indicating a plurality of data replication relations between the plurality of storage nodes. Accordingly, respective storage nodes in the storage system in a topology view can be visualized, and data replication relations between the respective storage nodes can be clearly described.

Abstract: Task management techniques, in a storage system, involve: dividing a task to be processed into a plurality of child tasks, so that a processing time required by each of the plurality of child tasks is same, the number of the plurality of child tasks being a first number; dividing a progress to be reported and being associated with the processing of the task into a plurality of child progresses, the number of the plurality of the child progresses being a second number, the second number being less than the first number, and each of the plurality of child progresses having a same value; and associating, based on the first and the second number, and according to a predetermined mapping between the plurality of child progresses and the plurality of child tasks, each of the plurality of child progresses with a respective child task of the plurality of child tasks.

Abstract: Described are techniques for testing software. The techniques may include identifying, at a first point in time, first code that has been modified, identifying, using first mapping information, a testing set of one or more test cases wherein the first mapping information identifies each test case of the testing set as a test case used to test the first code, running the testing set, generating coverage information in accordance with executing; analyzing the coverage information, generating second mapping information in accordance with said analyzing, and updating the first mapping information in accordance with the second mapping information.

Abstract: Described are techniques for testing software. The techniques may include identifying, at a first point in time, first code that has been modified, identifying, using first mapping information, a testing set of one or more test cases wherein the first mapping information identifies each test case of the testing set as a test case used to test the first code, running the testing set, generating coverage information in accordance with executing; analyzing the coverage information, generating second mapping information in accordance with said analyzing, and updating the first mapping information in accordance with the second mapping information.