Sorting huge amounts of datasets have become essential in many computer applications,
such as search engines, database and web-based applications, in order to improve …

We present an extension of the bulk-synchronous parallel (BSP) model to abstract and
model parallelism in the presence of multiple memory hierarchies and multiple cores. We …

Bitonic sort is one of the fastest oblivious parallel sorting algorithms known so far. Due to its
high modularity, bitonic sort can be mapped to different interconnection networks. In this …

This paper presents a new parallel structured lookahead multidimensional sorting algorithm.
Our algorithm can be based on any sequential sorting algorithm. The amount of parallelism …

Large amounts of data processing bring parallel computing into sharp focus. In order to
solve the sorting problem of large-scale data in the era of internet, a large-scale distributed …

Emerging parallel processor designs create a computing paradigm capable of advancing
numerous scientific areas, including medicine, data mining, biology, physics, and earth …

ABSTRACT Context: Cloud Computing has advanced in recent years. It is catching people's
attention as a commodious resource of computational power. Slowly, Cloud is bringing new …