A new approach to deadlock avoidance in embedded system

Deadlock avoidance algorithms help to improve fault tolerance feature of computer system. Unfortunately, few current algorithms are useful to embedded system either because they only work with single-unit resources, or because the time cost is too high. This paper improves the reduction algorithm with tree structure. According to the new algorithm, only multi-unit resources and the root process in each tree are considered when reducing, while single-unit resources and other processes are ignored because they are combined with tree structure. Thus the new algorithm works with all kinds of resources and its time cost is lower. The new algorithm is useful to embedded system.