Context-Aware Optimal Assignment of a Chain-like Processing Task onto Chain-like Resources in M-Health

H. Mei, I.A. Widya

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

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.
Original languageUndefined
Title of host publicationInternational Conference on Computational Science (3)
PublisherSpringer
Pages424-431
Number of pages8
ISBN (Print)978-3-540-72587-9
DOIs
Publication statusPublished - 14 Jul 2007
Event10th International Conference on Computational Science, ICCS 2010 - University of Amsterdam, Amsterdam, Netherlands
Duration: 31 May 20102 Jun 2010
Conference number: 10
https://www.iccs-meeting.org/iccs2010/

Publication series

Name
PublisherSpringer Verlag
Number67310A

Conference

Conference10th International Conference on Computational Science, ICCS 2010
Abbreviated titleICCS 2010
CountryNetherlands
CityAmsterdam
Period31/05/102/06/10
Internet address

Keywords

  • EWI-11642
  • METIS-245895
  • Graph-based - task assignment - contiguity constraint - M-health
  • IR-62083

Cite this

Mei, H., & Widya, I. A. (2007). Context-Aware Optimal Assignment of a Chain-like Processing Task onto Chain-like Resources in M-Health. In International Conference on Computational Science (3) (pp. 424-431). [10.1007/978-3-540-72588-6_69] Springer. https://doi.org/10.1007/978-3-540-72588-6_69
Mei, H. ; Widya, I.A. / Context-Aware Optimal Assignment of a Chain-like Processing Task onto Chain-like Resources in M-Health. International Conference on Computational Science (3). Springer, 2007. pp. 424-431
@inproceedings{87d79d722f6d4a9c937682864046f2a3,
title = "Context-Aware Optimal Assignment of a Chain-like Processing Task onto Chain-like Resources in M-Health",
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.",
keywords = "EWI-11642, METIS-245895, Graph-based - task assignment - contiguity constraint - M-health, IR-62083",
author = "H. Mei and I.A. Widya",
note = "10.1007/978-3-540-72588-6_69",
year = "2007",
month = "7",
day = "14",
doi = "10.1007/978-3-540-72588-6_69",
language = "Undefined",
isbn = "978-3-540-72587-9",
publisher = "Springer",
number = "67310A",
pages = "424--431",
booktitle = "International Conference on Computational Science (3)",

}

Mei, H & Widya, IA 2007, Context-Aware Optimal Assignment of a Chain-like Processing Task onto Chain-like Resources in M-Health. in International Conference on Computational Science (3)., 10.1007/978-3-540-72588-6_69, Springer, pp. 424-431, 10th International Conference on Computational Science, ICCS 2010, Amsterdam, Netherlands, 31/05/10. https://doi.org/10.1007/978-3-540-72588-6_69

Context-Aware Optimal Assignment of a Chain-like Processing Task onto Chain-like Resources in M-Health. / Mei, H.; Widya, I.A.

International Conference on Computational Science (3). Springer, 2007. p. 424-431 10.1007/978-3-540-72588-6_69.

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

TY - GEN

T1 - Context-Aware Optimal Assignment of a Chain-like Processing Task onto Chain-like Resources in M-Health

AU - Mei, H.

AU - Widya, I.A.

N1 - 10.1007/978-3-540-72588-6_69

PY - 2007/7/14

Y1 - 2007/7/14

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

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

KW - EWI-11642

KW - METIS-245895

KW - Graph-based - task assignment - contiguity constraint - M-health

KW - IR-62083

U2 - 10.1007/978-3-540-72588-6_69

DO - 10.1007/978-3-540-72588-6_69

M3 - Conference contribution

SN - 978-3-540-72587-9

SP - 424

EP - 431

BT - International Conference on Computational Science (3)

PB - Springer

ER -

Mei H, Widya IA. Context-Aware Optimal Assignment of a Chain-like Processing Task onto Chain-like Resources in M-Health. In International Conference on Computational Science (3). Springer. 2007. p. 424-431. 10.1007/978-3-540-72588-6_69 https://doi.org/10.1007/978-3-540-72588-6_69