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

Vidyasagar Nookala

dblp:35/913 · DBLP profile ↗
← Back
5ranked-venue papers
4as first author
0since 2021 · last 2006
—ORCID · none

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

Systems, architecture and hardware · 4 · 3 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 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.

Computer architecture, parallel and distributed computing, and storage systems
3 papers
Electronic design automation · 91% Integrated circuit design · 6% Performance modeling and evaluation · 3%

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

TopicWeightPapersLastEvidence papers
Electronic design automation
physical design
0.122005
Robust gate sizing by geometric programming · DAC 2005
Microarchitecture-aware floorplanning using a statistical design of experiments approach · DAC 2005
Electronic design automation › physical design › interconnect optimization
wire pipelining
0.122005
Microarchitecture-aware floorplanning using a statistical design of experiments approach · DAC 2005
A method for correcting the functionality of a wire-pipelined circuit · DAC 2004
Electronic design automation
design for manufacturability
0.112005
Robust gate sizing by geometric programming · DAC 2005
Electronic design automation › physical design
floorplanning
0.112005
Microarchitecture-aware floorplanning using a statistical design of experiments approach · DAC 2005
Electronic design automation › physical design
gate sizing
0.112005
Robust gate sizing by geometric programming · DAC 2005
Electronic design automation › design optimization
process variation-aware optimization
0.112005
Robust gate sizing by geometric programming · DAC 2005
Electronic design automation
high-level synthesis
0.012004
A method for correcting the functionality of a wire-pipelined circuit · DAC 2004
Performance modeling and evaluation › simulation
simulation-based design
0.012005
Microarchitecture-aware floorplanning using a statistical design of experiments approach · DAC 2005
Integrated circuit design
timing yield
0.012005
Robust gate sizing by geometric programming · DAC 2005

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

uncertainty ellipsoid · 0.1statistical design of experiments · 0.1multifactorial design · 0.1monte carlo simulation · 0.1geometric programming · 0.1throughput optimization · 0.0area minimization · 0.0
YearPublicationVenuePosition
2006 Temperature-aware floorplanning of microarchitecture blocks with IPC-power dependence modeling and transient analysis
abstract
Operating temperatures have become an important concern in high performance microprocessors. Floorplanning or block-level placement offers excellent potential for thermal optimization through better heat spreading between the blocks, but these optimizations can also impact the throughput of a microarchitecture, measured in terms of the number of instructions per cycle (IPC). In nanometer technologies, global buses can have multicycle delays that depend on the positions of the blocks, and it is important for a floorplanner to be microarchitecturally-aware to be sure that thermal and IPC considerations are appropriately balanced. This paper proposes a methodology for thermally-aware microarchitecture floorplanning. The approach models the interactions between the IPC and the temperature distribution, and incorporates both factors in the floorplanning cost function. Our approach uses transient modeling and optimizes both the peak and the average temperatures, and employs a design of experiments (DOE) based strategy, which effectively captures the huge exponential search space with a small number of cycle-accurate simulations. A comparison with a technique based on previous work indicates that the proposed approach results in good reductions both in the average and the peak temperatures for a range of SPEC benchmarks.
Vidyasagar Nookala, David J. Lilja, Sachin S. Sapatnekar
ISLPED1
2006 Comparing simulation techniques for microarchitecture-aware floorplanning
abstract
Due to the long simulation times of the reference input sets, microarchitects resort to alternative techniques to speed up cycle-accurate simulations. However, the reduction in the runtimes comes with an associated loss of accuracy in replicating the characteristics of the reference sets. In addition, the effect of these inaccuracies on the overall performance can vary across different microarchitecture optimizations or enhancements. In this work, we study and compare two such techniques, reduced input sets and statistical sampling, in the context of microarchitecture-aware floorplanning, a physical design stage, where the objective is to find an IPC-optimal global placement of the blocks of a microprocessor. The variation in the IPC results due the insertion of additional flip-flops on some across-chip wires of the processor that have multicycle delays in nanometer technology nodes. The objective of IPC-aware floorplanning is to minimize the amount of pipelining required by the system buses that are critical in determining the system performance. Our results indicate that, although the two techniques exhibit contrasting behavior in quantifying the criticality of bus latencies, the ensuing floorplanning optimization process results in almost identical performance improvements for both reduced input sets and sampling. The reason behind this is that, for discrete optimization problems such as IPC-aware floorplanning, a reasonably accurate relative ordering of performance bottlenecks is sufficient, absolute accuracy is not necessary.
Vidyasagar Nookala, David J. Lilja, Sachin S. Sapatnekar
ISPASS1
2005 Microarchitecture-aware floorplanning using a statistical design of experiments approach
abstract
Since across-chip interconnect delays can exceed a clock cycle in nanometer technologies, it has become essential in high performance designs to add flip-flops on wires with multi-cycle delays. Although such a wire pipelining strategy allows higher operating frequencies, it can reduce the delivered performance of a microarchitecture, since the extra flip-flops inserted may increase the operation latencies and stall cycles. Moreover, the addition of latencies on some wires can have a large impact on the overall performance while other wires are relatively insensitive to additional latencies. This varying sensitivity suggests the need for a throughput-aware strategy for pipelining the interconnects that interacts closely with the physical design step, which determines the lengths of these multicycle wires. We use a statistical design of experiments strategy based on a multifactorial design, which intelligently uses a limited number of simulations to rank the importance of the wires. When applied at the floorplanning level, our results show improvements both in the overall system performance and in the total wire length when compared with an existing technique.
Vidyasagar Nookala, David J. Lilja, Sachin S. Sapatnekar
DAC1
2005 Robust gate sizing by geometric programming
abstract
We present an efficient optimization scheme for gate sizing in the presence of process variations. Using a posynomial delay model, the delay constraints are modified to incorporate uncertainty in the transistor widths and effective channel lengths due to the process variations. An uncertainty ellipsoid method is used to model the random parameter variations. Spatial correlations of intra-die width and channel length variations are incorporated in the optimization procedure. The resulting optimization problem is relaxed to be a Geometric Program and is efficiently solved using convex optimization tools. The effectiveness of our robust gate sizing scheme is demonstrated by applying the optimization on the ISCAS ’85 benchmark circuits and testing the optimized circuits by performing Monte Carlo simulations to model the process variations. By varying the size of the uncertainty ellipsoids, a trade-off between area and robustness is explored. Experimental results show that the timing yield of the robustly optimized circuits improves manifold over the traditional deterministically sized circuits. As compared to the worst-case design, the robust gate sizing solution having the same area, has fewer timing violations.
Vidyasagar Nookala, Zhi-Quan Luo, Sachin S. Sapatnekar
DAC2
2004 A method for correcting the functionality of a wire-pipelined circuit
abstract
As across-chip interconnect delays can exceed a clock cycle, wire pipelining becomes essential in high performance designs. Although it allows higher clock frequencies, it may change the microarchitecture altogether because of the arbitrary increase in the latencies of the paths and cycles of the circuit. This paper proposes a method to regain the functionality of a wire-pipelined circuit. In this approach, increased cycle latencies are compensated by slowing down the issue rate of the inputs. Our method finds the optimal value of the slowdown required for a circuit as it directly affects the throughput of the circuit. We also incorporate area minimization in our formulation to minimize the number of extra flip-flops added to the circuit. The formulation is tested on circuits derived from ISCAS benchmarks and the results suggest that wire pipelining increases the overall throughput in most of the cases.
Vidyasagar Nookala, Sachin S. Sapatnekar
DAC1