Marc Gengler

Learn More
We deal with deterministic distributed routing algorithms on arbitrary n-node networks. For each router, we want to minimize the amount of routing information that must be stored in order to implement the local routing algorithm, even if the names of the routers can be chosen in advance. We take also into account the length of the routing paths and consider(More)
When parallelizing loop nests for distributed memory parallel computers, we have to specify when the different computations are carried out (computation scheduling), where they are carried out (computation mapping), and where the data are stored (data mapping). We show that even the “best” scheduling and mapping functions can lead to a sequential execution(More)