Optimal Assignment of a Tree-Structured Context Reasoning Procedure onto a Host-Satellites System


Share/Save/Bookmark

Mei, Hailiang and Pawar, Pravin and Widya, Ing (2007) Optimal Assignment of a Tree-Structured Context Reasoning Procedure onto a Host-Satellites System. In: IEEE International Parallel and Distributed Processing Symposium, IPDPS, 26-30 March 2007, Long Beach, CA, USA.

[img]
Preview
PDF
8Mb
Abstract:In this paper, we study the problem of an optimal assignment of a tree-structured context reasoning procedure onto the computation resources in a hostsatellites configuration. The objective function to be minimized is the end-to-end processing delay, which is a crucialfactor in a number ofcontext- aware applications, e.g. mobile healthcare applications. The presented solution is a modification of an earlier method proposed by Bokhari, in which the optimal assignment problem to minimize the bottleneck processing time is transformed into a path-searching problem in a doubly weighted graph. Due to the incompatible requirements raised in our study, e.g. a-prior known location of the sensors, we propose a colouring scheme and a new search algorithm in this paper to obtain the optimal assignment in order to satisfy our objective.
Item Type:Conference or Workshop Item
Copyright:© 2007 IEEE
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/64498
Official URL:http://dx.doi.org/10.1109/IPDPS.2007.370327
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 245813