Dynamic Programming In The Process Of User Interface Migration

Efficiency of User Interface is a focus in traditional process,this work depends mainly on programmers and lacks support and analysis offered by powerful tools.As a result,work during this process can not meet the need of pratical changes,and in turn be put into the state of low efficiency.Thus,programmers try to design a User Interface based on models in order to improve efficiency.The development of User Interface in recent years based on models,making full use of aid offered by tools to improve efficiency.Especially some tools are designed such as TERESA.These models often include Task model,Dialog model,also some important nodes such as ETS,STN are used to facilitate this designing process.The designing thought of these tools is to consider one program from 4 angles: tasks and objects angle, abstract user interface angles, concrete user interface angle and final user interface angle. These 4 angles have different requirements and limitation, which can help programmers to consider the reuse of code to a great extent.Compared to the reuse of code,the migration of code is more important.Migration of code means that when environment of code is changed,this program also can be excuted and offer the same ability.In fact,it is difficult to reach this purpose, and a lot of attention has been paid to this aspect.A way to solve this problem is to split the User Interface aiming at obtaining some children tasks,which can make a low need for various resouce and improve the migration of program. According to this view,this article maintains to split a User Interface based on Task Tree.This method is carried out in tools of Tesesa,combined programmer's understanding,considering the relation between different tasks.In this way,some children tasks which have logical relations from each other and can cooperate to offer the same ability just as the fomer User interface can are obtained.In order to improve the efficiency of the tasks' cooperation and make full use of various resource,this article puts up a set of new methods to allocate these children tasks on different computers.In this part, the allocation of children tasks are turned into a problem of Dynamic Programming,and then use A* Arithmetic to solve this problem. Thus children tasks are allocated properly,various resource are made full use of,research demonstrates that the efficiency of coordination between tasks are improved.