• 제목/요약/키워드: Distributed Allocation

검색결과 336건 처리시간 0.024초

분산 모바일 멀티미디어 통신망에서 파산이론을 적용한 대역폭 할당기법 (A Bandwidth a Allocation Scheme based on Bankruptcy theory in Distributed Mobile Multimedia Network)

  • 정성순
    • 전자공학회논문지
    • /
    • 제50권4호
    • /
    • pp.246-251
    • /
    • 2013
  • 본 논문에서는 분산 모바일 멀티미디어 통신망에서 유한한 대역폭을 공정하고 효율적으로 사용하기 위해 파산이론을 적용한 파산 대역폭할당 기법을 제안하였다. 제안된 파산 대역폭할당 기법은 협력게임이론에서 파산이론을 활용하여 파산상황에서 각 서비스의 최소 대역폭보장을 통해 각 서비스의 최소 QoS를 제공한다. 성능평가 결과로 제안한 파산 대역폭 할당기법(BBA)은 CEA, CEL, Reverse Talmud에 비해 공정성지수(FI:Fairness Index)를 통해 공정성 있고, Erlang blocking formular를 통해 서비스 차단율에 대해서도 높은 성능을 보임을 나타냈다. 제안된 파산 대역폭할당 기법은 분산 모바일 멀티미디어 통신망에서, 다양한 상황에서 서비스별 우선순위를 통한 대역폭 할당기법이나 동적인 대역폭 할당기법에 최소 대역폭 할당기준으로도 적용할 수 있다.

C++ 객체의 CORBA 기반 분산 시스템으로의 정적 할당 (Static Allocation of C++ Objects to CORBA-based Distributed Systems)

  • 최승훈
    • 인터넷정보학회논문지
    • /
    • 제1권2호
    • /
    • pp.69-88
    • /
    • 2000
  • 요약 분산 시스템의 전체적인 성능에 가장 큰 영향을 미치는 요인 중의 하나는, 소프트웨어 컴포넌트를 어떻게 효율적으로 분산시키는가 하는 것이다. 현재 태스크 기반의 시스템을 분할하여 분산 환경에 할당하는 문제는 연구가 많이 진행되었으나, 객체 지향 프로그램을 구성하는 각 객체들을 분산 객체 환경에 할당하는 기법에 대한 연구는 상대적으로 미약하다. 본 논문에서는 이미 개발되어 있는 C++ 응용 프로그램을 분할하여 C++ 객체들을 CORBA 기반의 분산 객체 환경에 할당하기 위한 그래프 모델을 정의하고, 이를 바탕으로 한 분산 객체 할당 알고리즘을 제안한다. 분산 시스템의 성능은, 주로 객체간의 병렬성, 각 프로세서에 드는 부하의 균등성, 네트워크 상의 통신 량에 의해 결정된다. 이 세 가지 요인을 동시에 최적화하는 해를 찾기 위하여. 본 논문의 분산 객체 할당 기법은 Niched Pareto 유전자 알고리즘(NPGA)에 바탕을 두고 있다. 전형적인 C++ 응용 프로그램에 대한 CORBA 시스템에서의 실험을 통하여 본 논문의 그래프 모델과 객체 할당 알고리즘의 유효성을 검증한다.

  • PDF

배전계통 운영비용의 최소화에 의한 분산전원의 최적 용량과 위치결정 (Optimal Capacity and Allocation Distributed Generation by Minimization Operation Cost of Distribution System)

  • 배인수;박정훈;김진오;김규호
    • 대한전기학회논문지:전력기술부문A
    • /
    • 제53권9호
    • /
    • pp.481-486
    • /
    • 2004
  • In operation of distribution system, $DG_s$ Distributed Generations) are installed as an alternative of extension and establishment of substations and transmission and distribution lines according to increasing power demand. In operation planning of $DG_s$, determining optimal capacity and allocation gets economical pro(it and improves power reliability. This paper proposes determining a optimal number, size and allocation of $DG_s$ needed to minimize operation cost of distribution system. Capacity of $DG_s$ (or economical operation of distribution system estimated by the load growth and line capacity during operation planning duration, DG allocations are determined to minimize total cost with power buying cost. operation cost of DG, loss cost and outage cost using GA(Genetic Algorithm).

File Replication and Workload Allocation for a Locally Distributed Database

  • Gil sang Jang
    • 산업경영시스템학회지
    • /
    • 제24권64호
    • /
    • pp.1-20
    • /
    • 2001
  • In distributed databases, file replication and workload allocation are important design issues. This paper solves these two issues simultaneously, The primary objective is to minimize the system response time that consists of local processing and communication overhead on a local area network. Workload (query transactions) is assigned among any sites in proportion to the remaining file request service rate of the each server The problem is presented in the form of a nonlinear integer programming model. The problem is proved to be NP-complete and thus an efficient heuristic is developed by employing its special structure. To illustrate its effectiveness, it is shown that the proposed heuristic is based on the heuristic of a non-redundant allocation that was provided to be effective. The model and heuristics are likely to provide more effective distributed database designs.

  • PDF

다중 측면 기반의 분산 데이터 할당을 위한 MAPN 모델링 (The MAPN Modeling for the distributed Data Allocation based on Multiple Aspects)

  • 박성진
    • 한국정보처리학회논문지
    • /
    • 제7권3호
    • /
    • pp.745-755
    • /
    • 2000
  • In designing distributed databases, DAP(Data Allocation Problem) is one of the key design issues. Because, however, most of previous researches on DAP have considered only cost aspect, they cannot increase the performance and availability and they are not proper to the system requiring high-availability or real-time processing. Therefore, we need a more formal data allocation model considering multiple aspects. In this paper, we propose the MAPN (Multiple Aspects Petri Net) modeling method for the distributed transaction modeling. The MAPN model, an extended classical petri net, is proposed for the formal modeling considering multiple aspects (cost, performance and availability) concurrently. We demonstrate that we can compose the valid DAP evaluation model considering not only cost but also performance and availability concurrently by using the MAPN structure and MAPN graph.

  • PDF

Tabu 탐색 기법을 이용한 분산 컴퓨팅 시스템 설계 (Design of Distributed Computer Systems Using Tabu Search Method)

  • 홍진원;김재련
    • 산업경영시스템학회지
    • /
    • 제18권36호
    • /
    • pp.143-152
    • /
    • 1995
  • This paper determines the allocation of computers and data files to minimize the sum of processing and communication costs which occur in processing jobs at each node. The problem of optimally configuring a distributed computer system belongs to the class of NP-Complete problems and the object function of this paper is nonlinear function and is hard to solve. This paper seeks the solution of distributed processing system by Tabu Search. Firstly, it presents the method of generating the starting solution proper to the distributed processing system. Secondly, it develops the method of searching neighborhood solutions. Finally, it determines the Tabu restriction appropriate to the distributed processing system. According to the experimental results, this algorithm solves a sized problems in reasonable time and is effective in the convergence of the solution. The algorithm developed in this paper is also applicable to the general allocation problems of the distributed processing system.

  • PDF

다방향 흐름 분배와 실시간 보정 알고리듬을 이용한 분포형 강우-유출 모형 개발(II) - 적용 - (Development of Distributed Rainfall-Runoff Model Using Multi-Directional Flow Allocation and Real-Time Updating Algorithm (II) - Application -)

  • 김극수;한건연;김광섭
    • 한국수자원학회논문집
    • /
    • 제42권3호
    • /
    • pp.259-270
    • /
    • 2009
  • 본 연구에서는 다방향 흐름 분배 알고리듬과 실시간 유출 보정 알고리듬을 이용하여 개발한 분포형 강우 유출모형의 실제 유역에 대한 적용성을 평가하였다. 안동댐과 남강댐 유역에 대해 각각 우량계 관측자료와 레이더 관측 우량자료를 이용하여 분포형 강우-유출 모의를 수행하였다. 이전의 호우사상에 대한 유역 매개변수 보정 실시 후 보정된 매개변수를 이용하여 다른 호우사상에 대해 모형을 적용하였다. 안동댐 유역에 대해 흐름 군집화 결과를 제시함으로써 다방향 흐름 분배 알고리듬의 흐름추적에 대한 물리적 타당성을 입증하였다. 다방향 흐름 분배 알고리듬을 이용하여 정확도를 유지하면서 계산소요시간 단축이 이루어졌으며 실시간 유출 보정 알고리듬의 적용을 통해 좀 더 향상된 정확도를 갖는 결과가 도출되었다. 본 연구에서 개선된 유역 홍수관리를 위한 분포형 강우 유출 모형의 활용가능성을 제시하였다.

Energy-Efficiency of Distributed Antenna Systems Relying on Resource Allocation

  • Huang, Xiaoge;Zhang, Dongyu;Dai, Weipeng;Tang, She
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제13권3호
    • /
    • pp.1325-1344
    • /
    • 2019
  • Recently, to satisfy mobile users' increasing data transmission requirement, energy efficiency (EE) resource allocation in distributed antenna systems (DASs) has become a hot topic. In this paper, we aim to maximize EE in DASs subject to constraints of the minimum data rate requirement and the maximum transmission power of distributed antenna units (DAUs) with different density distributions. Virtual cell is defined as DAUs selected by the same user equipment (UE) and the size of virtual cells is dependent on the number of subcarriers and the transmission power. Specifically, the selection rule of DAUs is depended on different scenarios. We develop two scenarios based on the density of DAUs, namely, the sparse scenario and the dense scenario. In the sparse scenario, each DAU can only be selected by one UE to avoid co-channel interference. In order to make the original non-convex optimization problem tractable, we transform it into an equivalent fractional programming and solve by the following two sub-problems: optimal subcarrier allocation to find suitable DAUs; optimal power allocation for each subcarrier. Moreover, in the dense scenario, we consider UEs could access the same channel and generate co-channel interference. The optimization problem could be transformed into a convex form based on interference upper bound and fractional programming. In addition, an energy-efficient DAU selection scheme based on the large scale fading is developed to maximize EE. Finally, simulation results demonstrate the effectiveness of the proposed algorithm for both sparse and dense scenarios.

Adaptive Partition-Based Address Allocation Protocol in Mobile Ad Hoc Networks

  • Kim, Ki-Il;Peng, Bai;Kim, Kyong-Hoon
    • Journal of information and communication convergence engineering
    • /
    • 제7권2호
    • /
    • pp.141-147
    • /
    • 2009
  • To initialize and maintain self-organizing networks such as mobile ad hoc networks, address allocation protocol is essentially required. However, centralized approaches that pervasively used in traditional networks are not recommended in this kind of networks since they cannot handle with mobility efficiently. In addition, previous distributed approaches suffer from inefficiency with control overhead caused by duplicated address detection and management of available address pool. In this paper, we propose a new dynamic address allocation scheme, which is based on adaptive partition. An available address is managed in distributed way by multiple agents and partitioned adaptively according to current network environments. Finally, simulation results reveal that a proposed scheme is superior to previous approach in term of address acquisition delay under diverse simulation scenarios.

Cost-Aware Dynamic Resource Allocation in Distributed Computing Infrastructures

  • Ricciardi, Gianni M.;Hwang, Soon-Wook
    • International Journal of Contents
    • /
    • 제7권2호
    • /
    • pp.1-5
    • /
    • 2011
  • Allocation of computing resources is a crucial issue when dealing with a huge number of tasks to be completed according to a given deadline and cost constraints. The task scheduling to several resources (e.g. grid, cloud or a supercomputer) with different characteristics is not trivial, especially if a trade-off in terms of time and cost is considered. We propose an allocation approach able to fulfill the given requirements about time and cost through the use of optimizing techniques and an adaptive behavior. Simulated productions of tasks have been run in order to evaluate the characteristics of the proposed approach.