P. Chretienne. Task scheduling with interprocessor communication delays. European Journal of Operational Research, 57:348--354, 1992. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Scheduling Problems in a Practical Allocation Model - Hollermann, Hsu, Lopez.. (1997) (1 citation) (Correct)
....Later work concentrated on approximation algorithms [1, 13, 16, 20] Research then evolved to more restricted models which allowed an infinite number of processors in the system. Polynomial algorithms were found for the cases where the precedence constraints form a tree under certain constraints [2, 3, 4, 7, 17]. A good review of models and algorithms developed for this problem can be found in [2, 6, 15, 19] Most of this work was very theoretical in nature, i.e. the models were too simplistic for practical application to real machines. More recently, Valiant s BSP Model [22, 23] provided a general ....
P. Chr'etienne. Task scheduling with interprocessor communication delays. European J. Operational Research, 57:348--354, 1992.
Free Scheduling of General Nested Loops For.. - Koziris, Pappas.. (Correct)
....and we initially ignore communication delays between computations (tasks) which are to be executed on different processors. Restricting to constant or small communication delays (SCT) or even ignoring them at all decreases dramatically the complexity, resulting in polynomial time solutions as in [1, 3, 8, 9]. Once optimal parallel execution is found, an efficient method of mapping the concurrent groups of computations into a parallel architecture should be applied. In the past, many proposed mapping methodologies were focused upon special purpose parallel architectures such as systolic arrays. Since ....
.... 22 Table 5: Optimal refined schedule t 0 t 1 t 2 t 3 t 4 t 5 P 1 13 14 15 17 19 24 P 2 10 11 20 21 22 23 P 3 3 4 5 6 7 P 4 0 1 16 18 9 P 5 12 2 8 By applying all equivalent methods presented in [1] 2] 4] or [5] the best, in terms of total execution time, linear schedule is given by = [3 2]. This linear schedule achieves the same total execution time. The main disadvantage of this linear schedule, is the poor processor utilisation that implies. The linear schedule, needs too many processors in order to be completed in the less possible time. Table 2 shows the linear scheduling ....
P. Chretienne "Task Scheduling with Interprocessor Communication Delays," Eur. J. Oper. Res., vol. 57, pp 348-354, 1992.
Optimal Loop Parallelization in n-Dimensional Index.. - Drositis, Andronikos.. (2002) (Correct)
No context found.
P. Chretienne. Task scheduling with interprocessor communication delays. European Journal of Operational Research, 57:348--354, 1992.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC