Yakov Nekrich visiting

Yakov Nekrich will be visiting in the week before Xmas and giving a talk on „Dynamic Point Location in External Memory“ (SoCG 2019).

2019-12-05 11:29

Beale-Orchard-Hays Prize at ISMP 2018

The Beale–Orchard-Hays Prize 2018 has been awarded to Liuqin Yang, Defeng Sun, and Kim-Chuan Toh for their paper on SDPNAL+, which describes a new method for semidefinite programming with nonnegative constraints (Mathematical Programming Computation 2015). The prize, which is awarded for excellence in computational mathematical programming has been presented at the 23rd International Symposium for Mathematical Programming (ISMP) in Bordeaux in July 2018.

The prize committee 2018 Tobias Achterberg, Michael Grant (chair), Jeffrey Linderoth, Petra Mutzel, and Ted Ralphs selected the winners from several worthy nominations. Every three years the Beale–Orchard-Hays Prize will be considered; it is awarded by the Mathematical Optimization Society.

2018-07-09 21:21

Timo Bingmann visiting

Timo Bingmann from KIT will be visiting from October 10 to October 11 and give a talk on “Thrill: High-Performance Algorithmic Distributed Batch Data Processing with C++” in OH14 R202 on October 10 at 14:00.

Abstract - We present on-going work on a new distributed Big Data processing framework called Thrill. It is a C++ framework consisting of a set of basic scalable algorithmic primitives like mapping, reducing, sorting, merging, joining, and additional MPI-like collectives. This set of primitives goes beyond traditional Map/Reduce and can be combined into larger more complex algorithms, such as WordCount, PageRank, k-means clustering, and suffix sorting. These complex algorithms can then be run on very large inputs using a distributed computing cluster. Among the main design goals of Thrill is to lose very little performance when composing primitives such that small data types are well supported. Thrill thus raises the questions of a) how to design algorithms using the scalable primitives, b) whether additional primitives should be added, and c) if one can improve the existing ones using new ideas to reduce communication volume and how they can be scaled to very large cluster sizes.

2018-10-02 13:02
Last modified: 2015-09-08 15:53 (external edit)