A framework for component-based distributed applications design. The CODE: Component Oriented Distributed Environment

2002 ◽  
Author(s):  
D. Grigoras ◽  
S. Mihaila
Keyword(s):  
Distributed Applications ◽  
Distributed Environment

A Combined Approach for Implementation of Broadcast Operation in Grid Computing

2013 ◽  
Vol 5 (1) ◽  
pp. 25-36
Author(s):  
Ghalem Belalem ◽  
Mohammed Ilyes Kara Mostefa
Keyword(s):  
Grid Computing ◽  
Large Scale ◽  
Distributed Applications ◽  
Scheduling Problems ◽  
Distributed Environment ◽  
Hybrid Strategy ◽  
Large Scale Systems ◽  
Information Power ◽  
Grid Simulation ◽  
Collective Communications

In distributed computing, the collective communications scheduling is among the most important scheduling problems related to intensive applications executed over heterogeneous platforms. The optimization of collective operations allows the improvement of parallel and distributed applications performance by reducing the completion time of these operations. In this paper, the authors are particularly interested by the optimization of broadcast operation executed over large scale distributed environment such as grid computing. For this aim, we combined the two levels approach implemented in MagPIe library proposed for the hierarchical large scale systems with the ECEF (Earliest Completion Edge First) heuristic proposed for the IPG (Information Power Grid). Simulation results show the advantage of our proposed hybrid strategy compared to the classical ECEF heuristic.

Load Following Function of Fuel Cell Plant in Distributed Environment

2005 ◽  
Vol 1 (03) ◽  
pp. 285-290 ◽  
Author(s):  
F. González-Longatt ◽  
◽  
A. Hernandez ◽  
F. Guillen ◽  
C. Fortoul
Keyword(s):  
Fuel Cell ◽  
Distributed Environment ◽  
Load Following

Big Data Privacy Preservation Using Two Phase Top-Down Specialization Algorithm with Multidimensional Map Reduce Framework on Hadoop

2015 ◽  
Vol 3 (2) ◽  
Author(s):  
Shalin Eliabeth S. ◽  
Sarju S.
Keyword(s):  
Big Data ◽  
Data Privacy ◽  
Privacy Preservation ◽  
Experimental Result ◽  
Map Reduce ◽  
Distributed Environment ◽  
Top Down ◽  
Two Phase ◽  
Data Anonymization ◽  
Big Data Privacy

Big data privacy preservation is one of the most disturbed issues in current industry. Sometimes the data privacy problems never identified when input data is published on cloud environment. Data privacy preservation in hadoop deals in hiding and publishing input dataset to the distributed environment. In this paper investigate the problem of big data anonymization for privacy preservation from the perspectives of scalability and time factor etc. At present, many cloud applications with big data anonymization faces the same kind of problems. For recovering this kind of problems, here introduced a data anonymization algorithm called Two Phase Top-Down Specialization (TPTDS) algorithm that is implemented in hadoop. For the data anonymization-45,222 records of adults information with 15 attribute values was taken as the input big data. With the help of multidimensional anonymization in map reduce framework, here implemented proposed Two-Phase Top-Down Specialization anonymization algorithm in hadoop and it will increases the efficiency on the big data processing system. By conducting experiment in both one dimensional and multidimensional map reduce framework with Two Phase Top-Down Specialization algorithm on hadoop, the better result shown in multidimensional anonymization on input adult dataset. Data sets is generalized in a top-down manner and the better result was shown in multidimensional map reduce framework by the better IGPL values generated by the algorithm. The anonymization was performed with specialization operation on taxonomy tree. The experiment shows that the solutions improves the IGPL values, anonymity parameter and decreases the execution time of big data privacy preservation by compared to the existing algorithm. This experimental result will leads to great application to the distributed environment.

Using events to build large scale distributed applications

1996 ◽  
Author(s):  
Richard Hayton ◽  
Jean Bacon ◽  
John Bates ◽  
Ken Moody
Keyword(s):  
Large Scale ◽  
Distributed Applications

Video Streaming Platform Using Distributed Environment In Cloud Platform

2021 ◽  
Author(s):  
Mythresh Korupolu ◽  
Srikanth Jannabhatla ◽  
Venkata Surendra Kommineni ◽  
Hemanth Kalyanam ◽  
Vijaykumar Vasantham
Keyword(s):  
Video Streaming ◽  
Cloud Platform ◽  
Distributed Environment

scholarly journals An experimental publish-subscribe monitoring assessment to Beyond 5G networks

2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Ramon Perez ◽  
Jaime Garcia-Reinoso ◽  
Aitor Zabala ◽  
Pablo Serrano ◽  
Albert Banchs
Keyword(s):  
Mobile Networks ◽  
Network Performance ◽  
Evaluation Process ◽  
Computing System ◽  
Distributed Monitoring ◽  
Distributed Environment ◽  
Real Time Traffic ◽  
Fifth Generation ◽  
Cloud Computing System ◽  
Multi Stakeholder

AbstractThe fifth generation (5G) of mobile networks is designed to accommodate different types of use cases, each of them with different and stringent requirements and key performance indicators (KPIs). To support the optimization of the network performance and validation of the KPIs, there exist the necessity of a flexible and efficient monitoring system and capable of realizing multi-site and multi-stakeholder scenarios. Nevertheless, for the evolution from 5G to 6G, the network is envisioned as a user-driven, distributed Cloud computing system where the resource pool is foreseen to integrate the participating users. In this paper, we present a distributed monitoring architecture for Beyond 5G multi-site platforms, where different stakeholders share the resource pool in a distributed environment. Taking advantage of the usage of publish-subscribe mechanisms adapted to the Edge, the developed lightweight monitoring solution can manage large amounts of real-time traffic generated by the applications located in the resource pool. We assess the performance of the implemented paradigm, revealing some interesting insights about the platform, such as the effect caused by the throughput of monitoring data in performance parameters such as the latency and packet loss, or the presence of a saturation effect due to software limitations that impacts in the performance of the system under specific conditions. In the end, the performance evaluation process has confirmed that the monitoring platform suits the requirements of the proposed scenarios, being capable of handling similar workloads in real 5G and Beyond 5G scenarios, then discussing how the architecture could be mapped to these real scenarios.

scholarly journals Swarm-Like Distributed Algorithm for Scheduling a Microservice-Based Application to the Cloud Servers

Electronics ◽  
2021 ◽  
Vol 10 (13) ◽  
pp. 1553
Author(s):  
Marian Rusek ◽  
Grzegorz Dwornicki
Keyword(s):  
Distributed Applications ◽  
Practical Implementation ◽  
Live Migration ◽  
Cloud Infrastructure ◽  
Application Development ◽  
Cloud Management ◽  
Cloud Application ◽  
Cloud Servers ◽  
Distributed Cloud ◽  
Better Than

Introduction of virtualization containers and container orchestrators fundamentally changed the landscape of cloud application development. Containers provide an ideal way for practical implementation of microservice-based architecture, which allows for repeatable, generic patterns that make the development of reliable, distributed applications more approachable and efficient. Orchestrators allow for shifting the accidental complexity from inside of an application into the automated cloud infrastructure. Existing container orchestrators are centralized systems that schedule containers to the cloud servers only at their startup. In this paper, we propose a swarm-like distributed cloud management system that uses live migration of containers to dynamically reassign application components to the different servers. It is based on the idea of “pheromone” robots. An additional mobile agent process is placed inside each application container to control the migration process. The number of parallel container migrations needed to reach an optimal state of the cloud is obtained using models, experiments, and simulations. We show that in the most common scenarios the proposed swarm-like algorithm performs better than existing systems, and due to its architecture it is also more scalable and resilient to container death. It also adapts to the influx of containers and addition of new servers to the cloud automatically.

scholarly journals Concept Drift Adaptation Techniques in Distributed Environment for Real-World Data Streams

Smart Cities ◽  
2021 ◽  
Vol 4 (1) ◽  
pp. 349-371
Author(s):  
Hassan Mehmood ◽  
Panos Kostakos ◽  
Marta Cortes ◽  
Theodoros Anagnostopoulos ◽  
Susanna Pirttikangas ◽  
...  
Keyword(s):  
Real World ◽  
Data Streams ◽  
Smart City ◽  
Smart Cities ◽  
Concept Drift ◽  
Distributed Environment ◽  
Real World Data ◽  
Unique Challenge ◽  
World Data ◽  
Concept Drift Detection

Real-world data streams pose a unique challenge to the implementation of machine learning (ML) models and data analysis. A notable problem that has been introduced by the growth of Internet of Things (IoT) deployments across the smart city ecosystem is that the statistical properties of data streams can change over time, resulting in poor prediction performance and ineffective decisions. While concept drift detection methods aim to patch this problem, emerging communication and sensing technologies are generating a massive amount of data, requiring distributed environments to perform computation tasks across smart city administrative domains. In this article, we implement and test a number of state-of-the-art active concept drift detection algorithms for time series analysis within a distributed environment. We use real-world data streams and provide critical analysis of results retrieved. The challenges of implementing concept drift adaptation algorithms, along with their applications in smart cities, are also discussed.

Sign in / Sign up

Export Citation Format

Share Document