#### Filter Results:

- Full text PDF available (14)

#### Publication Year

1966

2019

- This year (2)
- Last 5 years (14)
- Last 10 years (23)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- John L. Gustafson
- Commun. ACM
- 1988

Dans cet article, il est question de l'importance, pour la communaute scientifique informatique, de venir a bout du «blocage mental» contre le parallelisme massif impose par une mauvaise utilisation… (More)

We have developed highly efficient parallel solutions for three practical, full-scale scientific problems: wave mechanics, fluid dynamics, and structural analysis. Several algorithmic techniques are… (More)

- Xian-He Sun, John L. Gustafson
- Parallel Computing
- 1991

Due to programming difficulty, parallel algorithms are commonly compared with different levels of programming effort. They are also compared on different architectures. In this paper, the fairness''… (More)

- John L. Gustafson, Rajat Todi
- Proceedings of the Thirty-First Hawaii…
- 1998

Most benchmarks are smaller than actual application programs. One reason is to improve benchmark universality by demanding resources every computer is likely to have. But users dynamically increase… (More)

Symmetric elliptic integrals, which have been used as replacements for Legendre's integrals in recent integral tables and computer codes, are homogeneous functions of three or four variables. When… (More)

- John L. Gustafson, Quinn Snell
- Proceedings of the Twenty-Eighth Annual Hawaii…
- 1995

The computing community has long faced the problem of scientifically comparing different computers and different algorithms. When architectures, methods, precision, or storage capacity are very… (More)

- John L. Gustafson, Diane T. Rover, Stephen Elbert, Michael Carter
- J. Parallel Distrib. Comput.
- 1991

By using the principle of fixed time benchmarking, it is possible to compare a very wide range of computers, from a small personal computer to the most powerful parallel supercomputer, an a single… (More)

- Srinivas Aluru, John L. Gustafson, Gurpur M. Prabhu, Fatih Erdogan Sevilgen
- The Journal of Supercomputing
- 1998

The N-body problem is to simulate the motion of N particles under the influence of mutual force fields based on an inverse square law. Greengards algorithm claims to compute the cumulative force on… (More)

If we are willing to give up compatibility with IEEE 754 floats and design a number format with goals appropriate for 2016, we can achieve several goals simultaneously: Extremely high energy… (More)

Asymptotic formulas with error bounds are obtained for the first elliptic integral near its logarithmic singularity. It is convenient to start from the more general problem of expanding the integral… (More)