Method for managing read-write tasks of AUTOSAR (automotive open system architecture) NvM [NVRAM (nonvolatile random access memory) manager] on basis of priority bitmap

Abstract

The invention discloses a method for managing read-write tasks of an AUTOSAR (automotive open system architecture) NvM [NVRAM (nonvolatile random access memory) manager] on the basis of a priority bitmap. The method includes constructing 256 groups of normal task queues, a group of immediate task queue, a queue mapping table and a priority bitmap ready list; and inserting read-write tasks into the task queues or fetching read-write tasks from the task queues according to the queue mapping table and the priority bitmap ready list. The method has the advantages that deviation relative to the ready list is carried out by a priority bitmap algorithm when the read-write tasks are fetched, a to-be-processed read-write task with the top priority is found out from a priority bitmap lookup table, a ready task with the currently top priority can be found according to time complexity of O(1) by the lookup table algorithm with fixed limited number of times, expenditure on the expanded 257 read-write request queues is low, and maintenance is easy.

Description

technical field [0001] The invention belongs to the technical field of computer reading and writing, and in particular relates to a management method for AUTOSAR NvM reading and writing tasks based on priority bitmaps. Background technique [0002] AUTOSAR (AUTomotive Open System Architecture) is a standardized open automotive software architecture. In the AUTOSAR standard, a layered structure is used to manage memory, which is specifically divided into a memory driver layer, a hardware abstraction layer, and a memory service layer. Among them, the hardware driver layer encapsulates hardware functions and features by directly operating specific registers; the hardware abstraction layer further encapsulates different types of memories, and abstracts them into several user-configured memory blocks, so that different memory types and their limitations are relatively The upper storage service layer is transparent; the storage service layer uses blocks as the basic unit to provi...

AI Technical Summary

Problems solved by technology

[0005] In the implementation process of this kind of read and write request queue, the operation overhead of ordinary queue is relatively large and maintenance is difficult

It is inserted into the queue in the order in which tasks are ready. In this case, when grabbing the highest priority task from the queue, it is necessary to traverse the entire queue to find the highest priority task (if the queue is implemented using an array, when deleting tasks from the queue, It is also necessary to adjust the queue to make the queue continuous), so the time complexity of this method is O(n)

Images