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

H. Mei; I.A. Widya

doi: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

H. Mei, I.A. Widya

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-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 language	Undefined
Title of host publication	International Conference on Computational Science (3)
Publisher	Springer
Pages	424-431
Number of pages	8
ISBN (Print)	978-3-540-72587-9
DOIs	https://doi.org/10.1007/978-3-540-72588-6_69
Publication status	Published - 14 Jul 2007
Event	10th International Conference on Computational Science, ICCS 2010 - University of Amsterdam, Amsterdam, Netherlands Duration: 31 May 2010 → 2 Jun 2010 Conference number: 10 https://www.iccs-meeting.org/iccs2010/

Publication series

Name
Publisher	Springer Verlag
Number	67310A

Conference

Conference	10th International Conference on Computational Science, ICCS 2010
Abbreviated title	ICCS 2010
Country	Netherlands
City	Amsterdam
Period	31/05/10 → 2/06/10
Internet address	https://www.iccs-meeting.org/iccs2010/

Keywords

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

Access to Document

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

http://eprints.eemcs.utwente.nl/secure2/11642/01/fulltext.pdf

Cite this

@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 ; null ; Conference date: 31-05-2010 Through 02-06-2010",

year = "2007",

month = jul,

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)",

url = "https://www.iccs-meeting.org/iccs2010/",

}

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

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 - Conference code: 10

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

Y2 - 31 May 2010 through 2 June 2010

ER -