Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Parallel computing
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==Algorithmic methods== As parallel computers become larger and faster, we are now able to solve problems that had previously taken too long to run. Fields as varied as [[bioinformatics]] (for [[protein folding]] and [[sequence analysis]]) and economics have taken advantage of parallel computing. Common types of problems in parallel computing applications include:<ref>[[Asanovic, Krste]], et al. (December 18, 2006). [http://www.eecs.berkeley.edu/Pubs/TechRpts/2006/EECS-2006-183.pdf "The Landscape of Parallel Computing Research: A View from Berkeley"] (PDF). University of California, Berkeley. Technical Report No. UCB/EECS-2006-183. See table on pages 17–19.</ref> <!--Note: do not add to or remove from this list. It is copied from the above source--> * Dense [[linear algebra]] * Sparse linear algebra * Spectral methods (such as [[Cooley–Tukey FFT algorithm|Cooley–Tukey fast Fourier transform]]) * [[N-body problem|''N''-body problems]] (such as [[Barnes–Hut simulation]]) * [[Regular grid|Structured grid]] problems (such as [[Lattice Boltzmann methods]]) * [[Unstructured grid]] problems (such as found in [[finite element analysis]]) * [[Monte Carlo method]] * [[Combinational logic]] (such as [[Brute force attack|brute-force cryptographic techniques]]) * [[Graph traversal]] (such as [[sorting algorithm]]s) * [[Dynamic programming]] * [[Branch and bound]] methods * [[Graphical model]]s (such as detecting [[hidden Markov model]]s and constructing [[Bayesian network]]s) * [[HBJ model]], a concise message-passing model<ref>{{cite journal |last1=David R. |first1=Helman |last2=David A. |first2=Bader |last3=JaJa |first3=Joseph |year=1998 |title=A Randomized Parallel Sorting Algorithm with an Experimental Study |journal=Journal of Parallel and Distributed Computing |volume=52 |pages=1–23 |doi=10.1006/jpdc.1998.1462 |hdl=1903/835 |url=http://www.cc.gatech.edu/~bader/papers/JPDC-981462.pdf |access-date=26 October 2012 |archive-date=19 November 2012 |archive-url=https://web.archive.org/web/20121119012835/http://www.cc.gatech.edu/~bader/papers/JPDC-981462.pdf |url-status=dead }}</ref> * [[Finite-state machine]] simulation
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)