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.
Original language | English |
---|---|
Title of host publication | Proceedings of IEEE International Parallel and Distributed Processing Symposium (IPDPS) |
Place of Publication | Los Alamitos |
Publisher | IEEE |
Pages | 1-9 |
Number of pages | 9 |
ISBN (Print) | 1-4244-0910-1 |
DOIs | |
Publication status | Published - 26 Mar 2007 |
Event | 16th Heterogeneity in Computing Workshop, HCW 2007 - Long Beach, United States Duration: 26 Mar 2007 → 30 Mar 2007 Conference number: 16 |
Publication series
Name | |
---|---|
Publisher | IEEE Computer Society |
Number | 7 |
Conference
Conference | 16th Heterogeneity in Computing Workshop, HCW 2007 |
---|---|
Abbreviated title | HCW |
Country/Territory | United States |
City | Long Beach |
Period | 26/03/07 → 30/03/07 |
Keywords
- IR-64498
- METIS-245813
- EWI-11479