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

Omid Assare

dblp:46/10455 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
1since 2021 · last 2022
0000-0003-3433-0238ORCID · corroborated

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

Systems, architecture and hardware · 4 · 4 first-author · 1 since 2021

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
Processor architecture and microarchitecture · 77% Hardware reliability and fault tolerance · 14% Performance modeling and evaluation · 9%

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

TopicWeightPapersLastEvidence papers
Processor architecture and microarchitecture
timing speculative processor
1.022022
Performance Analysis of Timing-Speculative Processors · IEEE Trans. Computers 2022
Accurate Estimation of Program Error Rate for Timing-Speculative Processors · DAC 2019
Hardware reliability and fault tolerance
error recovery
0.212022
Performance Analysis of Timing-Speculative Processors · IEEE Trans. Computers 2022
Performance modeling and evaluation › system-level analysis › architecture evaluation
processor performance evaluation
0.112019
Accurate Estimation of Program Error Rate for Timing-Speculative Processors · DAC 2019

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

statistical estimation · 0.6gate-level dynamic timing analysis · 0.6architecture-level execution-driven simulation · 0.6statistical limit theorems · 0.4monte carlo simulation · 0.4instruction error modeling · 0.4
YearPublicationVenuePosition
2022 Performance Analysis of Timing-Speculative Processors
abstract
We propose a framework to estimate the number of timing errors experienced by an application as it runs on a timing-speculative processor. It takes a hybrid approach combining an accurate gate-level dynamic timing analysis engine to find timing errors in the processor’s control network with a fast architecture-level execution-driven simulator based on a path activation model of the datapath. We develop an instruction-level error model that estimates the likelihood of an instruction experiencing a timing error, capturing the effects of process and data variations as well as inter-instruction correlations caused by the error recovery scheme used by the processor. Finally, we utilize two well-known laws of applied statistics, the law of small numbers and the law of large numbers, to estimate, with bounded inaccuracy, the total number of timing errors experienced by a specific application. Our experiments show that the combination of running application and its input data can change performance by as much as 25 percent, demonstrating that application-specific analysis is necessary for accurate evaluation of timing-speculative processors and should be used to inform design decisions and assess the suitability of applications for timing speculation.
Omid Assare, Rajesh K. Gupta 0001
IEEE Trans. Computers1
2019 Accurate Estimation of Program Error Rate for Timing-Speculative Processors
abstract
We propose a framework that estimates the error rate experienced by an application as it runs on a timing-speculative processor. The framework uses an instruction error model that is comparable in accuracy to low-level simulations---as it considers the effects of operand values, preceding instructions, datapath configuration, and error correction scheme, as well as process variation, including its spatial correlation property---and yet efficient enough to allow its application in Monte Carlo experiments to characterize large program input datasets. We then use statistical limit theorems to estimate program error rate and quantify the effect of inter-instruction correlations.
Omid Assare, Rajesh K. Gupta 0001
DAC1
2016 Strategies for optimal operating point selection in timing speculative processors
abstract
Performance of timing speculative processors relies on strategies for accurate prediction of optimal operating points. In this paper, we develop an efficient process-variation-aware simulation framework and use it to evaluate a range of such timing speculation strategies. Our experiments on a timing speculative processor running applications from the MiBench benchmark suite show that, in a typical case, while a perfect timing speculation strategy can improve throughput by up to 143% over a guardbanded design, the most commonly used approach in the literature achieves only a 21.8% of the potential gains. By improving the speculation accuracy, the new strategies we propose in this paper can realize up to 35.6% of the potential gains, a throughput improvement of 50.9% over a guardbanded design.
Omid Assare, Rajesh K. Gupta 0001
ICCD1
2012 Accurate Estimation of Leakage Power Variability in Sub-micrometer CMOS Circuits
abstract
Leakage power has already become the major contributor to the total on-chip power consumption, rendering its estimation a necessary step in the IC design flow. The problem is further exacerbated with the increasing uncertainty in the manufacturing process known as process variability. We develop a method to estimate the variation of leakage power in the presence of both intra-die and inter-die process variability. Various complicating issues of leakage prediction such as spatial correlation of process parameters, the effect of different input states of gates on the leakage, and DIBL and stack effects are taken into account while we model the simultaneous variability of the two most critical process parameters, threshold voltage and effective channel length. Our subthreshold leakage current model is shown to fit closely on the HSPICE Monte Carlo simulation data with an average coefficient of determination (R2) value of 0.9984 for all the cells of a standard library. We also demonstrate the adjustability of this model to wider ranges of variation and its extendability to future technology scalings. We show that our framework imposes little timing penalty on the system design flow and is applicable to real design cases. The procedures explained in this paper are part of VAREX, an academic variability modeling framework for estimation of the effect of process variation on power consumption and performance of Multiprocessor SoCs.
Omid Assare, Mahmoud Momtazpour, Maziar Goudarzi
DSD1