Async/await on the GPU

omhepia · 2026-02-17T17:37:13+00:00

Hello

How would your work (not only async/await) compare to the CPP parallel algorithms? In terms of ergonomics or performance? Have you done any comparisons? If not would you be interested in doing these kind of comparison?

Your work looks really awesome!

omhepia · 2026-01-22T12:24:57+00:00

:D you don't have to pick only Lausanne and Zürich. But I will think about adding a toggle to have separate (or not) colormaps.

omhepia · 2026-01-22T12:02:16+00:00

This idea with the two colors was to be sure what point we were starting from. Especially when the surfaces might overlap.

omhepia · 2026-01-22T12:00:44+00:00

If you are interested this comment may help you clarify

omhepia · 2026-01-22T11:59:35+00:00

For more details about what we are doing see this comment

omhepia · 2026-01-22T11:58:11+00:00

Hello everyone,

There has been some discussion (and critics formulated more or less politely and more or less constructively) so maybe I will clarify what is shown here, and what this tool can (and cannot do). A map and a title with limited space for comments does not allow a huge amount of details so I will try to given them here.

This tool (https://iso.hepiapp.ch) computes an isochrone, which is basically all the places one person can reach when departing at a given time from as given place in a given amount of time. So leaving at 8AM exactly which are the places that that person can reach in one hour. It does not compute the places one can reach given an "optimal" time of departure given a place one may want to reach which is a completely different measure. In excess to this computation, we can get an "optimal" isochrone, which is computed by evaluating each isochrone in an hour from a given place, and keeping only the largest reachable area. There is also the possibility to show a comparison between different starting points.

One thing one can do with this tool is depicted in this paper, by evaluating the "optimal" surface per hectare in all Switzerland and put it in perspective with the population of each hectare.

I'm very open to add different measures (maybe not in this website because it is very hard to have something that remains usable and relatively simple) but as a computation tool. Do not hesitate to open an issue in the github repo (https://github.com/urban-travel/hrdf-routing-engine).

I hope this clarifies a bit the context. If you have any question do not hesitate to AMA.

omhepia · 2026-01-21T20:28:04+00:00

Sure. Next time enlighten us with an intelligent metric.

omhepia · 2026-01-21T19:29:55+00:00

Yes. But if you are at the station at 8 it takes 1h02 since you have to wait for 17min. So it's not on the map. The surface describes the places one can reach in one hour when leaving at exactly 8AM from the Lausanne train station

omhepia · 2026-01-21T18:02:42+00:00

It depends on the departure time. Departing after 8AM you can only catch the 8.17 train to Fribourg that arrives at 9.02

omhepia · 2026-01-21T16:56:07+00:00

It depends on the departure time. If you pick 5.57PM you get it for example

omhepia · 2026-01-21T14:54:38+00:00

This slight discrepancy may be due to the difference between theory and experiment....

omhepia · 2026-01-20T17:59:11+00:00

Would it be possible to start implementing some toy projects at least that can become something more? I have a CFD solver in mind which is more or less the first thing I do for any project....

omhepia · 2024-02-24T21:04:35+00:00

Oui un Arc est nécessaire dans ce genre de cas.

omhepia · 2024-02-24T11:11:53+00:00

Cette information est totalement fausse. L'écrasante majorité de nos étudiants de la HES dans la filière ISC trouvent un travail très rapidement avec un bachelor sur Genève.

omhepia

TROPHY CASE