Olympus: A High-Level Programming Model for Pervasive Computing Environments

Author(s):  
A. Ranganathan ◽  
S. Chetan ◽  
J. Al-Muhtadi ◽  
R.H. Campbell ◽  
M.D. Mickunas
Author(s):  
Hongbo Ni ◽  
Xingshe Zhou ◽  
Zhiwen Yu ◽  
Daqing Zhang

The vision of pervasive computing is floating into the domain of the household and aims to assist inhabitants (users) to live more conveniently and harmoniously. Due to the dynamic and heterogeneous nature of pervasive computing environments, it is difficult for an average user to obtain right service and information in the right place at the right time. This chapter proposes a context-dependent task approach to address the challenge. The most important component is its task model, which provides an adequate high-level description of user-oriented tasks and their related contexts. Leveraging the model, multiple entities can easily exchange, share, and reuse their knowledge. The conversion of OWL task ontology specifications to the First-Order Logic (FOL) representations is presented. The performance of FOL rule-based deducing in terms of task number, context size, and time is evaluated. Finally, we present a task supporting system (TSS) to aid an inhabitant’s tasks in light of his or her lifestyle and environment conditions in smart home.


Author(s):  
Breno A. de Melo Menezes ◽  
Nina Herrmann ◽  
Herbert Kuchen ◽  
Fernando Buarque de Lima Neto

AbstractParallel implementations of swarm intelligence algorithms such as the ant colony optimization (ACO) have been widely used to shorten the execution time when solving complex optimization problems. When aiming for a GPU environment, developing efficient parallel versions of such algorithms using CUDA can be a difficult and error-prone task even for experienced programmers. To overcome this issue, the parallel programming model of Algorithmic Skeletons simplifies parallel programs by abstracting from low-level features. This is realized by defining common programming patterns (e.g. map, fold and zip) that later on will be converted to efficient parallel code. In this paper, we show how algorithmic skeletons formulated in the domain specific language Musket can cope with the development of a parallel implementation of ACO and how that compares to a low-level implementation. Our experimental results show that Musket suits the development of ACO. Besides making it easier for the programmer to deal with the parallelization aspects, Musket generates high performance code with similar execution times when compared to low-level implementations.


Author(s):  
Rong Gu ◽  
Zhixiang Zhang ◽  
Zhihao Xu ◽  
Zhaokang Wang ◽  
Kai Zhang ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document