Title :
Computing radiosity solution on a high performance workstation LAN
Author_Institution :
Dept. of Electr. & Comput. Eng., Wayne State Univ., Detroit, MI
Abstract :
The notion of optimality of a parallel algorithm is closely tied to the characteristics of the parallel machine. A parallel implementation of radiosity solution is chosen for studying relationship between algorithms and parallel architectures. The radiosity method determines a view independent solution to scene illumination. This approach is computationally intensive and can benefit from parallelism. An algorithm for solving the radiosity equation was previously developed for Intel iPSC/2, a tightly coupled message passing multiprocessor. This algorithm when directly ported to IBM RS6000 LAN performed worse than a serial algorithm due to the high message latency of a LAN. Network parameters on the LAN multicomputer were measured. A new algorithm that minimizes the number of messages by increasing task granularity is proposed. The results obtained using this algorithm indicated expected performance improvements
Keywords :
local area networks; message passing; parallel algorithms; parallel architectures; performance evaluation; physics computing; Intel iPSC/2; high performance workstation LAN; optimality; parallel algorithm; parallel architectures; parallel machine; performance improvements; radiosity solution computing; scene illumination; task granularity; tightly coupled message passing multiprocessor; Concurrent computing; High performance computing; Layout; Lighting; Local area networks; Parallel algorithms; Parallel architectures; Parallel machines; Parallel processing; Workstations;
Conference_Titel :
High-Performance Distributed Computing, 1992. (HPDC-1), Proceedings of the First International Symposium on
Conference_Location :
Syracuse, NY
Print_ISBN :
0-8186-2970-3
DOI :
10.1109/HPDC.1992.246468
