Skyfire: Data-driven seed generation for fuzzing

J Wang, B Chen, L Wei, Y Liu - 2017 IEEE Symposium on …, 2017 - ieeexplore.ieee.org
Programs that take highly-structured files as inputs normally process inputs in stages: syntax
parsing, semantic checking, and application execution. Deep bugs are often hidden in the …

Utility-based cache partitioning: A low-overhead, high-performance, runtime mechanism to partition shared caches

MK Qureshi, YN Patt - 2006 39th Annual IEEE/ACM …, 2006 - ieeexplore.ieee.org
This paper investigates the problem of partitioning a shared cache between multiple
concurrently executing applications. The commonly used LRU policy implicitly partitions a …

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 …

[PDF][PDF] Communication-efficient parallel sorting (preliminary version)

MT Goodrich - Proceedings of the twenty-eighth annual ACM …, 1996 - dl.acm.org
We study the problem of sorting n numbers on a p-processor bulk-synchronous
parallel(BSP) computer, which is a parallel multicomputer that allows for general processor …

On the versatility of parallel sorting by regular sampling

X Li, P Lu, J Schaeffer, J Shillington, PS Wong, H Shi - Parallel Computing, 1993 - Elsevier
Parallel sorting algorithms have already been proposed for a variety of multiple instruction
streams, multiple data streams (MIMD) architectures. These algorithms often exploit the …

A simple, fast parallel implementation of quicksort and its performance evaluation on SUN enterprise 10000

P Tsigas, Y Zhang - … on Parallel, Distributed and Network-Based …, 2003 - ieeexplore.ieee.org
We have implemented sample sort and a parallel version of Quicksort on a cache-coherent
shared address space multiprocessor: the SUN ENTERPRISE 10000. Our computational …

Scaling graph traversal to 281 trillion edges with 40 million cores

H Cao, Y Wang, H Wang, H Lin, Z Ma, W Yin… - Proceedings of the 27th …, 2022 - dl.acm.org
Graph processing, especially high-performance graph traversal, plays a more and more
important role in data analytics. The successor of Sunway TaihuLight, New Sunway, is …

Highly scalable parallel sorting

E Solomonik, LV Kale - 2010 IEEE International Symposium on …, 2010 - ieeexplore.ieee.org
Sorting is a commonly used process with a wide breadth of applications in the high
performance computing field. Early research in parallel processing has provided us with …

From patterns to frameworks to parallel programs

S MacDonald, J Anvik, S Bromling, J Schaeffer… - Parallel Computing, 2002 - Elsevier
Object-oriented programming, design patterns, and frameworks are abstraction techniques
that have been used to reduce the complexity of sequential programming. This paper …

BSP vs MapReduce

MF Pace - Procedia Computer Science, 2012 - Elsevier
The MapReduce framework has been generating a lot of interest in a wide range of areas. It
has been widely adopted in industry and has been used to solve a number of non-trivial …