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

Deepali Deshpande

dblp:87/3196 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 1999
—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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Reconfigurable computing and FPGAs · 77% Memory systems · 12% Storage systems · 12%

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

TopicWeightPapersLastEvidence papers
Reconfigurable computing and FPGAs
dynamic reconfiguration
0.011999
Configuration Caching Vs Data Caching for Striped FPGAs · FPGA 1999
Memory systems
cache management
0.011999
Configuration Caching Vs Data Caching for Striped FPGAs · FPGA 1999
Storage systems
data caching
0.011999
Configuration Caching Vs Data Caching for Striped FPGAs · FPGA 1999
YearPublicationVenuePosition
1999 Hybrid Data/Configuration Caching for Striped FPGAs
abstract
Most custom computing machine (CCM) design has centered around field-programmable gate array (FPGA) technology and rapid prototyping applications. FPGAs are reconfigured to map parts of the application. The performance of an FPGA when used as a virtual hardware engine depends on its reconfiguration granularity. We study the striped FPGA and propose a hybrid mechanism to process a large amount of data using a combination of data and configuration caching.
Deepali Deshpande, Arun K. Somani, Akhilesh Tyagi
FCCM1
1999 Configuration Caching Vs Data Caching for Striped FPGAs
abstract
Striped FPGA [1], or pipeline-reconfigurable FPGA provides hardware virtualization by supporting fast run-time reconfiguration. In this paper we show that the performance of striped FPGA depends on the reconfiguration pattern, the run time scheduling of configurations through the FPGA. We study two main configuration scheduling approaches: Configuration Caching and Data Caching. We present the quantitative analysis of these scheduling techniques to compute their total execution cycles taking into account the overhead caused by the IO with the external memory. Based on the analysis we can determine which scheduling technique works better for the given application and for the given hardware parameters.
Deepali Deshpande, Arun K. Somani, Akhilesh Tyagi
FPGA1