Handling big data: research challenges and future directions

I Anagnostopoulos, S Zeadally, E Exposito - The Journal of …, 2016‏ - Springer
Today, an enormous amount of data is being continuously generated in all walks of life by all
kinds of devices and systems every day. A significant portion of such data is being captured …

Task scheduling for heterogeneous computing systems

S AlEbrahim, I Ahmad - The Journal of Supercomputing, 2017‏ - Springer
Efficient scheduling of tasks in heterogeneous computing systems is of primary importance
for high-performance execution of programs. The programs are to be considered as multiple …

ATSDS: adaptive two-stage deadline-constrained workflow scheduling considering run-time circumstances in cloud computing environments

R Khorsand, F Safi-Esfahani, N Nematbakhsh… - The Journal of …, 2017‏ - Springer
A significant aspect of cloud computing is scheduling of a large number of real-time
concurrent workflow instances. Most of the existing scheduling algorithms are designed for a …

GPUCloudSim: an extension of CloudSim for modeling and simulation of GPUs in cloud data centers

A Siavashi, M Momtazpour - The Journal of Supercomputing, 2019‏ - Springer
Recent years have witnessed an increasing growth in the usage of GPUs in cloud data
centers. It is known that conventional virtualization techniques are not directly applicable to …

Historical review and future challenges in Supercomputing and Networks of Scientific Communication

Á Fernández-González, R Rosillo… - The Journal of …, 2015‏ - Springer
Supercomputing involves not only the development and provision of infrastructures of large
capacity for the scientific and business community, but a new way to manage the tasks of …

Maximizing destructiveness of node capture attack in wireless sensor networks

C Lin, G Wu, CW Yu, L Yao - The Journal of Supercomputing, 2015‏ - Springer
As a special kind of attack, node capture attack in wireless sensor networks destroys the
confidentiality and integrity of network traffic by physically capturing sensor nodes and …

Paired many-to-many two-disjoint path cover of balanced hypercubes with faulty edges

H Lü - The Journal of Supercomputing, 2019‏ - Springer
As a variant of the well-known hypercube, the balanced hypercube BH_n BH n was
proposed as a desired interconnection network topology for parallel computing. It is known …

An efficient algorithm for embedding exchanged hypercubes into grids

W Fan, J Fan, CK Lin, G Wang, B Cheng… - The Journal of …, 2019‏ - Springer
Graph embedding is an important technology in simulating parallel structures and designing
VLSI layout. Hypercube is one of the most significant interconnection networks in parallel …

GPU-based parallel genetic approach to large-scale travelling salesman problem

S Kang, SS Kim, J Won, YM Kang - The Journal of Supercomputing, 2016‏ - Springer
The travelling salesman problem (TSP) is a well-known NP-hard problem. It is difficult to
efficiently find the solution of TSP even with the large number of gene instances …

On the restricted connectivity of the arrangement graph

E Cheng, K Qiu, Z Shen - The Journal of Supercomputing, 2017‏ - Springer
We derive a general upper bound of the R_h R h-restricted connectivity for the arrangement
graph, namely the minimum cardinality of a vertex set, whose removal disconnects the …