Full Text Available
Note: Clicking the button above will open the full text document at the original institutional repository in a new window.
Parallelisation of algorithms
Most numerical software involves performing an extremely large volume of algebraic computations. This is both costly and time consuming in respect of computer resources and, for large problems, often super-computer power is required in order for results to be obtained in a reasonable amount of time....
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | English |
| Published: |
Department of Computer Science
2016
|
| Subjects: | |
| Tags: |
No Tags, Be the first to tag this record!
|
Similar Items: Parallelisation of algorithms
- A computational framework for parallelised protein folding simulation and the investigation of protein stability
- SCBI_MapReduce, a New Ruby Task-Farm Skeleton for Automated Parallelisation and Distribution in Chunks of Sequences: The Implementation of a Boosted Blast+
- Parallelising inference on cluster graphs
- Fast array analysis using parallelised domain decomposition methods
- Performance Analysis of Machine Learning Algorithms for IoT Security
- Impact of Reducing Multicollinearity in a Dataset on Artificial Intelligence Algorithms