Partitioning Problems in Parallel, Pipeline, and Distributed Computing
IEEE Transactions on Computers
Efficient allocation of chain-like task on chain-like network computers
Information Processing Letters
Improved Algorithms for Mapping Pipelined and Parallel Computations
IEEE Transactions on Computers
Improved Algorithms for Partitioning Problems in Parallel, Pipelined, and Distributed Computing
IEEE Transactions on Computers
Journal of Parallel and Distributed Computing - Special issue on parallel evolutionary computing
Assigning chain-like tasks to a chain-like network
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
SRDS '98 Proceedings of the The 17th IEEE Symposium on Reliable Distributed Systems
Branch-and-bound task allocation with task clustering-based pruning
Journal of Parallel and Distributed Computing
On the Power-Aware Resource Allocation for Linear-Pipelined Real-Time Tasks
AINA '05 Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1
Implementation of a WAP-based telemedicine system for patient monitoring
IEEE Transactions on Information Technology in Biomedicine
A wireless PDA-based physiological monitoring system for patient transport
IEEE Transactions on Information Technology in Biomedicine
Smart distribution of bio-signal processing tasks in m-health
OTM'07 Proceedings of the 2007 OTM confederated international conference on On the move to meaningful internet systems - Volume Part I
Hi-index | 0.00 |
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.