Regular Plans of Execution of Tasks with Random Processing Time
Article describes the comparison of parallel and consequent approaches of executing a group of tasks (m > 2) with a random processing time (A1,...Xm) in a high productive computational system. It is shown that the difference of expectation functions for average processing time in parallel and consequent task processing cases equals:(m -1) 3/2- MX, - M max (X1, X2).
Random tasks processing time Parallel consequent tasks processing
ALEXANDER F. RONZHIN PAVEL E. GOLOSOV
Institution of Russian Academy of Sciences Dorodnicyn Computing Centre of RAS Vavilov st. 40,119333 Moscow, Russia
国际会议
北京
英文
477-480
2011-06-20(万方平台首次上网日期,不代表论文的发表时间)