Method of implementing inter-task sharing data

Abstract

The invention discloses a method for realizing data sharing among tasks. The problems that deadlock is easy to be generated by multi tasks when visiting the sharing data area and the fault is not easy to be localized are solved. The invention includes that the task without the authority to visit the sharing data area sends an ACTION message to the task with visit authority; after the task with visit authority receives the message, the task runs corresponding program and operates the sharing data area according to the content of the message; after the running is over, the task with visit authority sends a responses message to the sender of the ACTION message; the responses message comprises the result of running; the sharing data area of the invention need not to be protected and the sharing data area data can be safely visited among tasks. The lock and other protection mechanisms are not considered and the code is simplified. The deadlock can not be generated without lock ,so the problem of deadlock is completely avoided.

Description

technical field [0001] The invention relates to the field of computer systems, in particular to a method for realizing data sharing between tasks. It is especially suitable for access processing of shared data by tasks such as timers and backgrounds. Background technique [0002] Computer systems, whether it is a large graphical operating system or a program running on a small chip, often use multi-tasking processing methods. Each task has different functions, and some information is exchanged between tasks through messages. These tasks sometimes need to access the same data area, and the data accessed by multiple tasks is shared data, also known as critical area. Due to multi-task access, the critical section must be guaranteed not to be modified during the access of a certain task, that is, other tasks are not allowed to access the critical section until the current task is used up. Only in this way can the data in the critical section be correct. For example, in the b...

AI Technical Summary

Problems solved by technology

Sometimes the operation of the data in the critical section is simple, there are not many instructions, and the operation can be completed quickly, but the operation of locking and unlocking takes a lot of time, and the code cannot improve efficiency

[0006] 2. The coding is complex, once a deadlock occurs, it is not easy to locate the fault

Since the critical section can be accessed multiple times in a task, if a certain access does not release the lock, the subsequent access cannot be performed, but the occupant of the lock is himself, so he can only walk through the code to find the problem

Images