The tao of parallelism in algorithms

K Pingali, D Nguyen, M Kulkarni, M Burtscher… - Proceedings of the …, 2011 - dl.acm.org
For more than thirty years, the parallel programming community has used the dependence
graph as the main abstraction for reasoning about and exploiting parallelism in" regular" …

A survey on parallel computing and its applications in data-parallel problems using GPU architectures

CA Navarro, N Hitschfeld-Kahler… - … in Computational Physics, 2014 - cambridge.org
Parallel computing has become an important subject in the field of computer science and
has proven to be critical when researching high performance solutions. The evolution of …

A bridging model for multi-core computing

LG Valiant - Journal of Computer and System Sciences, 2011 - Elsevier
Writing software for one parallel system is a feasible though arduous task. Reusing the
substantial intellectual effort so expended for programming a second system has proved …

Speculative parallelism on multicore chip architecture strengthen green computing concept: A survey

S Kumar, SK Singh, N Aggarwal - Advanced computer science …, 2023 - taylorfrancis.com
In the present scenario, nobody wants to compromise on computational speed when it
comes to competitive business, transferring information quickly in a communication link, or …

Parallel programmer productivity: A case study of novice parallel programmers

L Hochstein, J Carver, F Shull, S Asgari… - SC'05: Proceedings …, 2005 - ieeexplore.ieee.org
In developing High-Performance Computing (HPC) software, time to solution is an important
metric. This metric is comprised of two main components: the human effort required …

Ordered vs. unordered: a comparison of parallelism and work-efficiency in irregular algorithms

MA Hassaan, M Burtscher, K Pingali - Acm Sigplan Notices, 2011 - dl.acm.org
Outside of computational science, most problems are formulated in terms of irregular data
structures such as graphs, trees and sets. Unfortunately, we understand relatively little about …

Software components capture using graph clustering

Y Chiricota, F Jourdan… - 11th IEEE International …, 2003 - ieeexplore.ieee.org
We describe a simple, fast computing and easy to implement method for finding relatively
good clusterings of software systems. Our method relies on the ability to compute the …

FPGA-based prototype of a PRAM-on-chip processor

X Wen, U Vishkin - Proceedings of the 5th conference on Computing …, 2008 - dl.acm.org
PRAM (Parallel Random Access Model) has been widely regarded a desirable parallel
machine model for many years, but it is also believed to be" impossible in reality." As the …

A pilot study to compare programming effort for two parallel programming models

L Hochstein, VR Basili, U Vishkin, J Gilbert - Journal of Systems and …, 2008 - Elsevier
CONTEXT: Writing software for the current generation of parallel systems requires significant
programmer effort, and the community is seeking alternatives that reduce effort while still …

A mesh-of-trees interconnection network for single-chip parallel processing

AO Balkan, G Qu, U Vishkin - IEEE 17th International …, 2006 - ieeexplore.ieee.org
There is a recent surge of interest in single-chip parallel processors. In such machines, it is
crucial to implement a high-throughput low-latency interconnection network to connect the …