- All Journals
- Al-Qadisiyah University
- Basrah University
- Kirkuk University
- Mosul University
- The Iraqi Borad for Medical Specialization
- University of Anbar
- University of Technology
- Al Mustafa University
- Al-Zahraa University for Women
- Alnoor University
- Kunooz University
- Misan University
- Ninevah University
- Tikrit University
- University of Al-Hamdaniya
- University of Kerbala
A Modified for Largest Processing Time Scheduling Algorithm in Multiprocessor | ||
| Tikrit Journal of Pure Science | ||
| Article 1, Volume 16, Issue 4, 2011, Pages 280-283 | ||
| Author | ||
| Isra Natheer Alkallak | ||
| Abstract | ||
| The research reviewed new priority allocated to the independent tasks in the graph in the modified algorithm for largest processing time scheduling algorithm in multiprocessor. Schedule length was taken criterion in determining the efficiency of the algorithm. The priority was calculated from the proportion of task's execution time to the total execution time for all tasks in the graph and then arranged in descending order. Practical side was simulated by computer program in Visual Basic 6 language. A modified algorithm is more efficient than shortest processing time scheduling algorithm. In practical side confirmed efficiency of modified algorithm by selecting free of first task from set of tasks in graph through scheduling. | ||
| Keywords | ||
| independent tasks; scheduling algorithm; priority | ||
|
Statistics Article View: 176 PDF Download: 95 |
||