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

H. Mei, P. Pawar, I.A. Widya

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    2 Citations (Scopus)
    145 Downloads (Pure)


    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 languageEnglish
    Title of host publicationProceedings of IEEE International Parallel and Distributed Processing Symposium (IPDPS)
    Place of PublicationLos Alamitos
    Number of pages9
    ISBN (Print)1-4244-0910-1
    Publication statusPublished - 26 Mar 2007
    Event16th Heterogeneity in Computing Workshop, HCW 2007 - Long Beach, United States
    Duration: 26 Mar 200730 Mar 2007
    Conference number: 16

    Publication series

    PublisherIEEE Computer Society


    Conference16th Heterogeneity in Computing Workshop, HCW 2007
    Abbreviated titleHCW
    Country/TerritoryUnited States
    CityLong Beach


    • IR-64498
    • METIS-245813
    • EWI-11479


    Dive into the research topics of 'Optimal Assignment of a Tree-Structured Context Reasoning Procedure onto a Host-Satellites System'. Together they form a unique fingerprint.

    Cite this