- J. Parallel Distrib. Comput. 66 (2006) 13661378 www.elsevier.com/locate/jpdc
- Practical Parallel Algorithms for Dynamic Data Redistribution, Median Finding, and Selection
- Parallel Algorithms for Image Enhancement and Segmentation by Region Growing with an Experimental Study
- Parallel Algorithms for Image Enhancement and Segmentation by Region Growing with an Experimental
- Designing Multithreaded Algorithms for Breadth-First Search and st-connectivity on the Cray MTA-2
- Parallel Algorithms for Personalized Communication and Sorting With an Experimental Study
- Understanding the Design Trade-offs among Current Multicore Systems
- 417MEASURING HPC PRODUCTIVITY A FRAMEWORK FOR MEASURING
- Dynamic Load Balancing in Distributed Systems in the Presence of Delays
- Evaluating Arithmetic Expressions using Tree Contraction: A Fast and Scalable Parallel
- int. j. remote sensing, 2000, vol. 21, no. 6 & 7, 15131536 High performance computing algorithms for land cover dynamics
- A Parallel State Assignment Algorithm for Finite State Machines
- Simulating Individual-Based Models of Epidemics in Hierarchical Networks
- 978-1-4244-1694-3/08/$25.00 2008 IEEE DOSA: Design Optimizer for Scientific Applications
- GTfold: A Scalable Multicore Code for RNA Secondary Structure Prediction
- BioSPLASH: A sample workload for bioinformatics and computational biology for optimizing next-generation
- Workshop on Enabling Petascale Science and Engineering
- An Empirical Analysis of Parallel Random Permutation Algorithms on Guojing Cong David A. Bader
- SIMPLE : A Methodology for Programming High Performance Algorithms on
- ExactMP: An Efficient Parallel Exact Solver for Phylogenetic Tree Reconstruction Using Maximum Parsimony
- Practical Parallel Algorithms for Dynamic Data Redistribution, Median Finding, and Selection
- Performance analysis of parallel programs via message-passing graph traversal
- 978-1-4244-1694-3/08/$25.00 2008 IEEE SNAP, Small-world Network Analysis and Partitioning: an open-source parallel
- Evaluating Arithmetic Expressions Using Tree Contraction
- 34 November 2004/Vol. 47, No. 11 COMMUNICATIONS OF THE ACM Computational biology has been revolutionized
- Fast character optimization in parsimony phylogeny reconstruction
- A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations
- A Linear-Time Algorithm for Computing Inversion Distance Between Signed Permutations with an
- Massive Social Network Analysis: Mining Twitter for Social Good
- Large Scale Complex Network Analysis using the Hybrid Combination of
- Compact Graph Representations and Parallel Connectivity Algorithms for Massive Dynamic Network Analysis
- A Faster Parallel Algorithm and Efficient Multithreaded Implementations for Evaluating Betweenness Centrality on Massive Datasets
- Author's personal copy High performance combinatorial algorithm
- On the Design and Analysis of Irregular Algorithms on the Cell Processor: A Case Study of List Ranking
- A Fast, Parallel Spanning Tree Algorithm for Symmetric Multiprocessors (SMPs) (Extended Abstract)
- Using PRAM Algorithms on a Uniform-Memory-Access Shared-Memory Architecture
- J. Parallel Distrib. Comput. 64 (2004) 10511059 www.elsevier.com/locate/jpdc
- {[A,B],[D]} {[E],[G,H]}
- High Performance Computing Algorithms for Land Cover Dynamics Using Remote Sensing Data
- Practical Parallel Algorithms for Personalized Communication and Integer Sorting
- A Randomized Parallel Sorting Algorithm With an Experimental Study
- SIMPLE: A Methodology for Programming High Performance Algorithms on
- Kronos: A Java-Based Software System for the Processing and Retrieval of Large Scale
- JOURNAL OF COMPUTATIONAL BIOLOGY Volume 8, Number 5, 2001
- High-Performance Algorithm Engineering for Computational Phylogenetics
- An Improved Randomized Selection Algorithm With an Experimental Study
- Algorithm Engineering for Parallel Computation David A. Bader1, Bernard M.E. Moret1, and Peter Sanders2
- 1. Algorithm Engineering for Parallel Computation
- BioPerf: A Benchmark Suite to Evaluate High-Performance Computer Architecture on Bioinformatics Applications
- Myrinet Switch 1 Myrinet Switch 2 Myrinet Switch 3Myrinet Switch 4
- Using PRAM Algorithms on a Uniform-Memory-Access Shared-Memory
- The Euler Tour Technique and Parallel Rooted Spanning Tree Guojing Cong, David A. Bader
- A Novel FDTD Application Featuring OpenMP-MPI Hybrid Parallelization Mehmet F. Su
- SWARM: A Parallel Programming Framework for Multicore Processors David A. Bader, Varun Kanade and Kamesh Madduri
- FFTC: Fastest Fourier Transform for the IBM Cell Broadband Engine
- Fast Shared-Memory Algorithms for Computing the Minimum Spanning Forest of Sparse Graphs (Extended Abstract)
- Lock-Free Parallel Algorithms: An Experimental Study Guojing Cong and David Bader
- An Experimental Study of a Parallel Shortest Path Algorithm for Solving Large-Scale Graph Instances
- Approximating Betweenness Centrality David A. Bader, Shiva Kintali, Kamesh Madduri, and Milena Mihail
- J. Parallel Distrib. Comput. 67 (2007) 10071017 www.elsevier.com/locate/jpdc
- images [2, 9, 11, 12, 15, 17, 18, 20, 33]. The task of connected component labeling is cited as an important object recogni-
- On the Design of Fast Pseudo-Random Number Generators for the Cell Broadband Engine and an Application to Risk Analysis
- A Graph-Theoretic Analysis of the Human Protein-Interaction Network Using Multicore Parallel Algorithms
- Design and Implementation of the HPCS Graph Analysis Benchmark
- Advanced Shortest Paths Algorithms on a Massively-Multithreaded Architecture Joseph R. Crobak1
- A New Deterministic Parallel Sorting Algorithm With an Experimental Evaluation
- Massive Streaming Data Analytics: A Case Study with Clustering Coefficients
- A New Parallel Algorithm for Planarity Testing David A. Bader
- Scalable Graph Exploration on Multicore Processors Virat Agarwal1
- A Parallel State Assignment Algorithm for Finite State Machines
- Parallel Algorithms for Image Histogramming and Connected Components with an Experimental Study
- High-Performance Algorithm Engineering for Large-Scale Graph Problems and Computational
- Scalable Data Parallel Algorithms for Texture Synthesis using Gibbs Random David A. Bader Joseph J aJ ay Rama Chellappaz
- Broadcast on Clusters of SMPs with Optimal Concurrency
- A Randomized Parallel Sorting Algorithm With an Experimental Study
- Computing discrete transforms on the Cell Broadband Engine David A. Bader *, Virat Agarwal, Seunghwa Kang
- COMPUTING APPLICATIONS APPLICATIONS
- Noname manuscript No. (will be inserted by the editor)
- 978-1-4244-1694-3/08/$25.00 2008 IEEE High Performance MPEG-2 Software Decoder on the Cell Broadband Engine
- A Prediction based CMP Cache Migration Policy , Zhihui Du1+
- J. Parallel Distrib. Comput. 65 (2005) 9941006 www.elsevier.com/locate/jpdc
- The Journal of Supercomputing, 22, 99111, 2002 2002 Kluwer Academic Publishers. Manufactured in The Netherlands.
- J. Parallel Distrib. Comput. 66 (2006) 854866 www.elsevier.com/locate/jpdc
- journal of parallel and distributed computing 52, 1 23 (1998) A Randomized Parallel Sorting Algorithm with
- A Novel FDTD Application Featuring OpenMP-MPI Hybrid Parallelization
- A New Implementation and Detailed Study of Breakpoint Analysis Bernard M.E. Moret Stacia Wyman
- IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS--I: FUNDAMENTAL THEORY AND APPLICATIONS, VOL. 49, NO. 4, APRIL 2002 543 Generalized Block Shift Network for Clusters
- A FRAMEWORK FOR MEASURING SUPERCOMPUTER PRODUCTIVITY1
- PARALLEL ALGORITHM DESIGN FOR BRANCH AND BOUND
- Design and Implementation of the HPCS Graph Analysis Benchmark
- Lock-free Parallel Algorithms: An Experimental Study Guojing Cong, David Bader
- DOI 10.1007/s00450-009-0093-5 SPECIAL ISSUE P APER
- Parallel Algorithms for Evaluating Centrality Indices in Real-world Networks David A. Bader Kamesh Madduri
- An Experimental Study of Parallel Biconnected Components Algorithms on Symmetric Multiprocessors
- Fast Shared-Memory Algorithms for Computing the Minimum Spanning Forest of Sparse Graphs (Extended Abstract)
- The Euler Tour Technique and Parallel Rooted Spanning Tree Guojing Cong, David A. Bader
- An Experimental Study of Parallel Biconnected Components Algorithms on Symmetric Multiprocessors (SMPs)
- Journal of Parallel and Distributed Computing 58, 92 108 (1999) SIMPLE: A Methodology for Programming High
- A Fast, Parallel Spanning Tree Algorithm for Symmetric Multiprocessors (SMPs) (Extended Abstract)
- 978-1-4244-1694-3/08/$25.00 2008 IEEE Financial Modeling on the Cell Broadband Engine
- Parallel Algorithms for Personalized Communication and Sorting With an Experimental Study
- GPUMemSort: A High Performance Graphic Co-processors Sorting Algorithm for Large Scale In-Memory Data
- On the Architectural Requirements for Efficient Execution of Graph Algorithms David A. Bader
- DOSA: Design Optimizer for Scientific Applications David A. Bader1
- Techniques for Designing Efficient Parallel Graph Algorithms for SMPs and Multicore Processors
- Generalizing k-Betweenness Centrality Using Short Paths and a Parallel Multithreaded Implementation
- A Comparison of the Performance of List Ranking and Connected Components Algorithms on SMP and MTA
- Scalable Data Parallel Algorithms for Texture Synthesis and Compression using Gibbs Random
- Broadcast on Clusters of SMPs with Optimal Concurrency
- Design and Implementation of the HPCS Graph Analysis Benchmark on Symmetric Multiprocessors
- Incorporating life sciences applications in the architectural optimizations of next-generation petaflop-system
- An Efficient Transactional Memory Algorithm for Computing Minimum Spanning Forest of Sparse Graphs
- HIGH-PERFORMANCE ALGORITHMS AND APPLICATIONS FOR SMP CLUSTERS David A. Bader1
- Optimizing JPEG2000 Still Image Encoding on the Cell Broadband Engine
- A Cache-Aware Parallel Implementation of the Push-Relabel Network Flow Algorithm and Experimental Evaluation of the Gap Relabeling
- A New Deterministic Parallel Sorting Algorithm With an Experimental Evaluation
- A Linear-Time Algorithm for Computing Inversion Distance Between Signed Permutations with an
- PRESENTED AT THE FIRST IEEE COMPUTER SOCIETY INTERNATIONAL WORKSHOP ON CLUSTER COMPUTING (IWCC99), MELBOURNE, AUSTRALIA,
- A Tile-based Parallel Viterbi Algorithm for Biological Sequence Alignment on GPU with CUDA
- GGeeoorrggiiaa IInnssttiittuuttee ooff TTeecchhnnoollooggyy College of Computing
- David A. Badera, Bernard M.E. Moretb, and Lisa Vawterc aElectrical and Computer Engineering Department,
- Parallel Shortest Path Algorithms for Solving Large-Scale Instances
