Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,680,922 papers from all fields of science
Search
Sign In
Create Free Account
Amdahl's law
Known as:
Amdahl
, Amdahl law
, Amdahl s Law
Expand
In computer architecture, Amdahl's law (or Amdahl's argument) gives the theoretical speedup in latency of the execution of a task at fixed workload…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
31 relations
American Federation of Information Processing Societies
Computer architecture
Concurrent data structure
Cray-1
Expand
Broader (1)
Analysis of parallel algorithms
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Acceleration of the Dual-Field Domain Decomposition Algorithm Using MPI–CUDA on Large-Scale Computing Systems
H. Meng
,
Jianming Jin
IEEE Transactions on Antennas and Propagation
2014
Corpus ID: 7474004
It is well known that graphics processing units (GPUs) are able to accelerate highly parallelizable algorithms with a high…
Expand
2011
2011
Amdahl's Law
J. Gustafson
Encyclopedia of Parallel Computing
2011
Corpus ID: 40822754
Typically, it is fairly straightforward to reason a bout the performance of sequential computations. For most programs, it…
Expand
2010
2010
Extending Amdahl's law for energy-efficiency
Sebastian M. Londono
,
J. P. de Gyvez
International Conference on Energy Aware…
2010
Corpus ID: 16076570
This paper presents a study about the potential dynamic energy improvement that can be achieved when hardware parallelization is…
Expand
2007
2007
Speedup and scalability analysis of Master-Slave applications on large heterogeneous clusters
Eduardo Javier Huerta Yero
,
M. A. Henriques
J. Parallel Distributed Comput.
2007
Corpus ID: 5167548
2002
2002
Parallel implementation of the steepest descent fast multipole method (SDFMM) on a Beowulf cluster for subsurface sensing applications
D. Jiang
,
W. Meleis
,
M. El-Shenawee
,
E. Mizan
,
M. Ashouei
,
C. Rappaport
IEEE Microwave and Wireless Components Letters
2002
Corpus ID: 8607360
We present the parallel, MPI-based implementation of the SDFMM computer code using a thirty-two node Intel Pentium-based Beowulf…
Expand
2001
2001
Fast hashing onto elliptic curves over fields of characteristic 3
Paulo L. Barreto
,
H. Y. Kim
IACR Cryptology ePrint Archive
2001
Corpus ID: 8380599
We describe a fast hash algorithm that maps arbitrary messages onto points of an elliptic curve defined over a finite field of…
Expand
Highly Cited
1995
Highly Cited
1995
Cost-Effective Parallel Computing
D. Wood
,
M. Hill
Computer
1995
Corpus ID: 34303634
We consider how large memories can make parallel computing cost-effective even with modest speedups. As a concrete example, we…
Expand
1992
1992
MPPs, Amdahl's law, and comparing computers
M. Annaratone
[Proceedings ] The Fourth Symposium on the…
1992
Corpus ID: 57126285
The author examines Amdahl's law in the context of parallel processing and provides some arguments as to what the applicability…
Expand
1985
1985
Implementation of precise interrupts in pipelined processors
James E. Smith
,
A. Pleszkun
International Symposium on Computer Architecture
1985
Corpus ID: 261279920
An interrupt is precise if the saved process state corresponds with the sequential model of program execution where one…
Expand
1981
1981
Models of DASD subsystems: Basic model of reconnection
A. Brandwajn
Performance evaluation (Print)
1981
Corpus ID: 5304202
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE