Results 1  10
of
1,532
1 Collapsing floatingpoint operations
, 2012
"... This paper addresses the issue of collapsing dependent floatingpoint operations. The presentation focuses on studying the dataflow graph of benchmark involving a large number of floatingpoint instructions. In particular, it focuses on the relevance of new floatingpoint operators performing two dep ..."
Abstract
 Add to MetaCart
This paper addresses the issue of collapsing dependent floatingpoint operations. The presentation focuses on studying the dataflow graph of benchmark involving a large number of floatingpoint instructions. In particular, it focuses on the relevance of new floatingpoint operators performing two
Static Analyses of FloatingPoint Operations
 In SAS’01, volume 2126 of LNCS
, 2001
"... Computers manipulate approximations of real numbers, called floatingpoint numbers. The calculations they make are accurate enough for most applications. Unfortunately, in some (catastrophic) situations, the floatingpoint operations lose so much precision that they quickly become irrelevant. In thi ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
Computers manipulate approximations of real numbers, called floatingpoint numbers. The calculations they make are accurate enough for most applications. Unfortunately, in some (catastrophic) situations, the floatingpoint operations lose so much precision that they quickly become irrelevant
Optimizing Floating Point Operations in Scheme
"... It is well known that dynamic typing in languages like Lisp is costly in terms of performance. Besides the cost of tag checking, the other major source of inefficiency comes from the need to place and retrieve data from dynamically allocated objects, i.e. boxing and unboxing. This makes it unaccepta ..."
Abstract
 Add to MetaCart
the problem. In this paper we shall examine a subproblem, namely using type inference to aid compilation of numerical intensiveLispcode. Atype inference algorithm for floating point operations will be described. This has been implemented in a Scheme compiler. Implementation issues and performance results
Errorfree Computations via FloatingPoint Operations
 Graduate Center, City University of New York
, 2007
"... Divisionfree arithmetic computations can be boiled down to summation due to Dekker/Veltkamp’s algorithm of 1971. The known doubleprecision numerical algorithms for summation are highly effective but limited by rounding errors. Our new summation algorithms relaxe this limitation, although they stil ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
they still almost entirely amount to doubleprecision additions. The efficiency of the algorithms is confirmed by our analysis and extensive tests. Key words: Errorfree summation, floatingpoint additions. 1
Improving the Ratio of Memory Operations to FloatingPoint Operations in Loops
 ACM Transactions on Programming Languages and Systems
, 1994
"... this paper we attempt to answer that question. To do so, we develop and evaluate techniques that automatically restructure program loops to achieve high performance on specific target architectures. These methods attempt to balance computation and memory accesses and seek to eliminate or reduce pipe ..."
Abstract

Cited by 110 (18 self)
 Add to MetaCart
pipeline interlock. To do this, they statically estimate the balance between memory operations and floatingpoint operations for each loop in a particular program and use these estimates to determine whether to apply various loop transformations. Experiments with our automatic techniques show that integer
AlgorithmBased Fault Tolerance for FloatingPoint Operations in Massively Parallel Systems
"... This paper considers the applicability of algorithmbased fault tolerance (ABFT) to massively parallel scientific computation. Existing ABFT schemes can provide effective fault tolerance at a low cost for computation on matrices of moderate size; however, the methods do not scale well to floatingpo ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
This paper considers the applicability of algorithmbased fault tolerance (ABFT) to massively parallel scientific computation. Existing ABFT schemes can provide effective fault tolerance at a low cost for computation on matrices of moderate size; however, the methods do not scale well to floatingpoint
Solving Constraints on the Intermediate Result of Decimal FloatingPoint Operations
"... The draft revision of the IEEE Standard for FloatingPoint Arithmetic (IEEE P754) includes a definition for decimal floatingpoint (FP) in addition to the widely used binary FP specification. The decimal standard raises new concerns with regard to the verification of hardware and softwarebased des ..."
Abstract
 Add to MetaCart
based designs. The verification process normally emphasizes intricate corner cases and uncommon events. The decimal format introduces several new classes of such events in addition to those characteristic of binary FP. Our work addresses the following problem: Given a decimal floatingpoint operation, a
Solving Constraints on the Intermediate Result of Decimal FloatingPoint Operations
 In 18th IEEE Symposium on Computer Arithmetic
, 2007
"... The draft revision of the IEEE Standard for FloatingPoint Arithmetic (IEEE P754) includes a definition for decimal floatingpoint (FP) in addition to the widely used binary FP specification. The decimal standard raises new concerns with regard to the verification of hardware and softwarebased d ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
based designs. The verification process normally emphasizes intricate corner cases and uncommon events. The decimal format introduces several new classes of such events in addition to those characteristic of binary FP. Our work addresses the following problem: Given a decimal floatingpoint operation, a
Abstract Domains for BitLevel Machine Integer and Floatingpoint Operations
"... We present a few lightweight numeric abstract domains to analyze C programs that exploit the binary representation of numbers in computers, for instance to perform “computethroughoverflow” on machine integers, or to directly manipulate the exponent and mantissa of floatingpoint numbers. On integer ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We present a few lightweight numeric abstract domains to analyze C programs that exploit the binary representation of numbers in computers, for instance to perform “computethroughoverflow” on machine integers, or to directly manipulate the exponent and mantissa of floatingpoint numbers
Abstract Domains for BitLevel Machine Integer and Floatingpoint Operations
"... We present a few lightweight numeric abstract domains to analyze C programs that exploit the binary representation of numbers in computers, for instance to perform “computethroughoverflow ” on machine integers, or to directly manipulate the exponent and mantissa of floatingpoint numbers. On int ..."
Abstract
 Add to MetaCart
We present a few lightweight numeric abstract domains to analyze C programs that exploit the binary representation of numbers in computers, for instance to perform “computethroughoverflow ” on machine integers, or to directly manipulate the exponent and mantissa of floatingpoint numbers
Results 1  10
of
1,532