scispace - formally typeset
S

Srinivas Devadas

Researcher at Massachusetts Institute of Technology

Publications -  498
Citations -  35003

Srinivas Devadas is an academic researcher from Massachusetts Institute of Technology. The author has contributed to research in topics: Sequential logic & Combinational logic. The author has an hindex of 88, co-authored 480 publications receiving 31897 citations. Previous affiliations of Srinivas Devadas include University of California, Berkeley & Cornell University.

Papers
More filters
Patent

Method and apparatus for allocating link bandwidth

TL;DR: In this article, a method and apparatus for selecting a queue for service across a shared link is presented, which includes determining a priority for each queue (202) within a plurality of ingresses (102), wherein the priority is instantaneous for a given timeslot for data transfer.

Functional Vector Generation for HDL Models Using

TL;DR: This paper presents a new HDL-SAT checking algorithm that works directly on the HDL model, and describes the details of the algorithm, which is a seamless integration of linear-programming techniques for feasibility checking of arithmetic equations that govern the behavior of data-path modules and SAT checking for logic equations that governs thebehavior of control modules.
Journal ArticleDOI

Modeling ensembles of transmembrane beta-barrel proteins.

TL;DR: The program partiFold is introduced to investigate the folding landscape of TMBs and outperforms existing programs for inter‐β‐strand residue contact prediction on TMB proteins, offering both higher average predictive accuracy as well as more consistent results.
Journal ArticleDOI

Sequential logic optimization for low power using input-disabling precomputation architectures

TL;DR: A method to automatically synthesize precomputation logic for this architecture is presented, and it is shown that it is significantly more powerful than the architecture previously treated in the literature.
Proceedings ArticleDOI

Transparency Logs via Append-Only Authenticated Dictionaries

TL;DR: An append-only authenticated dictionary (AAD) is proposed in this paper to provide both small-sized lookup proofs and small-size append only proofs for transparency logs, which is the first primitive to achieve (poly)logarithmic size for both proof types and helps reduce bandwidth consumption.