New Programming Model for Pervasive Computing
Qingsong Yao, Shan Chang, Yong Qi, Ming Li · 2008
One most important character which makes it hard for pervasive computing is that the environment contexts of the running program vary with the continuous migrating of user, and even the context in a geographical fixed space changes all the time. It makes the services which include software utilities, devices functionalities, etc. not always available. This requires the program behavior to be able to adapt rapidly to new context and deal well with the availability. In this paper we first take insight into the springing approaches then put forward a new common model named pervasive computing programming model (PCPM). The main feature of this model is that it transparentizes availability through automatic fulfilling the developerpsilas original purpose properly based on automatic service-encapsulation and intentional fulfilling of the relative methods, no need the run-time guide of the developer, and even without modifying legacy system code while existing programming models force developer to learn new rules. And it weaves context into run-time program dynamically to relax design-time context complexity. In this paper, we discuss the programming model, its implementation and several example programs using this model.