A faster parallel algorithm and efficient multithreaded implementations for evaluating betweenness centrality on massive datasets
We present a new lock-free parallel algorithm for computing betweenness centrality of
massive complex networks that achieves better spatial locality compared with previous …
massive complex networks that achieves better spatial locality compared with previous …
High performance computing for electric power systems: Applications and trends
RC Green, L Wang, M Alam - 2011 IEEE Power and Energy …, 2011 - ieeexplore.ieee.org
The last significant works that made an effort to review and summarize the relationship
between High Performance Computing (HPC) and Power Systems Analysis were published …
between High Performance Computing (HPC) and Power Systems Analysis were published …
Feedback-driven threading: power-efficient and high-performance execution of multi-threaded workloads on CMPs
MA Suleman, MK Qureshi, YN Patt - ACM Sigplan Notices, 2008 - dl.acm.org
Extracting high-performance from the emerging Chip Multiprocessors (CMPs) requires that
the application be divided into multiple threads. Each thread executes on a separate core …
the application be divided into multiple threads. Each thread executes on a separate core …
Thread reinforcer: Dynamically determining number of threads via os level monitoring
KK Pusukuri, R Gupta… - 2011 IEEE International …, 2011 - ieeexplore.ieee.org
It is often assumed that to maximize the performance of a multithreaded application, the
number of threads created should equal the number of cores. While this may be true for …
number of threads created should equal the number of cores. While this may be true for …
Thread tailor: dynamically weaving threads together for efficient, adaptive parallel applications
Extracting performance from modern parallel architectures requires that applications be
divided into many different threads of execution. Unfortunately selecting the appropriate …
divided into many different threads of execution. Unfortunately selecting the appropriate …
Graph coloring algorithms for multi-core and massively multithreaded architectures
We explore the interplay between architectures and algorithm design in the context of
shared-memory platforms and a specific graph problem of central importance in scientific …
shared-memory platforms and a specific graph problem of central importance in scientific …
Analysing the behaviour of distributed software architectures: a case study
A software architecture is the overall structure of a system in terms of its constituent
components and their interconnections. We describe work to associate behavioural …
components and their interconnections. We describe work to associate behavioural …
Approximate weighted matching on emerging manycore and multithreaded architectures
Graph matching is a prototypical combinatorial problem with many applications in high-
performance scientific computing. Optimal algorithms for computing matchings are …
performance scientific computing. Optimal algorithms for computing matchings are …
A survey of high-performance computing approaches in power systems
SK Khaitan - 2016 IEEE Power and Energy Society General …, 2016 - ieeexplore.ieee.org
As the size of power systems increases, conventional serial-execution based computing
platforms are proving to be insufficient to fulfil the computational demands of modern power …
platforms are proving to be insufficient to fulfil the computational demands of modern power …
Task Level Parallelization of All Pair Shortest Path Algorithm in OpenMP 3.0
E Albalwi, P Thulasiraman… - … Conference on Advances …, 2013 - atlantis-press.com
OpenMP is a standard parallel programming lan-guage to develop parallel applications on
shared memory ma-chines. OpenMP is very suitable for designing parallel algorithms for …
shared memory ma-chines. OpenMP is very suitable for designing parallel algorithms for …