A. J. C. van Gemund's scientific contributions

What is this page?

This page lists the scientific contributions of an author, who either does not have a ResearchGate profile, or has not yet added these contributions to their profile.

It was automatically created by ResearchGate to create a record of this author's body of work. We create such pages to advance our goal of creating and maintaining the most comprehensive scientific repository possible. In doing so, we process publicly available (personal) data relating to the author as a member of the scientific community.

If you're a ResearchGate member, you can follow this page to keep up with this author's work.

If you are this author, and you don't want us to display this page anymore, please let us know.

Publications (1)

On the loss of parallelism by imposing synchronization structure
  • Article

January 2003

·

26 Reads

·

4 Citations

·

·

A. J. C. van Gemund

Recently a new parallel programming model has been presented that imposes synchronization restrictions in order to allow for fully automatic, retargetable program optimization. The motivation for the model is the conjecture that in practice the loss of parallelism due to the inherent synchronization restrictions is less than a factor of 2. In this paper we provide compelling evidence in favor of this conjecture, based on the results of a largely empirical investigation into the ratio between the critical paths of unstructured task graphs and their approximations under the restricted synchronization model.

Share

Citations (1)

... The algorithm that Escribano and van Gemund [10] propose for converting non-series-parallel graphs into series-parallel graphs results in particularly large upper bounds for neighbor-synchronized graphs; in fact, it simply replaces local synchronization with barriers, as Malony's method does. Escribano and van Gemund [9] researched the extent to which adding dependencies to a task graph in order to make it seriesparallel affects its expected completion time. They conjectured that any graph representing a parallel computation has an equivalent series-parallel graph which takes no longer than twice that of the original graph. ...

Reference:

Analysis of Delays Caused by Local Synchronization
On the loss of parallelism by imposing synchronization structure
  • Citing Article

  • January 2003

·

·

A. J. C. van Gemund