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

Amisha Parikh

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

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

Systems, architecture and hardware · 3 · 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.

Computer architecture, parallel and distributed computing, and storage systems
2 papers
Embedded and real-time systems · 100%
Software engineering, system software, and programming languages
2 papers
Compilers and program optimization · 72% Operating systems · 28%

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

TopicWeightPapersLastEvidence papers
Compilers and program optimization
memory optimization
0.012004
A compiler-based approach for dynamically managing scratch-pad memories in embedded systems · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2004
Embedded and real-time systems › embedded software › embedded operating systems
embedded memory management
0.012004
A compiler-based approach for dynamically managing scratch-pad memories in embedded systems · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2004
Embedded and real-time systems › embedded software › embedded operating systems › embedded memory management
scratchpad memory management
0.012004
A compiler-based approach for dynamically managing scratch-pad memories in embedded systems · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2004
Operating systems › resource management › memory management
dynamic memory allocation
0.012001
Dynamic Management of Scratch-Pad Memory Space · DAC 2001
Compilers and program optimization › compiler optimization › compiler-directed memory management
scratch-pad memory management
0.012001
Dynamic Management of Scratch-Pad Memory Space · DAC 2001
Embedded and real-time systems
real-time embedded systems
0.012004
A compiler-based approach for dynamically managing scratch-pad memories in embedded systems · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2004
Embedded and real-time systems › embedded software › embedded operating systems › embedded memory management
on-chip memory optimization
0.012001
Dynamic Management of Scratch-Pad Memory Space · DAC 2001

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

loop transformation · 0.2data transformation · 0.2source-to-source translation · 0.1
YearPublicationVenuePosition
2004 A compiler-based approach for dynamically managing scratch-pad memories in embedded systems
abstract
Optimizations aimed at improving the efficiency of on-chip memories in embedded systems are extremely important. Using a suitable combination of program transformations and memory design space exploration aimed at enhancing data locality enables significant reductions in effective memory access latencies. While numerous compiler optimizations have been proposed to improve cache performance, there are relatively few techniques that focus on software-managed on-chip memories. It is well-known that software-managed memories are important in real-time embedded environments with hard deadlines as they allow one to accurately predict the amount of time a given code segment will take. In this paper, we propose and evaluate a compiler-controlled dynamic on-chip scratch-pad memory (SPM) management framework. Our framework includes an optimization suite that uses loop and data transformations, an on-chip memory partitioning step, and a code-rewriting phase that collectively transform an input code automatically to take advantage of the on-chip SPM. Compared with previous work, the proposed scheme is dynamic, and allows the contents of the SPM to change during the course of execution, depending on the changes in the data access pattern. Experimental results from our implementation using a source-to-source translator and a generic cost model indicate significant reductions in data transfer activity between the SPM and off-chip memory.
Mahmut T. Kandemir, J. Ramanujam, Mary Jane Irwin, Narayanan Vijaykrishnan, Ismail Kadayif, Amisha Parikh
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.6
2001 Dynamic Management of Scratch-Pad Memory Space
abstract
Optimizations aimed at improving the efficiency of on-chip memories are extremely important. We propose a compiler-controlled dynamic on-chip scratch-pad memory (SPM) management framework that uses both loop and data transformations. Experimental results obtained using a generic cost model indicate significant reductions in data transfer activity between SPM and off-chip memory.
Mahmut T. Kandemir, J. Ramanujam, Mary Jane Irwin, Narayanan Vijaykrishnan, Ismail Kadayif, Amisha Parikh
DAC6
2000 Energy-Aware Instruction Scheduling
Amisha Parikh, Mahmut T. Kandemir, Narayanan Vijaykrishnan, Mary Jane Irwin
HiPC1