Title
Computing Binary Space Partition Trees using a Scope Consistent DSM System in a Cluster of Workstations
Abstract
Distributed Shared Memory systems allow the use of the shared memory programming paradigm in distributed architectures where no physically shared memory exist. To reduce coherence overhead, relaxed memory consistency models were proposed Scope consistent software DSMs provide a relaxed memory model that guarantees consistency only at synchronization operations, on a per-lock basis. Much of the work in DSM systems is validated by benchmarks and there are only a few examples of real parallel applications running on DSM systems. Binary Space Partition trees are widely used in computer graphics and pattern recognition to accelerate hidden surface removal. Depending on the size of the scene, the computational cost of generating BSP trees can be very high. In this paper, we propose and. evaluate a parallel algorithm that distributes the task of calculating BSP sub-trees among several nodes. This algorithm was implemented in JIAJIA, a scope consistent software DSM system. Our results on an eight-machine cluster presented very good speedups, showing that our parallelization strategy and programming support were appropriate.
Year
DOI
Venue
2003
10.1109/EMPDP.2003.1183572
ELEVENTH EUROMICRO CONFERENCE ON PARALLEL, DISTRIBUTED AND NETWORK-BASED PROCESSING, PROCEEDINGS
Keywords
Field
DocType
computer graphic,parallel algorithm,parallel algorithms,memory model,programming paradigm,bsp tree,shared memory,distributed architecture,distributed shared memory,hidden surface removal,pattern recognition,distributed programming
Binary space partitioning,Programming paradigm,Shared memory,Computer science,Parallel algorithm,Parallel computing,Distributed memory,Memory model,Consistency model,Distributed shared memory,Distributed computing
Conference
Citations 
PageRank 
References 
0
0.34
7
Authors
3