The performance prediction of a parallel skyline solver and its implementation for large scale structure analysis

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.