Skip to main content

Quark Routing

  • Conference paper
  • First Online:
Field Programmable Logic and Application (FPL 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2778))

Included in the following conference series:

  • 2073 Accesses

Abstract

With inherent problem complexity, ever increasing instance size and ever decreasing layout area, there is need in physical design for improved heuristics and algorithms. In this investigation, we present a novel routing methodology based on the mechanics of auctions. We demonstrate its efficacy by exhibiting the superior results of our auctionbased FPGA router QUARK on the standard benchmark suite.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alexander, M., Cohoon, J.P., Ganley, J.L., Robins, G.: Placement and Routing for High-Performance FPGA layout. In: VLSI Design: International Journal of Custom-Chip Design, Simulation, and Testing, January 1998, pp. 97–110 (1998)

    Google Scholar 

  2. Betz, V., Rose, J.: VPR: a new packing placement and routing tool for FPGA research. In: International Workshop on Field Programmable Logic and Application (1997)

    Google Scholar 

  3. Brown, S.D., Rose, J.S., Vranesic, Z.G.: A detailed router for field programmable gate arrays. In: International Conference on Computer-Aided Design, pp. 382–385 (1990)

    Google Scholar 

  4. Chan, P.K., Schlag, M.D.F.: New parallelization and convergence results for NC: a negotiation-based FPGA route. In: International Symposium on Field Programmable Gate Arrays, pp. 165–174 (2000)

    Google Scholar 

  5. Gagliano, R.A., Fraser, M.D., Schaefer, M.E.: Auction allocation of computing resources. Communications of the ACM, J88–J102 (June 1995)

    Google Scholar 

  6. Lemieux, G.G., Brown, S.D.: A detailed routing algorithm for allocating wire segments in field programmable gate arrays. In: ACM-SIGDA Physical Design Workshop (April 1993)

    Google Scholar 

  7. McCulloch, S.T.: Auction-based routing for FPGAs, University of Virginia, Doctoral Dissertation (2002)

    Google Scholar 

  8. McMurchie, L., Ebeling, C.: Pathfinder: A negotiation-based performance-driven router for FPGAs. In: International Symposium on Field Programmable Gate Arrays, pp. 111–117 (1995)

    Google Scholar 

  9. Shragowitz, E., Keel, S.: A global router based on a multicommodity flow model. INTEGRATION: the VLSI Journal, 3-16 (1987)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

McCulloch, S.T., Cohoon, J.P. (2003). Quark Routing. In: Y. K. Cheung, P., Constantinides, G.A. (eds) Field Programmable Logic and Application. FPL 2003. Lecture Notes in Computer Science, vol 2778. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45234-8_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45234-8_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40822-2

  • Online ISBN: 978-3-540-45234-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics