Copyright © 2008 Rehab F. Abdel-Kader. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

1. P. Arató, Z. Á. Mann, and A. Orbán, “Time-constrained scheduling of large pipelined datapaths,” Journal of Systems Architecture, vol. 51, no. 12, pp. 665–687, 2005. View at Publisher · View at Google Scholar
2. K. Ito, T. Iwata, and H. Kunieda, “An optimal scheduling method for parallel processing system of array architecture,” in Proceedings of the Asia and South Pacific Design Automation Conference (ASP-DAC '97), pp. 447–454, Chiba, Japan, January 1997. View at Publisher · View at Google Scholar
3. S. O. Memik, R. Kastner, E. Bozorgzadeh, and M. Sarrafzadeh, “A scheduling algorithm for optimization and early planning in high-level synthesis,” ACM Transactions on Design Automation of Electronic Systems, vol. 10, no. 1, pp. 33–57, 2005. View at Publisher · View at Google Scholar
4. S. Beaty, “Genetic algorithms and instruction scheduling,” in Proceedings of the 24th Annual International Symposium on Microarchitecture, pp. 206–211, Albuquerque, NM, USA, November 1992. View at Publisher · View at Google Scholar
5. P. G. Paulin and J. P. Knight, “Force-directed scheduling in automatic data path synthesis,” in Proceedings of the 24th ACM/IEEE Conference on Design Automation, pp. 195–202, Miami Beach, Fla, USA, June 1987. View at Publisher · View at Google Scholar
6. P. G. Paulin and J. P. Knight, “Force-directed scheduling for the behavioral synthesis of ASIC's,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 8, no. 6, pp. 661–679, 1989. View at Publisher · View at Google Scholar
7. G. De Micheli, Synthesis and Optimization of Digital Circuits, McGraw-Hill, Boston, Mass, USA, 1994.
8. R. Camposano, “Path-based scheduling for synthesis,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 10, no. 1, pp. 85–93, 1991. View at Publisher · View at Google Scholar
9. E. Bonsma and S. Gerez, “A genetic approach to the overlapped scheduling of iterative data-flow graphs for target architectures with communication delays,” in Proceedings of the ProRISC Workshop on Circuits, Systems and Signal Processing, Mierlo, The Netherlands, November 1997.
10. M. J. M. Heijligers and J. A. G. Jess, “High-level synthesis scheduling and allocation using genetic algorithms based on constructive topological scheduling techniques,” in Proceedings of IEEE Conference on Evolutionary Computation, vol. 1, pp. 56–61, Perth, Australia, November-December 1995. View at Publisher · View at Google Scholar
11. G. Wang, W. Gong, and R. Kastner, “Instruction scheduling using MAX-MIN ant system optimization,” in Proceedings of the ACM Great Lakes Symposium on VLSI (GLSVLSI '05), pp. 44–49, Chicago, Ill, USA, April 2005. View at Publisher · View at Google Scholar
12. J.-F. Chang, S.-C. Chu, J. F. Roddick, and J.-S. Pan, “A parallel particle swarm optimization algorithm with communication strategies,” Journal of Information Science and Engineering, vol. 21, no. 4, pp. 809–818, 2005.
13. R. C. Eberhart and J. Kennedy, “A new optimizer using particle swarm theory,” in Proceedings of the 6th International Symposium on Micro Machine and Human Science (MHS '95), pp. 39–43, IEEE Service Center, Nagoya, Japan, October 1995. View at Publisher · View at Google Scholar
14. R. C. Eberhart and Y. H. Shi, “Comparison between genetic algorithm and particle swarm optimization,” in Proceedings of the 7th International Conference on Evolutionary Programming (EP '98), pp. 611–619, San Diego, Calif, USA, March 1998. View at Publisher · View at Google Scholar
15. J. Kennedy and R. C. Eberhart, “Particle swarm optimization,” in Proceedings of IEEE International Conference on Neural Networks (ICNN '95), vol. 4, pp. 1942–1948, IEEE Service Center, Perth, Australia, November-December 1995. View at Publisher · View at Google Scholar
16. Y. Shi and R. C. Eberhart, “Parameter selection in particle swarm optimization,” in Proceedings of the 7th Annual Conference on Evolutionary Programming (EP '98), pp. 591–600, San Diego, Calif, USA, March 1998.
17. Y. Shi and R. C. Eberhart, “A modified particle swarm optimizer,” in Proceedings of IEEE International Conference on Evolutionary Computation, pp. 69–73, Anchorage, Alaska, USA, May 1998. View at Publisher · View at Google Scholar
18. S.-C. Chu, Y.-T. Chen, and J.-H. Ho, “Timetable scheduling using particle swarm optimization,” in Proceedings of the 1st International Conference on Innovative Computing, Information and Control (ICICIC '06), pp. 324–327, Beijing, China, August-September 2006. View at Publisher · View at Google Scholar
19. K.-P. Wang, L. Huang, C.-G. Zhou, and W. Pang, “Particle swarm optimization for traveling salesman problem,” in Proceedings of the International Conference on Machine Learning and Cybernetics (ICMLC '03), vol. 3, pp. 1583–1585, Shanghai, China, August 2003. View at Publisher · View at Google Scholar
20. X. Kong, J. Sun, and W. Xu, “Particle swarm algorithm for tasks scheduling in distributed heterogeneous system,” in Proceedings of the 6th International Conference on Intelligent Systems Design and Applications (ISDA '06), vol. 2, pp. 690–695, Jinan, China, October 2006. View at Publisher · View at Google Scholar
21. A. Shatnawi, M. O. Ahmad, and M. N. S. Swamy, “Optimal scheduling of digital signal processing data-flow graphs using shortest-path algorithms,” The Computer Journal, vol. 45, no. 1, pp. 88–100, 2002. View at Publisher · View at Google Scholar