All Stories

  1. Tunnel: Parallel-inducing sort for large string analytics
  2. Anomaly Detection in Catalog Streams
  3. Parallel Suffix Sorting for Large String Analytics
  4. Parallel Triangles and Squares Count for Multigraphs Using Vertex Covers
  5. Scalable Katz Ranking Computation in Large Static and Dynamic Graphs
  6. Interactive Graph Stream Analytics in Arkouda
  7. Linux and Supercomputing: How My Passion for Building COTS Systems Led to an HPC Revolution
  8. Accelerating and Expanding End-to-End Data Science Workflows with DL/ML Interoperability Using RAPIDS
  9. Traversing large graphs on GPUs with unified memory
  10. Tailoring parallel alternating criteria search for domain specific MIPs: Application to maritime inventory routing
  11. Skip the Intersection: Quickly Counting Common Neighbors on Shared-Memory Systems
  12. Editorial from the Editor-in-Chief
  13. High-Performance Phylogenetic Inference
  14. Fast and Adaptive List Intersections on the GPU
  15. Hornet: An Efficient Data Structure for Dynamic Sparse Graphs and Matrices on GPUs
  16. Logarithmic Radix Binning and Vectorized Triangle Counting
  17. Accelerating GPU betweenness centrality
  18. Massive-scale Streaming Analytics
  19. Introduction to HiCOMB 2018
  20. Numerically approximating centrality for graph ranking guarantees
  21. Incrementally updating Katz centrality in dynamic graphs
  22. Benchmarking for Graph Clustering and Partitioning
  23. Approximating Personalized Katz Centrality in Dynamic Graphs
  24. Editor's Note
  25. Exact and Parallel Triangle Counting in Dynamic Graphs
  26. Ranking in Dynamic Graphs Using Exponential Centrality
  27. Designing and implementing a heuristic cross-architecture combination for graph traversal
  28. Design and implementation of parallel PageRank on multicore platforms
  29. Quickly finding a truss in a haystack
  30. Local Community Detection in Dynamic Graphs Using Personalized Centrality
  31. Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs
  32. A Dynamic Algorithm for Updating Katz Centrality in Graphs
  33. Streaming Graph Sampling with Size Restrictions
  34. Introduction to EMBRACE Workshop
  35. When Good Enough Is Better: Energy-Aware Scheduling for Multicore Servers
  36. Spectral partitioning with blends of eigenvectors
  37. Modeling the Power Variability of Core Speed Scaling on Homogeneous Multicore Systems
  38. A parallel local search framework for the Fixed-Charge Multicommodity Network Flow problem
  39. Editor's Note
  40. Graph Ranking Guarantees for Numerical Approximations to Katz Centrality
  41. Mathematical foundations of the GraphBLAS
  42. cuSTINGER: Supporting dynamic graph algorithms for GPUs
  43. Tracking local communities in streaming graphs with a dynamic algorithm
  44. A local measure of community change in dynamic graphs
  45. Aging data in dynamic graphs: A comparative study
  46. Evolving MPI+X Toward Exascale
  47. New stopping criteria for spectral partitioning
  48. HPC node performance and energy modeling with the co-location of applications
  49. A Memory and Time Scalable Parallelization of the Reptile Error-Correction Code
  50. GABB 2016 Keynote
  51. HiCOMB Introduction and Committees
  52. Attaining High Performance Communications
  53. A New Parallel Method for Binary Black Hole Simulations
  54. Editor's note
  55. Engineering Algorithms for Computational Biology
  56. High Performance Algorithm Engineering for Large-Scale Problems
  57. Sorting Signed Permutations by Reversal (Reversal Distance)
  58. Fast Incremental Community Detection on Dynamic Graphs
  59. Fast Execution of Simultaneous Breadth-First Searches on Sparse Graphs
  60. WEC: Improving Durability of SSD Cache Drives by Caching Write-Efficient Data
  61. Parallel Methods for Verifying the Consistency of Weakly-Ordered Architectures
  62. A fast, energy-efficient abstraction for simultaneous breadth-first searches
  63. A Dynamic Algorithm for Local Community Detection in Graphs
  64. Exemplar or matching: modeling DCJ problems with unequal content genome data
  65. Behavioral clusters in dynamic graphs
  66. State of the Journal
  67. A Methodology for Co-Location Aware Application Performance Modeling in Multicore Computing
  68. HiCOMB Introduction and Committees
  69. ParLearning Keynotes
  70. Introduction to Special Issue ALENEX'12
  71. Editor's note
  72. Graphs, Matrices, and the GraphBLAS: Seven Good Reasons
  73. Scalable and High Performance Betweenness Centrality on the GPU
  74. Designing a Heuristic Cross-Architecture Combination for Breadth-First Search
  75. Optimizing energy consumption and parallel performance for static and dynamic betweenness centrality using GPUs
  76. GABB Introduction
  77. HiCOMB Introduction and Committees
  78. Message from the Program Chair
  79. Revisiting Edge and Node Parallelism for Dynamic GPU Graph Analytics
  80. A performance evaluation of open source graph databases
  81. Load balanced clustering coefficients
  82. A Lin-Kernighan Heuristic for the DCJ Median Problem of Genomes with Unequal Contents
  83. Benchmarking for Graph Clustering and Partitioning
  84. State of the Journal
  85. Measuring the Sensitivity of Graph Metrics to Missing Data
  86. Multicore Computing
  87. A new parallel algorithm for connected components in dynamic graphs
  88. GraphCT: Multithreaded Algorithms for Massive Graph Analysis
  89. Faster Clustering Coefficient Using Vertex Covers
  90. Standards for graph algorithm primitives
  91. A statistical framework for streaming graph analysis
  92. Detecting insider threats in a real corporate database of computer usage activity
  93. Designing Hybrid Architectures for Massive-Scale Graph Analysis
  94. Energy-Efficient Scheduling for Best-Effort Interactive Services to Achieve High Response Quality
  95. HiCOMB Introduction
  96. Investigating Graph Algorithms in the BSP Model on the Cray XMT
  97. Multithreaded Community Monitoring for Massive Streaming Graph Data
  98. PASQUAL: Parallel Techniques for Next Generation Genome Sequence Assembly
  99. Massive streaming data analytics
  100. Faster Betweenness Centrality Based on Data Structure Experimentation
  101. Graph Partitioning and Graph Clustering
  102. Parallel community detection for massive graphs
  103. Streaming Breakpoint Graph Analytics for Accelerating and Parallelizing the Computation of DCJ Median of Three Genomes
  104. Task-based parallel breadth-first search in heterogeneous environments
  105. MuCoCoS 2012: 5th International Workshop on Multi-Core Computing Systems Focus: Performance Portability and Tuning
  106. Efficient Data Migration to Conserve Energy in Streaming Media Storage Systems
  107. Message from GreenCom 2012 Program Co-chairs
  108. Enhancing Cache Coherent Architectures with access patterns for embedded manycore systems
  109. A Fast Algorithm for Streaming Betweenness Centrality
  110. STINGER: High performance data structure for streaming graphs
  111. GTfold: Enabling parallel RNA secondary structure prediction on multi-core desktops
  112. ACM journal on experimental algorithmics special issue on multicore algorithms
  113. GPU merge path
  114. HCW 2012 Keynote Talk: Analyzing massive data using heterogeneous computing
  115. HiCOMB Introduction
  116. Scalable Multi-threaded Community Detection in Social Networks
  117. Analysis of streaming social networks and graphs on multicore architectures
  118. Combinatorial Scientific Computing
  119. 2012 Proceedings of the Fourteenth Workshop on Algorithm Engineering and Experiments (ALENEX)
  120. Parallel Community Detection for Massive Graphs
  121. Algorithm Engineering Challenges in Multicore and Manycore Systems
  122. Rec-DCM-Eigen: Reconstructing a Less Parsimonious but More Accurate Tree in Shorter Time
  123. A Waterfall Model to Achieve Energy Efficient Tasks Mapping for Large Scale GPU Clusters
  124. HiCOMB Introduction
  125. Message from the 25th Year Planning Chair
  126. Tracking Structure of Streaming Social Networks
  127. 16. Fundamental Questions in the Analysis of Large Graphs
  128. Graph Algorithms
  129. Guest Editor's Introduction: Special Issue on High-Performance Computing with Accelerators
  130. Hybrid Programming With SIMPLE
  131. 12. Large-Scale Network Analysis
  132. SWARM: A Parallel Programming Framework for Multicore Processors
  133. SEECN: SIMULATING COMPLEX SYSTEMS USING DYNAMIC COMPLEX NETWORKS
  134. Spanning Tree, Minimum Weight
  135. Scientific Computing with Multicore and Accelerators
  136. On accelerating iterative algorithms with CUDA: A case study on Conditional Random Fields training algorithm for biological sequence alignment
  137. GPUMemSort: A High Performance Graphic Co-processors Sorting Algorithm for Large Scale In-Memory Data
  138. Scalable Graph Exploration on Multicore Processors
  139. Massive Social Network Analysis: Mining Twitter for Social Good
  140. Evaluating Cell/B.E software cache for ClustalW
  141. A tile-based parallel Viterbi algorithm for biological sequence alignment on GPU with CUDA
  142. Message from the workshop chairs
  143. Large scale complex network analysis using the hybrid combination of a MapReduce cluster and a highly multithreaded system
  144. Massive streaming data analytics: A case study with clustering coefficients
  145. The 19th heterogeneity in Computing Workshop (HCW 2010)
  146. Analyzing Massive Social Networks Using Multicore and Multithreaded Architectures
  147. Message from general chair
  148. A Partition-Merge Based Cache-Conscious Parallel Sorting Algorithm for CMP with Shared Cache
  149. Generalizing k-Betweenness Centrality Using Short Paths and a Parallel Multithreaded Implementation
  150. Parallel shortest path algorithms for solving large-scale instances
  151. Faster FAST: multicore acceleration of streaming financial data
  152. A faster parallel algorithm and efficient multithreaded implementations for evaluating betweenness centrality on massive datasets
  153. Compact graph representations and parallel connectivity algorithms for massive dynamic network analysis
  154. Message from the workshop chairs
  155. Understanding the design trade-offs among current multicore systems for numerical computations
  156. GTfold
  157. Computing discrete transforms on the Cell Broadband Engine
  158. A Faster Parallel Algorithm and Efficient Multithreaded Implementations for Evaluating Betweenness Centrality on Massive Datasets
  159. An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs
  160. The 18th Heterogeneity in Computing Workshop (HCW 2009)
  161. A graph-theoretic analysis of the human protein-interaction network using multicore parallel algorithms
  162. High-performance computational biology
  163. A Prediction Based CMP Cache Migration Policy
  164. On the Design of Fast Pseudo-Random Number Generators for the Cell Broadband Engine and an Application to Risk Analysis
  165. Optimizing JPEG2000 Still Image Encoding on the Cell Broadband Engine
  166. 7th IEEE International Workshop on High Performance Computational Biology HiCOMB 2008
  167. Engineering Algorithms for Computational Biology
  168. High Performance Algorithm Engineering for Large-scale Problems
  169. Sorting Signed Permutations by Reversal (Reversal Distance)
  170. Workshop 20 introduction: Workshop on multithreaded architectures and applications - MTAAP’08
  171. Petascale Computing
  172. Handbook of Parallel Computing
  173. High performance combinatorial algorithm design on the Cell Broadband Engine processor
  174. Lecture on Progress toward Petascale Applications in Bioinformatics and Computational Biology
  175. On the design of high-performance algorithms for aligning multiple protein sequences on mesh-based multiprocessor architectures
  176. Dynamic Load Balancing in Distributed Systems in the Presence of Delays: A Regeneration-Theory Approach
  177. An Experimental Study of a Parallel Shortest Path Algorithm for Solving Large-Scale Graph Instances
  178. A Graph-Theoretic Analysis of the Human Protein-Interaction Network Using Multicore Parallel Algorithms
  179. Advanced Shortest Paths Algorithms on a Massively-Multithreaded Architecture
  180. DOSA: Design Optimizer for Scientific Applications
  181. SWARM: A Parallel Programming Framework for Multicore Processors
  182. Symposium Evening Tutorial: High-performance Computing Methods for Computational Genomics
  183. M11---High-performance computing methods for computational genomics
  184. 19. Parallel Computational Biology
  185. Performance analysis of parallel programs via message-passing graph traversal
  186. Handbook of Computational Molecular Biology
  187. A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs)
  188. High-Performance Phylogeny Reconstruction Under Maximum Parsimony
  189. High Performance Computing – HiPC 2005
  190. Message from the General Co-Chairs
  191. Computational biology and high-performance computing
  192. Special Issue: High Performance Computational Biology
  193. A novel FDTD application featuring OpenMP-MPI hybrid parallelization
  194. Guest Editor's Introduction: Special issue on high-performance computational biology
  195. Generalized block shift network for clusters
  196. Algorithm Engineering for Parallel Computation
  197. Evaluating Arithmetic Expressions Using Tree Contraction: A Fast and Scalable Parallel Implementation for Symmetric Multiprocessors (SMPs)
  198. A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study
  199. <title>Industrial applications of high-performance computing for phylogeny reconstruction</title>
  200. Applications
  201. A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study
  202. High-Performance Algorithmic Engineering for Computationa Phylogenetics
  203. Using PRAM Algorithms on a Uniform-Memory-Access Shared-Memory Architecture
  204. High performance computing algorithms for land cover dynamics using remote sensing data
  205. Simple: A Methodology for Programming High Performance Algorithms on Clusters of Symmetric Multiprocessors (SMPs)
  206. Design and analysis of the Alliance/University of New Mexico Roadrunner Linux SMP SuperCluster
  207. A new deterministic parallel sorting algorithm with an experimental evaluation
  208. A Randomized Parallel Sorting Algorithm with an Experimental Study
  209. Parallel Algorithms for Image Histogramming and Connected Components with an Experimental Study
  210. Parallel algorithms for personalized communication and sorting with an experimental study (extended abstract)
  211. Parallel algorithms for image enhancement and segmentation by region growing, with an experimental study
  212. Practical parallel algorithms for personalized communication and integer sorting
  213. Parallel algorithms for image histogramming and connected components with an experimental study (extended abstract)
  214. Scalable data parallel algorithms for texture synthesis using Gibbs random fields
  215. Approximating Betweenness Centrality
  216. FFTC: Fastest Fourier Transform for the IBM Cell Broadband Engine
  217. Petascale Computing for Large-Scale Graph Problems
  218. Designing Multithreaded Algorithms for Breadth-First Search and st-connectivity on the Cray MTA-2
  219. ExactMP: An Efficient Parallel Exact Solver for Phylogenetic Tree Reconstruction Using Maximum Parsimony
  220. An Experimental Study of Parallel Biconnected Components Algorithms on Symmetric Multiprocessors (SMPs)
  221. Incorporating life sciences applications in the architectural optimizations of next-generation petaflop-system
  222. On the Architectural Requirements for Efficient Execution of Graph Algorithms
  223. Parallel Algorithm Design for Branch and Bound
  224. A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs)(extended abstract )
  225. Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs (extended abstract )
  226. A hierarchical data archiving and processing system to generate custom tailored products from AVHRR data
  227. Parallel algorithms for image enhancement and segmentation by region growing with an experimental study
  228. Practical parallel algorithms for dynamic data redistribution, median finding, and selection