Investigation of optimization techniques for scheduling precedence computations with communication costs
نام عام مواد
[Thesis]
نام نخستين پديدآور
H. M. R. Najjari
وضعیت نشر و پخش و غیره
نام ناشر، پخش کننده و غيره
King Fahd University of Petroleum and Minerals (Saudi Arabia)
تاریخ نشرو بخش و غیره
1996
مشخصات ظاهری
نام خاص و کميت اثر
138
یادداشتهای مربوط به پایان نامه ها
جزئيات پايان نامه و نوع درجه آن
M.S.
کسي که مدرک را اعطا کرده
King Fahd University of Petroleum and Minerals (Saudi Arabia)
امتياز متن
1996
یادداشتهای مربوط به خلاصه یا چکیده
متن يادداشت
Efficient scheduling of precedence computations with communication is crucial for distributed systems. A precedence computations with communication is modeled as a directed acyclic graph. The objective here is to find a more refined strategy based on the Iterative Refinement Scheduling concept, that was previously developed, to approximate the task level. This work proposes a global scheduling heuristic that combines the refined estimate of task levels with management of processor idle times. Extensive testing of the proposed heuristic is conducted by altering the granularity, parallelism, and system topology. Analysis showed that, at coarse-grain computations, better performance can be achieved by reducing processor idle times. For fine-grain computations, however, better performance requires higher precision selection of critical tasks. Testing proved that the proposed heuristic outperforms other recently reported heuristics, and it generates near-optimum solutions. The time complexity of the proposed heuristic is usdO(pn\sp2),usd where p and n are the numbers of processors and tasks, respectively.
موضوع (اسم عام یاعبارت اسمی عام)
موضوع مستند نشده
Applied sciences
موضوع مستند نشده
Computer science
نام شخص به منزله سر شناسه - (مسئولیت معنوی درجه اول )