RESOURCE MANAGEMENT BASED ON GOSSIP MONITORING ALGORITHM FOR LARGE SCALE DISTRIBUTED SYSTEMS

被引:0
|
作者
Pop, Florin [1 ]
机构
[1] Univ Politehn Bucuresti, Fac Automat Control & Comp, Dept Comp Sci, Bucharest, Romania
来源
关键词
Resource Management; Large Scale Distributed Systems; Self-organizing Systems; Optimization; Task Scheduling;
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
The optimization of resource management in large scale distributed systems (LSDS) with the capability of selforganization is a complex process. LSDS are highly dynamic systems, with permanent changes in their configurations, as peers may join and leave the system with no restriction or control. This paper present the architecture for monitoring and resource management based on existing middleware solutions through the design of algorithms and methods inspired by natural models. The architecture is decentralized and it aims to optimize resource management in different types of distributed systems such as Grid, P2P, and Cloud. The important components considered for the architecture are: allocation of resources, task scheduling, resource discovery, monitoring resources and provide fault tolerance. As the system may have a large number of nodes, we need a scalable algorithm for monitoring process, able to guarantee a fast convergence no matter what the structure of the network is. In this context, gossip-based algorithms offer solutions for various topics in LSDS. The project aims to highlights the original obtained results in internationally scientific community. The paper presents the expecting results and discusses the performance evaluation of proposed architecture. Secondly, the paper presents a gossip-based algorithm for monitoring large-scale distributed systems and analyzes its efficiency in a simulated environment provided by OverSim.
引用
收藏
页码:21 / 34
页数:14
相关论文
共 50 条
  • [1] A dynamic rescheduling algorithm for resource management in large scale dependable distributed systems
    Olteanu, Alexandra
    Pop, Florin
    Dobre, Ciprian
    Cristea, Valentin
    COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2012, 63 (09) : 1409 - 1423
  • [2] Resource management in large distributed systems
    Goscinski, Andrzej
    Bearman, Mirion
    Operating Systems Review (ACM), 1990, 24 (04): : 7 - 25
  • [3] An Efficient Distributed Algorithm for Resource Allocation in Large-Scale Coupled Systems
    Niu, Di
    Li, Baochun
    2013 PROCEEDINGS IEEE INFOCOM, 2013, : 1501 - 1509
  • [4] Harmony: Integrated Resource and Reputation Management for Large-Scale Distributed Systems
    Shen, Haiying
    Liu, Guoxin
    2011 20TH INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATIONS AND NETWORKS (ICCCN), 2011,
  • [5] A Distributed Algorithm for Resource Clustering in Large Scale Platforms
    Beaumont, Olivier
    Bonichon, Nicolas
    Duchon, Philippe
    Eyraud-Dubois, Lionel
    Larcheveque, Hubert
    PRINCIPLES OF DISTRIBUTED SYSTEMS, 12TH INTERNATIONAL CONFERENCE, OPODIS 2008, 2008, 5401 : 564 - 567
  • [6] Priority-based Management Algorithm in Distributed Energy Resource Management Systems
    Bilakanti, Nishant
    Gurung, Niroj
    Chen, Heng
    Kothandaraman, Sri Raghavan
    2021 13TH ANNUAL IEEE GREEN TECHNOLOGIES CONFERENCE GREENTECH 2021, 2021, : 351 - 356
  • [7] Observer-based distributed control of large-scale systems under gossip communication protocol
    Yu, Tao
    Yu, Lanlin
    Xiong, Junlin
    ASIAN JOURNAL OF CONTROL, 2022, 24 (02) : 956 - 972
  • [8] Distributed resource discovery in large scale computing systems
    Gupta, A
    Agrawal, D
    El Abbadi, A
    2005 SYMPOSIUM ON APPLICATIONS AND THE INTERNET, PROCEEDINGS, 2005, : 320 - 326
  • [9] Gossip-Based Networking for Internet-Scale Distributed Systems
    Riviere, Etienne
    Voulgaris, Spyros
    E-TECHNOLOGIES: TRANSFORMATION IN A CONNECTED WORLD, 2011, 78 : 253 - +
  • [10] Modeling a gossip protocol distributed for resource discovery in systems
    Hawick, KA
    James, HA
    PDPTA'2001: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, 2001, : 1527 - 1533