Total views : 231

Optimal Resource Schedule in Architectural Level Synthesis using Evolutionary Computations


  • BMSCE, Department of Electrical Engineering Science, Visvesvaraya Technological University, Bangalore - 560019, Karnataka, India
  • Manuro Tech Research Pvt. Ltd, Bangalore - 560097, Karnataka, India


Objectives: This paper aims to find optimal resource schedule in Architectural level synthesis using Evolutionary Computation. Methods and Statistical Analysis: The paper is a comparative study of four Evolutionary Computations Algorithm: Differential Evolution (DE), Genetic Algorithm (GA), Evolutionary Programming (EP) and Particle Swarm Optimization (PSO). The problem area chosen is Hardware Abstraction Layer (HAL) benchmark scheduling problem using Integer Linear Programming method. Findings: The nature inspired computation algorithms should satisfy the Latency constrained Schedule, simulation results are implemented using MATLAB software. Conclusion/Application: The performance with respect to optimal resource schedule, number of generations, convergence time is compared among the four optimized algorithm are presented. The results prove Differential Evolution is better among the other optimized algorithm.


Architectural Level Synthesis, Evolutionary Computation, Hardware Abstraction Layer, Resource Schedule.

Full Text:

 |  (PDF views: 193)


  • Micheli DG. Synthesis and optimization of digital circuits. USA: McGraw-Hill; 1994.
  • Gajski D, Dutt ND, Wu A, Lin S. High level synthesis: Introduction to chip and system design. USA: Kluwer Academic Publisher; 1992. p. 219–24.
  • Shilpa KC, Narayana L. Natural computation for optimal scheduling with ilp modeling in high level synthesis. Science Direct, Procedia Engineering ELSEVIER Journal Publication. 2015; 46:167–75.
  • Back T, Fogel DB, Michalewicz M. Hand book on Evolutionary Computation. Institute of Physics Publication and Oxford University Press; 1997.
  • Goldberg DE. Genetic Algorithms in search, optimization and machine learning. Reading. MA: Addison-Wesley Publishing Co; 1989; 3(2):95–9.
  • Eiben AE, Smith JE. Introduction to evolutionary computing. Natural Computing Series Springer: Berlin Heidelberg: Springer-Verlag; 2003.
  • Eberhart RC, Shi Y. Comparison between Genetic Algorithms and Particle Swarm Optimization. Proceedings of Seventh Annual Conference on Evolutionary Programming; 1998. p. 611–6.
  • Storn R, Price K. Differential Evolution: A simple and efficient adaptive scheme of global optimization over continuous spaces. Journal of Global Optimization; 1997. p. 341–59.
  • Price K. Differential Evolution: A fast and simple numerical optimizer. NAFIPS. Biennial Conference of the North American Berkeley, CA; 1996. p. 842–4.
  • Grewal G, Cleirigh MO, Wineberg M. An evolutionary approach to behavioral-level synthesis. IEEE Trans VLSI circuits; 2003. p. 264–7.
  • Rohini V, Natrarajan AM. Comparison of Genetic Algorithm with Particle Swarm Optimization, Ant Colony Optimization and Tabu Search based on University Course Scheduling System. Indian Journal of Science and Technology. 2016 Jun; 9(21):1–5.
  • Nanda Kumar E, Dhanasekaran R, Mani R. Optimal location and improvement of voltage stability by UPFC using Genetic Algorithm (GA). Indian Journal of Science and Technology. 2015 Jun; 8(11):1–6.
  • Eiben AE, Smith JE. Introduction to Evolutionary Computing. Berlin: Springer; 2003.
  • Kennedy K, Eberhart RC. Particle Swarm Optimization. Proceedings IEEE Int Conf on Neural Networks (Perth Australia). Piscataway, IEEE Service Center: Springer Science+ Business Media, LLC; 1995.p. 760–6.
  • Effatnejad R, Rouhi F. Unit commitment in power system by combination of Dynamic Programming (DP), Genetic Algorithm (GA) and Particle Swarm Optimization (PSO). Indian Journal of Science and Technology. 2015 Jan; 8(2):131–41.
  • Hwang CT, Lee JH, Hsu YC, Lin YL. A formal approach to the scheduling problem in high level synthesis. IEEE Trans on Computer-Aided Design; 1991. p. 464–75.
  • Mohamad NH, Said F. Integer Linear Programming approach to scheduling toll booth collectors problem. Indian Journal of Science and Technology. 2013 May; 6(5):1–6.
  • Lee J, Hsu Y, Lin Y. A new integer linear programming formulation for the scheduling problem in data path synthesis. Proceedings of the International Conference on Computer Aided Design; 1989. p. 20–3.


  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.