Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

Computing binary space partition trees using a scope consistent DSM system in a cluster of workstations

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Batista, R.B. ; Dept. of Comput. Sci., Brasilia Univ., Brazil ; Correa, A.L.A.C. ; Melo, A.C.M.A.

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. 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.

Published in:

Parallel, Distributed and Network-Based Processing, 2003. Proceedings. Eleventh Euromicro Conference on

Date of Conference:

5-7 Feb. 2003