AN EFFICIENT CONTRIBUTION TO COMPUTING THE SKYLINE ON GPU

The skyline computation is very important in the field of decision making. It gives solutions to help among a wide dataset and where information is contradictory, especially when the implemented solution is progressive. As the need to get rapid solution is growing, it will be suitable to exploit new machines' performances and plate-forms. In this paper, we present a new solution of type divide-and-conquer for computing the skyline on GPU (Graphics Processing Units) cards. The proposed partitioning is adaptable to characteristics of the GPU. This proposition can lead to a well balanced computing and avoids overflows. The dominance tests are performed on points components in parallel and dominated points are early discarded unlike other solutions which save them for next loops. This way of comparison avoids threads' idleness. We compare our solution with other similar solutions on the same datasets. Experimentations show that our proposition is better in terms of time computing and exploitation of the GPU parallelism.