Results 1  10
of
6,720
Introduction to redundant arrays of inexpensive disks
 Proceedings of the IEEE COMPCON
, 1989
"... Abstract Increasmg performance of CPUs and memorres wrll be squandered lf not matched by a sunrlm peformance ourease m II0 Whde the capactty of Smgle Large Expenstve D&T (SLED) has grown rapuily, the performance rmprovement of SLED has been modest Redundant Arrays of Inexpensive Disks (RAID), ba ..."
Abstract

Cited by 846 (55 self)
 Add to MetaCart
Abstract Increasmg performance of CPUs and memorres wrll be squandered lf not matched by a sunrlm peformance ourease m II0 Whde the capactty of Smgle Large Expenstve D&T (SLED) has grown rapuily, the performance rmprovement of SLED has been modest Redundant Arrays of Inexpensive Disks (RAID), based on the magnetic duk technology developed for personal computers, offers an attractive alternattve IO SLED, promtang onprovements of an or&r of mogm&e m pctformance, rehabdlty, power consumption, and scalalnlrty Thu paper rntroducesfivc levels of RAIDS, grvmg rheu relative costlpetfotmance, and compares RAID to an IBM 3380 and a Fupisu Super Eagle 1 Background: Rlsrng CPU and Memory Performance The users of computers are currently enJoymg unprecedented growth m the speed of computers Gordon Bell said that between 1974 and 1984. smgle chip computers improved m performance by 40 % per year, about twice the rate of mmlcomputers [Bell 841 In the followmg year B111 Joy
NonMalleable Cryptography
 SIAM Journal on Computing
, 2000
"... The notion of nonmalleable cryptography, an extension of semantically secure cryptography, is defined. Informally, in the context of encryption the additional requirement is that given the ciphertext it is impossible to generate a different ciphertext so that the respective plaintexts are related. ..."
Abstract

Cited by 490 (21 self)
 Add to MetaCart
The notion of nonmalleable cryptography, an extension of semantically secure cryptography, is defined. Informally, in the context of encryption the additional requirement is that given the ciphertext it is impossible to generate a different ciphertext so that the respective plaintexts are related. The same concept makes sense in the contexts of string commitment and zeroknowledge proofs of possession of knowledge. Nonmalleable schemes for each of these three problems are presented. The schemes do not assume a trusted center; a user need not know anything about the number or identity of other system users. Our cryptosystem is the first proven to be secure against a strong type of chosen ciphertext attack proposed by Rackoff and Simon, in which the attacker knows the ciphertext she wishes to break and can query the decryption oracle on any ciphertext other than the target.
Garp: A MIPS Processor with a Reconfigurable Coprocessor
, 1997
"... Typical reconfigurable machines exhibit shortcomings that make them less than ideal for generalpurpose computing. The Garp Architecture combines reconfigurable hardware with a standard MIPS processor on the same die to retain the better features of both. Novel aspects of the architecture are presen ..."
Abstract

Cited by 402 (6 self)
 Add to MetaCart
Typical reconfigurable machines exhibit shortcomings that make them less than ideal for generalpurpose computing. The Garp Architecture combines reconfigurable hardware with a standard MIPS processor on the same die to retain the better features of both. Novel aspects of the architecture are presented, as well as a prototype software environment and preliminary performance results. Compared to an UltraSPARC, a Garp of similar technology could achieve speedups ranging from a factor of 2 to as high as a factor of 24 for some useful applications.
Truth and the Unprovability of Consistency
"... Abstract: It might be thought that we could argue for the consistency of a mathematical theory T within T, by giving an inductive argument that all theorems of T are true and inferring consistency. By Gödel’s second incompleteness theorem any such argument must break down, but just how it breaks dow ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Abstract: It might be thought that we could argue for the consistency of a mathematical theory T within T, by giving an inductive argument that all theorems of T are true and inferring consistency. By Gödel’s second incompleteness theorem any such argument must break down, but just how it breaks down depends on the kind of theory of truth that is built into T. The paper surveys the possibilities, and suggests that some theories of truth give far more intuitive diagnoses of the breakdown than do others. The paper concludes with some morals about the nature of validity and about a possible alternative to the idea that mathematical theories are indefinitely extensible. Gödel’s second incompleteness theorem says, very roughly, that no reasonably powerful recursively axiomatized mathematical theory in classical logic can prove its own consistency. This is rough in various ways Ce.g. it slurs over issues about how exactly the notion of consistency is to be formulatedCbut it will do for present purposes. A natural initial thought is that the theorem is slightly puzzling: we ought to be able to prove the consistency of a mathematical theory T within T by (i) inductively proving within T that all its theorems are true,
Resource Bounded Unprovability of
, 2003
"... This paper shows that the proof complexity (minimum computational complexity of proving formally or asymptotically) of "P6=NP" is superpolynomialtime with respect to a theory T , which is a consistent extension of Peano Arithmetic (PA), and PTM!consistent, where the PTM!consistenc ..."
Abstract
 Add to MetaCart
using any currently known mathematical paradigm implies an extremelyclosetopolynomial time algorithm that can solve NPcomplete problems. Based on this result, we show that the security of any computational cryptographic scheme is unprovable in the standard setting of modern cryptography, where
An Overview of JML Tools and Applications
, 2003
"... The Java Modeling Language (JML) can be used to specify the detailed design of Java classes and interfaces by adding annotations to Java source files. The aim of JML is to provide a specification language that is easy to use for Java programmers and that is supported by a wide range of tools for ..."
Abstract

Cited by 369 (55 self)
 Add to MetaCart
The Java Modeling Language (JML) can be used to specify the detailed design of Java classes and interfaces by adding annotations to Java source files. The aim of JML is to provide a specification language that is easy to use for Java programmers and that is supported by a wide range of tools for specification typechecking, runtime debugging, static analysis, and verification. This paper
Results 1  10
of
6,720