Close category search window  Computing binary space partition
trees using a scope consistent DSM system in a cluster of
workstations  Sign In   Formats Non-Member Member $31 $13 Become
an IEEE Member or Subscribe to IEEE Xplore for exclusive
pricing! close button  puzzle piece   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 wid