A survey of current challenges in partitioning and processing of graph-structured data in parallel and distributed systems
One of the concepts that attracts attention since entering of big data era is the graph-
structured data. Suitable frameworks to handle such data would face several constraints …
structured data. Suitable frameworks to handle such data would face several constraints …
[HTML][HTML] Intelligent Swarm: Concept, Design and Validation of Self-Organized UAVs Based on Leader–Followers Paradigm for Autonomous Mission Planning
Unmanned Aerial Vehicles (UAVs), commonly known as drones, are omnipresent and have
grown in popularity due to their wide potential use in many civilian sectors. Equipped with …
grown in popularity due to their wide potential use in many civilian sectors. Equipped with …
DHPV: a distributed algorithm for large-scale graph partitioning
Big graphs are part of the movement of “Not Only SQL” databases (also called NoSQL)
focusing on the relationships between data, rather than the values themselves. The data is …
focusing on the relationships between data, rather than the values themselves. The data is …
[PDF][PDF] A scalable big data framework for real-time traffic monitoring system
In this study, a scalable and real-time intelligent transportation system based on a big data
framework is presented. The proposed system allows for the use of existing data from road …
framework is presented. The proposed system allows for the use of existing data from road …
Hgraph: Parallel and distributed tool for large-scale graph processing
Graph are ubiquitous because the fields of application are varied. Well-known examples are
social networks, biological networks and path-finding in road networks. Real-world graphs …
social networks, biological networks and path-finding in road networks. Real-world graphs …
The MapReduce based approach to improve the all-pair shortest path computation
LN Dinh - International Journal of Advanced Science and …, 2024 - ijasca.org
When building sequential algorithms for problems on the graphic network, the algorithms
themselves are not only very complex but the complexity of the algorithms also is very big …
themselves are not only very complex but the complexity of the algorithms also is very big …
The MapReduce based approach to improve the shortest path computation
ND Lau, TT Trang, LT Tuan - J. Math. Comput. Sci., 2023 - scik.org
When building sequential algorithms for problems on the graphic network, the algorithms
themselves are not only very complex but the complexity of the algorithms also is very …
themselves are not only very complex but the complexity of the algorithms also is very …
Improved Computing Performance for Algorithm Finding the Shortest Path for all-pair in the MapReduce architectures
ND Lau - 2024 - researchsquare.com
The problem of finding All Pair Shortest Path (APSP). APSP is performed on many structures
such as: MPI, OpenMP, Cuda,…. When the input data is large, we need to find ways to …
such as: MPI, OpenMP, Cuda,…. When the input data is large, we need to find ways to …
Multi-path Coverage of All Final States for Model-Based Testing Theory Using Spark In-memory Design
This paper deals with an efficient and robust distributed framework for finite state machine
coverage in the field model based testing theory. All final states coverage in large-scale …
coverage in the field model based testing theory. All final states coverage in large-scale …
[PDF][PDF] Neodoop: Parallel and Distributed Framework for High Performance Computing on Large-Scale Graph
NoSQL and especially graph databases are constantly gaining popularity among big data
processing systems. In this work, we present Neodoop (Neo4j for Hadoop), a parallel and …
processing systems. In this work, we present Neodoop (Neo4j for Hadoop), a parallel and …