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

Amit Nandi

dblp:56/3246 · DBLP profile ↗
← Back
9ranked-venue papers
1as first author
0since 2021 · last 2005
—ORCID · none

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

Systems, architecture and hardware · 6 · 1 first-authorSoftware engineering, systems software and programming languages · 6

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
Electronic design automation · 95% Embedded and real-time systems · 5%

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

TopicWeightPapersLastEvidence papers
Electronic design automation › hardware verification and test
fault simulation
0.112005
Schematic array models for associative and non-associative memory circuits · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2005
Electronic design automation
hardware verification and test
0.112005
Schematic array models for associative and non-associative memory circuits · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2005
Electronic design automation › hardware verification and test
logic simulation
0.112005
Schematic array models for associative and non-associative memory circuits · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2005
Electronic design automation
system-level design
0.012001
System-Level Power/Performance Analysis for Embedded Systems Design · DAC 2001
Embedded and real-time systems
embedded system design
0.012001
System-Level Power/Performance Analysis for Embedded Systems Design · DAC 2001

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

register transfer level modeling · 0.1decoded array model · 0.1stochastic automata networks · 0.0
YearPublicationVenuePosition
2005 Schematic array models for associative and non-associative memory circuits
abstract
The modeling and simulation of memory circuits remains an outstanding problem whenever accuracy with respect to the actual schematic implementation is desired. Functionally equivalent Register Transfer (RT) level models often cannot be used for designs with embedded memory blocks, because schematic models for the surrounding logic may be required for fault-modeling accuracy. Existing methods derive a latch model that essentially represents each memory location as a latch primitive. This approach results in models that have a large number of primitives. We present new algorithms that model such circuits as decoded arrays that access entire rows of cells for individual read and write operations. Decoded array models are easy to generate and allow fault-modeling accuracy for the surrounding logic, including the memory address decoder. Experimental data show improvements of an order of magnitude for both logic and fault simulations, when compared to the equivalent latch model.
Soumitra Bose, Amit Nandi
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.2
2004 Extraction of Schematic Array Models for Memory Circuits
abstract
The modeling and simulation of memory circuits remains an outstanding problem when accuracy with respect to the actual schematic implementation is desired. Functionally equivalent RTL models often cannot be used for designs with embedded memory blocks, because schematic models for the surrounding logic may be required for fault modeling accuracy. Existing methods derive a latch model that essentially represents each memory location as a latch primitive, and have a large number of gates. We present new algorithms that model such circuits as decoded arrays that access entire rows of cells for individual read and write operations. Decoded array models allow fault modeling accuracy for the surrounding logic, including the memory address decoder. Experimental data show improvements of an order of magnitude for both logic and fault simulations, when compared to the equivalent latch model.
Soumitra Bose, Amit Nandi
DATE2
2004 Applications of clustering techniques to software partitioning, recovery and restructuring
Chung-Horng Lung, Marzia Zaman, Amit Nandi
J. Syst. Softw.3
2001 System-Level Power/Performance Analysis for Embedded Systems Design
abstract
This paper presents a formal technique for system-level power/performance analysis that can help the designer to select the right platform starting from a set of target applications. By platform we mean a family of heterogeneous architectures that satisfy a set of architectural constraints imposed to allow re-use of hardware and software components. More precisely, we introduce the Stochastic Automata Networks (SANs) as an effective formalism for average-case analysis that can be used early in the design cycle to identify the best power/performance figure among several appli-cation-architecture combinations. This information not only helps avoid lengthy profiling simulations, but also enables efficient map-pings of the applications onto the chosen platform. We illustrate the features of our technique through the design of an MPEG-2 video decoder application.
Amit Nandi, Radu Marculescu
DAC1
2001 Abstraction of word-level linear arithmetic functions from bit-level component descriptions
abstract
RTL descriptions for word-level arithmetic components typically specify the architecture at the bit-level of the registers. The problem studied in this paper is to abstract the word-level functionality of a component from its bit-level specification. This is particularly useful in simulation since word-level descriptions can be simulated much faster than bit-level descriptions. Word-level abstractions are also useful for reducing the complexity of component matching since the number of words is significantly smaller than the number of bits. This paper presents an algorithm for abstraction of word-level linear functions from bit-level component descriptions. We also present complexity results for component matching which justifies the advantage of performing abstraction prior to component matching.
Pallab Dasgupta, P. P. Chakrabarti 0001, Amit Nandi, Sekar Krishna, Arindam Chakrabarti
DATE3
2001 Probabilistic application modeling for system-level perfromance analysis
abstract
The objective of this paper is to introduce the Stochastic Automata Networks (SANs) as an effective formalism for application modeling in system-level analysis. More precisely we present a methodology for application modeling for system-level power/performance analysis that can help the designer to select the right platform and implement a set of target multimedia applications. We also show that, under various input traces, the steady-state behavior of the application itself is characterized by very different 'clusterings' of the probability distributions. Having this information available, not only helps to avoid lengthy profiling simulations for predicting power and performance figures, but also enables efficient mappings of the applications onto a chosen platform. We illustrate the benefits of our methodology using the MPEG-2 video decoder as the driver application.
Radu Marculescu, Amit Nandi
DATE2
2001 System-Level Power/Performance Analysis of Portable Multimedia Systems Communicating over Wireless Channels
abstract
This paper presents a new methodology for system-level power and performance analysis of wireless multimedia systems. More precisely, we introduce an analytical approach based on concurrent processes modeled as Stochastic Automata Networks (SANs) that can be effectively used to integrate power and performance metrics in system-level design. We show that 1) under various input traces and wireless channel conditions, the average-case behavior of a multimedia system consisting of a video encoder/decoder pair is characterized by very different probability distributions and power consumption values and 2) in order to identify the best trade-off between power and performance figures, one must take into consideration the entire environment (i.e., encoder, decoder and channel) for which the system is being designed. Compared to using simulation, our analytical technique reduces the time needed to find the steady-state behavior by orders of magnitude, with some limited loss in accuracy compared to the exact solution. We illustrate the potential of our methodology using the MPEG-2 video as the driver application.
Radu Marculescu, Amit Nandi, Luciano Lavagno, Alberto L. Sangiovanni-Vincentelli
ICCAD2
1997 Predicting fault-prone modules with case-based reasoning
abstract
Software quality classification models seek to predict quality factors such as whether a module will be fault prone, or not. Case based reasoning (CBR) is a modeling technique that seeks to answer new questions by identifying similar "cases" from the past. When applied to software reliability, the working hypothesis of our approach is this: a module currently under development is probably fault prone if a module with similar product and process attributes in an earlier release was fault prone. The contribution of the paper is application of case based reasoning to software quality modeling. To the best of our knowledge, this is the first time that case based reasoning has been used to identify fault prone modules. A case study illustrates our approach and provides evidence that case based reasoning can be the basis for useful software quality classification models that are competitive with discriminant models. The case study revisits data from a previously published nonparametric discriminant analysis study. The Type II misclassification rate of the CBR model was substantially better than that of the discriminant model. Although the Type I misclassification rate was slightly greater and the overall misclassification rate was only slightly less, the CBR model was preferred when costs of misclassification were considered.
Taghi M. Khoshgoftaar, K. Ganesan 0001, Edward B. Allen, Fletcher D. Ross, Rama Munikoti, Nishith Goel, Amit Nandi
ISSRE7
1996 Detection of software modules with high debug code churn in a very large legacy system
abstract
Society has become so dependent on reliable telecommunications, that failures can risk loss of emergency service, business disruptions, or isolation from friends. Consequently, telecommunications software is required to have high reliability. Many previous studies define the classification fault prone in terms of fault counts. This study defines fault prone as exceeding a threshold of debug code churn, defined as the number of lines added or changed due to bug fixes. Previous studies have characterized reuse history with simple categories. This study quantified new functionality with lines of code. The paper analyzes two consecutive releases of a large legacy software system for telecommunications. We applied discriminant analysis to identify fault prone modules based on 16 static software product metrics and the amount of code changed during development. Modules from one release were used as a fit data set and modules from the subsequent release were used as a test data set. In contrast, comparable prior studies of legacy systems split the data to simulate two releases. We validated the model with a realistic simulation of utilization of the fitted model with the test data set. Model results could be used to give extra attention to fault prone modules and thus, reduce the risk of unexpected problems.
Taghi M. Khoshgoftaar, Edward B. Allen, Nishith Goel, Amit Nandi, John McMullan
ISSRE4