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)
    47 Downloads (Pure)

    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 languageEnglish
    Title of host publicationProceedings of IEEE International Parallel and Distributed Processing Symposium (IPDPS)
    Place of PublicationLos Alamitos
    PublisherIEEE Computer Society
    Pages1-9
    Number of pages9
    ISBN (Print)1-4244-0910-1
    DOIs
    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

    Name
    PublisherIEEE Computer Society
    Number7

    Conference

    Conference16th Heterogeneity in Computing Workshop, HCW 2007
    Abbreviated titleHCW
    CountryUnited States
    CityLong Beach
    Period26/03/0730/03/07

    Fingerprint

    Satellites
    Coloring
    Processing
    Sensors
    mHealth

    Keywords

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

    Cite this

    Mei, H., Pawar, P., & 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) (pp. 1-9). Los Alamitos: IEEE Computer Society. https://doi.org/10.1109/IPDPS.2007.370327
    Mei, H. ; Pawar, P. ; Widya, I.A. / Optimal Assignment of a Tree-Structured Context Reasoning Procedure onto a Host-Satellites System. Proceedings of IEEE International Parallel and Distributed Processing Symposium (IPDPS). Los Alamitos : IEEE Computer Society, 2007. pp. 1-9
    @inproceedings{f57808490322497e879da46f6039b951,
    title = "Optimal Assignment of a Tree-Structured Context Reasoning Procedure onto a Host-Satellites System",
    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.",
    keywords = "IR-64498, METIS-245813, EWI-11479",
    author = "H. Mei and P. Pawar and I.A. Widya",
    year = "2007",
    month = "3",
    day = "26",
    doi = "10.1109/IPDPS.2007.370327",
    language = "English",
    isbn = "1-4244-0910-1",
    publisher = "IEEE Computer Society",
    number = "7",
    pages = "1--9",
    booktitle = "Proceedings of IEEE International Parallel and Distributed Processing Symposium (IPDPS)",
    address = "United States",

    }

    Mei, H, Pawar, P & Widya, IA 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). IEEE Computer Society, Los Alamitos, pp. 1-9, 16th Heterogeneity in Computing Workshop, HCW 2007, Long Beach, United States, 26/03/07. https://doi.org/10.1109/IPDPS.2007.370327

    Optimal Assignment of a Tree-Structured Context Reasoning Procedure onto a Host-Satellites System. / Mei, H.; Pawar, P.; Widya, I.A.

    Proceedings of IEEE International Parallel and Distributed Processing Symposium (IPDPS). Los Alamitos : IEEE Computer Society, 2007. p. 1-9.

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

    TY - GEN

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

    AU - Mei, H.

    AU - Pawar, P.

    AU - Widya, I.A.

    PY - 2007/3/26

    Y1 - 2007/3/26

    N2 - 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.

    AB - 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.

    KW - IR-64498

    KW - METIS-245813

    KW - EWI-11479

    U2 - 10.1109/IPDPS.2007.370327

    DO - 10.1109/IPDPS.2007.370327

    M3 - Conference contribution

    SN - 1-4244-0910-1

    SP - 1

    EP - 9

    BT - Proceedings of IEEE International Parallel and Distributed Processing Symposium (IPDPS)

    PB - IEEE Computer Society

    CY - Los Alamitos

    ER -

    Mei H, Pawar P, Widya IA. 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). Los Alamitos: IEEE Computer Society. 2007. p. 1-9 https://doi.org/10.1109/IPDPS.2007.370327