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.

Jason Eckhardt

dblp:23/6578 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2008
—ORCID · none

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

Systems, architecture and hardware · 2Software engineering, systems software and programming languages · 1 · 1 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
Processor architecture and microarchitecture · 100%

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

TopicWeightPapersLastEvidence papers
Compilers and program optimization › instruction scheduling › software pipelining
modulo scheduling
0.012001
Lifetime-Sensitive Modulo Scheduling in a Production Environment · IEEE Trans. Computers 2001
Compilers and program optimization › instruction scheduling
software pipelining
0.012001
Lifetime-Sensitive Modulo Scheduling in a Production Environment · IEEE Trans. Computers 2001
Processor architecture and microarchitecture › instruction-level parallelism
VLIW
0.012001
Lifetime-Sensitive Modulo Scheduling in a Production Environment · IEEE Trans. Computers 2001

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

swing modulo scheduling · 0.1
YearPublicationVenuePosition
2008 Redundancy elimination revisited
abstract
This work proposes and evaluates improvements to previously known algorithms for redundancy elimination.
Keith D. Cooper, Jason Eckhardt, Ken Kennedy
PACT2
2005 Implicitly Heterogeneous Multi-stage Programming
Jason Eckhardt, Roumen Kaiabachev, Emir Pasalic, Kedar N. Swadi, Walid Taha
GPCE1
2001 Lifetime-Sensitive Modulo Scheduling in a Production Environment
abstract
This paper presents a novel software pipelining approach, which is called Swing Modulo Scheduling (SMS). It generates schedules that are near optimal in terms of initiation interval, register requirements, and stage count. Swing Modulo Scheduling is a heuristic approach that has a low computational cost. This paper first describes the technique and evaluates it for the Perfect Club benchmark suite on a generic VLIW architecture. SMS is compared with other heuristic methods, showing that it outperforms them in terms of the quality of the obtained schedules and compilation time. To further explore the effectiveness of SMS, the experience of incorporating it into a production quality compiler for the Equator MAP1000 processor is described; implementation issues are discussed, as well as modifications and improvements to the original algorithm. Finally, experimental results from using a set of industrial multimedia applications are presented.
Josep Llosa, Eduard Ayguadé, Antonio González 0001, Mateo Valero, Jason Eckhardt
IEEE Trans. Computers5