• Title/Summary/Keyword: Distributed Systems

Search Result 4,031, Processing Time 0.029 seconds

Distributed artificial capital market based planning in 3D multi-robot transportation

  • Akbarimajd, Adel;Simzan, Ghader
    • Advances in robotics research
    • /
    • v.1 no.2
    • /
    • pp.171-183
    • /
    • 2014
  • Distributed planning and decision making can be beneficial from the robustness, adaptability and fault tolerance in multi-robot systems. Distributed mechanisms have not been employed in three dimensional transportation systems namely aerial and underwater environments. This paper presents a distributed cooperation mechanism on multi robot transportation problem in three dimensional environments. The cooperation mechanism is based on artificial capital market, a newly introduced market based negotiation protocol. In the proposed mechanism contributing in transportation task is defined as asset. Each robot is considered as an investor who decides if he is going to invest on some assets. The decision is made based on environmental constraint including fuel limitation and distances those are modeled as capital and cost. Simulations show effectiveness of the algorithm in terms of robustness, speed and adaptability.

A Load Sharing Algorithm Including An Improved Response Time using Evolutionary Information in Distributed Systems

  • Lee, Seong-Hoon
    • International Journal of Contents
    • /
    • v.4 no.2
    • /
    • pp.13-18
    • /
    • 2008
  • A load sharing algorithm is one of the important factors in computer system. In sender-initiated load sharing algorithms, when a distributed system becomes to heavy system load, it is difficult to find a suitable receiver because most processors have additional tasks to send. The sender continues to send unnecessary request messages for load transfer until a receiver is found while the system load is heavy. Because of these unnecessary request messages it results in inefficient communications, low cpu utilization, and low system throughput. To solve these problems, we propose a self-adjusting evolutionary algorithm for improved sender-initiated load sharing in distributed systems. This algorithm decreases response time and increases acceptance rate. Compared with the conventional sender-initiated load sharing algorithms, we show that the proposed algorithm performs better.

A Cooperation Model for Object Sharing in Distributed Systems (분산시스템에서 객체공유를 위한 상호협력모델)

  • 정진섭;윤인숙;이재완
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 1999.05a
    • /
    • pp.224-229
    • /
    • 1999
  • In distributed object oriented environment based upon wide heterogeneous network, effective cooperation policies between/among distributed objects are needed to resolve a complexity of management of distributed objects because of growing of a large stale of systems. Thus, in this paper, we propose three trading cooperation models between/among traders for supporting a high speed and a wide selection of trader service for clients, by considering three different cooperation models(light weight trader, simple negotiation and federation) depending upon their facilities, goals, and weights of goals.

  • PDF

Maximum Likelihood (ML)-Based Quantizer Design for Distributed Systems

  • Kim, Yoon Hak
    • Journal of information and communication convergence engineering
    • /
    • v.13 no.3
    • /
    • pp.152-158
    • /
    • 2015
  • We consider the problem of designing independently operating local quantizers at nodes in distributed estimation systems, where many spatially distributed sensor nodes measure a parameter of interest, quantize these measurements, and send the quantized data to a fusion node, which conducts the parameter estimation. Motivated by the discussion that the estimation accuracy can be improved by using the quantized data with a high probability of occurrence, we propose an iterative algorithm with a simple design rule that produces quantizers by searching boundary values with an increased likelihood. We prove that this design rule generates a considerably reduced interval for finding the next boundary values, yielding a low design complexity. We demonstrate through extensive simulations that the proposed algorithm achieves a significant performance gain with respect to traditional quantizer designs. A comparison with the recently published novel algorithms further illustrates the benefit of the proposed technique in terms of performance and design complexity.

Performance of Distributed MISO Systems Using Cooperative Transmission with Antenna Selection

  • Park, Jong-Hyun;Kim, Jae-Won;Sung, Won-Jin
    • Journal of Communications and Networks
    • /
    • v.10 no.2
    • /
    • pp.163-174
    • /
    • 2008
  • Performance of downlink transmission strategies exploiting cooperative transmit diversity is investigated for distributed multiple-input single-output (MISO) systems, for which geographically distributed remote antennas (RA) in a cell can either communicate with distinct mobile stations (MS) or cooperate for a common MS. Statistical characteristics in terms of the signal-to-interference-plus-noise ratio (SINR) and the achievable capacity are analyzed for both cooperative and non-cooperative transmission schemes, and the preferred mode of operation for given channel conditions is presented using the analysis result. In particular, we determine an exact amount of the maximum achievable gain in capacity when RAs for signal transmission are selected based on the instantaneous channel condition, by deriving a general expression for the SINR of such antenna selection based transmission. For important special cases of selecting a single RA for non-cooperative transmission and selecting two RAs for cooperative transmission among three RAs surrounding the MS, closed-form formulas are presented for the SINR and capacity distributions.

DISTRIBUTED HMI SYSTEM FOR MANAGING ALL SPAN OF PLANT CONTROL AND MAINTENANCE

  • Yoshikawa, Hidekazu
    • Nuclear Engineering and Technology
    • /
    • v.41 no.3
    • /
    • pp.237-246
    • /
    • 2009
  • Digitalization of not only non-safety but also safety-grade I &C systems with full computerized Main Control Room (MCR) is the recent trend of I&C systems of nuclear power plants (NPP) around the world, while plant maintenance has been shifting from traditional time based maintenance to condition based maintenance. In order to cope with the new trend of operation and maintenance in NPP, a concept of online distributed diagnostic system for both plant operation and maintenance has been proposed in order to further improve both the plant efficiency and the work environment of plant operation staff members by organizational learning. In this respect, the research subjects of human machine interface (HMI) for the online distributed diagnostic system are also discussed for supporting the plant personnel at both MCR and local working places in the plant by the application of advanced ICT (Information and Communication Technologies).

An Approach to Implementing Distributed Optimal Power Flow (최적조류계산의 분산처리기법에 관한 연구)

  • Kim, Ho-Woong;Kim, Bal-Ho;Kim, Jung-Hoon
    • Proceedings of the KIEE Conference
    • /
    • 1997.11a
    • /
    • pp.182-186
    • /
    • 1997
  • This paper presents a mathematical approach to implementing distributed optimal power flow (OPF), wherein a regional decomposition technique is adopted to parallelize the OPF. Three mathematical decomposition coordination methods are introduced firs to implement the proposed distributed scheme: the Auxiliary Problem Principle (APP), the Predictor-Corrector Proximal Multiplier Method (PCPM), and the Alternating Direction Method (ADM). Then two alternative schemes for modeling distributed OPF are introduced; the Dummy Generator-Dummy Generator (DGDG) scheme and Dummy Generator-Dummy Load (DGDL) scheme. We present the mathematical analyses of the proposed approach, and demonstrate the approach on several test, systems, including IEEE Reliability Test Systems and parts of the ERCOT (Electric Reliability Council of Texas) system.

  • PDF

Cluster-Based Quantization and Estimation for Distributed Systems

  • Kim, Yoon Hak
    • Journal of information and communication convergence engineering
    • /
    • v.14 no.4
    • /
    • pp.215-221
    • /
    • 2016
  • We consider a design of a combined quantizer and estimator for distributed systems wherein each node quantizes its measurement without any communication among the nodes and transmits it to a fusion node for estimation. Noting that the quantization partitions minimizing the estimation error are not independently encoded at nodes, we focus on the parameter regions created by the partitions and propose a cluster-based quantization algorithm that iteratively finds a given number of clusters of parameter regions with each region being closer to the corresponding codeword than to the other codewords. We introduce a new metric to determine the distance between codewords and parameter regions. We also discuss that the fusion node can perform an efficient estimation by finding the intersection of the clusters sent from the nodes. We demonstrate through experiments that the proposed design achieves a significant performance gain with a low complexity as compared to the previous designs.

Distributed Server Configuration Scheme for Internet Online Game (인터넷 온라인 게임을 위한 서버의 분산구성 기법)

  • Lee, Nam-Jae;Seo, Duck-Won;Kwak, Hoon-Sung
    • Journal of Korea Game Society
    • /
    • v.1 no.1
    • /
    • pp.31-36
    • /
    • 2001
  • Generally, the internet online game systems are divided into two parts, clients and servers. The clients provide a connection with game server to each user and communicate between them. And, the server controls all clients by the game rules fairly and manages database systems to maintain the user information. In this paper, we propose a configuration method for internet online game servers using distributed scheme. To apply this method, we divide game server into three sub-level parts again. First part of game server is login server to establish the connection between communication server and clients. Second part is communication server to connect between clients and main game server during playing the game. And last part is DBMS that performs database independently. Our proposed scheme suggests that the game server operates very stable because of decreasing of processing load by distributed scheme. So, our proposed server configuration applies to similar online game easily.

  • PDF

A Study on Optimal Control of Heat Exchange of Thin Metal Moving at Constant Velocity Via the Paley Order of Walsh Functions (팰리배열 월쉬함수를 이용한 정속 이동 금속판의 열교환 최적제어에 관한 연구)

  • Kim, Tai-Hoon;Lee, Myung-Kyu;Ahn, Doo-Soo
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.50 no.11
    • /
    • pp.514-521
    • /
    • 2001
  • This paper uses the distributed heating thin metal moving at constant velocity which are modeled as distributed parameter systems, and applies the Paley order of Walsh functions to high order partial differential equations and matrix partial differential equations. This thesis presents a new algorithm which usefully exercises the optimal control in the distributed parameter systems. In this paper, the excellent consequences are found without using the existing decentralized control or hierarchical control method.

  • PDF