Task redistribution algorithm for contour extraction
A dynamic parallel algorithm for the active contour extraction with the varying number of control points has been developed. For the case where the execution time of tasks is not known in advance, the task scheduling algorithm speculates that a heavily-loaded processor might have more tasks in the n...
Uložené v:
| Vydané v: | 10th International Conference on Telecommunications : ICT'2003 : February 23-March 1, 2003, Sofitel Coralia Maeva Beach Hotel, Tahiti, Papeete, French Polynesia Ročník 2; s. 1610 - 1616 vol.2 |
|---|---|
| Hlavný autor: | |
| Médium: | Konferenčný príspevok.. |
| Jazyk: | English Japanese |
| Vydavateľské údaje: |
IEEE
01.01.2003
|
| Predmet: | |
| ISBN: | 0780376617, 9780780376618 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Shrnutí: | A dynamic parallel algorithm for the active contour extraction with the varying number of control points has been developed. For the case where the execution time of tasks is not known in advance, the task scheduling algorithm speculates that a heavily-loaded processor might have more tasks in the near future and schedules less tasks to the processor than average. Thus, this algorithm keeps the balance of the parallel tasks over processors as fairly as possible and both the empirical and analytical evaluations show that the algorithm provides better performance than the balanced algorithm for the active contour extraction. The optimal scheduling parameter is also described for a special case. The analytical evaluation confirms the effectiveness of the algorithm and the experimental result shows that the algorithm provides up to 10% better performance than the balanced algorithm for the active contour extraction. |
|---|---|
| ISBN: | 0780376617 9780780376618 |
| DOI: | 10.1109/ICTEL.2003.1191675 |