Abstract
In this paper, we propose simplified formulas to predict the time complexity in a parallel skyline solver using two different memory schemes (Global Shared, Shared/Local memory) on two machines (BBN, KSRI). Numerical operation counts and data communication costs are considered for the formulas. Based on these formulas, we developed a processor mapping algorithm to cover the initial computation stage and the recomputation stage of substructure analysis, and also compared the performances of parallel global approach and parallel substructure approach for two practical structure models.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
