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

In this paper, we study the problem of an optimal assignment of a tree-structured context reasoning procedure onto the computation resources in a host-satellites configuration. The objective function to be minimized is the end-to-end processing delay, which is a crucial factor in a number of context-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.

[1]  Pierre Hansen,et al.  Improved Algorithms for Partitioning Problems in Parallel, Pipelined, and Distributed Computing , 1992, IEEE Trans. Computers.

[2]  Richard M. Karp,et al.  Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.

[3]  E. Kay,et al.  Graph Theory. An Algorithmic Approach , 1975 .

[4]  Virginia Mary Lo,et al.  Heuristic Algorithms for Task Assignment in Distributed Systems , 1988, IEEE Trans. Computers.

[5]  David K. Smith.  Network Flows: Theory, Algorithms, and Applications , 1994 .

[6]  Bjørn Olstad,et al.  Efficient Partitioning of Sequences , 1995, IEEE Trans. Computers.

[7]  SiegelHoward Jay,et al.  Task Matching and Scheduling in Heterogeneous Computing Environments Using a Genetic-Algorithm-Based Approach , 1997 .

[8]  Shahid H. Bokhari,et al.  Efficient Algorithms for a Class of Partitioning Problems , 1995, IEEE Trans. Parallel Distributed Syst..

[9]  Michael G. Norman,et al.  Models of machines and computation for mapping in multicomputers , 1993, CSUR.

[10]  Gregory D. Abowd,et al.  A Conceptual Framework and a Toolkit for Supporting the Rapid Prototyping of Context-Aware Applications , 2001, Hum. Comput. Interact..

[11]  Shahid H. Bokhari,et al.  On the Mapping Problem , 1981, IEEE Transactions on Computers.

[12]  Shahid H. Bokhari,et al.  Partitioning Problems in Parallel, Pipelined, and Distributed Computing , 1988, IEEE Trans. Computers.

[13]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[14]  K. Wac,et al.  Mobile patient monitoring: the MobiHealth system. , 2004, Studies in health technology and informatics.

[15]  Howard Jay Siegel,et al.  A dynamic matching and scheduling algorithm for heterogeneous computing systems , 1998, Proceedings Seventh Heterogeneous Computing Workshop (HCW'98).

[16]  Harold S. Stone,et al.  Multiprocessor Scheduling with the Aid of Network Flow Algorithms , 1977, IEEE Transactions on Software Engineering.

[17]  Francine Berman,et al.  New Grid Scheduling and Rescheduling Methods in the GrADS Project , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[18]  Mary Mehrnoosh Eshaghian-Wilner,et al.  Mapping heterogeneous task graphs onto heterogeneous system graphs , 1997, Proceedings Sixth Heterogeneous Computing Workshop (HCW'97).

[19]  Mahadev Satyanarayanan,et al.  From the Editor in Chief: The Many Faces of Adaptation , 2004, IEEE Pervasive Comput..

[20]  Steven Skiena,et al.  Efficient Array Partitioning , 1997, ICALP.

[21]  Jadwiga Indulska,et al.  Middleware for Distributed Context-Aware Systems , 2005, OTM Conferences.

[22]  Gerhard J. Woeginger.  Assigning chain-like tasks to a chain-like network , 2001, SODA '01.

[23]  Anthony A. Maciejewski,et al.  Task Matching and Scheduling in Heterogenous Computing Environments Using a Genetic-Algorithm-Based Approach , 1997, J. Parallel Distributed Comput..

[24]  Awi Federgruen,et al.  Structured Partitioning Problems , 1991, Oper. Res..

[25]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[26]  Mahadev Satyanarayanan,et al.  The Many Faces of Adaptation , 2004 .