CN116700913A - Scheduling method, equipment and storage medium of embedded file system - Google Patents

Abstract

The application discloses a scheduling method, equipment and storage medium of an embedded file system, and the method is applied to electronic equipment integrating an embedded operating system. In this method, when receiving multiple scheduling requests initiated by multiple tasks to the embedded file system, according to the priority of each scheduling request corresponding to the task and/or the waiting time of each scheduling request, each time from Select the most urgent scheduling request to respond to the scheduling requests that have not been responded, so as to achieve the purpose of responding to multiple scheduling requests reasonably.

Description

Scheduling method, device and storage medium of embedded file system

technical field

The present application relates to the technical field of embedded operating system, in particular to a scheduling method, device and storage medium of an embedded file system.

Background technique

In an electronic device equipped with an embedded operating system, the embedded operating system will receive scheduling requests to the file system initiated by multiple tasks generated by upper-layer applications at the same time or in a short period of time. For multiple scheduling requests, how to schedule embedded files It is an urgent problem to be solved that the system performs file operations, and then executes the multiple tasks in a timely manner.

Contents of the invention

The application discloses a scheduling method, equipment and storage medium of an embedded file system, and the method is applied to electronic equipment integrating an embedded operating system. In this method, when receiving multiple scheduling requests initiated by multiple tasks to the embedded file system, according to the priority of each scheduling request corresponding to the task and/or the waiting time of each scheduling request, each time from Select the most urgent scheduling request to respond to the scheduling requests that have not been responded, so as to achieve the purpose of responding to multiple scheduling requests reasonably.

In a first aspect, the present application provides an embedded file system scheduling method, the method is applied to an electronic device, the electronic device includes an embedded file system, and the method includes: the electronic device generates multiple scheduling requests from multiple tasks , one task corresponds to one or more scheduling requests, and the scheduling requests are used to schedule the embedded file system to perform corresponding file operations; time, and respond to the multiple scheduling requests in turn.

After implementing the method provided in the first aspect, the electronic device can determine a reasonable sequence of request responses according to a certain scheduling strategy, and schedule the embedded file system to perform file operations in order to complete corresponding tasks.

In combination with the method provided in the first aspect, the electronic device responds to the multiple scheduling requests in sequence, specifically including: sequentially selecting scheduling requests from the multiple scheduling requests to respond to, and selecting one scheduling request to respond at a time; wherein, selecting one scheduling request at a time The requesting process includes: when the second queue is empty, or when the scheduling request in the second queue is continuously responded to for a duration greater than or equal to the full time, select one of the tasks with the highest priority from the first queue Respond to the scheduling request; if the second queue is not empty, or the duration of the continuous response of the scheduling request in the second queue is less than the full time, select the task with the highest priority from the second queue A scheduling request responds; the first queue includes: scheduling requests whose waiting time is less than the starvation time; the second queue includes: scheduling requests that have not been responded and whose waiting time is greater than or equal to the starvation time; scheduling requests belonging to the same task Corresponding to the same starvation time.

It can be seen that the embedded file system scheduling method adopted in this application is real-time for the file operation service provided by the upper layer application. That is, the priority corresponding to the different types of tasks initiated by the application and the first threshold of the waiting time of the scheduling request from the task are set to ensure that the scheduling requests initiated by applications with higher priority and higher response time requirements be prioritized for response. In addition, the embedded file system scheduling method adopted in this application is fair to the file operation service provided by the upper layer application. That is, the total running time of the scheduling requests that are prioritized to be responded is limited, so that while satisfying real-time requirements, response services can also be obtained for requests for tasks with low real-time requirements.

In combination with the method provided in the first aspect, the scheduling request selected by the electronic device from the first queue is the scheduling request with the earliest generation time among the tasks with the highest priority in the first queue; A scheduling request selected in the queue is a scheduling request with the earliest generation time among the tasks with the highest priority in the second queue.

In this way, when the same task contains multiple scheduling requests, the priorities of the tasks corresponding to the multiple scheduling requests are the same, and the scheduling request that arrives earliest can be selected to respond, thereby ensuring that in the case of the same priority, priority Respond to scheduling requests that arrive early.

In combination with the method provided in the first aspect, the priority of the task is preset by the electronic device, specifically according to the frequency of the application generation task counted in the development stage, and/or, the value preset according to the real-time requirements of the task ; or, the priority of the task is dynamically adjusted by the electronic device according to any one or more of the following: the number of times the history of the task has not been successfully executed, the time taken for the history of the task to be successfully executed, the scheduling request of the task The waiting time in the first queue and the historical generation frequency of the task.

In this way, during the operation of the electronic device, according to the dynamic change of the service characteristic of the task initiated by the application (that is, the user's use demand), the priority parameter used when selecting the order of dispatching requests for response can be adjusted in real time, and then according to a more Reasonable order to respond to scheduling requests.

In combination with the method provided in the first aspect, the starvation time of the scheduling request is preset by the electronic device, specifically according to the frequency of application generation tasks counted in the development stage, and/or, the real-time requirements of the tasks are preset or, dynamically adjusted by the electronic device according to any one or more of the following: the number of times the history of the task to which the scheduling request belongs has not been successfully executed, the time taken for the history of the task to which the scheduling request belongs to be successfully executed, the scheduling The waiting time of the scheduling request of the task to which the request belongs in the first queue, and the historical generation frequency of the task to which the scheduling request belongs.

In this way, during the operation of the electronic device, according to the dynamic change of the service characteristics of the task initiated by the application (that is, the user's use demand), the starvation time parameter used when selecting the order in which the scheduling request is responded to can be adjusted in real time, and then according to a more Reasonable order to respond to scheduling requests.

In combination with the method provided in the first aspect, the eating time is preset by the electronic device; or, it is dynamically adjusted by the electronic device according to the historical duration of continuously responding to the scheduling requests in the second queue.

In this way, during the operation of the electronic device, according to the dynamic change of the business characteristics of the task initiated by the application (that is, the user's use demand), the full time used when selecting the order of scheduling requests for response can be adjusted in real time, and then according to a more Reasonable order to respond to scheduling requests.

In combination with the method provided in the first aspect, the file operations performed by the embedded file system include any one or more of the following: creating, opening, reading and writing, closing, deleting, modifying files or transferring file storage locations.

In this way, the electronic device can sequentially respond to multiple scheduling requests in a specific order to schedule the embedded file system to execute various corresponding file operations, expanding the application scenarios of the method itself.

In a second aspect, the present application provides an electronic device, which includes a file system scheduling service and an embedded file system; the file system scheduling service is used to receive multiple scheduling requests from multiple tasks, and according to the scheduling request The priority of the task to which it belongs, the waiting time of the scheduling request, and sequentially schedule the embedded file system to respond to the multiple scheduling requests; one task corresponds to one or more scheduling requests; the embedded file system is used to respond to The request should be dispatched to perform the corresponding file operation.

After using the electronic device provided by the second aspect, the electronic device can determine a reasonable sequence of request responses according to a certain scheduling strategy, and schedule the embedded file system to perform file operations in order to complete corresponding tasks.

In combination with the electronic device provided in the second aspect, the file system scheduling service sequentially schedules the embedded file system to respond to the multiple scheduling requests, specifically including: the file system scheduling service sequentially selects a scheduling request from the multiple scheduling requests to schedule the The embedded file system responds, and selects a scheduling request to schedule the embedded file system to respond; wherein, the process of selecting a scheduling request each time includes: the second queue is empty, or the scheduling request in the second queue When the duration of the continuous response is greater than or equal to the full time, the file system scheduling service selects a scheduling request of the task with the highest priority from the first queue to schedule the embedded file system to respond; is empty, or, when the scheduling request in the second queue is continuously responded to for less than the full time, a scheduling request of the task with the highest priority is selected from the second queue to respond; the first queue includes : Scheduling requests whose waiting time is less than the starvation time; the second queue includes: scheduling requests that have not been responded and whose waiting time is greater than or equal to the starvation time; scheduling requests belonging to the same task correspond to the same starvation time.

It can be seen that the electronic device used in this application has real-time performance on the file operation service provided by the upper layer application. That is, the priority corresponding to the different types of tasks initiated by the application and the first threshold of the waiting time of the scheduling request from the task are set to ensure that the scheduling requests initiated by applications with higher priority and higher response time requirements be prioritized for response. In addition, the embedded file system scheduling method adopted in this application is fair to the file operation service provided by the upper layer application. That is, the total running time of the scheduling requests that are prioritized to be responded is limited, so that while satisfying real-time requirements, response services can also be obtained for requests for tasks with low real-time requirements.

In combination with the electronic device provided in the second aspect, the scheduling request selected by the file system scheduling service from the first queue is the scheduling request with the earliest generation time among the tasks with the highest priority in the first queue; the file system scheduling service The scheduling request selected by the service from the second queue is the scheduling request with the earliest generation time among the tasks with the highest priority in the second queue.

In this way, when the same task contains multiple scheduling requests, the priorities of the tasks corresponding to the multiple scheduling requests are the same, and the scheduling request that arrives earliest can be selected to respond, thereby ensuring that in the case of the same priority, priority Respond to scheduling requests that arrive early.

In combination with the electronic device provided in the second aspect, the priority of the task is preset by the electronic device, specifically according to the frequency of the application generation task counted in the development stage, and/or, the real-time requirement of the task is preset value; or, the priority of the task is dynamically adjusted by the file system scheduling service according to any one or more of the following: the number of times the history of the task has not been successfully executed, the time taken for the history of the task to be successfully executed, the task The waiting time of the scheduling request in the first queue, and the historical generation frequency of the task.

In this way, during the operation of the electronic device, according to the dynamic change of the service characteristic of the task initiated by the application (that is, the user's use demand), the priority parameter used when selecting the order of dispatching requests for response can be adjusted in real time, and then according to a more Reasonable order to respond to scheduling requests.

In combination with the electronic device provided in the second aspect, the starvation time of the scheduling request is preset by the electronic device, specifically according to the frequency of application generation tasks counted in the development stage, and/or, the real-time requirements of the tasks Or, the file system scheduling service dynamically adjusts according to any one or more of the following: the number of times the history of the task to which the scheduling request belongs is not successfully executed, and the time it takes for the history of the task to which the scheduling request belongs to be successfully executed , the waiting time of the scheduling request of the task to which the scheduling request belongs in the first queue, and the historical generation frequency of the task to which the scheduling request belongs.

In this way, during the operation of the electronic device, according to the dynamic change of the service characteristics of the task initiated by the application (that is, the user's use demand), the starvation time parameter used when selecting the order in which the scheduling request is responded to can be adjusted in real time, and then according to a more Reasonable order to respond to scheduling requests.

In combination with the electronic device provided in the second aspect, the full time is preset by the electronic device; or, the file system scheduling service dynamically adjusts the duration of continuously responding to the scheduling requests in the second queue according to history.

In this way, during the operation of the electronic device, according to the dynamic change of the business characteristics of the task initiated by the application (that is, the user's use demand), the full time used when selecting the order of scheduling requests for response can be adjusted in real time, and then according to a more Reasonable order to respond to scheduling requests.

In combination with the electronic device provided in the second aspect, the file operations performed by the embedded file system include any one or more of the following: creating, opening, reading and writing, closing, deleting, modifying files or transferring file storage locations.

In this way, the electronic device can sequentially respond to multiple scheduling requests in a specific order to schedule the embedded file system to execute various corresponding file operations, expanding the application scenarios of the method itself.

In a third aspect, the present application provides an electronic device, which includes an embedded file system, memory, and one or more processors; the memory is coupled to the one or more processors, and the memory is used to store computer programs Code, the computer program code includes computer instructions, the one or more processors invoke the computer instructions to cause the electronic device to perform: generating a plurality of scheduling requests from a plurality of tasks, one of the tasks corresponding to one or more of the scheduling requests , the scheduling request is used to schedule the embedded file system to execute the corresponding file operation; according to the priority of the task to which the scheduling request belongs and the waiting time of the scheduling request, respond to the multiple scheduling requests in sequence.

After using the electronic device provided by the second aspect, the file system scheduling service included in the electronic device can determine a reasonable request response sequence according to a certain scheduling strategy, and schedule the embedded file system to perform file operations in order to complete the corresponding task .

With reference to the electronic device provided in the third aspect, the one or more processors call the computer instruction so that the electronic device responds to the multiple scheduling requests in sequence, specifically including: sequentially selecting a scheduling request from the multiple scheduling requests to respond, Select one scheduling request at a time to respond; wherein, the process of selecting one scheduling request each time includes: the second queue is empty, or, the duration of continuous response of the scheduling requests in the second queue is greater than or equal to the full time In this case, select a scheduling request of the task with the highest priority from the first queue to respond; when the second queue is not empty, or the duration of the continuous response of the scheduling requests in the second queue is less than the full time Next, select a scheduling request of the task with the highest priority from the second queue to respond; the first queue includes: the scheduling request whose waiting time is less than the starvation time; the second queue includes: no response and the waiting time is longer than Or scheduling requests equal to the starvation time; scheduling requests belonging to the same task correspond to the same starvation time.

It can be seen that the file system scheduling service adopted in this application has real-time performance on the file operation service provided by the upper layer application. That is, the priority corresponding to the different types of tasks initiated by the application and the first threshold of the waiting time of the scheduling request from the task are set to ensure that the scheduling requests initiated by applications with higher priority and higher response time requirements be prioritized for response. In addition, the file system scheduling service adopted in this application is fair to the file operation service provided by the upper layer application. That is, the total running time of the scheduling requests that are prioritized to be responded is limited, so that while satisfying real-time requirements, response services can also be obtained for requests for tasks with low real-time requirements. In combination with the electronic device provided in the third aspect, the one or more processors invoke the computer instruction so that the electronic device selects a scheduling request from the first queue as, among the tasks with the highest priority in the first queue, The scheduling request with the earliest generation time; the one or more processors invoke the computer instruction so that the electronic device selects a scheduling request from the second queue as, among the tasks with the highest priority in the second queue, the generation time Earliest scheduling request.

In this way, when the same task contains multiple scheduling requests, the priorities of the tasks corresponding to the multiple scheduling requests are the same, and the scheduling request that arrives earliest can be selected to respond, thereby ensuring that in the case of the same priority, priority Respond to scheduling requests that arrive early.

In combination with the electronic device provided in the third aspect, the priority of the task is preset by the electronic device, specifically according to the frequency of the application generation task counted in the development stage, and/or, the real-time requirement of the task is preset value; or, the priority of the task is dynamically adjusted by the electronic device according to any one or more of the following: the number of times the history of the task has not been successfully executed, the time taken for the history of the task to be successfully executed, the scheduling of the task The waiting time of the request in the first queue and the historical generation frequency of the task.

In this way, during the operation of the electronic device, according to the dynamic change of the service characteristic of the task initiated by the application (that is, the user's use demand), the priority parameter used when selecting the order of dispatching requests for response can be adjusted in real time, and then according to a more Reasonable order to respond to scheduling requests.

In combination with the electronic device provided in the third aspect, the starvation time of the scheduling request is preset by the electronic device, specifically according to the frequency of application generation tasks counted in the development stage, and/or the real-time requirements of the tasks Or, the electronic device dynamically adjusts according to any one or more of the following: the number of times the history of the task to which the dispatching request belongs has not been successfully executed, the time it takes for the history of the task to which the dispatching request belongs to be successfully executed, the The waiting time of the scheduling request of the task to which the scheduling request belongs in the first queue, and the historical generation frequency of the task to which the scheduling request belongs.

In this way, during the operation of the electronic device, according to the dynamic change of the service characteristics of the task initiated by the application (that is, the user's use demand), the starvation time parameter used when selecting the order in which the scheduling request is responded to can be adjusted in real time, and then according to a more Reasonable order to respond to scheduling requests.

In combination with the electronic device provided in the third aspect, the time to be full is preset by the electronic device; or, the electronic device dynamically adjusts the time length of continuously responding to the scheduling request in the second queue according to history.

In this way, during the operation of the electronic device, according to the dynamic change of the business characteristics of the task initiated by the application (that is, the user's use demand), the full time used when selecting the order of scheduling requests for response can be adjusted in real time, and then according to a more Reasonable order to respond to scheduling requests.

In combination with the electronic device provided by the third aspect, the file operations performed by the embedded file system include any one or more of the following: creating, opening, reading and writing, closing, deleting, modifying files or transferring file storage locations.

In this way, the electronic device can sequentially respond to multiple scheduling requests in a specific order to schedule the embedded file system to execute various corresponding file operations, expanding the application scenarios of the method itself.

In a fourth aspect, the present application provides a chip, the chip is applied to an electronic device, the chip includes one or more processors, and the processor is used to invoke computer instructions so that the electronic device performs any one of the first aspects described method.

In a fifth aspect, the present application provides a computer-readable storage medium, the computer-readable storage medium includes an instruction, and when the instruction is run on an electronic device, the electronic device executes the method described in any one of the first aspect. method.

Description of drawings

Figures 1A-1C are logic diagrams for scheduling embedded file systems in two task scenarios;

FIG. 2 is a schematic diagram of a hardware architecture of an electronic device provided by an embodiment of the present application;

FIG. 3 is a schematic diagram of an electronic device software architecture (embedded system architecture) provided by an embodiment of the present application;

FIG. 4 is a flow chart of a file system scheduling method in an embedded system provided in an embodiment of the present application;

FIG. 5 is a file system scheduling strategy diagram in an embedded system provided by an embodiment of the present application;

FIG. 6 is a file system scheduling strategy diagram in an embedded system provided by an embodiment of the present application;

FIG. 7 is a logic diagram for scheduling embedded file systems in two task scenarios provided by the embodiment of the present application;

FIG. 8 shows the scheduling request response logic for the file system in the embedded system provided by the embodiment of the present application.

Detailed ways

The technical solutions in the embodiments of the present application will be described clearly and in detail below in conjunction with the accompanying drawings. Among them, in the description of the embodiments of this application, unless otherwise specified, "/" means or means, for example, A/B can mean A or B; "and/or" in the text is only a description of associated objects The association relationship of indicates that there may be three kinds of relationships, for example, A and/or B may indicate: A exists alone, A and B exist simultaneously, and B exists independently.

Hereinafter, the terms "first" and "second" are used for descriptive purposes only, and cannot be understood as implying or implying relative importance or implicitly specifying the quantity of indicated technical features. Therefore, the features defined as "first" and "second" may explicitly or implicitly include one or more of these features. In the description of the embodiments of the present application, unless otherwise specified, the "multiple" The meaning is two or more.

Reference in this application to an "embodiment" means that a particular feature, structure, or characteristic described in connection with the embodiment can be included in at least one embodiment of the present application. The occurrences of this phrase in various places in the specification are not necessarily all referring to the same embodiment, nor are separate or alternative embodiments mutually exclusive of other embodiments. It is understood explicitly and implicitly by those skilled in the art that the embodiments described in this application can be combined with other embodiments.

First, explain the terms involved in this application, as follows:

Embedded Operating System: Embedded Operating System (Embedded Operating System, EOS for short) refers to an operating system applied in embedded devices. Embedded devices (also known as embedded systems) refer to devices that are composed of hardware and software and can operate independently, including the software content of the software operating environment and its operating system, as well as hardware content such as processors, memories, and communication modules. .

In an embedded device, software running on an embedded operating system can directly access the device's hardware. It can be seen that the upper-layer application can directly schedule the underlying embedded file system to access the external memory module, that is, when the upper-layer application needs to access the external memory module, the application can directly call the file system interface to access the external memory module, for example, through the write function and read functions to read and write files stored in the external memory module.

It can be seen that the use of embedded operating systems reduces the coupling between software and hardware, and the scheduling and management of hardware by upper-layer applications does not depend on the underlying hardware. Therefore, embedded operating systems have the characteristics of portability, tailorable software and hardware, and configurability. In addition, compared with the rich resources and powerful software configuration required by other non-embedded operating systems, embedded operating systems consume less power and are more suitable for small devices, such as wearable devices and Internet of Things devices.

Non-embedded operating system: Non-embedded operating system, also known as general-purpose operating system, refers to the operating system used in general-purpose (traditional) systems.

It is worth noting that in non-embedded systems, most software running on non-embedded operating systems cannot directly access the hardware of the device, that is, upper-layer applications cannot directly schedule the underlying file system interface to access external memory modules. Specifically, because the non-embedded system divides the storage space into user space and kernel space, the application program runs in the user space, and the non-embedded operating system and driver program run in the kernel space. When the kernel space uses the user space pointer , the corresponding file may not be found in the external memory module, so the two cannot simply use pointers to transfer data. That is to say, when the upper-layer application needs to access the external memory module, the process/thread created by the upper-layer application needs to be converted from the user state to the kernel state, and then the file system interface can be called to access the external memory module, that is, the access to the external memory module is different through the write and read functions. files stored in the external memory module.

Embedded file system: It is an important part of the embedded operating system. The embedded file system is a method used by the embedded operating system to explicitly store files on the device. The embedded file system is also used to: manage and schedule the storage space of the file, provide the logical structure, physical structure and storage method of the file, realize the mapping of the file from the identifier to the actual address, realize the control operation and the access operation of the file (including creating , open, read, write, close, and revoke files, etc.).

The embedded file system is mainly composed of three parts: the interface of the file system, the software collection for object manipulation and management, objects and attributes. From a system point of view, the embedded file system is a system that organizes and allocates the space of the file storage device, is responsible for file storage, and protects and retrieves the stored files. Specifically, it is responsible for creating files for users, storing, reading, modifying, and dumping files, and controlling file access.

File operation: refers to the operations of creating, opening, reading and writing, closing, deleting and modifying files, and dumping files. The functions that need to be called when performing file operations include but are not limited to: open, write, read, close, seek-read, random-read, etc. The embodiment of the present application does not limit specific file operations.

In particular, the file operation specifically refers to the operation on the file stored in the external module of the electronic device, rather than the operation on the data in the memory, because the data in the memory can be directly read and written by the CPU.

Task: refers to the operating system of an electronic device, that is to say, a task refers to a series of operations to achieve a certain purpose.

In this embodiment of the present application, a task refers to an application or service initiated by an electronic device running on an embedded operating system, and one application may initiate one or more tasks.

Types of tasks include but are not limited to: sensor tasks, display tasks, over-the-air tasks, audio tasks, navigation (such as Global Positioning System (Global Positioning System, GPS)) tasks, input tasks, capability tasks, and so on.

The electronic device execution task specifically includes: after the application or service initiates a certain task, the application or service initiates one or more scheduling requests to the embedded operating system by creating threads, and the embedded operating system responds to the one or more scheduling requests with The embedded file system is scheduled to execute one or more corresponding file operations to complete the task. That is to say, when a task includes instructions for performing one or more file operations, the task corresponds to one or more scheduling requests.

Thread (Thread): It is the smallest unit that the operating system can perform operation scheduling. It is included in the process and is the actual operating unit in the process. A thread refers to a single sequential flow of control in a process. Multiple threads can run concurrently in a process, and each thread is used to perform a different task.

With the wide application of small devices such as wearables, embedded operating systems are widely used in small devices such as wearables due to their unique characteristics of low power consumption, portability, tailorability, and configurability. In addition, the embedded file system, as an important part of the embedded operating system, plays an important role in realizing the storage of files and the management of various operations in the embedded system.

A characteristic of embedded devices is the ability to perform different tasks through different threads. Specifically, when the upper-layer application or service of the electronic device initiates multiple tasks, the electronic device creates multiple threads for executing the corresponding tasks, and the order in which multiple tasks are executed is essentially based on the order in which the scheduling requests corresponding to each task arrive. definite. In order to facilitate understanding, the scheduling logic of the embedded file system will be described in the context of two tasks respectively.

Referring to FIG. 1A-FIG. 1C, FIG. 1A-FIG. 1C exemplarily show a scheduling logic diagram for an embedded file system in two task scenarios.

FIG. 1A exemplarily shows the processing process of two read tasks.

As shown in FIG. 1A , after the upper layer application or service of the electronic device successively initiates the read task 1 and the read task 2, a thread Thread1-read can be created to execute the read task 1, and a thread Thread2-read can be created to execute the read task 2. When the read task 1 includes 4 file operations (for example r1, r2, r3, r4), then the read task 1 corresponds to 4 scheduling requests to the embedded file system. When the read task 2 includes 4 file operations (eg r1, r2, r3, r4), then the read task 1 corresponds to 4 scheduling requests to the embedded file system. When the scheduling request of task 1 arrives earlier than the scheduling request of task 2 (denoted as "Thread1-read>Thread2-read" in the figure), the electronic device responds to the scheduling request of task 1 first, and then responds to the scheduling request of task 2 , that is to say, the electronic device will not execute the four file operations included in the read task 2 until the electronic device finishes executing the four file operations included in the read task 1. This is because, when Thread1-read executes read task 1, Thread1-read seizes the task lock, and only after Thread1-read executes read task 1, the task will be released so that Thread2-read can seize the task lock and execute Read task 2.

FIG. 1B exemplarily shows the processing process of two writing tasks.

As shown in FIG. 1B , after the upper-layer application or service of the electronic device successively initiates the write task 1 and the write task 2, a thread Thread1-write can be created to execute the write task 1, and a thread Thread2-write can be created to execute the read task 2. Similarly, according to the order of arrival time of the scheduling requests corresponding to writing task 1 and writing task 2, the electronic device responds first to the scheduling request of writing task 1 to execute the earlier arriving writing task 1, and then responds to the scheduling request of writing task 2 to For the write task 2 achieved after execution, the specific execution process can refer to the description of FIG. 1A above, and will not be repeated here. FIG. 1C exemplarily shows the processing process of a read task and a write task.

As shown in FIG. 1C , after the upper-layer application or service of the electronic device successively initiates the read task 1 and the write task 2, a thread Thread1-read can be created to execute the write task 1, and a thread Thread2-write can be created to execute the read task 2. Similarly, according to the order of arrival time of the scheduling requests corresponding to the reading task 1 and writing task 2, the electronic device responds to the scheduling request of the reading task 1 first to execute the earlier arriving reading task 1, and then responds to the scheduling request of the writing task 2 to For the write task 2 achieved after execution, the specific execution process can refer to the description of FIG. 1A above, and will not be repeated here.

From the above scenarios shown in Figures 1A-1C, when the upper-layer application or service of the electronic device initiates multiple tasks, the electronic device responds to each task in turn according to the order in which the scheduling requests corresponding to each task arrive. Requests are scheduled to perform the plurality of tasks. This will lead to a long waiting time for the scheduling request of the task that arrives later, and cannot respond to the task that arrives in time. If the scheduling request of the task that arrives later has high requirements for real-time performance, the thread executing the task will be starved to death, thus This can lead to problems such as electronic equipment freezing or even crashing.

In addition, since most embedded devices are single-core devices, that is, only have one CPU, when faced with multiple tasks to be executed, since only one CPU executes the multiple tasks, it is easier to cause the scheduling of subsequent queued tasks The request waits for a long time and still does not get a response, which causes problems such as freezing or even crashing of the electronic device, which affects the user experience.

In order to solve the above problems, the present application provides a scheduling method, device and storage medium of an embedded file system, and the method is applied to an electronic device integrated with an embedded operating system. In this method, when multiple scheduling requests to the file system initiated by the tasks created by the application are received, according to the priority of the task corresponding to each scheduling request and/or the waiting time of each scheduling request, each time from Select the most urgent scheduling request to respond to the scheduling requests that have not been responded, so as to achieve the purpose of responding to multiple scheduling requests reasonably.

Wherein, selecting the most urgent scheduling request includes: selecting the scheduling request with the highest corresponding task priority from multiple scheduling requests as the most urgent scheduling request (hereinafter also referred to as the target scheduling request);

Or, select the scheduling request whose waiting time is greater than the corresponding first threshold (hereinafter also referred to as the starvation time) from the multiple scheduling requests as the most urgent scheduling request;

Or, set the first queue with low priority and the second queue with high priority, first add all scheduling requests to the first queue; The scheduling request is added to the second queue; the priority is to select the scheduling request with the highest priority corresponding to the task from the second queue to respond until the second queue is empty or the total duration of continuous response to the second queue reaches the second threshold (hereinafter also referred to as In the case of full time), switch to select the scheduling request with the highest priority corresponding to the task from the first queue to respond.

Further, in another possible implementation mode of this application, in addition to setting the first queue and the second queue, more queues with different priorities can be set, and multiple time thresholds can be set accordingly as the starvation of the scheduling request Time, add scheduling requests whose waiting time is within different threshold ranges to the corresponding queues, and set multiple time thresholds accordingly as the full time of each queue, and switch to other queues after reaching the full time of a certain queue Select a scheduling request to respond to, so as to achieve more refined and reasonable scheduling.

Further, in another possible implementation mode of the present application, the scheduling strategy adopted in the present application involves the priority of the task corresponding to each scheduling request, the first threshold corresponding to each scheduling request, and the continuous response to a certain Parameters such as the second threshold of a queue are dynamically changed according to the business characteristics of the upper-layer application (that is, the user's usage requirements), so that the scheduling strategy can be dynamically adjusted with the change of the business characteristics of the upper-layer application, and then respond in a more reasonable order. Scheduling requests.

Next, explain the custom vocabulary involved in this application, as follows:

Task priority (also called the priority of the scheduling request corresponding to the task): refers to a fixed value defined by the developer based on the dependence of the upper-layer application that initiates the task on the file system. When the priority of the task corresponds to A higher value indicates that the application that requests this type of task has a higher priority to schedule the embedded file system. Alternatively, the task priority may also be a value dynamically adjusted by analyzing periodically collected Design for Test (DFT) data during the operation of the electronic device. For details, refer to the description of the method embodiments below.

Wherein, the dependence degree of the upper-layer application on the file system is characterized by any one or more of the following factors: the frequency of the task scheduling the embedded file system obtained by the developer through research, the task's impact on the scheduling of the embedded file system The real-time requirements of the file system. It can be understood as: In order to ensure that an application is running normally, if the application needs to frequently schedule the embedded file system to perform corresponding operations on the file, or if the application has high real-time requirements for scheduling request responses, it means that the The application has a high degree of dependence on the embedded file system, so the priority of the task initiated by the application can be defined as a high priority, otherwise it can be defined as a low priority. Regarding the classification of task priorities, for details, refer to the description in the method embodiments below, and details will not be repeated here.

In the present application, when other conditions are the same, tasks with higher priority can be prioritized to schedule the embedded file system to operate files. That is to say, under certain other conditions, when the embedded operating system receives multiple scheduling requests from tasks with different priorities to the embedded file system, it responds to the scheduling requests in order of priority from high to low. And schedule the embedded file system to perform corresponding file operations. It can be understood that other conditions must include but are not limited to: when the waiting time of tasks with different priorities to the scheduling requests of the embedded file system is less than the corresponding first threshold, or when both are greater than or equal to the first threshold, That is, other conditions are the same. As for the implementation process of responding to the file scheduling request according to the priority of the task, for details, refer to the description in the method embodiment below, and details will not be repeated here.

The first threshold: refers to the "starvation time" defined by the developer according to the dependence of the upper application on the embedded file system. The "starvation time" refers to the waiting time for the scheduling request to the file system initiated by the task in the application a threshold of . It is understandable that in order to ensure the user experience and avoid long-term unresponsiveness of the triggered scheduling request, the process/thread created by the application will be starved to death, and the application cannot run normally, and at the same time, avoid the long-term unscheduled scheduling request from occupying the system. resources, causing the system to crash. Usually, when a scheduling request is generated, a timeout period is assigned to it, which is the maximum time to wait for being scheduled. Therefore, the starvation time provided in this application can be set according to the timeout time corresponding to the scheduling request, for example, the starvation time is set to be less than or equal to the timeout time. Alternatively, the first threshold may also be a value that is dynamically adjusted by analyzing periodically collected Design For Test (DFT) data during the operation of the electronic device. For details, refer to the description of the method embodiments below.

Wherein, the dependence degree of the upper-layer application on the file system is characterized by any one or more of the following factors: the frequency of the task scheduling the embedded file system obtained by the developer through research, the task's impact on the scheduling of the embedded file system The real-time requirements of the file system. It can be understood as: when an application is running normally, if the application needs to frequently schedule the embedded file system to perform corresponding operations on the file, or if the application has high real-time requirements for scheduling request responses, it means that the Applications are highly dependent on the embedded file system, so the first threshold of scheduling requests to the embedded file system for tasks initiated by such applications can be defined as a shorter time, otherwise it can be defined as a longer time. Regarding the specific setting of the first threshold, reference may be made to the description in the method embodiments later, and details are not repeated here.

In this application, the first thresholds corresponding to task requests initiated by different applications may be the same or different, and the first thresholds corresponding to different task requests initiated by the same application may also be the same or different.

The second threshold: refers to the upper limit time defined by developers to continuously respond to requests in the second queue in order to ensure the relative fairness of the response to task requests initiated by each application, also known as "satisfaction time". This is because the requests in the second queue are more urgent than the requests in the first queue, so they are executed first, but when there are many requests in the second queue, if the second queue is executed for a long time The task corresponding to the request in the first queue will cause the request in the first queue to wait for too long to get a response, thus causing the scheduling request in the first queue to reach the corresponding timeout period. Therefore, in order to ensure that ordinary requests in the first queue can also be responded to, the application needs to define the upper limit of the total running time of the requests in the second queue, that is, the second threshold. Alternatively, the second threshold may also be a value dynamically adjusted by analyzing periodically collected Design For Test (DFT) data during the operation of the electronic device. For details, refer to the description of the method embodiments below.

It can be seen that after implementing the embedded file system scheduling method provided by this application, the following technical effects can be brought about:

(1) For multiple scheduling requests to the embedded file system, a reasonable request response sequence can be determined according to the scheduling policy, and the embedded file system is scheduled to perform file operations in order to complete the corresponding tasks, so that there is no priority The conceptual file system service has the ability to prioritize.

(2) The scheduling strategy adopted in this application is real-time for the file operation service provided by the upper layer application. That is, the priority corresponding to the different types of tasks initiated by the application and the first threshold of the waiting time of the scheduling request from the task are set to ensure that the scheduling requests initiated by applications with higher priority and higher response time requirements be prioritized for response.

(3) The scheduling strategy adopted in this application is fair to the file operation service provided by the upper layer application. That is, the total running time of the scheduling requests that are prioritized to be responded is limited, so that while satisfying real-time requirements, response services can also be obtained for requests for tasks with low real-time requirements.

(4) The scheduling policy adopted in this application is dynamic and can flexibly meet the requirements of different application scenarios.

(5) The embedded file system scheduling method provided by this application is dedicated to electronic devices equipped with an embedded operating system, so the embedded file system scheduling method provided by this application can be provided as a loadable option of an embedded system, and it has a scalable , tailorable, portable, configurable and other features.

Next, the form, software and hardware architecture of the electronic equipment provided by this application is introduced.

The electronic device provided in this application refers to an embedded device. Embedded operating systems include but are not limited to: Palm Embedded /> Windows /> wait. The embedded device can be, for example, a wearable device (such as a smart watch/bracelet, smart glasses, a true wireless stereo (True Wireless Stereo, TWS) headset, etc.), an ultra-mobile personal computer (ultra-mobile personal computer, UMPC), Netbooks, personal digital assistants (personal digital assistant, PDA), augmented reality (augmented reality, AR) equipment, virtual reality (virtual reality, VR) equipment, artificial intelligence (artificial intelligence, AI) equipment, vehicle equipment, smart home equipment and / or smart city equipment, etc. In addition, most Internet of Things (Internet of Things, IOT) devices are also embedded devices.

Referring to FIG. 2 , FIG. 2 exemplarily shows a schematic diagram of a hardware structure of an electronic device.

As shown in Figure 2, the electronic device may include: a processor 110, an external memory interface 120, an internal memory 121, a universal serial bus (universalserialbus, USB) interface 130, a charging management module 140, a power management module 141, a battery 142, and an antenna 1. Antenna 2, mobile communication module 150, wireless communication module 160, audio module 170, speaker 170A, receiver 170B, microphone 170C, earphone jack 170D, sensor module 180, button 190, motor 191, indicator 192, camera 193, display screen 194, and a subscriber identification module (subscriber identification module, SIM) card interface 195 and so on. Wherein, the sensor module 180 may include a pressure sensor 180A and a touch sensor 180B. Or the sensor module further includes a gyro sensor, an air pressure sensor, a magnetic sensor, an acceleration sensor, a distance sensor, a proximity light sensor, a fingerprint sensor, a temperature sensor, an ambient light sensor, a bone conduction sensor, etc., which are not shown.

It can be understood that, the structure shown in the embodiment of the present application does not constitute a specific limitation on the electronic device. In other embodiments of the present application, the electronic device may include more or fewer components than shown in the illustrations, or combine certain components, or separate certain components, or arrange different components. The illustrated components can be realized in hardware, software or a combination of software and hardware.

The processor 110 may include one or more processing units, for example: the processor 110 may include an application processor (application processor, AP), a modem processor, a graphics processing unit (graphics processing unit, GPU), an image signal processor (image signal processor, ISP), controller, memory, video codec, digital signal processor (digital signal processor, DSP), baseband processor, and/or neural network processor (neural-network processing unit, NPU), etc. Wherein, different processing units may be independent devices, or may be integrated in one or more processors.

Wherein, the controller may be the nerve center and command center of the electronic equipment. The controller can generate an operation control signal according to the instruction opcode and timing signal, and complete the control of fetching and executing the instruction.

A memory may also be provided in the processor 110 for storing instructions and data. In some embodiments, the memory in processor 110 is a cache memory. The memory may hold instructions or data that the processor 110 has just used or recycled. If the processor 110 needs to use the instruction or data again, it can be called directly from the memory. Repeated access is avoided, and the waiting time of the processor 110 is reduced, thereby improving the efficiency of the system.

In this embodiment of the application, after the processor 110 receives multiple scheduling requests for the file system from tasks initiated by the upper-layer application, it can sort the multiple scheduling requests according to the scheduling policy, and respond to the requests in order to schedule the embedded file system. The system performs file operations, and after completing the corresponding task, the processor 110 can also control the corresponding module to output the result of task execution. For example, when the processor 110 receives a request for playing music initiated by a music application and a request for recording GPS data initiated by a navigation application, it can first schedule the embedded file system to read the corresponding music file according to the scheduling strategy, and then The processor 110 can control the audio module 170 to play music; afterward, the processor 110 schedules the embedded file system to write the GPS data into the corresponding GPS file according to the scheduling strategy. Optionally, the processor 110 can control the display screen 194 to display the record Successful prompt message.

In particular, the electronic device provided in this application is an electronic device integrated with an embedded operating system as an example. Based on the description of the scenarios described in Figures 1A-1C above, when an embedded device executes multiple tasks through multiple threads , it is impossible to perform multiple tasks in parallel through multiple threads, so the technical problems mentioned above are prone to occur, but after the processor 110 adopts the scheduling strategy provided by this application, for multiple tasks to be executed, the processor 110 will Call the file system service to achieve the effect of executing multiple tasks in parallel through multiple threads, so as to avoid the starvation of threads and cause the application to freeze.

Regarding the specific implementation method for the processor 110 to sort the multiple scheduling requests according to the scheduling policy, reference may be made to the detailed description of the method flow in the following text, which will not be repeated here.

In some embodiments, processor 110 may include one or more interfaces. The interface may include an integrated circuit (inter-integrated circuit, I2C) interface, an integrated circuit built-in audio (inter-integrated circuits sound, I2S) interface, a pulse code modulation (pulse code modulation, PCM) interface, a universal asynchronous receiver/transmitter (universal asynchronous receiver/transmitter, UART) interface , mobile industry processor interface (mobile industry processor interface, MIPI), general-purpose input and output (general-purpose input/output, GPIO) interface, subscriber identity module (subscriber identity module, SIM) interface, and/or universal serial bus (universal serial bus, USB) interface, etc. .

It can be understood that the interface connection relationship between the modules shown in the embodiment of the present application is only a schematic illustration, and does not constitute a structural limitation of the electronic device. In other embodiments of the present application, the electronic device may also adopt different interface connection methods in the above embodiments, or a combination of multiple interface connection methods.

The charging management module 140 is configured to receive a charging input from a charger. Wherein, the charger may be a wireless charger or a wired charger. In some wired charging embodiments, the charging management module 140 can receive charging input from the wired charger through the USB interface 130 . In some wireless charging embodiments, the charging management module 140 may receive wireless charging input through a wireless charging coil of the electronic device. While the charging management module 140 is charging the battery 142 , it can also supply power to the electronic device through the power management module 141 .

The power management module 141 is used for connecting the battery 142 , the charging management module 140 and the processor 110 . The power management module 141 receives the input from the battery 142 and/or the charging management module 140 to provide power for the processor 110 , the internal memory 121 , the external memory, the display screen 194 , the camera 193 , and the wireless communication module 160 . The power management module 141 can also be used to monitor parameters such as battery capacity, battery cycle times, and battery health status (leakage, impedance). In some other embodiments, the power management module 141 may also be disposed in the processor 110 . In some other embodiments, the power management module 141 and the charging management module 140 may also be set in the same device.

The wireless communication function of the electronic device can be realized by the antenna 1, the antenna 2, the mobile communication module 150, the wireless communication module 160, the modem processor and the baseband processor.

Antenna 1 and Antenna 2 are used to transmit and receive electromagnetic wave signals. Each antenna in an electronic device can be used to cover a single or multiple communication frequency bands. Different antennas can also be multiplexed to improve the utilization of the antennas. For example: Antenna 1 can be multiplexed as a diversity antenna of a wireless local area network. In other embodiments, the antenna may be used in conjunction with a tuning switch.

The mobile communication module 150 can provide wireless communication solutions including 2G/3G/4G/5G applied to electronic devices. The mobile communication module 150 may include at least one filter, switch, power amplifier, low noise amplifier (low noise amplifier, LNA) and the like. The mobile communication module 150 can receive electromagnetic waves through the antenna 1, filter and amplify the received electromagnetic waves, and send them to the modem processor for demodulation. The mobile communication module 150 can also amplify the signals modulated by the modem processor, and convert them into electromagnetic waves and radiate them through the antenna 1 . In some embodiments, at least part of the functional modules of the mobile communication module 150 may be set in the processor 110 . In some embodiments, at least part of the functional modules of the mobile communication module 150 and at least part of the modules of the processor 110 may be set in the same device.

A modem processor may include a modulator and a demodulator. Wherein, the modulator is used for modulating the low-frequency baseband signal to be transmitted into a medium-high frequency signal. The demodulator is used to demodulate the received electromagnetic wave signal into a low frequency baseband signal. Then the demodulator sends the demodulated low-frequency baseband signal to the baseband processor for processing. The low-frequency baseband signal is passed to the application processor after being processed by the baseband processor. The application processor outputs sound signals through audio equipment (not limited to speaker 170A, receiver 170B, etc.), or displays images or videos through display screen 194 . In some embodiments, the modem processor may be a stand-alone device. In some other embodiments, the modem processor may be independent of the processor 110, and be set in the same device as the mobile communication module 150 or other functional modules.

The wireless communication module 160 can provide wireless local area networks (wireless local area networks, WLAN) (such as wireless fidelity (Wi-Fi) network), bluetooth (bluetooth, BT), global navigation satellite system ( Global navigation satellite system (GNSS), frequency modulation (frequency modulation, FM), near field communication (near field communication, NFC), infrared technology (infrared, IR) and other wireless communication solutions. The wireless communication module 160 may be one or more devices integrating at least one communication processing module. The wireless communication module 160 receives electromagnetic waves via the antenna 2 , demodulates and filters the electromagnetic wave signals, and sends the processed signals to the processor 110 . The wireless communication module 160 can also receive the signal to be sent from the processor 110 , frequency-modulate it, amplify it, and convert it into electromagnetic waves through the antenna 2 for radiation.

In some embodiments, the antenna 1 of the electronic device is coupled to the mobile communication module 150, and the antenna 2 is coupled to the wireless communication module 160, so that the electronic device can communicate with the network and other devices through wireless communication technology. The wireless communication technology may include global system for mobile communications (GSM), general packet radio service (general packet radio service, GPRS), code division multiple access (code division multiple access, CDMA), wideband code wideband code division multiple access (WCDMA), time-division code division multiple access (TD-SCDMA), long term evolution (LTE), BT, GNSS, WLAN, NFC, FM, and/or IR technology, etc. The GNSS may include a global positioning system (global positioning system, GPS), a global navigation satellite system (globalnavigation satellite system, GLONASS), a Beidou satellite navigation system (beidou navigationsatellite system, BDS), a quasi-zenith satellite system (quasi-zenith) satellite system (QZSS) and/or satellite based augmentation systems (SBAS).

In the embodiment of the present application, the electronic device can communicate with other electronic devices, servers, etc. through the mobile communication module 150 and the wireless communication module 160 to receive and download file resources, and store these file resources in the local external memory module, For subsequent electronic devices to read and write these file resources.

The electronic device realizes the display function through the GPU, the display screen 194, and the application processor. The GPU is a microprocessor for image processing, and is connected to the display screen 194 and the application processor. GPUs are used to perform mathematical and geometric calculations for graphics rendering. Processor 110 may include one or more GPUs that execute program instructions to generate or change display information.

The display screen 194 is used to display images, videos and the like. The display screen 194 includes a display panel. The display panel may be a liquid crystal display (LCD). The display panel can also use organic light-emitting diodes (organic light-emitting diode, OLED), active-matrix organic light-emitting diodes or active-matrix organic light-emitting diodes (active-matrix organic light emitting diode, AMOLED), flexible light-emitting diodes (flexlight-emitting diode, FLED), miniled, microLed, micro-oled, quantum dot light emitting diodes (quantum dot light emitting diodes, QLED), etc. In some embodiments, the electronic device may include 1 or N display screens 194, where N is a positive integer greater than 1.

In this embodiment of the present application, the display screen 194 of the electronic device can be used to display the user interface of the task execution result. For example, when the task request initiated by the upper-layer application is to request to open the gallery, memo, etc., the electronic device will execute the corresponding After the operation of reading the file, information such as images contained in the gallery and events recorded in the memorandum can be displayed through the display screen 194 .

The electronic device can realize the shooting function through ISP, camera 193 , video codec, GPU, display screen 194 and application processor.

The ISP is used for processing the data fed back by the camera 193 . For example, when taking a picture, open the shutter, the light is transmitted to the photosensitive element of the camera through the lens, and the light signal is converted into an electrical signal, and the photosensitive element of the camera transmits the electrical signal to the ISP for processing, and converts it into an image visible to the naked eye. ISP can also perform algorithm optimization on image noise, brightness, and skin color. ISP can also optimize the exposure, color temperature and other parameters of the shooting scene. In some embodiments, the ISP may be located in the camera 193 .

Camera 193 is used to capture still images or video. The object generates an optical image through the lens and projects it to the photosensitive element. The photosensitive element may be a charge coupled device (charge coupled device, CCD) or a complementary metal-oxide-semiconductor (complementary metal-oxide-semiconductor, CMOS) phototransistor. The photosensitive element converts the light signal into an electrical signal, and then transmits the electrical signal to the ISP to convert it into a digital image signal. The ISP outputs the digital image signal to the DSP for processing. DSP converts digital image signals into standard RGB, YUV and other image signals. In some embodiments, the electronic device may include 1 or N cameras 193, where N is a positive integer greater than 1.

In the embodiment of the present application, the images captured by the camera 193 can be stored in the gallery file of the external storage module, so that the processor 110 can view, delete, edit pictures, change the position of pictures, etc. by operating the gallery file.

Digital signal processors are used to process digital signals. In addition to digital image signals, they can also process other digital signals. For example, when an electronic device selects a frequency point, a digital signal processor is used to perform Fourier transform on the frequency point energy, etc.

Video codecs are used to compress or decompress digital video. An electronic device may support one or more video codecs. In this way, the electronic device can play or record videos in various encoding formats, such as: moving picture experts group (moving picture experts group, MPEG) 1, MPEG2, MPEG3, MPEG4 and so on.

In the embodiment of the present application, in scenarios such as screen sharing, remote control, and screen projection, the electronic device needs to use a video codec to encode the content currently displayed on the display screen 194 into a video stream and then send it to other electronic devices.

The internal memory 121 may include one or more random access memories (random access memory, RAM) and one or more non-volatile memories (non-volatile memory, NVM).

Random access memory may include static random-access memory (SRAM), dynamic random access memory (DRAM), synchronous dynamic random access memory (synchronous dynamic random access memory, SDRAM), double data rate synchronous Dynamic random access memory (double data rate synchronous dynamic random access memory, DDR SDRAM, such as the fifth generation DDR SDRAM is generally called DDR5 SDRAM), etc.;

Non-volatile memory may include magnetic disk storage devices, flash memory (flash memory).

According to the operating principle, flash memory can include NOR FLASH, NAND FLASH, 3D NAND FLASH, etc. According to the potential order of storage cells, it can include single-level storage cells (single-level cell, SLC), multi-level storage cells (multi-level cell, MLC), triple-level cell (TLC), quad-level cell (QLC), etc., can include universal flash storage (English: universal flash storage, UFS), An embedded multimedia memory card (embedded multi media Card, eMMC), etc.

The random access memory can be directly read and written by the processor 110, and can be used to store executable programs (such as machine instructions) of an operating system or other running programs, and can also be used to store data of users and application programs.

The non-volatile memory can also store executable programs and data of users and application programs, etc., and can be loaded into the random access memory in advance for the processor 110 to directly read and write.

The external memory interface 120 can be used to connect an external non-volatile memory, so as to expand the storage capacity of the electronic device. The external non-volatile memory communicates with the processor 110 through the external memory interface 120 to implement a data storage function. For example, files such as music and video are stored in an external non-volatile memory.

In the embodiment of the present application, the external memory module includes: a built-in nonvolatile memory of the electronic device and an external nonvolatile memory connected to the electronic device through the external memory interface 120 . The external memory module refers to a memory that cannot be directly read and written by the processor 110 of the electronic device, rather than simply referring to a memory outside the electronic device in a spatial structure. The external memory module can be used to store music, video or various log files, etc. The electronic device can implement audio functions through the audio module 170, the speaker 170A, the receiver 170B, the microphone 170C, the earphone interface 170D, and the application processor. Such as music playback, recording, etc.

The audio module 170 is used to convert digital audio information into analog audio signal output, and is also used to convert analog audio input into digital audio signal. The audio module 170 may also be used to encode and decode audio signals. In some embodiments, the audio module 170 may be set in the processor 110 , or some functional modules of the audio module 170 may be set in the processor 110 .

Speaker 170A, also referred to as a "horn", is used to convert audio electrical signals into sound signals. The electronic device can listen to music through speaker 170A, or listen to hands-free calls.

Receiver 170B, also called "earpiece", is used to convert audio electrical signals into sound signals. When the electronic device receives a call or a voice message, it can listen to the voice by placing the receiver 170B close to the human ear.

The microphone 170C, also called "microphone" or "microphone", is used to convert sound signals into electrical signals. When making a phone call or sending a voice message, the user can put his mouth close to the microphone 170C to make a sound, and input the sound signal to the microphone 170C. The electronic device may be provided with at least one microphone 170C. In other embodiments, the electronic device can be provided with two microphones 170C, which can also implement a noise reduction function in addition to collecting sound signals. In some other embodiments, the electronic device can also be equipped with three, four or more microphones 170C to realize the collection of sound signals, noise reduction, identification of sound sources, and realization of directional recording functions, etc.

The earphone interface 170D is used for connecting wired earphones. The earphone interface 170D may be the USB interface 130, or a 3.5mm open mobile terminal platform (OMTP) standard interface, or a cellular telecommunications industry association of the USA (CTIA) standard interface.

In this embodiment of the application, after the electronic device reads the music file from the external storage module, the audio module 170 can convert the digital audio information of the music file into an analog audio signal, and then output the music through the speaker 170A or the receiver 170B.

The pressure sensor 180A is used to sense the pressure signal and convert the pressure signal into an electrical signal. In some embodiments, pressure sensor 180A may be disposed on display screen 194 . There are many types of pressure sensors 180A, such as resistive pressure sensors, inductive pressure sensors, and capacitive pressure sensors. A capacitive pressure sensor may be comprised of at least two parallel plates with conductive material. When a force is applied to the pressure sensor 180A, the capacitance between the electrodes changes. Electronics determine the strength of the pressure based on the change in capacitance. When a touch operation acts on the display screen 194, the electronic device detects the intensity of the touch operation according to the pressure sensor 180A. The electronic device may also calculate the touched position according to the detection signal of the pressure sensor 180A. In some embodiments, touch operations acting on the same touch position but with different touch operation intensities may correspond to different operation instructions. For example: when a touch operation with a touch operation intensity less than the first pressure threshold acts on the short message application icon, an instruction to view short messages is executed. When a touch operation whose intensity is greater than or equal to the first pressure threshold acts on the icon of the short message application, the instruction of creating a new short message is executed.

The touch sensor 180B is also called "touch panel". The touch sensor 180B can be disposed on the display screen 194, and the touch sensor 180B and the display screen 194 form a touch screen, also called “touch screen”. The touch sensor 180B is used to detect a touch operation on or near it. The touch sensor can pass the detected touch operation to the application processor to determine the type of touch event. Visual output related to the touch operation can be provided through the display screen 194 . In some other embodiments, the touch sensor 180B may also be disposed on the surface of the electronic device, which is different from the position of the display screen 194 .

In the embodiment of the present application, the pressure sensor 180A and the touch sensor 180B can be used to collect data related to click, press, slide or long press operations on the display screen 194, and report these data to the processor 110 for processing The controller 110 determines corresponding events according to these data, so as to control corresponding modules of the electronic device to execute corresponding events. For example, the touch sensor 180B of the electronic device can collect data related to the touch operation on the control provided by the music application to play local music, and report the data to the processor 110. Through analysis, the processor 110 can determine that The music application initiates a request for the task of playing music, and in response to the request, the processor 110 may read a corresponding music file from the external storage module to execute the task of playing music.

The keys 190 include a power key, a volume key and the like. The key 190 may be a mechanical key. It can also be a touch button. The electronic device can receive key input and generate key signal input related to user settings and function control of the electronic device.

The motor 191 can generate a vibrating reminder. The motor 191 can be used for incoming call vibration prompts, and can also be used for touch vibration feedback. For example, touch operations applied to different applications (such as taking pictures, playing audio, etc.) may correspond to different vibration feedback effects. The motor 191 may also correspond to different vibration feedback effects for touch operations acting on different areas of the display screen 194 . Different application scenarios (for example: time reminder, receiving information, alarm clock, games, etc.) can also correspond to different vibration feedback effects. The touch vibration feedback effect can also support customization.

The indicator 192 can be an indicator light, and can be used to indicate charging status, power change, and can also be used to indicate messages, missed calls, notifications, and the like.

The SIM card interface 195 is used for connecting a SIM card. The SIM card can be inserted into the SIM card interface 195 or pulled out from the SIM card interface 195 to realize contact and separation with the electronic device. The electronic device can support 1 or N SIM card interfaces, where N is a positive integer greater than 1. SIM card interface 195 can support Nano SIM card, Micro SIM card, SIM card and so on. Multiple cards can be inserted into the same SIM card interface 195 at the same time. The types of the multiple cards may be the same or different. The SIM card interface 195 is also compatible with different types of SIM cards. The SIM card interface 195 is also compatible with external memory cards. The electronic device interacts with the network through the SIM card to realize functions such as calling and data communication. In some embodiments, the electronic device adopts an eSIM, that is, an embedded SIM card. The eSIM card can be embedded in the electronic device and cannot be separated from the electronic device.

Referring to FIG. 3 , FIG. 3 is a structural block diagram of a software system of an electronic device according to an embodiment of the present application.

As shown in FIG. 3 , the software system of the electronic device integrated with the embedded operating system adopts a layered architecture. Among them, the layered architecture divides the software into several layers, and each layer has a clear role and division of labor. Layers communicate through software interfaces. In some implementations, the embedded operating system is divided into four layers, which are application program layer, application program framework layer, algorithm and internal library, and kernel layer from top to bottom.

The application layer can consist of a series of application packages. With the integrated embedded operating system, the application program can include, for example: map, music, gallery, camera, and calendar not shown, call, navigation, WLAN, Bluetooth, video, short message, alarm clock, sports health, weather, etc. These applications run on the embedded operating system, and are generally separate from the embedded operating system. The application software is used to realize the control function of the controlled object. The application software layer is to face the controlled object and the user. To facilitate the user's operation, a human-computer interaction interface is usually provided.

The framework layer provides application programming interface (application programming interface, API) and programming framework for the application program of the application program layer, that is, the application program layer accesses/calls the services provided by the application program framework layer through the Framework API, for example, including the basic system shown in Figure 3 Capability services, hardware services, underlying software services, etc.

In particular, in the embodiment of the present application, in order to realize the reasonable scheduling of the file system in the embedded operating system, a new file system scheduling service is added. The file system scheduling service can be integrated in the underlying software service, that is, it is different from The file system service (that is, the file system mentioned in this application) in the underlying software service is at the same level, and the communication between the two is realized through the message service request. Alternatively, the file system scheduling service may also be independently set at the application framework layer, algorithm and internal library or kernel layer, etc., which is not limited in this embodiment of the present application.

Understandably, in addition to the above-mentioned file system services and file system scheduling services, the underlying software services may also include content management services, log services, sensor management services, Bluetooth management services, etc., which will not be listed here. Applications are not limited to this.

In this embodiment of the application, when the upper layer application initiates a task, or other services in the application framework layer initiate a task, if the task includes one or more file operation instructions, the file system scheduling service can receive the file operation instruction Instructions are multiple call requests to the file system at the granularity. For example, when task A includes file operation instruction 1, file operation instruction 2, and file operation instruction 3, the application can carry file operation instruction 1 in scheduling request 1, file operation instruction 2 in scheduling request 2, and file operation instruction 2 in scheduling request 2. Instruction 3 is carried in scheduling request 3, and sends scheduling request 1, scheduling request 2, and scheduling request 3 to the file system scheduling service. Then, the file system scheduling service sorts the calling requests of the upper-layer application file system according to the scheduling policy, so as to select the most urgent scheduling request at present, and send the most urgent scheduling request to the file system service. The carried file operation command performs file scheduling, which is equivalent to the file system scheduling service sending the most urgent scheduling request to the actual embedded file system for file operation. Correspondingly, when the file system service completes the scheduling and obtains the corresponding result, it will transmit the obtained result to the file system scheduling service through the interface with the file system scheduling service, and then the file system scheduling service will return it to the provider of the scheduling request. or, the corresponding task.

For the specific implementation method of sorting multiple invocation requests by the file system scheduling service according to the scheduling policy, reference may be made to the introduction of the method embodiments below, and details will not be repeated here.

Algorithms and internal libraries are used to manage various algorithms, such as liveness detection algorithms, gesture algorithms, wearing detection algorithms, dimming algorithms, etc., and various basic libraries, such as basic libraries for security, barcode, and payment, as well as those provided by chip manufacturers. Protocol stacks, such as traditional Bluetooth protocol stacks, low-power protocol stacks, etc.

It should be understood that the above description is only an example for better understanding of the technical solution of this embodiment, and is not the only limitation to this embodiment.

The kernel layer includes the kernel core, the hardware abstraction layer (HAL), and the hardware driver layer. In practical applications, the kernel core can interact with the upper layer through the Cortex Microcontroller Software Interface Standard (CMSIS) API, and the hardware abstraction layer can interact with the upper layer through the HAL API.

HAL can separate the upper-layer software of the system from the underlying hardware, so that developers of the upper-layer software of the system do not need to care about the situation of the underlying hardware, and can develop according to the interface provided by HAL. HAL can also be understood as part of the hardware driver layer. In some embodiments, the application layer can directly call the hardware driver layer through the framework layer. In other embodiments, the appearance of the hardware adaptation layer is to deal with the situation that the electronic device adopts multi-platform hardware. The hardware driver interface provided by the platform is re-encapsulated to maintain a unified external interface, so that the upper-level software developers of the system do not need to care about the underlying hardware, and can develop according to the interface provided by HAL.

The kernel layer contains all the drivers required for the normal operation of onboard hardware resources, and provides APIs for upper layer calls. The kernel layer includes display drivers, camera drivers, audio drivers, sensor drivers, etc., for example.

Based on the above introduction to the software and hardware architecture of the electronic device, a flow chart of a scheduling method for an embedded file system provided by the present application is introduced next.

As shown in Figure 4, the method flow includes the following steps:

S101. The electronic device generates multiple tasks, and one task includes one or more scheduling requests.

Specifically, one or more applications or services in the electronic device may generate multiple tasks by self-triggering or triggering according to user operations during operation, and the electronic device creates multiple threads to execute the multiple tasks. One of the tasks may include multiple file operations, and each file operation corresponds to a scheduling request, and the scheduling request is used to schedule the embedded file system to execute the corresponding file operation. That is to say, the file scheduling request corresponding to each task is generated at the granularity of the file operations included in each task. In addition, the above multiple scheduling requests may be generated by the electronic device simultaneously or within a short period of time.

Taking a specific example, when music, navigation and other applications are installed in the electronic device, when the music receives an operation input by the user for playing music, the music application will create a thread to perform the task of playing music , the task may involve multiple operations for reading music files, so the file system scheduling service in the embedded operating system of the electronic device may receive multiple scheduling requests to the file system initiated by tasks in the music application. When the navigation application receives the operation input by the user to enable the GPS function, the navigation application will create a thread to perform the task of recording GPS data. This task involves multiple operations of writing GPS files, so the embedded The file system scheduling service in the operating system may receive multiple scheduling requests to the file system initiated by tasks in the navigation application.

S102, the electronic device sequentially responds to multiple scheduling requests according to the priority of the tasks and/or the waiting time of the scheduling requests.

Specifically, the application or service in the electronic device sends multiple scheduling requests corresponding to multiple tasks to the file system scheduling service, and the file system scheduling service responds to multiple scheduling requests in sequence according to the priority of the task and/or the waiting time of the scheduling request. Request, that is, sequentially schedule the corresponding file system to execute the corresponding file operation.

Wherein, the file system scheduling service responds to multiple scheduling requests sequentially according to the priority of the task and/or the waiting time of the scheduling request, and specifically responds according to the following three strategies.

Strategy 1: Select the scheduling request corresponding to the task with the highest priority from multiple unresponsed scheduling requests each time as the target scheduling request (also called the most urgent scheduling request) to respond, if the task with the highest priority corresponds to When there are multiple scheduling requests, they will be responded in sequence according to the arrival time of the scheduling requests from front to back.

Strategy 2: Select the scheduling request whose waiting time reaches the corresponding first threshold from multiple scheduling requests each time as the target scheduling request (also called the most urgent scheduling request) to respond, if the scheduling request whose waiting time reaches the corresponding first threshold When there are multiple requests, they will be responded in sequence according to the arrival time of the scheduling requests from front to back.

Strategy 3: Considering that in the case of busy business, when multiple scheduling requests are received at the same time or in a short period of time, there may be multiple scheduling requests corresponding to tasks of the same priority in the multiple scheduling requests, or there may be waiting Multiple scheduling requests whose time is greater than the corresponding first threshold, so the two factors of task priority and waiting time can be considered at the same time to select the target scheduling request from the unresponsed scheduling requests to respond, specifically including Out of the following steps:

S1031. The electronic device adds multiple scheduling requests to the first queue.

Specifically, the file system scheduling service of the electronic device first adds multiple received scheduling requests to the first queue. Optionally, the file system scheduling service may sequentially add multiple corresponding scheduling requests to the first queue in order of priority of tasks from high to low.

In this application, the first queue is also called a common queue.

S1032. The electronic device selects a scheduling request with the highest priority from the unresponded scheduling requests in the first queue to respond.

Specifically, in the initial situation, the waiting time of unresponsive scheduling requests in the first queue is usually short, and has not yet reached the corresponding first threshold (also known as the starvation time), so the file system scheduling service of the electronic device starts from Select the scheduling request with the highest priority from the scheduling requests that have not been responded in the first queue to respond. If there are multiple scheduling requests corresponding to the task with the highest priority, the scheduling request that arrives first and has the highest priority is selected for response according to the arrival time of the scheduling request.

S1033. The electronic device judges whether the waiting time of unresponsed scheduling requests in the first queue reaches a first threshold.

Specifically, as the electronic device responds to the scheduling requests in the first queue, the waiting time of the unresponsed scheduling requests in the first queue usually gradually increases. Therefore, it is necessary to detect in time the scheduling request whose waiting time reaches (greater than or equal to) the first threshold, so as to implement the subsequent strategy of timely response.

If the electronic device determines that there are unresponsive scheduling requests whose waiting time reaches the first threshold in the first queue, the electronic device executes subsequent steps S1034-S1036; otherwise, the electronic device executes S1032-S1033 in a loop.

S1034. The electronic device adds scheduling requests that have not been responded to in the first queue and whose waiting time reaches the first threshold to the second queue.

Specifically, as the electronic device responds to the scheduling requests in the first queue, the waiting time of the unresponded scheduling requests in the first queue usually increases gradually, that is, the waiting time of one or more scheduling requests reaches the corresponding starvation time, therefore, one or more scheduling requests whose waiting time of the file system scheduling service of the electronic device reaches the corresponding starvation time are moved to the second queue for subsequent priority response. In this application, the second queue is also called the VIP queue.

S1035. The electronic device selects a scheduling request with the highest priority from the unresponded scheduling requests in the second queue to respond.

Specifically, since the scheduling requests in the second queue are all scheduling requests that have reached the corresponding starvation time, that is, scheduling requests that have high real-time requirements and are about to time out, compared with those in the first queue that have not reached the corresponding starvation time For scheduling requests, the file system scheduling service of the electronic device should give priority to selecting the scheduling request with the highest priority from the scheduling requests that have not been responded to in the second queue to respond. If there are multiple scheduling requests corresponding to the task with the highest priority, the scheduling request that arrives first and has the highest priority is selected for response according to the arrival time of the scheduling request. In this way, it can be guaranteed that scheduling requests with high priority and high real-time requirements can be responded as soon as possible.

(Optional step) S1036. The electronic device determines whether the second queue is empty, or whether the duration of continuously responding to the scheduling requests in the second queue exceeds a second threshold.

Specifically, during the process of responding to the scheduling request in the second queue, the file system scheduling service of the electronic device will record the duration of continuously responding to the scheduling request in the second queue, and determine whether the second queue is still empty.

When it is judged that the second queue is empty, or the duration of continuously responding to the scheduling requests in the second queue reaches a second threshold (also known as the full time), the electronic device jumps to execute S1032. When it is determined that the second queue is not empty, and the duration of continuously responding to the scheduling requests in the second queue does not reach (less than) the second threshold (also known as the full time), the electronic device jumps to the aforementioned step S1035.

Optionally, after the electronic device executes step S1035, it may continue to step S1035 until there is no unresponsive scheduling request in the second queue, and then jump to execute S1032. That is to say, the electronic device does not need to consider the full time of the second queue, as long as there are scheduling requests from the waiting time to the starvation time in the second queue, it will continue to respond to the scheduling requests in the second queue until the second queue is empty.

The priority of the task corresponding to the scheduling request (also referred to as the priority of the scheduling request) is determined according to the degree of dependence of the upper-layer application initiating the task on the file system. For example, for applications that initiate sensor tasks, display tasks, over-the-air tasks, audio tasks, and GPS tasks, these applications usually have a high degree of dependence on the file system, so the priority of such tasks is set higher; For applications of input, capability tasks (such as Bluetooth transmission tasks, tasks of various drivers in the platform) and log tasks, these applications have low dependence on the file system, and the priority of such tasks can be set lower. In particular, the scheduling requests corresponding to the above sensor tasks and the scheduling requests corresponding to the display tasks have high requirements for real-time performance. Therefore, the priority of the sensor tasks and display tasks can be set higher; while the recording system/program running process The scheduling request corresponding to the log task of the generated data has low real-time requirements, so the priority of the log task can be set lower.

For the priority division of tasks, please refer to Table 1 for details.

Table 1 priority policy table

task Priority (the larger the value, the higher the priority) Sensor task 37 Display task 36 Input task 34 OTA task 34 Audio task 33 Ability task 25 Log task 0

It should be understood that the above description and the content shown in Table 1 are only examples for better understanding of the technical solution of this embodiment, and are not intended as the only limitation to this embodiment.

Through the above description of different task priority settings, the starvation time configured in the scheduling request corresponding to different tasks can also be set according to the priority. For example, the higher the priority, the higher the real-time requirement, and the corresponding starvation time can be The smaller the value, the lower the priority, the lower the real-time requirement and the greater the hunger time. Based on this principle, the starvation time configured for scheduling requests corresponding to different tasks can be shown in Table 2.

Table 2 Starvation time strategy table

It can be understood that the starvation time corresponding to tasks with different priorities recorded in Table 2 is only an example for better understanding the technical solution of this embodiment, and is not the only limitation to this embodiment. In practical applications, the starvation time policy can be recorded in any form such as a table or XML that can reflect the relationship between the priority and the starvation time.

Optionally, the method described in FIG. 5 may further include the following steps: after executing step S1036 and jumping to execute S1032, the duration of continuous response to the scheduling request in the first queue will also be recorded, and when the duration reaches the first When the queue is full, it can also switch to respond to the scheduling request in the second queue.

Optionally, the ordinary queues and VIP queues included in the method flow described in Figure 5 are only examples. In other examples of this application, more queues can also be set, and different queues have different priorities. Different queues The time to be full is different. Set multiple starvation times for each scheduling request, and add scheduling requests with waiting times in different ranges to corresponding queues. Scheduling requests in queues with higher priorities can be responded to first. When the total duration of the continuous response of the scheduling request reaches the corresponding full time, it will switch to respond to the scheduling request in the queue with a lower priority than the current queue.

Optionally, the method flow shown in Figure 5 may also include the following steps:

On the basis of the file system scheduling service provided by this application, it is also possible to dynamically adjust the priority of the task corresponding to the above scheduling request, the starvation time corresponding to each scheduling request, or the full time corresponding to each queue, etc. One or more items, so that the file system scheduling service can adapt to changes in the business characteristics of the upper-layer application (that is, the user's use requirements). When selecting a target scheduling request each time, the target scheduling request can be selected according to a more reasonable scheduling strategy. Further improve the scheduling capability of file system services.

Specifically, the method for adjusting priority, hunger time, and full time may be dynamically adjusted according to DFT data collected periodically during the user's use of the electronic device, for example. In this embodiment, DFT data includes, but is not limited to, any one or more of the following: scheduler statistical information (i.e. TaskId or application identifier of the upper-layer application), file request times (recording the number of times each file is scheduled), scheduled The upper-layer application with the most requests within a set time (for example, within 1 second), the number of failed scheduling requests corresponding to the upper-layer application, the response time from when the upper-layer application triggers the scheduling request to the completion of processing, the waiting time of each scheduling request in the normal queue, and the VIP queue the total running time, etc.

In order to collect the above DFT data and update the file service scheduling policy followed by the file system scheduling service according to the collected DFT data, this embodiment introduces a DFT data collection module into the structure of the above file system scheduling service. Exemplarily, in some implementation manners, there may be one DFT data collection module; in other implementation manners, there may be multiple DFT data collection modules. From the content collected in the DFT data listed above, it can be seen that the statistical information of the caller and the number of file requests are obtained from the encapsulation module in the file system scheduling service, while other information can be obtained in the scheduling module or in the encapsulation module Obtain.

From the above introduction to the flow chart of the embedded file system scheduling method shown in Figure 5, it can be known that the scheduling method of the embedded file system provided by this application not only takes into account the real-time requirements of each scheduling request, but also takes into account Guarantees the fairness requirements of the overall scheduling request. Specifically, by setting multiple queues with different priorities such as the normal queue (low priority) and VIP queue (high priority) above, the queue with high priority is used to accommodate scheduling requests whose waiting time is about to reach the business requirement. The lower-priority queue is used to accommodate scheduling requests whose waiting time has not reached the service requirement. In order to ensure the real-time requirements of scheduling requests, priority is given to responding to scheduling requests in high-priority queues. In addition, in order to ensure the fairness of the overall scheduling request, a total time threshold for responding to scheduling requests in the high-priority queue is also set. When the threshold is reached, it will switch to respond to scheduling requests in the low-priority queue. And, in order to further meet the required duration of the business to which each scheduling request belongs, that is, to further meet the real-time requirements of each scheduling request, when responding to scheduling requests in each queue, the urgency is ranked from high to low (the scheduling request corresponds to The priority of the task is from high to low) to respond in turn.

Next, take a specific method of selecting a target scheduling request and responding to the target scheduling request described in the third step in step S102 as an example, and combine the embedded system architecture introduced in Figure 3 above to introduce in detail an embedded The scheduling method for the file system.

Referring to FIG. 6 , FIG. 6 schematically shows a file system scheduling framework diagram in an embedded system provided by an embodiment of the present application.

As shown in FIG. 6, the file system scheduling service in the embedded system architecture may include: an encapsulation module, a scheduling module and an execution module.

The encapsulation module is used to receive multiple scheduling requests to the file system from tasks initiated by upper-layer applications, and extract information such as file operation instructions and task identification numbers from the scheduling requests, and encapsulate the extracted information into a structure according to a predetermined format. The scheduling request is transmitted in the embedded operating system in the form of a structure. The multiple scheduling requests include, for example, the scheduling requests of task 1, task 2, task 3, and task 4 shown in FIG. 6, or may also include more or fewer scheduling requests, which is not limited in the present application.

It can be understood that the scheduling request mentioned in the implementation of this application refers to the scheduling request provided by the task triggered by the upper layer application or other services. A task may contain one or more scheduling requests. For example, for reading files In terms of tasks, the file read task can include any one or several file operation instructions in r1, r2, r3, and r4 as mentioned above, so the read task initiates a corresponding one or more file operation instructions at the granularity of the file operation instruction Multiple dispatch requests.

In one embodiment, the structure obtained by encapsulating each scheduling request by the encapsulation module includes but is not limited to the following parameters: file object structure (FIP), file name (FileName), file operation instruction (OperaCmd), upper layer application Task identification number (TsakId), file information structure (FILINF), current scheduling status (EnuFlag), timeout waiting time (WaitTime), hunger time (HungtryTime), file operation return result (FileOperaErr), etc. Among them, the parameters FIP, FileName, OperaCmd, TsakId, WaitTime, etc. can be assigned values in the encapsulation module, specifically, the encapsulation module extracts information from the received scheduling request to assign values. The remaining parameters can be assigned by subsequent corresponding modules. That is to say, the scheduling request output by the encapsulation module, that is, the scheduling request sent in ② in Figure 6, only has specific information on the parameters of FIP, FileName, OperaCmd, TsakId, and WaitTime, while HungtryTimeEnuFlag and FileOperaErr These parameters have no specific information.

The scheduling module selects the most urgent scheduling request (the scheduling request with the highest priority) from the multiple scheduling requests as the target scheduling request, and sends the selected target scheduling request to the execution module. Wherein, step ③ in FIG. 6 , that is, the specific steps involved in selecting a target scheduling request by the scheduling module and sending it to the scheduling module can refer to the description of steps S1031-S1036 above, and will not be repeated here.

Among them, the method for obtaining the priority of the task and the starvation time includes: the scheduling module can obtain the priority of the task corresponding to the scheduling request according to the specific parameter TsakId in the structure representing each scheduling request; The specific parameter in the structure of a scheduling request is HungtryTime, or the hunger time corresponding to the scheduling request.

In addition, the scheduling module is also used to assign values to specific parameters in the structure representing each scheduling request, including assigning values to EnuFlag and HungtryTime. Specifically, the scheduling module can obtain the hunger time corresponding to the scheduling request according to the TsakId of the scheduling request, thereby assigning a value to HungtryTime, and the scheduling module assigns a value to EnuFlag according to whether the scheduling request is responded, for example, 0 indicates that it has not been responded, and 1 means ID has been responded to, etc.

The execution module is used to receive the target scheduling request selected by the scheduling module. In response to the target scheduling request, the execution module can send the target scheduling request to the file system service, that is, execute step ④, and the file system service schedules the corresponding file system interface to execute The corresponding file operation, after obtaining the processing result, will send the processing result to the execution module, that is, execute step ⑤. Then, after the execution module obtains the processing result returned by the file system service, the execution module also sends information including the processing result to the encapsulation module.

Or, in another possible implementation method, after the execution module receives the target scheduling request selected by the scheduling module, in response to the target scheduling request, the execution module can directly schedule the corresponding file system interface to execute the corresponding file operation. After the module obtains the processing result, it will send the processing result to the encapsulation module, that is, execute step ⑥.

In addition, the execution module is also used to assign values to specific parameters in the structure representing each scheduling request, including the FileOperaErr parameter. Specifically, after the execution module dispatches the file system to respond to the dispatch request, it can obtain the execution result returned by the file system, and then the execution module sets the value of the FileOperaErr parameter according to the execution result.

Finally, the execution module returns the information including the execution result to the upper application through the encapsulation module. Specifically, the execution module may return the information including the returned result to the encapsulation module first, and the information including the returned result may be, for example, a structure representing each scheduling request after the FileOperaErr parameter has been assigned a value. In some instances, the returned execution result may be actually read data, for example.

Next, with reference to FIG. 7 , the technical effects that can be achieved by the method provided by the present application will be introduced.

Referring to FIG. 7 , FIG. 7 exemplarily shows a scheduling logic diagram for an embedded file system in two task scenarios provided by an embodiment of the present application.

As shown in Figure 7, when the upper-layer application or service of the electronic device initiates task1 and task2 successively, a thread Thread1-task1 can be created to execute task1, and a thread Thread1-task2 can be created to execute task2.

Wherein, when the three files included in task1 are operated, three scheduling requests Req1, Req2 and Req3 are correspondingly generated. When the two files included in task2 are operated, two scheduling requests Req4 and Req5 are correspondingly generated.

Regarding the sequence of arrival times of scheduling requests corresponding to task1 and task2, reference may be made to the description of FIG. 8 below.

FIG. 8 exemplarily shows a logic diagram of a scheduling request response to a file system in an embedded system provided by an embodiment of the present application.

Referring to (1) in FIG. 8 , in an initial situation, when the electronic device has no scheduling request to be responded to, both the common queue and the VIP queue are empty.

Referring to (2) in Figure 8, when the file system scheduling service of the electronic device receives scheduling requests Req1, Req2, and Req3 from task1, since these three scheduling requests come from the same task, in one implementation, they The priorities can be the same. For this scenario, they can be added to the normal queue according to the order received among the three scheduling requests, such as first Req1, then Req2, and then Req3, while the VIP queue remains the same. is empty.

Referring to (3) in FIG. 8 , the file system scheduling service of the electronic device will select the most urgent scheduling request from the common queue as the target scheduling request according to the aforementioned scheduling method to respond. Since the tasks corresponding to Req1, Req2, and Req3 are all task 1, and therefore have the same priority, Req1 is selected to respond in the order of Req1, Req2, and Req3, and the unresponsive scheduling requests in the ordinary queue at this time include Req2 , Req3, if the electronic device also receives scheduling requests Req4 and Req5 from task2 during the process of responding to Req1, then the unresponded scheduling requests in the normal queue at this time also include Req4 and Req5.

Referring to (4) in Figure 8, the file system scheduling service of the electronic device will record the waiting time of unresponsed scheduling requests in the ordinary queue according to the scheduling method described above. When it is detected that the waiting time of the scheduling request reaches the corresponding During the starvation time, the scheduling request is moved to the VIP queue. For example, when it is detected that the waiting time of Req4 and Req5 reaches the corresponding starvation time, Req4 and Req5 are moved to the VIP queue.

Continuing to refer to FIG. 8 , after moving Req4 and Req5 from the common queue to the VIP queue, the file system scheduling service of the electronic device will select the scheduling request in the VIP queue in (4) in FIG. 8 to respond. Since Req4 and Req5 come from the same task, that is, task2, in one implementation, their priorities can be the same. For this scenario, the order of receipt between Req4 and Req5 can be followed, such as Req4 first, then Req5 will be moved to the VIP queue in order. And respond in the order of Req4 first, then Req5.

In particular, when the electronic device calls the file system service and responds to Req4 first, it will record the total time of responding to the scheduling request in the VIP queue at the same time. When the total time reaches the full time, it will switch to the normal queue. Select a dispatch request to respond to.

For example, as shown in (1) in Figure 7, before the electronic device invokes the file system service to respond to Req5 first, if it detects that the total time for responding to the scheduling request in the VIP queue reaches the full time, the electronic device switches to the normal queue, from In the ordinary queue, the scheduling requests Req2 and Req3 are selected in turn to respond, that is, the file operation instruction 2 and the file operation instruction 3 are executed until the scheduling request in the ordinary queue is empty, or there is a scheduling in the ordinary queue whose waiting time is longer than the corresponding starvation time After the total time of requesting or responding to the scheduling request in the ordinary queue reaches the corresponding full time, switch to the VIP queue, and select Req5 from the VIP queue to respond, that is, execute the file operation instruction 5.

For example, as shown in (2) in Figure 7, before the electronic device calls the file system service and responds to Req5 first, if it detects that the total time for responding to the scheduling request in the VIP queue has not reached the corresponding full time, the electronic device continues to respond to the VIP Req5 in the queue, that is, execute file operation command 5, until the scheduling request in the VIP queue is empty, or the total time for responding to the scheduling request in the normal queue reaches the corresponding full time, then switch to the normal queue, from the normal queue Select Req2 and Req3 to respond, that is, execute file operation instruction 2 and file operation instruction 3.

Through the analysis of Fig. 7, it can be seen that after implementing the scheduling method of the embedded file system provided by the present application, when multiple tasks initiate multiple scheduling requests, by setting multiple queues of different priorities such as the ordinary queue above ( Low priority) and VIP queue (high priority), the queue with high priority is used to accommodate scheduling requests that reach the starvation time (about to reach the length of business requirements), and the queue with lower priority is used to accommodate the waiting time that has not yet reached hunger Time (that is, the waiting time is longer than the business requirement time) scheduling request, in order to ensure the real-time requirements of the scheduling request, the scheduling request in the high-priority queue is given priority. In addition, in order to ensure the fairness of the overall scheduling request, a total time threshold for responding to scheduling requests in the high-priority queue is also set. When the threshold is reached, it will switch to respond to scheduling requests in the low-priority queue. And, in order to further meet the required duration of the business to which each scheduling request belongs, that is, to further meet the real-time requirements of each scheduling request, when responding to scheduling requests in each queue, the urgency is ranked from high to low (the scheduling request corresponds to The priority of the task is from high to low), and when the priority is the same, it will respond in the order of the arrival time of the scheduling request. Therefore, the electronic device can take into account the real-time requirements of each scheduling request (such as the priority response Req4 shown in Figure 7 (1) and (2)) in a very short time Guarantee the fairness requirements of the overall scheduling request, and avoid long-term starvation of scheduled threads (for example, after giving priority to responding to Req4 with high real-time requirements as shown in Figure 7 (2), taking into account the low real-time requirements But the waiting time is longer for Req2 and Req3).

It should be understood that each step in the foregoing method embodiments provided in the present application may be implemented by an integrated logic circuit of hardware in a processor or instructions in the form of software. The method steps disclosed in connection with the embodiments of the present application may be directly implemented by a hardware processor, or implemented by a combination of hardware and software modules in the processor.

The present application also provides an electronic device, which may include: a memory and a processor. Wherein, the memory may be used to store a computer program; the processor may be used to call the computer program in the memory, so that the electronic device executes the method in any one of the above embodiments.

The present application also provides a chip system, where the chip system includes at least one processor, configured to implement the functions involved in the method performed by the electronic device in any one of the above embodiments.

In a possible design, the chip system further includes a memory, the memory is used to store program instructions and data, and the memory is located inside or outside the processor.

The system-on-a-chip may consist of chips, or may include chips and other discrete devices.

Optionally, there may be one or more processors in the chip system. The processor can be realized by hardware or by software. When implemented in hardware, the processor may be a logic circuit, an integrated circuit, or the like. When implemented by software, the processor may be a general-purpose processor implemented by reading software codes stored in a memory.

Optionally, there may be one or more memories in the chip system. The memory may be integrated with the processor, or may be configured separately from the processor, which is not limited in this embodiment of the present application. Exemplarily, the memory can be a non-transitory processor, such as a read-only memory ROM, which can be integrated with the processor on the same chip, or can be respectively arranged on different chips. The arrangement manner of the memory and the processor is not specifically limited.

Exemplarily, the chip system may be a field programmable gate array (field programmable gate array, FPGA), may be an application specific integrated circuit (ASIC), may also be a system chip (system on chip, SoC), or It can be a central processor unit (CPU), a network processor (network processor, NP), a digital signal processing circuit (digital signal processor, DSP), or a microcontroller (micro controller unit) , MCU), and may also be a programmable controller (programmable logic device, PLD) or other integrated chips.

The present application also provides a computer program product, the computer program product including: a computer program (also called code, or instruction), when the computer program is executed, the computer executes the electronic device in any one of the above-mentioned embodiments. method of execution.

The present application also provides a computer-readable storage medium, where the computer-readable storage medium stores a computer program (also called a code, or an instruction). When the computer program is executed, the computer is made to execute the method executed by the electronic device in any one of the above embodiments.

Various implementation modes of the present application can be combined arbitrarily to achieve different technical effects.

In the above embodiments, all or part of them may be implemented by software, hardware, firmware or any combination thereof. When implemented using software, it may be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on the computer, the processes or functions according to the present application will be generated in whole or in part. The computer can be a general purpose computer, a special purpose computer, a computer network, or other programmable devices. The computer instructions may be stored in or transmitted from one computer-readable storage medium to another computer-readable storage medium, for example, the computer instructions may be transmitted from a website, computer, server or data center Transmission to another website site, computer, server, or data center by wired (eg, coaxial cable, optical fiber, DSL) or wireless (eg, infrared, wireless, microwave, etc.) means. The computer-readable storage medium may be any available medium that can be accessed by a computer, or a data storage device such as a server or a data center integrated with one or more available media. The available medium may be a magnetic medium (for example, a floppy disk, a hard disk, or a magnetic tape), an optical medium (for example, a DVD), or a semiconductor medium (for example, a Solid State Disk).

Those of ordinary skill in the art can understand that all or part of the processes in the methods of the above embodiments are realized. The processes can be completed by computer programs to instruct related hardware. The programs can be stored in computer-readable storage media. When the programs are executed , may include the processes of the foregoing method embodiments. The aforementioned storage medium includes: ROM or random access memory RAM, magnetic disk or optical disk, and other various media that can store program codes.

In a word, the above description is only an embodiment of the technical solution of the present invention, and is not intended to limit the protection scope of the present invention. All modifications, equivalent replacements, improvements, etc. made according to the disclosure of the present invention shall be included in the protection scope of the present invention.

Claims (23)

1. An embedded file system scheduling method, characterized in that, the method is applied to electronic equipment, and the electronic equipment includes an embedded file system, and the method comprises: The electronic device generates multiple scheduling requests from multiple tasks, one task corresponds to one or more scheduling requests, and the scheduling requests are used to schedule the embedded file system to perform corresponding file operations; The electronic device responds to the multiple scheduling requests sequentially according to the priority of the task to which the scheduling request belongs and the waiting time of the scheduling request. 2. The method according to claim 1, wherein the electronic device sequentially responds to the multiple scheduling requests, specifically comprising: Selecting a dispatching request from the plurality of dispatching requests in turn to respond, and selecting one dispatching request to respond at a time; Among them, the process of selecting a scheduling request each time includes: When the second queue is empty, or the duration of the continuous response of the scheduling requests in the second queue is greater than or equal to the full time, select a scheduling request of the task with the highest priority from the first queue to respond ; In the case that the second queue is not empty, or the duration of the continuous response of the scheduling requests in the second queue is less than the full time, select a scheduler of the task with the highest priority from the second queue request to respond; The first queue includes: scheduling requests whose waiting time is less than the starvation time; the second queue includes: scheduling requests that have not been responded and whose waiting time is greater than or equal to the starvation time; scheduling requests belonging to the same task correspond to the same starvation time. dead time. 3. The method of claim 2, wherein, The scheduling request selected by the electronic device from the first queue is the scheduling request with the earliest generation time among the tasks with the highest priority in the first queue; The one scheduling request selected by the electronic device from the second queue is the scheduling request with the earliest generation time among the tasks with the highest priority in the second queue. 4. The method according to any one of claims 1-3, characterized in that, The priority of the task is preset by the electronic device; Alternatively, the priority of the task is dynamically adjusted by the electronic device according to any one or more of the following: the number of times the history of the task has not been successfully executed, the time taken for the history of the task to be successfully executed, the The waiting time of the scheduling request of the task in the first queue, and the historical generation frequency of the task. 5. The method according to any one of claims 1-4, characterized in that, The starvation time of the scheduling request is preset by the electronic device; Alternatively, the electronic device dynamically adjusts according to any one or more of the following: the number of times the history of the task to which the scheduling request belongs has not been successfully executed, the time taken when the history of the task to which the scheduling request belongs is successfully executed, the The waiting time of the scheduling request of the task to which the scheduling request belongs in the first queue, and the historical generation frequency of the task to which the scheduling request belongs. 6. The method according to any one of claims 1-5, characterized in that, The full time is preset by the electronic device; alternatively, it is dynamically adjusted by the electronic device according to the time duration of continuously responding to the scheduling requests in the second queue according to history. 7. The method according to any one of claims 1-6, characterized in that, The file operations performed by the embedded file system include any one or more of the following: creating, opening, reading and writing, closing, deleting, modifying files or transferring file storage locations. 8. An electronic device, characterized in that the electronic device includes a file system scheduling service and an embedded file system; The file system scheduling service is configured to receive multiple scheduling requests from multiple tasks, and sequentially schedule the embedded file system to respond according to the priority of the tasks to which the scheduling requests belong and the waiting time of the scheduling requests The multiple scheduling requests; one task corresponds to one or more scheduling requests; The embedded file system is configured to respond to the scheduling request to execute corresponding file operations. 9. The electronic device according to claim 8, wherein the file system scheduling service sequentially schedules the embedded file system to respond to the multiple scheduling requests, specifically comprising: The file system scheduling service sequentially selects scheduling requests from the plurality of scheduling requests to schedule the embedded file system to respond, and selects one scheduling request at a time to schedule the embedded file system to respond; Among them, the process of selecting a scheduling request each time includes: When the second queue is empty, or the duration of the continuous response of the scheduling requests in the second queue is greater than or equal to the full time, the file system scheduling service selects the task with the highest priority from the first queue a dispatch request dispatching the embedded file system to respond; In the case that the second queue is not empty, or the duration of the continuous response of the scheduling requests in the second queue is less than the full time, select a scheduler of the task with the highest priority from the second queue request to respond; The first queue includes: scheduling requests whose waiting time is less than the starvation time; the second queue includes: scheduling requests that have not been responded and whose waiting time is greater than or equal to the starvation time; scheduling requests belonging to the same task correspond to the same starvation time. dead time. 10. The electronic device according to claim 9, wherein: A scheduling request selected by the file system scheduling service from the first queue is the scheduling request with the earliest generation time among the tasks with the highest priority in the first queue; A scheduling request selected by the file system scheduling service from the second queue is the scheduling request with the earliest generation time among the tasks with the highest priority in the second queue. 11. The electronic device according to any one of claims 8-10, characterized in that, The priority of the task is preset by the electronic device; Alternatively, the priority of the task is dynamically adjusted by the file system scheduling service according to any one or more of the following: the number of times the history of the task has not been successfully executed, the time taken for the history of the task to be successfully executed, The waiting time of the scheduling request of the task in the first queue, and the historical generation frequency of the task. 12. The electronic device according to any one of claims 8-11, characterized in that, The starvation time of the scheduling request is preset by the electronic device; Or, the file system scheduling service dynamically adjusts according to any one or more of the following: the number of times the history of the task to which the scheduling request belongs has not been successfully executed, the time taken for the history of the task to which the scheduling request belongs to be successfully executed, The waiting time of the scheduling request of the task to which the scheduling request belongs in the first queue, and the historical generation frequency of the task to which the scheduling request belongs. 13. The electronic device according to any one of claims 8-12, characterized in that, The full time is preset by the electronic device; or, it is dynamically adjusted by the file system scheduling service according to the history of the duration of continuously responding to the scheduling requests in the second queue. 14. The electronic device according to any one of claims 8-13, characterized in that, The file operations performed by the embedded file system include any one or more of the following: creating, opening, reading and writing, closing, deleting, modifying files or transferring file storage locations. 15. An electronic device, characterized in that the electronic device includes an embedded file system, memory, and one or more processors; the memory is coupled to the one or more processors, and the memory is used to store computer program code comprising computer instructions invoked by the one or more processors to cause the electronic device to perform: generating multiple scheduling requests from multiple tasks, one task corresponds to one or more scheduling requests, and the scheduling requests are used to schedule the embedded file system to perform corresponding file operations; Responding to the multiple scheduling requests in sequence according to the priority of the task to which the scheduling request belongs and the waiting time of the scheduling request. 16. The method according to claim 15, wherein the one or more processors call the computer instructions so that the electronic device responds to the multiple scheduling requests in turn, specifically comprising: Selecting a dispatching request from the plurality of dispatching requests in turn to respond, and selecting one dispatching request to respond at a time; Among them, the process of selecting a scheduling request each time includes: When the second queue is empty, or the duration of the continuous response of the scheduling requests in the second queue is greater than or equal to the full time, select a scheduling request of the task with the highest priority from the first queue to respond ; In the case that the second queue is not empty, or the duration of the continuous response of the scheduling requests in the second queue is less than the full time, select a scheduler of the task with the highest priority from the second queue request to respond; The first queue includes: scheduling requests whose waiting time is less than the starvation time; the second queue includes: scheduling requests that have not been responded and whose waiting time is greater than or equal to the starvation time; scheduling requests belonging to the same task correspond to the same starvation time. dead time. 17. The method of claim 16, wherein, The one or more processors call the computer instructions so that the electronic device selects a scheduling request from the first queue as, among the tasks with the highest priority in the first queue, the earliest generation time Scheduling requests; The one or more processors call the computer instructions so that the electronic device selects a scheduling request from the second queue as, among the tasks with the highest priority in the second queue, the earliest generation time Scheduling requests. 18. The method according to any one of claims 15-17, wherein, The priority of the task is preset by the electronic device; Alternatively, the priority of the task is dynamically adjusted by the electronic device according to any one or more of the following: the number of times the history of the task has not been successfully executed, the time taken for the history of the task to be successfully executed, the The waiting time of the scheduling request of the task in the first queue, and the historical generation frequency of the task. 19. The method according to any one of claims 15-18, wherein, The starvation time of the scheduling request is preset by the electronic device; Alternatively, the electronic device dynamically adjusts according to any one or more of the following: the number of times the history of the task to which the scheduling request belongs has not been successfully executed, the time taken when the history of the task to which the scheduling request belongs is successfully executed, the The waiting time of the scheduling request of the task to which the scheduling request belongs in the first queue, and the historical generation frequency of the task to which the scheduling request belongs. 20. The method according to any one of claims 15-19, wherein, The full time is preset by the electronic device; alternatively, it is dynamically adjusted by the electronic device according to the time duration of continuously responding to the scheduling requests in the second queue according to history. 21. The method according to any one of claims 15-20, wherein, The file operations performed by the embedded file system include any one or more of the following: creating, opening, reading and writing, closing, deleting, modifying files or transferring file storage locations. 22. A chip, which is applied to electronic equipment, characterized in that the chip includes one or more processors, and the processors are used to call computer instructions so that the electronic equipment executes the electronic equipment according to claims 1-7. any one of the methods described. 23. A computer-readable storage medium, comprising instructions, wherein when the instructions are run on an electronic device, the electronic device is made to execute the method according to any one of claims 1-7.