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

Cagdas Akturan

dblp:24/5884 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2002
—ORCID · none

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

Systems, architecture and hardware · 2 · 2 first-author

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.

Software engineering, system software, and programming languages
1 paper
Compilers and program optimization · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Embedded and real-time systems · 100%

Topics — the 2 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Compilers and program optimization
code size reduction
0.012002
RS-FDRA: A register-sensitive software pipelining algorithm for embedded VLIW processors · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2002
Compilers and program optimization › instruction scheduling
software pipelining
0.012002
RS-FDRA: A register-sensitive software pipelining algorithm for embedded VLIW processors · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2002

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

pareto optimization · 0.1force-directed retiming · 0.1
YearPublicationVenuePosition
2002 RS-FDRA: A register-sensitive software pipelining algorithm for embedded VLIW processors
abstract
The paper proposes a novel software-pipelining algorithm, Register-Sensitive Force-Directed Retiming Algorithm (RS-FDRA), suitable for optimizing compilers targeting embedded very large instruction word processors. The key difference between RS-FDRA and previous approaches is that this algorithm can handle code-size constraints along with latency and resource constraints. This capability enables the exploration of Pareto "optimal" points with respect to code size and performance. RS-FDRA can also minimize the increase in register pressure typically incurred by software pipelining. This ability is critical since the need to insert spill code may result in significant performance degradation. Extensive experimental results are presented demonstrating that the extended set of optimization goals and constraints supported by RS-FDRA enables a thorough compiler-assisted exploration of tradeoffs among performance, code size, and register requirements for time-critical segments of embedded software components.
Cagdas Akturan, Margarida F. Jacome
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.1
2001 CALiBeR: A Software Pipelining Algorithm for Clustered Embedded VLIW Processors
abstract
In this paper, we describe a software pipelining framework, CALiBeR (cluster aware load balancing retiming algorithm), suitable for compilers targeting clustered embedded VLIW processors. CALiBeR can be effectively used by embedded system designers to explore different code optimization alternatives, i.e. it can assist the generation of high-quality customized retiming solutions for desired program memory size and throughput requirements, while minimizing register pressure. An extensive set of experimental results is presented, considering several representative benchmark loop kernels and a wide variety of clustered datapath configurations, demonstrating that our algorithm compares favorably with one of the best state-of-the-art algorithms, achieving up to 50% improvement in performance and up to 47% improvement in register requirements.
Cagdas Akturan, Margarida F. Jacome
ICCAD1