Stochastic Bounds on Execution Times of Parallel Programs

  title={Stochastic Bounds on Execution Times of Parallel Programs},
  author={Nihal Yazici-Pekergin and Jean-Marc Vincent},
  journal={IEEE Trans. Software Eng.},
AbstructWe obtain stochastic bounds on execution times of parallel programs when the number of processors is unlimited. A parallel program is considered to consist of interdependent tasks with synchronization constraints. These constraints are described by an acyclic directed graph called a “task graph.’’ The execution times of tasks are considered to be… CONTINUE READING