All Stories

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