07 THIELE CENTRE for applied mathematics in natural science

Abstract

A task of random size T is split into M subtasks of lengths T1, . . . , TM , each of which is sent to one out of M parallel processors. Each processor may fail at a random time before completing its allocated task, and then has to restart it from the beginning. If X1, . . . , XM are the total task times at the M processors, the overall total task time is… (More)

Topics

  • Presentations referencing similar topics