Approximation algorithms for multiprocessor scheduling problem
Satoshi Fujita, Masafumi Yamashita · 2000
this paper isdescrfi ed as follows. The time rme/Sfi2 for executing a unit of task on aprS cessor is assumed to be a unit of time, called a step, and the timere/F:++ for trF:++4/;+2 a unit of data frt one pr cessor toanother pr cessor is assumed to be a step, as well. We also assume that a communicationfri