In this study, we present a novel compiler-time scheduling algorithm, DCPD, for distributed computing environments which consists of heterogeneous resources.
The proposed algorithm could avoid the redundant duplication to improve the utilization, and could also generate the shorter schedule length. The effectiveness of the DCPD algorithm is shown by comparing three proposed algorithms.
Experimental results display the superiority of the DCPD algorithm over those presented in previous literature, and also show that the scheduling performance is affected by the heterogeneity of computational power, the heterogeneity of communication mechanisms and the program structure of applications.
The time complexity of the DCPD algorithm is O((|N|+|E|)|N||P|). It is reasonable in practical applications. Therefore, the proposed scheduling algorithm may be used in designing scheduling strategies for those situations where the system heterogeneity is the system performance bottlenecks. In this paper, the experiment runs at the simulation environment and the experiment result is satisfaction explicitly. Therefore; this new algorithm is suitable to be applied in the heterogeneous computing environment.
The preliminary experimental results have been proposed in IEEE the Twelfth International Conference on Parallel and Distributed Systems (ICPADS 2006).
The future works of our study include:
1. To reduce the time complexity of the DCPD algorithm.
2. Exploiting the utilization more effectively.
3. Try to apply the DCPD algorithm into the middleware.
References
Ahmad, I., and Kwok, Y.-K. (1998). On Exploiting Task Duplication in Parallel Program Scheduling, IEEE Transactions on Parallel and Distributed Systems, 9(8), 872-892.
Bozdag, Doruk., Ozguner, Fusun., Ekici, Eylem., and Catalyurek, Umit. (2005).
A Task Duplication Based Scheduling Algorithm Using Partial Schedules.
Proceedings of the 2005 International Conference on Parallel Processing (ICPP’05),
Braun, T., Siegel, H.J., Beck, N., Boloni, L.L., Maheswaran, M., Reuther, A.I., Robertson, J.P., Theys, M.D., Yao, B., Hengsen, D., and Freund, R.F. (1999).
A Comparison Study 25 of Static Mapping Heuristics for a Classes of Meta-Tasks on Heterogeneous Computing Systems, Proc. Heterogeneous Computing Workshop, 15-29.
Chung, Y.C., and Ranka, S. (1992). Application and Performance Analysis of a Compile-Time Optimization Approach for List Scheduling Algorithms on Distributed-Memory Multiprocessors, Proc. Supercomputing, 512-521.
Chung, Y.C., Liu, C.C., and Liu, J.S. (1995, June). Applications and Performance Analysis of A Compile-Time Optimization Approach for List Scheduling Algorithms on Distributed Memory Multiprocessors. Journal of Information Science and Engineering, 11(2), 155-181.
Dogan, A. and Ozguner, R. (2002). LDBS: a duplication based scheduling algorithm for heterogeneous computing systems. Proceedings of International Conference on Parallel Processing 2002 (ICPP'02), 352- 359.
Garey, M.R., and Johnson, D.S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman.
Gerasoulis, A. and Yang, T. (1992). A Comparison of Clustering Heuristics for Scheduling Directed Acyclic Graphs onto Multiprocessors, Journal of Parallel and Distributed Computing, 16( 4), 276-291.
Gerasoulis, A. and Yang, T. (1993). On the Granularity and Clustering of Directed Acyclic Task Graphs, IEEE Transactions on Parallel and Distributed Systems, 4(6), 686-701.
Guodong, L., Daoxu, C., Daming, W., and Defu, Z. (2003). Task clustering and scheduling to multiprocessors with duplication, Proceedings of the International Parallel and Distributed Processing Symposium, April 2003.
Hagras, Tarek., and Janecek, Jan. (2003). A High Performance, Low Complexity Algorithm for Compile-Time Job Scheduling in Homogeneous Computing Environment, 2003 IEEE Int. Conf. on Parallel Processing Workshops.
Hagras, Tarek., and Janecek, Jan. (2004). A High Performance, Low Complexity Algorithm for Compile-Time Task Scheduling in Heterogeneous Systems, 2004 IEEE Int. Parallel and Distributed Processing Symposium.
Hagras, Tarek., and Janecek, Jan. (2004). A Near Lower-Bound Complexity
Algorithm for Compile-Time Task-Scheduling in Heterogeneous Computing Systems, 2004 IEEE Proceedings of the ISPDC/HeteroPar’04.
ILIJA, EKMECIC., IGOR, TARTALJA,, AND VELJKO MILUTINOVIC (1996).
A Survey of Heterogeneous Computing: Concepts and Systems, PROCEEDINGS OF THE IEEE, vol. 84, NO. 8.
Kwok, Y.-K. (2000). Parallel Program Execution on a Heterogeneous PC Cluster Using Task Duplication. Heterogeneous Computing Workshop 2000, 364-374.
Kwok, Y.-K., and Ahmad, I. (1996). Dynamic critical-path scheduling: an effective technique for allocating task graphs onto multiprocessors. IEEE Transactions on Parallel and Distributed Systems, 7(5), 506–521.
Kwok, Y.-K., and Ahmad, I. (1999). Static scheduling algorithms for allocating directed task graphs to multiprocessors, ACM Computing Surveys, 31(4), 406 – 471.
Kwok, Y.-K., and Ahmad, I. (2000). Link Contention-Constrained Scheduling and Mapping of Tasks and Messages to a Network of Heterogeneous Processors, Cluster Computing:Journal of Networks, Software Tools, and Applications, 3(2), 113-124.
Lai, G.J., Fang, J.F., Sung, P.S., and Pean, D.L. (2003). Scheduling Parallel Tasks onto NUMA Multiprocessors with Inter-processor Communication Overhead, 2003 International Symposium on Parallel and Distributed Processing and
Applications, ISPA-03, Japan, 2(4).
Li, C.F. (2006, July). A Study of a Scalable Duplication-based Task Scheduling Algorithm with Low Complexity. Unpublished dissertation, National Tai-chung University, Taiwan.
Liu, C.H., Li, C.F., Lai, K.C., and Wu, C.C. (2006, July). A Dynamic Critical Path Duplication Task Scheduling Algorithm for Distributed Heterogeneous Computing Systems. The 2006 International Conference on Parallel and Distributed Systems (ICPADS 2006), Minneapolis, U.S.A.
Lord, R.E., Kowalik, J.S., and Kumar, S.P. (1983, Jan). Solving Linear Algebraic Equations on an MIMD Computer. Journal of the ACM, 30(1), 103-117.
Olivier, B., Vincent, B., and Yves, R. (2002). The Iso-Level Scheduling Heuristic for Heterogeneous Processors, Proc. Of 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing.
Palis, M.A., Liou, J.-C., and Wei, D.S.L. (1996). Task Clustering and Scheduling for Distributed Memory Parallel Architectures, IEEE Transactions on Parallel and Distributed Systems, 7(1), 46-55.
Pande, S.S., Agrawal, D.P., and Mauney, J. (1994). A New Threshold Scheduling Strategy for Sisal Programs on Distributed Memory Systems, Journal of Parallel and Distributed Computing, 21(2), 223-236.
Pande, S.S., Agrawal, D.P., and Mauney, J. (1995). A Scalable Scheduling
Method for Functional Parallelism on Distributed Memory Multiprocessors, IEEE Transactions on Parallel and Distributed Systems, 6(4), 388-399.
Park, C., and Choe, T. (2002). An optimal scheduling algorithm based on task duplication. IEEE Transactions on Computers, 51(4), 444–448.
Park, G., shirazi, B., Marquis, J., Choo, H. (1997). Decisive path scheduling: a new list scheduling method, proceedings of the ICPP.
Pasham, Srikar., and Lin, Wei-Ming. (2005). Efficient Task Scheduling with Duplication for Bounded Number of Processors, Proceedings of the 2005 11th International Conference on Parallel and Distributed Systems (ICPADS'05)
Ranaweera, A. and Agrawal, D.P. (2000). A Scalable Task Duplication Based Scheduling Algorithm for Heterogeneous Systems, Proc. Int’l Conf.
Parallel Processing, 383-390.
Ranaweera, A. and Agrawal, D.P. (2000). A Task Duplication Based Scheduling Algorithm for Heterogeneous Systems, Proc. Int’l Conf. Parallel Processing Symp., 445-450.
Ranaweera, S., & Agrawal, D. P. (2000). A Scalable Task Duplication Based Scheduling Algorithm for Heterogeneous Systems. ICPP 2000,383-390.
Rashmi, Bajaj., and Dharma P. Agrawal (2004). Improving Scheduling of Tasks in a Heterogeneous Environment, IEEE Transactions on Parallel and Distributed Systems, 15(2), 107-118.
Sanjeev, Baskiyar., and Christopher, Dickinson. (2005). Scheduling directed a-cyclic task graphs on a bounded set of heterogeneous processors using task duplication, Journal of Parallel and Distributed Computing, Vol. 65, 911-921.
Sarkar, V. (1989). Partitionning and Scheduling Parallel Programs for Execution on Multiprocessors. MIT Press.
Savina, Bansal., Padam, Kumar., and Kuldip, Singh. (2003). An Improved Duplication Strategy for Scheduling Precedence Constrained Graphs in Multiprocessor Systems, IEEE Transactions on Parallel and Distributed Systems, 14(6), 533-544.
Selvakumar, S., and Siva, Ram Murthy C. (1994). Scheduling Precedence Constrained Task Graphs with Non-Negligible Intertask Communication onto Multiprocessors, IEEE Transactions on Parallel and Distributed Systems, 5(3), 328-336.
Sih, G.C., and Lee, E.A. (1993). A Compiler-Time Scheduling Heuristic for Interconnection-Constrained Heterogeneous Processor Architectures, IEEE Transactions on Parallel and Distributed Systems, 4(2), 175-186 .
Sinnen, O., and Sousa, L. (2004). List Scheduling: Extension for Contention Awareness and Evaluation of Node Priorities for Heterogeneous Cluster Architectures, Parallel Computing, 30(1), 81-101.
Topcuoglu, H., Hariri, S., and Wu, M-Y. (2002). Performance-Effective and
Low-Complexity Task Scheduling for Heterogeneous Computing, IEEE Transactions on Parallel and Distributed Systems, 13(3), 260-274.
Ullman, J.D. (1975). NP-Complete Scheduling Problems, Journal of Computing System Science, vol. 10, 384-393.
Wu, M.Y., & Gajski, D. (1990). Hypertool: A Programming Aid for Message-Passing Systems. IEEE Transactions on Parallel and Distributed Systems, 1(3), 330-343.
Yang, T., & Gerasoulis, A. (1993). DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors. IEEE Transactions on Parallel and Distributed Systems, 5(9), 951-967.
宋佩珊 (民 92)。透過網路連結異質性電腦環境中增進計算效能之研究。未出 版之碩士論文，國立台中師範學院教育測驗統計所，台中市。