Results 201 to 210 of about 9,135 (230)
Tall and Skinny QR factorizations in MapReduce architectures.
David F. Gleich, Paul G. Constantine
openalex +1 more source
MARIANE: MApReduce Implementation Adapted for HPC Environments
Zacharia Fadika+3 more
openalex +1 more source
A Distributed VMD-BiLSTM Model for Taxi Demand Forecasting with GPS Sensor Data. [PDF]
Naji HAH, Xue Q, Li T.
europepmc +1 more source
Secure Computing for Fog-Enabled Industrial IoT. [PDF]
Alvi AN+5 more
europepmc +1 more source
Ordonnancement dynamique des transferts dans MapReduce sous contrainte de bande passante
Sylvain Gault
openalex +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Tuple MapReduce: Beyond Classic MapReduce
2012 IEEE 12th International Conference on Data Mining, 2012This paper proposes Tuple Map Reduce, a new foundational model extending Map Reduce with the notion of tuples. Tuple Map Reduce allows to bridge the gap between the low-level constructs provided by Map Reduce and higher-level needs required by programmers, such as compound records, sorting or joins.
Eric Palacios+4 more
openaire +2 more sources
An Advanced MapReduce: Cloud MapReduce, Enhancements and Applications
IEEE Transactions on Network and Service Management, 2014Recently, Cloud Computing is attracting great attention due to its provision of configurable computing resources. MapReduce (MR) is a popular framework for data-intensive distributed computing of batch jobs. MapReduce suffers from the following drawbacks: 1. It is sequential in its processing of Map and Reduce Phases 2.
Athanasios V. Vasilakos+7 more
openaire +2 more sources
Secure Intersection with MapReduce
Proceedings of the 16th International Joint Conference on e-Business and Telecommunications, 2019Relation intersection is a fundamental problem, which becomes non-trivial when the relations to be intersected are too large to fit on a single machine. Hence, a natural approach is to design parallel algorithms that are executed on a cluster of machines rented from a public cloud provider.
Ciucanu, Radu+3 more
openaire +4 more sources
2017 International Conference on High Performance Computing & Simulation (HPCS), 2017
Integrity constraints (ICs) such as Functional Dependencies (FDs) or Inclusion Dependencies (INDs) are commonly used in databases to check if input relations obey to certain pre-defined quality metrics. While Data-Intensive Scalable Computing (DISC) platforms such as MapReduce commonly accept as input (semi-structured) data not in relational format ...
Interlandi, Matteo+3 more
openaire +3 more sources
Integrity constraints (ICs) such as Functional Dependencies (FDs) or Inclusion Dependencies (INDs) are commonly used in databases to check if input relations obey to certain pre-defined quality metrics. While Data-Intensive Scalable Computing (DISC) platforms such as MapReduce commonly accept as input (semi-structured) data not in relational format ...
Interlandi, Matteo+3 more
openaire +3 more sources
Cross-MapReduce: Data transfer reduction in geo-distributed MapReduce
Future Generation Computer Systems, 2021Abstract The MapReduce model is widely used to store and process big data in a distributed manner. MapReduce was originally developed for a single tightly coupled cluster of computers. Approaches such as Hierarchical and Geo-Hadoop are designed to address geo-distributed MapReduce processing.
Seyed Saeed Mirpour Marzuni+3 more
openaire +2 more sources