This paper proposes and analyzes the performance of a task scheduling scheme that couples network schedule for master-slave style parallel computing cluster built on top of wireless local area networks. When a transmission fails, the proposed scheme selects another data and destination that can replace the subtask scheduled on the unreachable node with minimal cost, rather than hopelessly retransmits on the bad channel. Simulation results performed via ns-2 event scheduler, show that the proposed scheme minimizes the task migration, improves the computation time by maximally 35.4 %, increases the probability of successful retransmission, and finally survives the network failure as long as at least one node is reachable at each instance of time. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Lee, J., Kang, M., Kang, E., Park, G., Kim, H., Kim, C., … Hong, J. (2006). Design and performance analysis of a message scheduling scheme for WLAN-based cluster computing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3983 LNCS, pp. 558–566). Springer Verlag. https://doi.org/10.1007/11751632_61
Mendeley helps you to discover research relevant for your work.