返回Google圖書搜尋

Wasted Resources in Gang Scheduling

Hebrew University of Jerusalem. Department of Computer ScienceDror G. Feitelson

出版	Leibniz Center for Research in Computer Science, Department of Computer Science, Hebrew University of Jerusalem, 1990
URL	http://books.google.com.hk/books?id=sU_NHAAACAAJ&hl=&source=gbs_api

註釋Abstract: "Gang scheduling -- the scheduling of a number of interacting threads to run simultaneously on distinct processors -- can leave processors idle if the sizes of the gangs do not match the number of available processors. Given an optimal off-line algorithm, the wasted processing power can range from 0 to 50% depending on the distribution of gang sizes. We focus on the uniform and the harmonic distributions, rather than worst-case distributions. If there are no restrictions on how the processors are partitioned, these distributions cause no waste with an off- line algorithm, but a waste of 20 to 37% should be expected for on-line algorithms