Ant colony optimizations for resource- and timing-constrained operation scheduling

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Volumn 26, Issue 6, 2007, Pages 1010-1028

  Wang, Gang ^a,b   Gong, Wenrui ^a,c   DeRenzi, Brian ^a,d   Kastner, Ryan ^a,b  

^a IEEE   (United States)

^b University of California   (United States)

^c MENTOR GRAPHICS CORPORATION   (United States)

^d University of Washington   (United States)

Author keywords

Force directed scheduling (FDS); List scheduling; MAX MIN ant system (MMAS); Operation scheduling (OS)

Indexed keywords

FORCE DIRECTED SCHEDULING (FDS); LIST SCHEDULING; MAX MIN ANT SYSTEM (MMAS); OPERATION SCHEDULING (OS);

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; COMPUTER SIMULATION; HEURISTIC METHODS; OPTIMIZATION; SCHEDULING ALGORITHMS;

COMPUTER RESOURCE MANAGEMENT;

EID: 34247553915     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCAD.2006.885829     Document Type: Article

References (46)

1. Semiconductor Industry Association, National Technology Roadmap for Semiconductors, 2003.
2. K. Kennedy and R. Allen, Optimizing compilers for modern architectures: A dependence-based approach. San Mateo, CA: Morgan Kaufmann, 2001.
3. A. Aletà, J. M. Codina, J. Sánchez, and A. González, "Graph-partitioning based instruction scheduling for clustered processors," in Proc. 34th Annu. ACM/IEEE Int. Symp. Microarchitecture, 2001, pp. 150-159.
4. G. D. Micheli, Synthesis and Optimization of Digital Circuits. New York: McGraw-Hill, 1994.
5. J. E. Smith, "Dynamic instruction scheduling and the astronautics ZS-1," Computer, vol. 22, no. 7, pp. 21-35, Jul. 1989.
6. T. Stützte and H. H. Hoos, "MAX-MIN ant system," Future Gener. Comput. Syst., vol. 16, no. 9, pp. 889-914, Sep. 2000.
7. H. Topcuouglu, S. Hariri, and M. You Wu, "Performance-effective and low-complexity task scheduling for heterogeneous computing," IEEE Trans. Parallel Distrib. Syst., vol. 13, no. 3, pp. 260-274, Mar. 2002.
8. D. Bernstein, M. Rodeh, and I. Gertner, "On the complexity of scheduling problems for parallel/pipelined machines," IEEE Trans. Comput., vol. 38, no. 9, pp. 1308-1313, Sep. 1989.
9. K. Wilken, J. Liu, and M. Heffernan, "Optimal instruction scheduling using integer programming," in Proc. ACM SIGPLAN Conf. Program. Language Des. and Implementation, 2000, pp. 121-133.
10. P. G. Paulin and J. P. Knight, "Force-directed scheduling in automatic data path synthesis," in Proc. 24th ACM/IEEE Conf. Des. Autom. Conf., 1987, pp. 195-202.
11. P. G. Paulin and J. P. Knight, "Force-directed scheduling for the behavioral synthesis of ASIC's," IEEE Trans. Comput.-Aided Design Integr. Circuits Syst., vol. 8, no. 6, pp. 661-679, Jun. 1989.
12. W. F. J. Verhaegh, E. H. L. Aarts, J. H. M. Korst, and P. E. R. Lippens, "Improved force-directed scheduling," in Proc. EURO-DAC, 1991, pp. 430-435.
13. W. F. J. Verhaegh, P. E. R. Lippens, E. H. L. Aarts, J. H. M. Korst, A. van der Werf, and J. L. van Meerbergen, "Efficiency improvements for force-directed scheduling," in Proc. IEEE/ACM Int. Conf. Comput.-Aided Des., 1992, pp. 286-291.
14. I.-C. Park and C.-M. Kyung, "Fast and near optimal scheduling in automatic data path synthesis," in Proc. 28th ACM/IEEE DAC. 1991, pp. 680-685.
15. B. W. Kernighan and S. Lin, "An efficient heuristic procedure for partitioning graphs," Bell Syst. Tech. J., vol. 49, no. 2, pp. 291-307, Feb. 1970.
16. M. Heijligers and J. Jess, "High-level synthesis scheduling and allocation using genetic algorithms based on constructive topological scheduling techniques," in Proc. Int. Conf. Evol. Comput., Perth, Australia, 1995, pp. 56-61.
17. A. Sharma and R. Jain, "Insyn: Integrated scheduling for DSP applications," in Proc. DAC, 1993, pp. 349-354.
18. T. L. Adam, K. M. Chandy, and J. R. Dickson, "A comparison of list schedules for parallel processing systems," Commun. ACM, vol. 17, no. 12, pp. 685-690, 1974.
19. M. Grajcar, "Genetic list scheduling algorithm for scheduling and allocation on a loosely coupled heterogeneous multiprocessor system," in Proc. 36th ACM/IEEE Conf. Des. Autom. Conf., 1999, pp. 280-285.
20. S. J. Beaty, "Genetic algorithms versus tabu search for instruction scheduling," in Proc. Int. Conf. Artif. Neural Nets and Genetic Algorithms, 1993, pp. 496-501.
21. P. H. Sweany and S. J. Beaty, "Instruction scheduling using simulated annealing," in Proc. 3rd Int. Conf. Massively Parallel Comput. Syst., 1998.
22. R. Kolisch and S. Hartmann, Project Scheduling: Recent Models, Algorithms and Applications. Norwell, MA: Kluwer, 1999, ch. Heuristic Algorithms for Solving the Resource-Constrained Project Scheduling problem: Classification and Computational Analysis.
23. A. Auyeung, I. Gondra, and H. K. Dai, Advances in Soft Computing: Intelligent Systems Design and Applications. New York: Springer-Verlag, 2003, ch. Integrating random ordering into multi-heuristic list scheduling genetic algorithm.
24. M. Dorigo, V. Maniezzo, and A. Colorni, "Ant system: Optimization by a colony of cooperating agents," IEEE Trans. Syst., Man Cybern. B, Cybern., vol. 26, no. 1, pp. 29-41, Feb. 1996.
25. J. L. Deneubourg and S. Goss, "Collective patterns and decision making," Ethol., Ecol Evol., vol. 1, no. 4, pp. 295-311, Dec. 1989.
26. S. Fenet and C. Solmon, "Searching for maximum cliques with ant colony optimization," in Proc. 3rd Eur. Workshop Evol. Comput. Combinatorial Optimization, Apr. 2003, pp. 236-245.
27. L. M. Gambardella, E. D. Taillard, M. Dorigo, "Ant colonies for the quadratic assignment," J. Oper. Res. Soc., vol. 50, no. 2, pp. 167-176, 1996.
28. D. Costa and A. Hertz, "Ants can colour graphs," J. Oper. Res. Soc., vol. 48, no. 3, pp. 295-305, Mar. 1996.
29. G. Leguizamon and Z. Michalewicz, "A new version of ant system for subset problems," in Proc. Congr. Evol. Comput., 1999, pp. 1459-1464.
30. R. Michel and M. Middendorf, New Ideas in Optimization. London, U.K.: McGraw-Hill, 1999, ch. An ACO algorithm for the shortest super-sequence problem, pp. 51-61.
31. S. Fidanova, "Evolutionary algorithm for multiple knapsack problem," in Pmc. PPSN-VII, 2002, pp. 42-43.
32. L. M. Gambardella, E. D. Taillard, and G. Agazzi, New Ideas in Optimization. London, U.K.: McGraw-Hill, 1999, ch. A multiple ant colony system for vehicle routing problems with time windows, pp. 51-61.
33. R. S. Parpinelli, H. S. Lopes, and A. A. Freitas, "Data mining with an ant colony optimization algorithm," IEEE Trans. Evol. Comput., vol. 6, no. 4, pp. 321-332, Aug. 2002.
34. R. Schoonderwoerd, O. Holland, J. Bruten, and L. Rothkrantz, "Ant-based load balancing in telecommunications networks," Adapt. Behav., vol. 5, no. 2, pp. 169-207, 1996.
35. G. Wang, W. Gong, and R. Kastner, "A new approach for task level computational resource bi-partitioning," in Proc. 15th Int. Conf. Parallel and Distrib. Comput. and Syst., Nov. 2003, vol. 1, no. 1, pp. 439-444.
36. G. Wang, W. Gong, and R. Kastner, "System level partitioning for programmable platforms using the ant colony optimization," in Proc. 13th IWLS, Jun. 2004, pp. 238-245.
37. G. Wang, W. Gong, and R. Kastner, "Application partitioning on programmable platforms using the ant colony optimization," J. Embedded Comput., vol. 2, no. 1, pp. 119-136, 2006.
38. W. J. Gutjahr, "ACO algorithms with guaranteed convergence to the optimal solution," Inf. Process. Lett., vol. 82, no. 3, pp. 145-153, 2002.
39. G. Pruesse and F. Ruskey, "Generating linear extensions fast," SIAM J. Comput., vol. 23, no. 2, pp. 373-386, 1994.
40. C. Lee, M. Potkonjak, and W. H. Mangione-Smith, "MediaBench: A tool for evaluating and synthesizing multimedia and communications systems," in Proc. 30th Annu. ACM/IEEE Int. Symp. Microarchitecture, 1997, p. 330.
41. G. Aigner, A. Diwan, D. L. Heine, M. S. Lam, D. L. Moore, B. R. Murphy, and C. Sapuntzakis, The Basic SUIF Programming Guide. Stanford, CA: Comput. Syst. Lab., Stanford Univ., Aug. 2000.
42. M. D. Smith and G. Holloway, An Introduction to Machine SUIF and Its Portable Libraries for Analysis and Optimization. Cambridge, MA: Division Eng. Appl. Sci., Harvard Univ., Jul. 2002.
43. G. Wang, W. Gong, B. DeRenzi and R. Kastner, ExpressDFG benchmark suite. [Online]. Available: http://express.ece.ucsb.edu/benchmark/
44. T. Wiangtong, P. Y. K. Cheung, and W. Luk, "Comparing three heuristic search methods for functional partitioning in hardware-software code-sign," Des. Autom. Embed. Syst., vol. 6, no. 4, pp. 425-429, Jul. 2002.
45. E. Aarts and J. Korst, Simulated. Annealing and Boltzmann Machines: A Stochastic Approach to Combinatoria Optimization and Neural Computing. New York: Wiley, 1989.
46. S. Kopuri and N. Mansouri, "Enhancing scheduling solutions through ant colony optimization," in Proc. ISCAS, May 2004, pp. V-257-wV-260.