Article

OpenFPGA CoreLib core library interoperability effort

Brigham Young University, 448 CB, Provo, Utah, 84602, USA; SRC Computers, Inc., 4240 N. Nevada Avenue, Colorado Springs, CO 80907, USA; Xilinx Inc., 2100 Logic Drive, San Jose, CA 95124, USA; OptNgn Software, LL, 2828 Corbett Avenue, Portland, OR 97201, USA; Impulse Accelerated Technologies, 550 Kirkland Way, Suite 408, Kirkland, Washington 98033-6240, USA; Department of Computer Science & Engineering, University of California Riverside, Riverside, CA 92521, USA; Nallatech, Boolean House, One Napier Park, Glasgow G68 0BH, UK; Institute for System Level Integration, The Alba Centre, Livingston, Scotland EH54 7EG, UK; DSPlogic, Inc., 13017 Wisteria Drive, #420, Germantown, MD 20874, USA; Altera Corporation, 110 Cooper St, Suite 201, Santa Cruz, CA 95062, USA; Ylichron Srl, c/o C.R. ENEA Casaccia, Via Anguillarese, 301, 00123 S. Maria di Galeria, Rome, Italy; Computer Engineering, EEMCS, TU Delft, Mekelweg 4, 2628 CD, Delft, The Netherlands
Parallel Computing 01/2008; DOI: 10.1016/j.parco.2008.03.004
Source: DBLP

ABSTRACT This paper begins by summarizing the goals of the OpenFPGA CoreLib Working Group to facilitate the interoperability of FPGA circuit cores within a variety of FPGA design tools, including high-level programming tools targeting FPGA architectures. This effort is contrasted with other IP reuse efforts. The paper reviews the current approach used by several high-level language compilers to integrate IP within their tool. The CoreLib approach for standardizing this IP integration is proposed followed by an example that demonstrates its utility. Finally, the current state of the effort and future plans are presented.

1 Bookmark
 · 
104 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: The latest generation of FPGA devices offers huge resource counts that provide the headroom to implement large-scale and complex systems. However, this poses increasing challenges for the designer, not just because of pure size and complexity, but also to harness effectively the flexibility and programmability of the FPGA. A central issue is the need to integrate modules (IP blocks) from diverse sources to promote modular design and reuse. In this paper, we introduce ShapeUp: a high-level approach for designing systems by interconnecting modules, which gives a `plug and play' look and feel to the designer and is supported by tools that carry out implementation and verification functions. The emphasis is on the inter-module connections and abstracting the communication patterns that are typical between modules - for example, the streaming of data that is common in many FPGA based DSP or networking systems, or the reading and writing of data to and from memory modules. The details of wiring and signaling are hidden from view, via metadata associated with individual modules. The ShapeUp tool suite includes an implementation capability that automatically generates wiring between blocks, possibly including additional bridging blocks, and a simulation capability that allows multi-level verification of systems of interconnected modules. The methodology and tools have been validated on Xilinx customer design projects.
    Field-Programmable Custom Computing Machines (FCCM), 2010 18th IEEE Annual International Symposium on; 06/2010
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper presents a framework that improves the portability and ease-of-use issues of current Reconfig- urable Computers (RCs). These two drawbacks should be solved in order for RC to become a mainstream solution. Portability across platforms is difficult to achieve because RC systems have diverse hardware architectures and ser- vices. This lack of portability hinders reuse, and thus, ease- of-use. The framework proposed in this work is able to hide the architectural details of the systems, simplify the IP in- tegration, and provide the portability across different RC platforms. User specifies IP requirements such as memory configuration, sequential or random access to the memory, or I/O registers using a graphical-user-interface (GUI) tool, which generates a hardware interface specification for the IP and the logic necessary to target the selected platform. The hardware interface remains the same regardless the tar- geted architecture. In addition, the tool generates a soft- ware library that includes services such as bitstream man- agement and data exchange between microprocessor and IP. This framework has been demonstrated on two repre- sentative RCs: Cray XD1 and SGI RASC RC100.
    Proceedings of the 2008 International Conference on Engineering of Reconfigurable Systems & Algorithms, ERSA 2008, Las Vegas, Nevada, USA, July 14-17, 2008; 01/2008
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Reconfigurable computers (RC) can provide significant performance improvement for domain applications. However, wide acceptance of todaypsilas RCs among domain scientist is hindered by the complexity of design tools and the required hardware design experience. Recent developments in hardware/software co-design methodologies for these systems provide the ease of use, but they are not comparable in performance to manual co-design. This paper aims at improving the overall performance of hardware tasks assigned to FPGA. Particularly the analysis of inter-task communication as well as data dependencies among tasks are used to reduce the number of configurations and to minimize the communication overhead and task processing time. This work leverages algorithms developed in the RC and reconfigurable hardware (RH) domains to address efficient use of hardware resources to propose two algorithms, weight-based scheduling (WBS) and highest priority first-next fit (HPF-NF). However, traditional resource based scheduling alone is not sufficient to reduce the performance bottleneck, therefore a comprehensive algorithm is necessary. The reduced data movement scheduling (RDMS) algorithm is proposed to address dependency analysis and inter-task communication optimizations. Simulation shows that compared to WBS and HPF-NF, RDMS is able to reduce the amount of FPGA configurations to schedule random generated graphs with heavy weight nodes by 30% and 11% respectively. Additionally, the proof-of-concept implementation of a complex 13-node example task graph on the SGI RC100 reconfigurable computer shows that RDMS is not only able to trim down the amount of necessary configurations from 6 to 4 but also to reduce communication overhead by 48% and the hardware processing time by 33%.
    High-Performance Reconfigurable Computing Technology and Applications, 2008. HPRCTA 2008. Second International Workshop on; 12/2008

Full-text (2 Sources)

View
45 Downloads
Available from
May 19, 2014