Skip to Main Content
This paper takes the Sobel operator as example to study parallel sequential algorithm onto a memory-sharing multiprocessor by using a virtual machine. Several different parallel algorithms using function decomposition and/or data decomposition methods are compared and their performances are analyzed in terms of processor utilization, data traffic, shared memory access, and synchronization overhead. The analysis is validated through a simulation experiment on the virtual machine of 64 parallel processors. Conclusions are presented at the end of this paper.