Browse > Article

Improved Task Scheduling Algorithm Considering the Successive Communication Features of Heterogeneous Message-passing System  

노두호 (서강대학교 컴퓨터학과)
김성천 (서강대학교 컴퓨터학과)
Publication Information
Journal of KIISE:Computer Systems and Theory / v.31, no.5_6, 2004 , pp. 347-352 More about this Journal
Abstract
This thesis deals with a task scheduling on a message-passing system. Scheduling and allocation are very important issues since the inappropriate scheduling of tasks cannot exploit the true potential of the system and it can offset the grain from parallelization. It is difficult to apply previous schemes to message-passing system, because previous schemes assume the shared memory system. This thesis proposes an modified priority function and processor selection technique that consider the problems caused by the difference between previous models and message-passing environments. The priority function includes the cumulative communication cost which causes task execution to be delayed. The processor selection technique avoids the situation that a child task is assigned to the same Processor allocated to its parent task that has other unscheduled child tasks. We showed by some simulations that our modified features of task scheduling algorithm can make the better scheduling results than the previous algorithms.
Keywords
message passing; task scheduling; communication cost;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Y. - K. Kowk and I. Ahmad, 'Static Scheduling Algorithms for Allocating Directed Task Graphs to Multiprocessors,' ACM Computing Surveys, vol. 31, no. 4, 1999, pp.406-471   DOI
2 K. Hwang and Z. Xu, Scalable Parallel Computing, McGraw-Hill, 1998, pp.13-36
3 H. Topcuoglu, S. Hariri, and M. - Y. Wu, 'Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing,' IEEE Transactions on parallel and distributed system. vol. 13, no. 3, March 2002, pp.260-274   DOI   ScienceOn
4 T. Hsu and D. R. Lopez, 'Task Allocation on a Network of Processors,' IEEE Transactions on computers, vol. 49, no. 12, December 2000,. pp.1339-1353   DOI   ScienceOn
5 H. El-Rewini, T. G. Lewis and H. H. Ali, Task Scheduling in Parallel and Distributed Systems, PTR Prentice Hall, USA, 1994, pp.17-81
6 B. R. Arafeh, 'Clustering Algorithm for Scheduling Parallel Programs on NOWs with Synchronization Requirements at the Application Level,' proceedings of IPDPS'02, Fort Lauderdale, California, April 2002, http://www.computer.org/proceedings/ipdps/1573/symposium/1573toc.htm
7 D. Kadamuddi and J. J. P. Tsai, 'Clustering Algorithm for Parallelizing Software Systems in Multiprocessors Environment,' IEEE Transactions on Software Engineering, vol. 26, no. 4, April 2000, pp.340- 361   DOI   ScienceOn
8 I. Ahmad and Y-K. Kwok, 'On Parallelizing the Multiprocessor Scheduling Problem,' IEEE Transactions on parallel and distributed system. vol. 10, no. 4, April 1999, pp.414-432   DOI   ScienceOn