Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,055,883 papers from all fields of science
Search
Sign In
Create Free Account
Analysis of parallel algorithms
Known as:
Brent's law
, Analysis of PRAM algorithms
, Critical path length
Expand
This article discusses the analysis of parallel algorithms. Like in the analysis of "ordinary", sequential, algorithms, one is typically interested…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
10 relations
Analysis of algorithms
Data dependency
Memory hierarchy
Merge algorithm
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Buffer optimization based on critical path analysis of a dataflow program design
S. Brunet
,
M. Mattavelli
,
Jörn W. Janneck
International Symposium on Circuits and Systems
2013
Corpus ID: 20569701
The trade-off between throughput and memory constraints is a common design problem in embedded systems, and especially for…
Expand
2012
2012
Performance Analysis of Parallel Algorithms on Multi-core System using OpenMP
S. Sharma
,
Kusum Gupta
2012
Corpus ID: 61706431
The current multi-core architectures have become popular due to performance, and efficient processing of multiple tasks…
Expand
2008
2008
A Highly Parallel Joint VLSI Architecture for Transforms in H.264/AVC
Yu Li
,
Yun He
,
Shunliang Mei
Journal of Signal Processing Systems
2008
Corpus ID: 3285375
In H.264/AVC, the concept of adapting the transform size to the block size of motion-compensated prediction residue has proven to…
Expand
2007
2007
Faster Placer for Island-Style FPGAs
Pritha Banerjee
,
S. Sur-Kolay
International Conference on Computing: Theory and…
2007
Corpus ID: 8629247
In this paper, we propose a placement method for island-style FPGAs, based on fast yet very good initial placement followed by…
Expand
2007
2007
A Greedy Common Subexpression Elimination Algorithm for Implementing FIR Filters
S. Vijay
,
A. P. Vinod
,
E. Lai
IEEE International Symposium on Circuits and…
2007
Corpus ID: 14907440
The complexity of finite impulse response (FIR) filters is dominated by the number of adders (subtractors) used to implement the…
Expand
2007
2007
An Evolutionary Approach to Task Graph Scheduling
Saeed Parsa
,
S. Lotfi
,
Naser Lotfi
International Conference on Adaptive and Natural…
2007
Corpus ID: 2846768
Effective scheduling is of great importance to parallel programming environments. The aim is to minimize the completion time of…
Expand
2007
2007
Exploration of Low Power Adders for a SIMD Data Path
Giacomo Paci
,
P. Marchal
,
L. Benini
Asia and South Pacific Design Automation…
2007
Corpus ID: 5990634
Hardware for ambient intelligence needs to achieve extremely high computational efficiency (up to 40GOPS/W). An important way for…
Expand
1997
1997
Scheduling and optimal voltage selection for low power multi-voltage DSP datapaths
Mark C. Johnson
,
Kaushik Roy
Proceedings of IEEE International Symposium on…
1997
Corpus ID: 17834725
We present an algorithm called MOVER (Multiple Operating Voltage Energy Reduction) to minimize datapath energy dissipation…
Expand
1995
1995
On Optimal Orow-Pram Algorithms for Computing Recursively Defined Functions
R. Niedermeier
,
P. Rossmanith
Parallel Processing Letters
1995
Corpus ID: 17782605
We investigate parallel algorithms to compute recursively defined functions. Our computational model are parallel random access…
Expand
1994
1994
Functional I-structure, and M-structure Implementations of NAS Benchmark FT
S. Sur
,
A. Böhm
Parallel Architectures and Compilation Techniques
1994
Corpus ID: 6476444
We implement the NAS parallel benchmark FT, which numerically solves a three dimensional partial diierential equation using…
Expand
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