About Thomas Heller

Thomas is a researcher at the Friedrich-Alexander University in Erlangen. He works at the Computer Science Chair for Computer Architecture. His research deals with mapping an abstract formulation of a algorithms developed with the help of a C++ EDSL onto any given heterogeneous multi- and many-core architectures achieving optimal performance.

The STE||AR Group accepted as GSoC mentor organization!

We are very pleased to announce that our application to the Google Summer of Code 2014 was successful and that we were selected as a mentor organization!

We are looking forward to an exciting summer with awesome contributions from students from all around the world. Be sure to check our ideas page and talk about possible proposals today!

For more information about the Google Summer of Code program visit the website here.

GD Star Rating
loading...

The STE||AR Group is applying for GSoC 2014

Quote

“Provide students the opportunity to do work related to their academic pursuits (think “flip bits, not burgers”)” — What are the goals of GSoC?

Google Summer of Code 2014 is a unique program with the goal to fund Open Source Projects and give Students a possibility to gain real world programming experience with a small bonus of $5000!

The STE||AR group decided to apply again as a mentoring organization this year (after being denied last year 🙁 ). All interested students are welcome to submit proposals. For a list of ideas you can visit our GSoC 2014 Project Ideas wiki page. Find your match and discuss your ideas with us now!

GD Star Rating
loading...

A Scalable Backend for True MMORPGs – HPX at GTC

Currently the GPU Technology conference is ongoing. Together with the HPX Backend for LibGeoDecomp Andreas Schäfer submitted a poster about a scalable MMORPG design which eventually will use HPX to make it scale. The title of the poster is A Scalable Backend for True MMORPGs.

Also, don’t miss Andreas’ talk S3299 – From Notebooks to Supercomputers: Tap the Full Potential of Your CUDA Resources with LibGeoDecomp on thursday in room 211A form 16:00 to 16:25 if you happen to attend the conference.

GD Star Rating
loading...

Solving Combination Puzzles – An example HPX application – Part 1

HPX is great for developing applications that run both in a shared memory and distributed memory environment. This is accomplished by leveraging the Active Global Address Space (AGAS). By creating components in AGAS we gain the ability to seamlessly write parallel object oriented applications without the need to manually care about passing messages to different localities of explicitly creating threads. While this idea sounds great it is difficult to think about an implementation which achieves exactly that. As such this blog post is trying to walk you through the development of a recursive back tracking brute force solver for combination puzzles and you will discover that recursion allows us in general to exploit parallelism.

This is the first post in a series. This article series will walk you through the complete lifecycle of an HPX application. From the first basic idea, which is covered in this post to a full fledged HPX application exploiting the unique features of HPX to write programs with a unified semantic for local and possibly remote access to objects. The idea to develop such an application was given by Andreas Schäfer who challenged me to beat his MPI implementation. We’ll see how we fared in the last post of this series.

Continue reading

GD Star Rating
loading...

HPX on Android!

It’s been a while since the last post on this blog representing new development in the HPX world. We are not dead and are still working on providing a new and unique experience to the world of parallel computing! One of our latest efforts was to bring HPX to Android devices. Android is an exciting platform which grew very popular recently.

Continue reading

GD Star Rating
loading...

HPX vs. OpenMP: Gauss-Seidel Method

[latexpage]

NOTE: This article does not represent the whole truth. Actually OpenMP is better, not all relevant things have been exploited. There will be an updated article as soon as possible!

Many problems can be reduced, or reformulated as such that the solution is equivalent to solving a linear system of equations (LSE) in the form of:

$Ax = b$ where $A \in \mathbb{R}^{NxN}$ and $x, b \in \mathbb{R}^{N}$.

There exist a big variety of algorithms to solve these equations. This post will lay out a possible parallel implementation using HPX and OpenMP of the Gauss-Seidel method. Continue reading

GD Star Rating
loading...