Advertisement

Domain specific mapping for solving graph problems on reconfigurable devices

  • Andreas Dandalis
  • Alessandro Mei
  • Viktor K. Prasanna
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1586)

Abstract

Conventional mapping approaches to Reconfigurable Computing (RC) utilize CAD tools to perform the technology mapping of a high-level design. In comparison with the execution time on the hardware, extensive amount of time is spent for compilation by the CAD tools. However, the long compilation time is not always considered when evaluating the time performance of RC solutions. In this paper, we propose a domain specific mapping approach for solving graph problems. The key idea is to alleviate the intervention of the CAD tools at mapping time. High-level designs are synthesized with respect to the specific domain and are adapted to the input graph instance at run-time. The domain is defined by the algorithm and the reconfigurable target. The proposed approach leads to predictable RC solutions with superior time performance. The time performance metric includes both the mapping time and the execution time. For example, in the case of the single-source shortest path problem, the estimated run-time speed-up is 106 compared with the state-of-the-art. In comparison with software implementations, the estimated run-time speed-up is asymptotically 3.75 and can be improved by further optimization of the hardware design or improvement of the configuration time.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    J. Babb, M. Frank, and A. Agarwal, “Solving graph problems with dynamic computation structures”, SPIE ’96: High-Speed Computing, Digital Signal Processing, and Filtering using Reconfigurable Logic, 1996.Google Scholar
  2. 2.
    D. P. Bertsekas, J. N. Tsitsiklis, “Parallel and Distributed Computations: Numerical Methods”, Athena Scientific, Belmont, Massachusetts, 1997.Google Scholar
  3. 3.
    T. H. Cormen, C. E. Leiserson, and R. L. Rivest, “Introduction to Algorithms”, The Massachusetts Institute of Technology, 1990.Google Scholar
  4. 4.
    B. L. Hutchings, “Exploiting Reconfigurability Through Domain-Specific Systems”, Int. Workshop on Field Programmable Logic and Applications, Sep. 1997.Google Scholar
  5. 5.
    A. Rashid, J. Leonard, and W. H. Mangione-Smith, “Dynamic Circuit Generation for Solving Specific Problem Instances of Boolean Satisfiability”, IEEE Symposium on Field-Programmable Custom Computing Machines, Apr. 1998.Google Scholar
  6. 6.
    J. D. Ullman, “Computational Aspects of VLSI”, Computer Science Press, Rockville, Maryland, 1984.Google Scholar
  7. 7.
    P. Zhong, M. Martonosi, P. Ashar, and S. Malik, “Accelerating Boolean Satisfiability with Configurable Hardware”, IEEE Symposium on Field-Programmable Custom Computing Machines, Apr. 1998.Google Scholar
  8. 8.
    The XC6200 Field Programmable Gate Arrays Databook, http://www.xilinx.com/apps/6200.htm, April 1997.Google Scholar
  9. 9.
    Parameterized Library for XC6200, H.O.T. Works Ver. 1.1, Aug. 1997.Google Scholar

Copyright information

© Springer-Verlag 1999

Authors and Affiliations

  • Andreas Dandalis
    • 1
  • Alessandro Mei
    • 1
  • Viktor K. Prasanna
    • 1
  1. 1.University of Southern CaliforniaUSA

Personalised recommendations