Engineering a Distributed-Memory Triangle Counting Algorithm

Counting triangles in a graph and incident to each vertex is a fundamental and frequently considered task of graph analysis. We consider how to efficiently do this for huge graphs using massively parallel distributed-memory machines. Unsurprisingly, the main issue is to reduce communication between processors. We achieve this by counting locally whenever possible and reducing the amount of information that needs to be sent in order to handle (possible) nonlocal triangles. We also achieve linear memory requirements despite superlinear communication volume by introducing a new asynchronous sparse-all-to-all operation. Furthermore, we dramatically reduce startup overheads by allowing this communication to use indirect routing. Our algorithms scale (at least) up to 32 768 cores and are up to 18 times faster than the previous state of the art.Comment: 11 pages, 8 figures, to be published in 2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS), St. Petersburg, FL, USA, pp. 702-71

Faster and better nested dissection orders for Customizable Contraction Hierarchies

Graph partitioning has many applications. We consider the acceleration of shortest path queries in road networks using Customizable Contraction Hierarchies (CCH). It is based on computing a nested dissection order by recursively dividing the road network into parts. Recently, with FlowCutter and Inertial Flow, two flow-based graph bipartitioning algorithms have been proposed for road networks. While FlowCutter achieves high-quality results and thus fast query times, it is rather slow. Inertial Flow is particularly fast due to the use of geographical information while still achieving decent query times. We combine the techniques of both algorithms to achieve more than six times faster preprocessing times than FlowCutter and even faster queries on the Europe road network. We show that, using 16 cores of a shared-memory machine, this preprocessing needs four minutes

Faster and Better Nested Dissection Orders for Customizable Contraction Hierarchies

Graph partitioning has many applications. We consider the acceleration of shortest path queries in road networks using Customizable Contraction Hierarchies (CCH). It is based on computing a nested dissection order by recursively dividing the road network into parts. Recently, with FlowCutter and Inertial Flow, two flow-based graph bipartitioning algorithms have been proposed for road networks. While FlowCutter achieves high-quality results and thus fast query times, it is rather slow. Inertial Flow is particularly fast due to the use of geographical information while still achieving decent query times. We combine the techniques of both algorithms to achieve more than six times faster preprocessing times than FlowCutter and even faster queries on the Europe road network. We show that, using 16 cores of a shared-memory machine, this preprocessing needs four minutes

Pancreatic surgery outcomes: multicentre prospective snapshot study in 67 countries

Background: Pancreatic surgery remains associated with high morbidity rates. Although postoperative mortality appears to have improved with specialization, the outcomes reported in the literature reflect the activity of highly specialized centres. The aim of this study was to evaluate the outcomes following pancreatic surgery worldwide.Methods: This was an international, prospective, multicentre, cross-sectional snapshot study of consecutive patients undergoing pancreatic operations worldwide in a 3-month interval in 2021. The primary outcome was postoperative mortality within 90 days of surgery. Multivariable logistic regression was used to explore relationships with Human Development Index (HDI) and other parameters.Results: A total of 4223 patients from 67 countries were analysed. A complication of any severity was detected in 68.7 percent of patients (2901 of 4223). Major complication rates (Clavien-Dindo grade at least IIIa) were 24, 18, and 27 percent, and mortality rates were 10, 5, and 5 per cent in low-to-middle-, high-, and very high-HDI countries respectively. The 90-day postoperative mortality rate was 5.4 per cent (229 of 4223) overall, but was significantly higher in the low-to-middle-HDI group (adjusted OR 2.88, 95 per cent c.i. 1.80 to 4.48). The overall failure-to-rescue rate was 21 percent; however, it was 41 per cent in low-to-middle-compared with 19 per cent in very high-HDI countries.Conclusion: Excess mortality in low-to-middle-HDI countries could be attributable to failure to rescue of patients from severe complications. The authors call for a collaborative response from international and regional associations of pancreatic surgeons to address management related to death from postoperative complications to tackle the global disparities in the outcomes of pancreatic surgery (NCT04652271; ISRCTN95140761)