Abstract
This paper focuses on the optimal assignment of a chain-structured medical task onto a chain of networked devices, a need identified in context-aware mobile healthcare applications. We propose a graph-based method to compute the assignment which has the minimal end-to-end process and transfer delay. In essence, the method transforms the assignment problem to a shortest path problem in a graph representing all possible assignments. Compared to earlier work, our method relaxes a so-called contiguity constraint, which is a necessity in the earlier case but unnecessarily constraining in the healthcare applications. The proposed method reduces the time and space complexity in case it is adapted to include the contiguity constraint.
Chapter PDF
Similar content being viewed by others
References
Hung, K., Yuan-Ting, Z.: Implementation of a WAP-based telemedicine system for patient monitoring. IEEE Transactions on Information Technology in Biomedicine 7(2), 101 (2003)
Yuan-Hsiang, L., et al.: A wireless PDA-based physiological monitoring system for patient transport. IEEE Transactions on Information Technology in Biomedicine 8(4), 439 (2004)
Van Halteren, A., et al.: Mobile Patient Monitoring: The MobiHealth System. The Journal of Information Technology in Healthcare 2(5) (2004)
Bokhari, S.H.: Partitioning problems in parallel, pipelined, and distributed computing. IEEE Transactions on Computers 37(1), 48–57 (1988)
Sheu, J.-P., Chiang, Z.-F.: Efficient allocation of chain-like task on chain-like network computers. Information Processing Letters 36(5), 241–246 (1990)
Nicol, D.M., O’Hallaron, D.R.: Improved Algorithms for Mapping Pipelined and Parallel Computations. IEEE Transactions on Computers 40(3), 295–306 (1991)
Woeginger, G.J.: Assigning chain-like tasks to a chain-like network. In: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms (2001)
Tönis, T., Hermens, H.J., Vollenbroek-Hutten, M.: Context aware algorithm for discriminating stress and physical activity versus epilepsy. AWARENESS deliverables, D4.18 (2006)
AWARENESS, Freeband AWARENESS project webpage (2005), http://www.freeband.nl/project.cfm?id=494&language=en
Braun, T.D., et al.: A Taxonomy for Describing Matching and Scheduling Heuristics for Mixed-Machine Heterogeneous Computing Systems. In: 17th IEEE Symposium on Reliable Distributed Systems (1998)
Hansen, P., Lih, K.-W.: Improved Algorithms for Partitioning Paroblems in Parallel, Pipelined, and Distributed Computing (Correspondence). IEEE Transactions on Computers 41(6), 769–771 (1992)
Yeh, C.-C.: On the Power-Aware Resource Allocation for Linear-Pipelined Real-Time Tasks. In: 19th International Conference on Advanced Information Networking and Applications (2005)
Ma, Y.-C., Chen, T.-F., Chung, C.-P.: Branch-and-boundtask allocation with task clustering-basedpruning. Journal of Parallel and Distributed Computing 64, 1223–1240 (2004)
Wang, L., et al.: Task Matching and Scheduling in Heterogeneous Computing Environments Using a Genetic-Algorithm-Based Approach. Journal of Parallel and Distributed Computing 47, 8–22 (1997)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Mei, H., Widya, I. (2007). Context-Aware Optimal Assignment of a Chain-Like Processing Task onto Chain-Like Resources in M-Health. In: Shi, Y., van Albada, G.D., Dongarra, J., Sloot, P.M.A. (eds) Computational Science – ICCS 2007. ICCS 2007. Lecture Notes in Computer Science, vol 4489. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72588-6_69
Download citation
DOI: https://doi.org/10.1007/978-3-540-72588-6_69
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72587-9
Online ISBN: 978-3-540-72588-6
eBook Packages: Computer ScienceComputer Science (R0)