Distributed workflow mapping algorithm for maximized reliability under end-to-end delay constraint

Research output: Contribution to journalArticle

5 Scopus citations

Abstract

A distributed scientific workflow mapping algorithm for maximized reliability under certain end-to-end delay (EED) bound is proposed. It is studied in a heterogeneous distributed computing environment, where computing node and communication link failures are inevitable. The mapping decision and the stored table information is distributed among various nodes in order to achieve scalability and robustness, which are especially important for large-scale distributed systems. This Distributed Reliability Maximization workflow mapping algorithm under End-to-end Delay constraint (dis-DRMED) considers both the maximum reliability and the minimum EED objectives in a two-step procedure. In the first step, a mapping algorithm combining iterative Critical Path search and Layer-based priority assigning techniques (CPL) is adopted to minimize the EED by focusing on the optimal allocation of tasks on the critical path. In the second step, tasks on noncritical paths are remapped to improve the overall execution reliability. Simulation results under various system setups demonstrated that dis-DRMED achieved considerably higher reliability values under the same EED constraint compared with some representative workflow mapping algorithms.

Original languageEnglish
Pages (from-to)1462-1488
Number of pages27
JournalJournal of Supercomputing
Volume66
Issue number3
DOIs
StatePublished - 22 Apr 2013

Keywords

  • Distributed computing
  • Maximized reliability
  • Minimum end-to-end delay
  • Workflow mapping

Fingerprint Dive into the research topics of 'Distributed workflow mapping algorithm for maximized reliability under end-to-end delay constraint'. Together they form a unique fingerprint.

Cite this