This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Efficient Local Search for DAG Scheduling
June 2001 (vol. 12 no. 6)
pp. 617-627

Abstract—Scheduling DAGs to multiprocessors is one of the key issues in high-performance computing. Most realistic scheduling algorithms are heuristic and heuristic algorithms often have room for improvement. The quality of a scheduling algorithm can be effectively improved by a local search. In this paper, we present a fast local search algorithm based on topological ordering. This is a compaction algorithm that can effectively reduce the schedule length produced by any DAG scheduling algorithm. Thus, it can improve the quality of existing DAG scheduling algorithms. This algorithm can quickly determine the optimal search direction. Thus, it is of low complexity and extremely fast.

[1] T.L. Adam, K.M. Chandy, and J.R. Dickson, “A Comparison of List Schedules for Parallel Processing Systems,” Comm. ACM, vol. 17, no. 12, pp. 685-690, Dec. 1974.
[2] Y.-C. Chung and S. Ranka,"Applications and performance analysis of a compile-time optimization approach for list scheduling algorithms on distributed memory multiprocessors," Proc. Supercomputing '92, pp. 512-521, 1992.
[3] Computer and Job-Shop Scheduling Theory. E. Coffman, ed., John Wiley&Sons, 1976.
[4] H.E. Rewini and T.G. Lewis,"Scheduling parallel program tasks onto arbitrary target machines," J. Parallel and Distributed Computing, vol. 9, pp. 138-153, 1990.
[5] H. El-Rewini, T.G. Lewis, and H.H. Ali, Task Scheduling in Parallel and Distributed Systems. Prentice Hall, 1994.
[6] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness.New York: W.H. Freeman, 1979.
[7] R.L. Graham, E.L. Lawler, J.K. Lenstra, and A.H.G. Rinnoy Kan, “Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey,” Annals of Discrete Math., vol. 5, pp. 287-326, 1979.
[8] J. Gu, “Parallel Algorithms and Architectures for Very Fast Search,” Technical Report UUCS-TR-88-005, Dept. of Computer Science, Univ. Utah, July 1988.
[9] J. Gu, “How to Solve Very Large-Scale Satisfiability Problems,” Technical Report UUCS-TR-88-032, Dept. of Computer Science, Univ. Utah, 1988 (and UCECE-TR-90-002, 1990).
[10] J. Gu, “Efficient Local Search for Very Large-Scale Satisfiability Problem,” SIGART Bulletin, vol. 3, no. 1, pp. 8-12, Jan. 1992.
[11] J. Gu and Q.P. Gu, “Average Time Complexities of Several Local Search Algorithms for the Satisfiability Problem,” Lecture Notes in Computer Science, vol. 834, pp. 146-154 1994.
[12] J. Gu, “Local Search for Satisfiability (SAT) Problem,” IEEE Trans. Systems, Man, and Cybernetics, vol. 23, no. 4, pp. 1108-1129, July 1993.
[13] T.C. Hu, “Parallel Sequencing and Assembly Line Problems,” Operations Research, vol. 9, no. 6, pp. 841-848, 1961.
[14] A.A. Khan, C.L. McCreary, and M.S. Jones, “A Comparison of Multiprocessor Scheduling Heuristics,” Proc. Int'l Conf. Parallel Processing, vol. II, pp. 243-250, Aug. 1994.
[15] B. Kruatrachue and T. Lewis,"Grain size determination for parallel processing," IEEE Software, pp. 23-32, Jan. 1988.
[16] Y.-K. Kwok, I. Ahmad, and J. Gu, “FAST: A Low-Complexity Algorithm for Efficient Scheduling of DAGs on Parallel Processors,” Proc. Int'l Conf. Parallel Processing (ICPP), vol. II, pp. 150-157, Aug. 1996.
[17] Y.K. Kwok and I. Ahmad, “FASTEST: A Practical Low-Complexity Algorithm for Compile-Time Assignment of Parallel Programs to Multiprocessors,” IEEE Trans. Parallel and Distributed Systems, vol. 10, no. 2, pp. 147-159, Feb. 1999.
[18] R. Puri and J. Gu, “Microword Length Minimization in Microprogrammed Controller Synthesis,” IEEE Trans. Computer Aided Design, vol. 10, pp. 1449-1457, Oct. 1993.
[19] V. Sarkar,Partitioning and Scheduling Parallel Programs for Execution on Multiprocessors.Cambridge, Mass.: MIT Press, 1989.
[20] G.C. Sih and E.A. Lee, “A Compile-Time Scheduling Heuristic for Interconnection-Constrained Heterogeneous Processor Architectures,” IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 2, pp. 175-186, Feb. 1993.
[21] R. Sosic and J. Gu, “How to Search for Million Queens,” Technical Report UUCS-TR-88-008, Dept. of Computer Science, Univ. of Utah, Feb. 1988.
[22] R. Sosic and J. Gu, “Fast Search Algorithms for the n-Queens Problem,” IEEE Trans. Knowledge and Data Engineering, vol. 21, no. 5, pp. 661-668, Oct. 1994.
[23] R. Sosic and J. Gu, “Efficient Local Search with Conflict Minimation,” IEEE Trans. Systems, Man, and Cybernetics, vol. 21, no. 6, pp. 1572-1576, Nov./Dec. 1991.
[24] M.Y. Wu and D.D. Gajski,"Hypertool: A programming aid for message-passing systems," IEEE Transactions on Parallel and Distributed Systems, vol. 1, no. 3, pp. 330-343, July 1990.
[25] T. Yang and A. Gerasoulis, “DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors,” IEEE Trans. Parallel and Distributed Systems, vol. 5, pp. 951-967, 1994.
[26] T. Yang and A. Gerasoulis, “PYRROS: Static Scheduling and Code Generation for Message Passing Multiprocessors,” Proc. Sixth ACM Int'l Conf. Supercomputing, pp. 428-437, 1992.

Index Terms:
DAG scheduling, multiprocessors, fast local search, quality, complexity.
Citation:
Min-You Wu, Wei Shu, Jun Gu, "Efficient Local Search for DAG Scheduling," IEEE Transactions on Parallel and Distributed Systems, vol. 12, no. 6, pp. 617-627, June 2001, doi:10.1109/71.932715
Usage of this product signifies your acceptance of the Terms of Use.