Undergraduate Research about Parallel Computing in JavaScript
-
Updated
Oct 21, 2015 - TeX
Undergraduate Research about Parallel Computing in JavaScript
Various parallel implementations of Floyd-Warshall algorithm
Parallel Computing work
ANR Pythia project repository
Project on agent-based simulations for the GPU. My final year dissertation project co-supervised by Fiona Polack (Keele University) and Kieran Alden (University of York) with additional support provided by Richard Paige (UoY).
A* is a graph-traversal and path-search algorithm. It is used in many contexts of computer science and not only. It can be considered as a general case of the Dijkstra algorithm.
Projects for the Parallel & Distributed Systems course of 2015
Final Project for COMP 605: Scientific Computing at San Diego State University, Spring 2023 using C, OpenMP, and CUDA
Project for the SPM course
Power capping the cpu and exploiting heterogenity using charm++ load balancers
Informe de la Tesis para la Carrera en Ingeniería en Computación FCEFyN UNC
Code and notes on concurrent and parallel programming in C++
Artículos escritos en base al Proyecto Final de la carrera Ingeniería en Computación FCEFyN UNC
Efficient n-body simulation written in futhark
Is parallel programming hard, and, if so, what can you do about it?
Sammlung wichtiger Befehle und so für die Klausur
Computer Science 267: Applications of Parallel Computers
Add a description, image, and links to the parallel-programming topic page so that developers can more easily learn about it.
To associate your repository with the parallel-programming topic, visit your repo's landing page and select "manage topics."