Table Of Content
TeAMP Lab is developing scalable machine learning algorithms, warehouse-scale-computer-friendly programming models, and crowd-sourcing tools to gain valuable insights quicklyfrom big data in the cloud. Te ASPIRE Lab uses deep hardware and sofware co-tuningto achieve the highest possible performance and energy efciency for mobile and rackcomputing systems.John L. Hennessy is a Professor of Electrical Engineering and Computer Science atStanford University, where he has been a member of the faculty since 1977 and was,from 2000 to 2016, its tenth President.
References to this book
In their example, encryption security was provably based on a quadratic residuosity assumption. They were the first to give a rigorous definition of semantic security for a public-key encryption system, and showed that it was equivalent to a number of other intuitive formulations of security. Julius Caesar may have used cryptography, but now we were finally beginning to understand it.
Other David Patterson's
They wondered if one could prove some non-trivial statement (for example, membership of a string in a hard language) without giving away any knowledge whatsoever about why it was true. They defined that the verifier receives no knowledge from the prover if the verifier could simulate on his own the probability distribution that he obtains in interacting with the prover.The idea that “no knowledge” means simulatability was a very important contribution. They also gave the first example of these “zero knowledge interactive proofs” using quadratic residuosity. ACM named John L. Hennessy a recipient of the 2017 ACM A.M. Turing Award for pioneering a systematic, quantitative approach to the design and evaluation of computer architectures with enduring impact on the microprocessor industry. John L. Hennessy is a Professor of Electrical Engineering and Computer Science at Stanford University, where he has been a member of the faculty since 1977 and was, from 2000 to 2016, its tenth President.
Publication History
Codasip Releases a Major Upgrade of Its Studio Processor Design Toolset with a Tutorial RISC-V core - Design and Reuse
Codasip Releases a Major Upgrade of Its Studio Processor Design Toolset with a Tutorial RISC-V core.
Posted: Tue, 13 Apr 2021 07:00:00 GMT [source]
Like his co-author, Patterson is a Fellow of the American Academy of Arts and Sciences, the Computer History Museum, ACM, and IEEE, and he was elected to the National Academy of Engineering, the National Academy of Sciences, and the Silicon Valley Engineering Hall of Fame. President, as chair of the CS division in the Berkeley EECS department, as chair of the Computing Research Association, and as President of ACM. Shafi, with Micali (and later Rackoff) [6], had been thinking for a while about expanding the traditional notion of “proof” to an interactive process in which a "prover" can convince a probabilistic "verifier" of the correctness of a mathematical proposition with overwhelming probability if and only if the proposition is correct. They called this interactive process an "interactive proof" (a name suggested by Mike Sipser).
John L. Hennessy
For the convenience of readers who have purchased an ebook edition or who may have misplaced the CD-ROM, all CD content is available as a download at bit.ly/nFXcLq. Another outcome of this research was a variant of interactive proofs where the prover is replaced by two or more provers who cannot talk with each other. Shafi, with Ben-Or, Kilian and Wigderson, showed [9] that two provers are sufficient, and that all of NP can be proven with zero knowledge in this model without any assumptions.
Eckert-Mauchly Award
Like his co-author, Patterson is a Fellow of theAmerican Academy of Arts and Sciences, the Computer History Museum, ACM,and IEEE, and he was elected to the National Academy of Engineering, the NationalAcademy of Sciences, and the Silicon Valley Engineering Hall of Fame. President, as chair of theCS division in the Berkeley EECS department, as chair of the Computing ResearchAssociation, and as President of ACM. T is record led to Distinguished Service Awardsfrom ACM and CRA.At Berkeley, Patterson led the design and implementation of RISC I, likely the f rstVLSI reduced instruction set computer, and the foundation of the commercialSPARC architecture. He was a leader of the Redundant Arrays of Inexpensive Disks(RAID) project, which led to dependable storage systems from many companies.He was also involved in the Network of Workstations (NOW) project, which led tocluster technology used by Internet companies and later to cloud computing. His current research projectsare Algorithm-Machine-People and Algorithms and Specializers for Provably OptimalImplementations with Resilience and Ef ciency. T e AMP Lab is developing scalablemachine learning algorithms, warehouse-scale-computer-friendly programmingmodels, and crowd-sourcing tools to gain valuable insights quickly from big data inthe cloud.
ACM () is widely recognized as the premier organization for computing professionals, delivering a broad array of resources that advance the computing and IT disciplines, enable professional development, and promote policies and research that benefit society. Another recent area of research [17] is protection against “side-channel attacks”, where an adversary is able to get information (for example, by measuring processor power consumption) that is not part of the stream of bits specified by a protocol. Shafi, with Adi Akavia and Vaikuntanathan, had the first results showing how to do public-key encryption in a way that remains secure even if the secret memory containing the secret key is partially leaked. This was the beginning of an intensive research effort by the cryptographic community to define and achieve leakage resilience for cryptographic primitives and protocols. For example, with Tauman Kalai and Rothblum she proposed [16] the model of "one-time program" which obfuscates a program so that it can be executed only for a prescribed number of executions, assuming a special kind of universal secure hardware.
He was a leader of the Redundant Arrays of Inexpensive Disks (RAID) project,which led to dependable storage systems from many companies. He was also involved in theNetwork of Workstations (NOW) project, which led to cluster technology used by Internetcompanies and later to cloud computing. His current research projects are Algorithm-Machine-People and Algorithmsand Specializers for Provably Optimal Implementations with Resilience and Efciency.
Sharing the Gödel Prize was a paper by László Babai and Shlomo Moran that gave a different notion of interactive proof, where the randomness of the verifier is only from public coins. An example in Shafi's paper on zero knowledge clearly seemed to require private coins, but Shafi and Michael Sipser [7] later proved that the two notions are equivalent. This involved using public coins to do interactive proofs showing lower bounds on the sizes of sets.
Prof. Hennessy is a Fellow of the IEEE and ACM; a member of the National Academy of Engineering, the National Academy of Science, and the American Philosophical Society; and a Fellow of the American Academy of Arts and Sciences. Among his many awards are the 2001 Eckert-Mauchly Award for his contributions to RISC technology, the 2001 Seymour Cray Computer Engineering Award, and the 2000 John von Neumann Award, which he shared with David Patterson. A new aspect of the third edition is the explicit connection between program performance and CPU performance. The authors show how hardware and software components--such as the specific algorithm, programming language, compiler, ISA and processor implementation--impact program performance. Throughout the book a new feature focusing on program performance describes how to search for bottlenecks and improve performance in various parts of the system. The book digs deeper into the hardware/software interface, presenting a complete view of the function of the programming language and compiler--crucial for understanding computer organization.
Innovations like domain-specific hardware, enhanced security, open instruction sets, and agile chip development will lead the way.
David A. Patterson is the Pardee Professor of Computer Science, Emeritus at theUniversity of California at Berkeley, which he joined afer graduating from UCLA in1977. His teaching has been honored by the Distinguished Teaching Award from theUniversity of California, the Karlstrom Award from ACM, and the Mulligan EducationMedal and Undergraduate Teaching Award from IEEE. Patterson received the IEEETechnical Achievement Award and the ACM Eckert-Mauchly Award for contributionsto RISC, and he shared the IEEE Johnson Information Storage Award for contributionsto RAID. Like his coauthor, Patterson is a Fellow of the American Academyof Arts and Sciences, the Computer History Museum, ACM, and IEEE, and he waselected to the National Academy of Engineering, the National Academy of Sciences,and the Silicon Valley Engineering Hall of Fame. He served on the InformationTechnology Advisory Committee to the US President, as chair of the CS division in theBerkeley EECS department, as chair of the Computing Research Association, and asPresident of ACM. Tis record led to Distinguished Service Awards from ACM, CRA,and SIGARCH.At Berkeley, Patterson led the design and implementation of RISC I, likely the frstVLSI reduced instruction set computer, and the foundation of the commercial SPARCarchitecture.
Specifically, they showed that if the size of a maximum clique in a graph can be approximated within a constant factor, then all of NP can be accepted in nearly polynomial time. This result inspired decades of results about PCPs (probabilistically checkable proofs, an alternative characterization of multi-prover proofs) and hardness of approximation. This paper earned Shafi her second Gödel Prize, shared with two papers that prove nearly optimal parameters for PCPs. One of the most important contributors to this area is Johan Håstad, who years earlier had been the very first of Shafi's many amazing graduate students.
This book is recommended for professional digital system designers, programmers, application developers, and system software developers; and undergraduate students in Computer Science, Computer Engineering and Electrical Engineering courses in Computer Organization, Computer Design, ranging from Sophomore required courses to Senior Electives. Shafi enrolled in graduate school in Computer Science at the University of California, Berkeley, without knowing what she wanted to study. Her master's work was with Michael Powell and David Patterson, studying the optimal instruction set for the RISC architecture. But she soon met a group of enthusiastic young theoretical computer scientists – including Eric Bach, Faith Ellen, Mike Luby, Jeff Shallit, Vijay Vazirani and her Turing Award co-recipient Silvio Micali – and she began to see that her interests lay in theoretical areas.
Patterson has been teaching computer architecture at the University ofCalifornia, Berkeley, since joining the faculty in 1977, where he holds the Pardee Chairof Computer Science. His teaching has been honored by the Distinguished TeachingAward from the University of California, the Karlstrom Award from ACM, and theMulligan Education Medal and Undergraduate Teaching Award from IEEE. Pattersonreceived the IEEE Technical Achievement Award and the ACM Eckert-Mauchly Awardfor contributions to RISC, and he shared the IEEE Johnson Information Storage Awardfor contributions to RAID.
No comments:
Post a Comment