System enables large speedups — as much as 88-fold — on common parallel-computing algorithms (MIT) A new system called Fractal achieves 88-fold speedups through a parallelism strategy known as ...

The team designed a fully dynamic APSP algorithm in the MPC model with low round complexity that is faster than all the existing static parallel APSP algorithms.

In this video, Torsten Hoefler from ETH Zurich presents: Scientific Benchmarking of Parallel Computing Systems. "Measuring and reporting performance of parallel computers constitutes the basis for ...

The graduate program in computer science is concerned with the fundamental concepts arising in the development and use of computing systems, including the study of computational complexity and ...

Viewshed analysis is a critical process within Geographic Information Systems (GIS) that determines the visibility of terrain from a given observation point. Recent progress in parallel computing ...

With support and funding from Intel, research at the new center will use high performance parallel computing to solve problems in finance. Researchers will develop computational algorithms and ...

Important parallel algorithms and data structures will be discussed, including the notion of lock-free data structures. Note that this class lightly touches upon GPU programming; students primarily ...