RPack: routability-driven packing for cluster-based FPGAs

  • Authors:
  • Elaheh Bozorgzadeh;Seda Ogrenci-Memik;Majid Sarrafzadeh

  • Affiliations:
  • Computer Science Department, UCLA Los Angeles, CA;Department of ECE, Northw estern University, Ev anston, IL;Computer Science Department, UCLA Los Angeles, CA

  • Venue:
  • Proceedings of the 2001 Asia and South Pacific Design Automation Conference
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

Routing tools consume a significant portion of the total design time. Considering routability at earlier steps of the CAD flow would both yield better quality and faster design process. In this paper we are presenting a routability-driven clustering method for cluster-based FPGAs. Our method packs LUTs into logic clusters while incorporating routability metrics into a cost function. The objective is to minimize this routability cost function . Our cost function is consistently able to indicate improved routability. Our method yields up to 50 % improvement over existing clustering methods in terms of the number of routing tracks required. The average improvement obtained is 16.5 %. Reduction in number of tracks yields reduced routing area.