Take the 2-minute tour ×  This is going to be a long story, but
maybe some of you would like to study this case.  I am working
on parallel graph algorithm development. I've chosen a cutting-
edge, HPC parallel graph data structure named STINGER. STINGER's
mission statement reads:  "STINGER should provide a common
abstract data structure such that the large graph community can
quickly leverage each others' research developments.
[...] Algorithms written for STINGER can easily be
translated/ported between multiple languages and frameworks
[...] It is recognized that no single data structure is optimal
for every graph algorithm. The objective of STINGER is to
configure a sensible data structure that can run most algorithms
well. There should be no significant performance reduction for
using STINGER when compared with another general data structure
across a broad set of typical graph algorithms."  STINGER is
probably rather efficient and suitable for shared-memory
parallelism. On the other hand, it is not very abs