Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,147,095 papers from all fields of science
Search
Sign In
Create Free Account
Livermore loops
Known as:
Livermore Fortran kernels
, Livermore loop
Livermore loops (also known as the Livermore Fortran kernels or LFK) is a benchmark for parallel computers. It was created by Francis H. McMahon from…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
8 relations
Benchmark (computing)
Cholesky decomposition
Do while loop
Fortran
Expand
Broader (1)
Parallel computing
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2004
2004
A Modified Vertex Method for Parallelization of Arbitrary Nested Loops
W. Bielecki
,
R. Kocisz
Parallel Computing in Electrical Engineering…
2004
Corpus ID: 9930094
A technique, permitting us to linearize constraints formed to find affine schedules for arbitrary nested loops, is presented. The…
Expand
2003
2003
AN ARCHITECTURE FOR PARALLEL INTERPRETATION OF ABSTRACT MACHINE LANGUAGES
M. Manwaring
,
V. Malbasa
2003
Corpus ID: 17223213
An innovative central processor architecture is described that exploits the innate parallelism found in the machine language…
Expand
1997
1997
Evaluation of Loop Scheduling Algorithms on Distributed Memory Systems
T. Philip
,
C. Das
1997
Corpus ID: 14449652
Loops are the largest source of parallelism in many applications. All prior DOALL loop scheduling algorithms such as Self…
Expand
1994
1994
Extracting parallelism in Fortran by translation to a single assignment intermediate form
R. Barry
,
P. Evripidou
Proceedings of 8th International Parallel…
1994
Corpus ID: 30216531
The paper presents MUSTANG, a system for translating Fortran to single assignment form in an effort to automatically extract…
Expand
1994
1994
Effects and Handling of Instruction Class Contention in Superscalar Processing
Yuh-Horng Shiau
,
C. Chung
International journal of high speed computing
1994
Corpus ID: 13315493
Operation class conflicts degrade the performance of a superscalar machine by reducing the instruction-level parallelism…
Expand
1993
1993
Compiler Techniques for Managing Data Motion
J. Pieper
1993
Corpus ID: 56917032
Abstract : Software caching, automatic algorithm blocking, and data overlays are different names for the same problem: compiler…
Expand
Review
1993
Review
1993
Performance of the Efficient Data-Driven Evaluation Scheme
Darin B. Johnson
,
Francine Berman
J. Parallel Distributed Comput.
1993
Corpus ID: 451289
Abstract The Efficient Data-Driven Evaluation Scheme is a two-phase strategy for optimizing the execution time of programs in the…
Expand
1991
1991
Performance Prediction for Parallel Numerical Algorithms
K. Gallivan
,
W. Jalby
,
A. Malony
,
H. Wijshoff
International journal of high speed computing
1991
Corpus ID: 39527947
In this paper, we discuss the performance prediction of Fortran constructs commonly found in numerical scientific computing…
Expand
1988
1988
Instruction reorganization for a variable-length pipelined microprocessor
S. Abraham
,
K. Padmanabhan
Conference on Advanced Research in VLSI
1988
Corpus ID: 62602632
The implementation of an instruction reorganizer for a floating-point microprocessor with a variable-length pipeline is described…
Expand
1985
1985
Parallel processing as a language design problem
Jim Savage
International Symposium on Computer Architecture
1985
Corpus ID: 18353560
I n t r o d u c t i o n peak rates of about 200 Mflops but its harmonic mean for the first fourteen Livermore loops is about 19…
Expand