Nederlands
Contact
Sitemap
Search
OrganisationEEMCS EPrints Service
 |
|
|
||||||||||||||||||||||||||||||||||
|
|
|
|
|
||||||||||||||||||||||||||||||||
|
|
|
||||||||||||||||||||||||||||||||||
|
|
|
|
|
||||||||||||||||||||||||||||||||
|
|
Mei, Hailiang and Pawar, P. and Widya, I.A.
(2007)
Optimal Assignment of a Tree-Structured Context Reasoning Procedure onto a Host-Satellites System.
In: Proceedings of IEEE International Parallel and Distributed Processing Symposium (IPDPS), 26 - 30 Mar 2007, Long Beach, US.
pp. 1-9.
IEEE Computer Society.
ISBN 1-4244-0910-1
Full text available as:
Official URL: http://dx.doi.org/10.1109/IPDPS.2007.370327  AbstractIn 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.
Export this item as: To correct this item please ask your editor Repository Staff Only: edit this item |
|
|
||||||||||||||||||||||||||||||||
|
|
|
||||||||||||||||||||||||||||||||||
|
|
|
|
|
||||||||||||||||||||||||||||||||
|
|
|
||||||||||||||||||||||||||||||||||
