PARALLEL RENDERING OF VOLUMETRIC DATA SET ON DISTRIBUTED-MEMORY ARCHITECTURES

被引:4
|
作者
MONTANI, C [1 ]
PEREGO, R [1 ]
SCOPIGNO, R [1 ]
机构
[1] CNR, IST CNUCE, I-56100 PISA, ITALY
来源
CONCURRENCY-PRACTICE AND EXPERIENCE | 1993年 / 5卷 / 02期
关键词
Computer architecture - Data compression - Distributed computer systems - Multiprocessing systems - Parallel processing systems;
D O I
10.1002/cpe.4330050205
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
A solution is proposed to the problem of interactive visualization and rendering of volume data. Designed for parallel distributed memory MIMD architectures, the volume rendering system is based on the ray tracing (RT) visualization technique, the Sticks representation scheme (a data structure exploiting data coherence for the compression of classified data sets), the use of a slice-partitioning technique for the distribution of the data between the processing nodes and the consequent ray-data-flow parallelizing strategy. The system has been implemented on two different architectures: an inmos Transputer network and a hypercube nCUBE 6400 architecture. The high number of processors of this latter machine has allowed us to exploit a second level of parallelism (parallelism on image space, or parallelism on pixels) in order to arrive at a higher degree of scalability. In both proposals, the similarities between the chosen data-partitioning strategy, the communications pattern of the visualization processes and the topology of the physical system architecture represent the key points and provide improved software design and efficiency. Moreover, the partitioning strategy used and the network interconnection topology reduce the communications overhead and allow for an efficient implementation of a static load-balancing technique based on the prerendering of a low resolution image. Details of the practical issues involved in the parallelization process of volumetric RT, commonly encountered problems (i.e. termination and deadlock prevention) and the sw migration process between different architectures are discussed.
引用
收藏
页码:153 / 167
页数:15
相关论文
共 50 条
  • [31] LU FACTORIZATION ALGORITHMS ON DISTRIBUTED-MEMORY MULTIPROCESSOR ARCHITECTURES
    GEIST, GA
    ROMINE, CH
    SIAM JOURNAL ON SCIENTIFIC AND STATISTICAL COMPUTING, 1988, 9 (04): : 639 - 649
  • [32] A PARALLEL TRIANGULAR SOLVER FOR A DISTRIBUTED-MEMORY MULTIPROCESSOR
    LI, GG
    COLEMAN, TF
    SIAM JOURNAL ON SCIENTIFIC AND STATISTICAL COMPUTING, 1988, 9 (03): : 485 - 502
  • [33] Scalability and Locality of Extrapolation Methods for Distributed-Memory Architectures
    Korch, Matthias
    Rauber, Thomas
    Scholtes, Carsten
    EURO-PAR 2010 - PARALLEL PROCESSING, PART II, 2010, 6272 : 65 - 76
  • [34] Compiling High Performance Fortran for distributed-memory architectures
    Benkner, S
    Zima, H
    PARALLEL COMPUTING, 1999, 25 (13-14) : 1785 - 1825
  • [35] SYNTHETIC MODELS OF DISTRIBUTED-MEMORY PARALLEL PROGRAMS
    POPLAWSKI, DA
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1991, 12 (04) : 423 - 426
  • [36] PARALLEL TALBOT ALGORITHM FOR DISTRIBUTED-MEMORY MACHINES
    DEROSA, MA
    GIUNTA, G
    RIZZARDI, M
    PARALLEL COMPUTING, 1995, 21 (05) : 783 - 801
  • [37] Parallel feature selection for distributed-memory clusters
    Gonzalez-Dominguez, Jorge
    Bolon-Canedo, Veronica
    Freire, Borja
    Tourino, Juan
    INFORMATION SCIENCES, 2019, 496 : 399 - 409
  • [38] Numerical integration on distributed-memory parallel systems
    Ciegis, R
    Sablinskas, R
    Wasniewski, J
    RECENT ADVANCES IN PARALLEL VIRTUAL MACHINE AND MESSAGE PASSING INTERFACE, 1997, 1332 : 329 - 336
  • [39] Portable, parallel transformation: Distributed-memory approach
    Covick, LA
    Sando, KM
    JOURNAL OF COMPUTATIONAL CHEMISTRY, 1996, 17 (08) : 992 - 1001
  • [40] STORE COHERENCY IN A PARALLEL DISTRIBUTED-MEMORY MACHINE
    BORRMANN, L
    ISTAVRINOS, P
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 487 : 32 - 41