Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Betul Buyukkurt

dblp:39/3443 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
0since 2021 · last 2010
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 4 · 2 first-authorSoftware engineering, systems software and programming languages · 2

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
2 papers
Reconfigurable computing and FPGAs · 58% Electronic design automation · 35% High-performance computing · 7%
Software engineering, system software, and programming languages
2 papers
Compilers and program optimization · 100%

Topics — the 6 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Reconfigurable computing and FPGAs › FPGA high-level synthesis
C-to-HDL compilation
0.222010
Impact of high-level transformations within the ROCCC framework · ACM Trans. Archit. Code Optim. 2010
Efficient hardware code generation for FPGAs · ACM Trans. Archit. Code Optim. 2008
Reconfigurable computing and FPGAs
FPGA accelerator
0.112008
Efficient hardware code generation for FPGAs · ACM Trans. Archit. Code Optim. 2008
Electronic design automation
high-level synthesis
0.112008
Efficient hardware code generation for FPGAs · ACM Trans. Archit. Code Optim. 2008
Electronic design automation › high-level synthesis › pipeline synthesis
loop pipelining
0.112008
Efficient hardware code generation for FPGAs · ACM Trans. Archit. Code Optim. 2008
High-performance computing › code optimization
loop-level optimization
0.012010
Impact of high-level transformations within the ROCCC framework · ACM Trans. Archit. Code Optim. 2010
Compilers and program optimization
loop optimization
0.012008
Efficient hardware code generation for FPGAs · ACM Trans. Archit. Code Optim. 2008

Methods — techniques the papers use, named apart from their topics

high-level synthesis · 0.2
YearPublicationVenuePosition
2010 Impact of high-level transformations within the ROCCC framework
abstract
Reconfigurable computers, where one or more FPGAs are attached to a conventional microprocessor, are promising platforms for code acceleration. Despite their advantages, programmability concerns and the lack of efficient design tools/compilers for FPGAs are preventing the technology's widespread adoption. The traditional compiler technology is microprocessor-based-systems-specific and needs to be customized and augmented to address the needs in reconfigurable computing. The challenges are several due to the resources and performance constraints for FPGAs being drastically different than those of microprocessors, and also that compiling for FPGAs requires laying the computation in space by a circuit rather than in time by a sequence of instructions. ROCCC is an optimizing C-to-VHDL compiler specifically targeting the reconfigurable computer platforms. ROCCC includes several high-level optimizations that parallelize and optimize the source code for minimized area and critical path length and maximized throughput. This article presents the effect of ROCCC's high-level transformations on the performance of the generated VHDL output. ROCCC utilizes: (1) several array access optimizations to eliminate redundant memory accesses, (2) procedure-level optimizations to achieve circuit area reductions of up to 88% compared to circuit areas generated from unoptimized codes, (3) loop-level optimizations to increase the throughput, and (4) transformations unique to certain classes of applications. The preceding listed features help ROCCC generate circuits with very large degrees of parallelism capable of very high computation rates.
Betul Buyukkurt, John Cortes, Jason R. Villarreal, Walid A. Najjar
ACM Trans. Archit. Code Optim.1
2008 Compiler generated systolic arrays for wavefront algorithm acceleration on FPGAs
abstract
Wavefront algorithms, such as the Smith-Waterman algorithm, are commonly used in bioinformatics for exact local and global sequence alignment. These algorithms are highly computationally intensive and are therefore excellent candidates for FPGA-based code acceleration. However, there is no standard form of these algorithms, they are used in a wide variety of situations with various constraints. It is therefore not practical to have a standard kernel that can be mapped to an FPGA, hence the importance of being able to compile such codes from a high level language. ROCCC is a C to VHDL compiler, which optimizes and parallelizes the most frequently executed kernel loops in applications such as in multimedia, scientific and high-performance computing. In this paper we describe the transformations performed by ROCCC, which transformed the kernel of the Smith-Waterman algorithm into a hardware systolic array that is mapped onto the FPGA on the SGI Altix RASC blade. We report a throughput increase by over 3,000times over a 2.8 GHz Xeon.
Betul Buyukkurt, Walid A. Najjar
FPL1
2008 Efficient hardware code generation for FPGAs
abstract
The wider acceptance of FPGAs as a computing device requires a higher level of programming abstraction. ROCCC is an optimizing C to HDL compiler. We describe the code generation approach in ROCCC. The smart buffer is a component that reuses input data between adjacent iterations. It significantly improves the performance of the circuit and simplifies loop control. The ROCCC-generated datapath can execute one loop iteration per clock cycle when there is no loop dependency or there is only scalar recurrence variable dependency. ROCCC's approach to supporting while-loops operating on scalars makes the compiler able to move scalar iterative computation into hardware.
Zhi Guo, Walid A. Najjar, Betul Buyukkurt
ACM Trans. Archit. Code Optim.3
2005 Optimized Generation of Data-Path from C Codes for FPGAs
abstract
FPGAs, as computing devices, offer significant speedup over microprocessors. Furthermore, their configurability offers an advantage over traditional ASICs. However, they do not yet enjoy high-level language programmability, as microprocessors do. This has become the main obstacle for their wider acceptance by application designers. ROCCC is a compiler designed to generate circuits from C source code to execute on FPGAs, more specifically on CSoCs. It generates RTL level HDLs from frequently executing kernels in an application. In this paper, we describe the ROCCC's system overview and focus on its data path generation. We compare the performance of ROCCC-generated VHDL code with that of Xilinx IPs. The synthesis result shows that the ROCCC-generated circuit takes around 2/spl times//spl sim/3/spl times/ the area and runs at a comparable clock rate.
Zhi Guo, Betul Buyukkurt, Walid A. Najjar, Kees A. Vissers
DATE2
2004 Input data reuse in compiling window operations onto reconfigurable hardware
abstract
Balancing computation with I/O has been considered as a critical factor of the overall performance for embedded systems in general and reconfigurable computing systems in particular. Data I/O often dominates the overall computation performance for window operation, which are frequently used in image processing, image compression, pattern recognition and digital signal processing. This problem is more acute in reconfigurable systems since the compiler must generate the data path and the sequence of operations. The challenge is to intelligently exploit data reuse on the reconfigurable fabric (FPGA) to minimize the required memory or I/O bandwidth while maximizing parallelism.In this paper, we present a compile-time approach to reuse data in window-based codes. The compiler, called ROCCC, first analyzes and optimizes the window operation in C. It then computes the size of the hardware buffer and defines three sets of data values for each window: the window set, the managed set and the killed set. This compile-time analysis simplifies the HDL code generation and improves the resulting hardware performance. We also discuss in-place window operations.
Zhi Guo, Betul Buyukkurt, Walid A. Najjar
LCTES2