The chapter suggests an FPGA-based implementation of graph colouring algorithms formulated over ternary matrices. First, software models (described in C + +) and the respective hardware circuits (synthesised from Handel-C specifications) for getting exact solutions are discussed, analysed and compared. Then it is shown that the exact algorithm can serve as a base for a number of approximate algorithms, which permit to improve incrementally the results until some predefined criteria are satisfied. Characteristics and capabilities of the approximate algorithms are also examined.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Celoxica products (visited on 03/04/2007). [Online] http://www.celoxica.com
Culberson J (visited on 03/04/2007) Graph coloring page. [Online] http://www.cs.ualberta.ca/~joe/Coloring/index.html
Ezick J (visited on 03/04/2007) Robotics. [Online] http://dimacs.rutgers.edu/REU/1996/ezick.html
Goossens G, Van Praet J, Lanneer D, Geurts W, Kifli A, Liem C, Paulin PG (1997) Embedded software in real-time signal processing systems: design technologies. Proceedings of the IEEE, 85(3):436-454
Lee TK, Leong PHW, Lee KH, Chan KT, Hui SK, Yeung HK, Lo MF, Lee JHM (1998) An FPGA implementation of GENNET for solving graph coloring problems. In: Proc. IEEE Symposium on Field-Programmable Custom Computing Machines-FCCM, USA, pp 284-285
Pochet LM, Linderman M, Kohler R, Drager S (visited on 03/04/2007) An FPGA based graph coloring accelerator. [Online] http://klabs.org/richcontent/MAPLDCon00/Papers/Session_A/A2_Pochet_P.pdf
Rosen KH (ed) (2000) Handbook of Discrete and Combinatorial Mathematics. CRC Press, USA
Skliarova I (2004) Reconfigurable Architectures for Combinatorial Optimization Problems. Ph.D. thesis, University of Aveiro, Portugal
Sklyarov V (2004) FPGA-based implementation of recursive algorithms. Microprocessors and Microsystems, Special Issue on FPGAs: Applications and Designs, 28(5-6):197-211
Sklyarov V, Skliarova I, Pimentel B (2006) Modeling and FPGA-based implementation of graph coloring algorithms. In: Proc. 3rd International Conference on Autonomous Robots and Agents-ICARA’2006, Palmerston North, New Zealand, pp 443-448
Subramonian V, Huang HM, Xing G, Gill C, Lu C, Cytron R (visited on 03/04/2007) Middleware specialization for memory-constrained networked embedded systems. [Online] http://www.cs.wustl.edu/~venkita/publications/rtsj_norb.pdf
Wu YL, Marek-Sadowska M (1993) Graph based analysis of FPGA routing. In: Proc. European Design Automation Conference, Germany, pp 104-109
Xilinx products (visited on 03/04/2007). [Online] http://www.xilinx.com
Zakrevskij AD (1981) Logical Synthesis of Cascade Networks. Science, Moscow
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Sklyarov, V., Skliarova, I., Pimentel, B. (2007). FPGA-Based Implementation of Graph Colouring Algorithms. In: Mukhopadhyay, S.C., Gupta, G.S. (eds) Autonomous Robots and Agents. Studies in Computational Intelligence, vol 76. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73424-6_26
Download citation
DOI: https://doi.org/10.1007/978-3-540-73424-6_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73423-9
Online ISBN: 978-3-540-73424-6
eBook Packages: EngineeringEngineering (R0)