Didier Badouel

Learn More
We first briefly describe the methodology of programming ray-tracing algorithms on distributed-memory parallel computers, or DMPCs, and review previous efforts to overcome the problems of data distribution and load balancing. Then we present two algorithms designed for DMPCs and implemented on an Intel iPSC/2. We also compare the results of our experiments(More)
The production of realistic image generated by computer requires a huge amount of computation and a large memory capacity. The use of highly parallel computers allows this process to be performed faster. Distributed memory parallel computers (DMPCs), such as hypercubes or transputer-based machines, ooer an attractive performance/cost ratio when the load(More)
Non-uniform message distribution in interconnection networks is a common problem and causes network congestion. This paper proves that a careful choice of the routing algorithm can increase signiicantly the communication performance under pathological communication patterns, such as hot spots. A comparison between widely used e-cube routing and a new(More)
This paper describes a performance tuning tool, named SVMview, for DSM-based parallel computers. SVMview is a tool for doing a post-mortem analysis of page movements generated during the execution of Fortran-S programs. This tool is able to analyze some particular phenomena such as false-sharing which occurs when several processors write to the same page(More)
The diierence among diierent topologies in interconnection networks is a debated issue among highly parallel machine designers, since opposing parameters innuence the network performance. This paper presents a new model, k-ary n-cube m-diags, which generalizes existing k-ary n-cube topologies to include hexagonal networks and their n-dimensional extensions.(More)
  • 1