ESTONIAN ACADEMY
PUBLISHERS
eesti teaduste
akadeemia kirjastus
cover
Estonian Journal of Engineering

System-level optimization of NoC-based timing sensitive systems; pp. 158–168

Full article in PDF format | doi: 10.3176/eng.2011.2.06

Authors
Mihkel Tagel, Peeter Ellervee, Thomas Hollstein, Gert Jervan

Abstract
Communication modelling and synthesis plays an important role in the design of complex network-on-chip based timing-sensitive systems-on-chip. Trying to guarantee the observance of tim­ing constraints without detailed know-how of communication transactions might lead to unexpected results. In our previous work we have proposed a system level approach for communication modelling and synthesis to calculate hard communication deadlines based on communication delay models and on guidance of the scheduling process to take into account possible network conflicts. In this paper we combine our communication scheduling approach with global optimization techniques to perform design space exploration and/or improvement of the synthesized schedule.
References

  1. Marculescu, R., Ogras, U. Y., Li-Shiuan Peh, Jerger, N. E. and Hoskote, Y. Outstanding research problems in NoC design: system, microarchitecture, and circuit perspectives. IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, 2009, 28, 3–21.
doi:10.1109/TCAD.2008.2010691

  2. Tagel, M., Ellervee, P. and Jervan, G. System-level communication synthesis and dependability improvements for network-on-chip based systems. Estonian J. Eng., 2010, 16, 23–38.
doi:10.3176/eng.2010.1.05

  3. Tagel, M., Ellervee, P., Hollstein, T. and Jervan, G. Communication modelling and synthesis for NoC-based systems with real-time constraints. In Proc. IEEE Symposium on Design and Diagnostics of Electronic Circuits and Systems. Cottbus, Germany, 2011, 237–242.

  4. Garey, M. R. and Johson, D. S. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H.Freeman Publ., New York, 1979.

  5. Rahman, M. M. and Chowdhury, M. Examining branch and bound strategy on multiprocessor task scheduling. In Proc. International Conference on Computer and Information Technology. Dhaka, Bangladesh, 2009, 162–167.
doi:10.1109/ICCIT.2009.5407146

  6. Kazem, A., Rahmani, A. M. and Aghdam, H. H. A modified simulated annealing algorithm for static task scheduling in grid computing. In Proc. International Conference on Computer Science and Information Technology. Singapore, 2008, 623–627.
doi:10.1109/ICCSIT.2008.163

  7. Orsila, H., Salminen, E., Hännikäinen, M. and Hämäläinen, T. D. Optimal subset mapping and convergence evaluation of mapping algorithms for distributing task graphs on multi­processor SoC. In Proc. International Symposium on System-on-Chip. Tampere, Finland, 2007, 1–6.

  8. Talbi, E.-G. and Muntean, T. Hill-climbing, simulated annealing and genetic algorithms: a comparative study and application to the mapping problem. In Proc. 26th Hawaii Inter­national Conference on System Sciences. Wailea, Hawaii, 1993, 565–573.

  9. Lee, C. and Bic, L. On the mapping problem using simulated annealing. In Proc. 8th Annual International Phoenix Conference on Computers and Communications. Scottsdale, Arizona, USA, 1989, 40–44.
doi:10.1109/PCCC.1989.37357

10. Lu, Z., Xia, L. and Jantsch, A. Cluster-based simulated annealing for mapping cores onto 2D mesh networks on chip. In Proc. 11th IEEE Workshop on Design and Diagnostics of Electronic Circuits and Systems. Bratislava, Slovakia, 2008, 1–6.
doi:10.1109/DDECS.2008.4538763

11. Nanda, A. K., DeGroot, D. and Stenger, D. L. Scheduling directed task graphs on multi­processors using simulated annealing. In Proc. 12th International Conference on Distributed Computing Systems. Yokohama, Japan, 1992, 20–27.
doi:10.1109/ICDCS.1992.235059

12. Murali, S., Benini, L. and De Micheli, G. Mapping and physical planning of networks-on-chip architectures with quality-of-service guarantees. In Proc. Asia and South Pacific Design Automation Conference. Shanghai, China, 2005, 27–32.

13. Ascia, G., Catania, V. and Palesi, M. An evolutionary approach to network-on-chip mapping problem. In Proc. 2005 IEEE Congress on Evolutionary Computation. Edinburgh, Scot­land, 2005, 112–119.
doi:10.1109/CEC.2005.1554674

14. Kirkpatrick, S., Gelatt, C. D. and Vecchi, M. P. Optimization by simulated annealing. Science, 1983, 220(4598), 671–680.
doi:10.1126/science.220.4598.671

15. Ledesma, S., Avina, G. and Sanchez, R. Practical considerations for simulated annealing implementation. In Simulated Annealing (Tan, C. M., ed.). InTech, 2008.

16. Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N. and Teller, A. H. Equation of state calculations by fast computing machines. J. Chem. Phys., 1953, 21, 1087–1092.
doi:10.1063/1.1699114
Back to Issue