• Title/Summary/Keyword: Share 할당

Search Result 149, Processing Time 0.023 seconds

A Study on the Concentration and Responses of Container Ports in China (중국 컨테이너 항만의 집중화와 대응에 관한 연구)

  • Zhang, Jun-Qing;Lee, Ja-Yeon;Woo, Su-Han
    • Journal of Korea Port Economic Association
    • /
    • v.31 no.4
    • /
    • pp.169-187
    • /
    • 2015
  • Ports as central factors of the logistics industry and principal bases in industrial activities play a significant role in the development of the social economy. This paper takes the throughput data from 2000 to 2014 of 10 container ports located in China as the research object with the Gini coefficient and employs the shift-share analysis. It aims to analyze the changes in port concentration and movement of container throughputs and propose a stage of development port system in China. The results are as follows. First, the system of container ports clearly moves northward. According to the above shift-share analysis, the throughput moves from the Pearl River Delta to the other two regions. This indicates that the center of Chinese container port system moves northward. Second, container port diversification development takes a representative position in the change of container throughput space structure. According to the calculation results of Gini coefficient, diversified development gradually predominates the change of container throughput space structure.

A Modified Proportional Scheduler and Evaluation Method (수정 비례 지분 스케쥴러 및 평가법 설계)

  • 김현철;박정석
    • Journal of Internet Computing and Services
    • /
    • v.3 no.2
    • /
    • pp.15-26
    • /
    • 2002
  • Since multimedia data such as video and audio data are displayed within a certain time constraint, their computation and manipulation should be handled under limited condition. Traditional real-time scheduling algorithms could net be directly applicable, because they are not suitable for multimedia scheduling applications which support many clients at the same time. Rate Regulating Proportional Share Scheduling Algorithm is a scheduling algorithm considered the time constraint of the multimedia data. This scheduling algorithm uses a rate regulator which prevents tasks from receiving more resource than its share in a given period. But this algorithm loses fairness, and does not show graceful degradation of performance under overloaded situation, This paper proposes a new modified algorithm. namely Modified Proportional Share Scheduling Algorithm considering the characteristics of multimedia data such as its continuity and time dependency, Proposed scheduling algorithm shows graceful degradation of performance in overloaded situation and the reduction in the number of context switching, Furthermore, a new evaluation method is proposed which can evaluate the flexibility of scheduling algorithm.

  • PDF

A Scheduler for Multimedia Data and Evaluation Method (멀티미디어 데이터를 위한 스케쥴러 및 평가법 설계)

  • 유명련;김현철
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.3 no.2
    • /
    • pp.1-7
    • /
    • 2002
  • Since multimedia data such as video and audio data are displayed within a certain time constraint, their computation and manipulation should be handled under limited condition. Traditional real-time scheduling algorithms could not be directly applicable, because they are not suitable for multimedia scheduling applications which support many clients at the same time. Rate Regulating Proportional Share Scheduling Algorithm is a scheduling algorithm considered the time constraint of the multimedia data. This scheduling algorithm uses a rate regulator which prevents tasks from receiving more resource than its share in a given period. But this algorithm loses fairness, and does not show graceful degradation of performance under overloaded situation. This paper proposes a new modified algorithm, namely Modified Proportional Share Scheduling Algorithm considering the characteristics of multimedia data such as its continuity and time dependency. Proposed scheduling algorithm shows graceful degradation of performance in overloaded situation and the reduction in the number of context switching. Furthermore, a new evaluation method is proposed which can evaluate the flexibility of scheduling algorithm.

  • PDF

A Decomposition Analysis of FDI Inflow into Korea - Shift-Share Analysis, 2003-2006 - (한국 외국인직접투자 유입요인의 분해분석 - 변이할당분석, 2003-2006 -)

  • Lee, Sanghack;Cheong, Kiwoong;Kim, Jeongsook
    • International Area Studies Review
    • /
    • v.13 no.3
    • /
    • pp.145-161
    • /
    • 2009
  • Applying the shift-share analysis, this paper decomposes FDI inflow into Korea for the period of 2003-2006. The paper finds that Korea has been lagging behind the world average in absorbing inward FDI, thereby recording negative aggregate industry-mix effects and negative aggregate competitive effects as well. However, the following industries have recorded positive competitive effect: electrical and electronic equipment, motor vehicles and other transport equipment, hotels and restaurants, transport, storage and communications, finance, and business services. In a nutshell, Korea is revealed to have competitive advantage in absorbing inward FDI in a few manufacturing industries and most of service industries. Government policies should accordingly be focused on these industries to encourage more inward FDIs.

Characteristic Analysis of Industrial Structure in Jeju Special Self-Governing Province Using Dynamic Shift-Share Analysis (동태적 변이할당분석을 이용한 제주특별자치도 산업구조 특성 분석)

  • Yang, Young-Jun
    • Journal of the Korea Convergence Society
    • /
    • v.10 no.8
    • /
    • pp.181-193
    • /
    • 2019
  • The regional economy growth of Jeju has seen higher than national growth since 2011 by the establishment of Jeju Special Self-Governing Province and the increase of incoming population, but its economic growth has slowed after 2016. This study conducted the dynamic shift-share analysis using the production and employees of each industry from 2010 to 2016, targeting Jeju with many factors of regional economic change. In the results of empirical analysis, the regional economy of Jeju was not the industrial structure depending on the national growth, but the industrial structure by the competitiveness and industrial structure of Jeju region. The industries having positive(+) effects of industrial mix effect and competitive effect on the production and the number of employees were the electricity/gas/heavy equipments & waterworks, construction, accommodation & restaurants, and service industry. These industries have positive effects on the regional industry of Jeju. The above-mentioned industries are not only more likely to grow than other regions, but also to drive the local economy of Jeju. In order for these industries to continuously contribute to the regional economy of Jeju, it would be necessary to have the policy/institutional support in the long-term perspective.

Resource Allocation Scheme Based on Spectrum Sensing for Device-to-Device Communications Underlaying Cellular Networks (셀룰러 네트워크 환경에서 D2D 통신을 위한 스펙트럼 센싱 기반 자원 할당 기법)

  • Kang, Gil-Mo;Shin, Oh-Soon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38A no.10
    • /
    • pp.898-907
    • /
    • 2013
  • For D2D communications underlaying cellular networks, it is essential to consider the mutual interference between the existing cellular communications and D2D communications as well as the spectral efficiency, as they need to share the same frequency. Accordingly, a resource allocation scheme should be designed in such a way that minimizes the mutual interference and maximizes the spectrum utilization efficiency at the same time. In this paper, we propose a resource allocation scheme based on cooperation of the base station and D2D terminals. Specifically, a D2D terminal senses the cellular spectrum to recognize the interference condition, chooses the best cellular resource, and reports the information to the base station. The base station allocates D2D resource such that the corresponding D2D link and cellular link share the same resource. The performance of the proposed resource allocation scheme is ated through compu under 3GPP LTE-Advanced scenarios.

Priority-Based Resource Allocation Algorithm for Virtual Network (가상 네트워크를 위한 우선순위 기반 자원 할당 알고리즘)

  • Kim, Hak-Suh;Lee, Sang-Ho
    • Journal of Digital Convergence
    • /
    • v.14 no.10
    • /
    • pp.303-310
    • /
    • 2016
  • Due to the ossification of the Internet, it is difficult to accommodate variety services. One of the efficient solution to this problem is network virtualization. It allows multiple parallel virtual networks to run on the shared physical infrastructure. It needs new resource allocation mechanism to share efficient physical resources. In this paper, we present efficient bandwidth allocation algorithm for virtual network request with high service priority. Our proposed algorithm can withdraw allocated bandwidth from low-level priority virtual network and maintain low-level virtual network service. We evaluated the performance of our proposed algorithm using simulation and found the improvement of approximately 8% acceptance rate.

EPON Bandwidth Allocation Scheme for Improved Utilization (Bandwidth 이용률을 높이기 위한 EPON 대역 할당 기법)

  • 윤춘희;이성창
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.40 no.10
    • /
    • pp.89-94
    • /
    • 2003
  • Passive Optical Network(PON) architecture is a very simple. However media access protocol is necessary to the PON because the ONUs should share a channel in the upsteam direction. We propose the design of dynamic bandwidth allocation algorithm for improved bandwidth utilization in the broad bandwidth access network that uses Ethernet PON. The object of our study shall be to decrease a unused remainder bandwidth of granted timeslot for a upstream traffic transmission. We propose that OLT notifies ONU of maximum transmission window during discovery and ONU request a amount under maximum transmission window after it checks a frame length. We confirm that the proposed algorithm shown improving performance from bandwidth utilization and queueing delay point of view through the simulation result.

A Simultaneous Hardware Resource Allocation and Binding Algorithm for VLSI Design (VLSI 설계를 위한 동시수행 하드웨어 자원 할당 및 바인딩 알고리듬)

  • 최지영
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.10A
    • /
    • pp.1604-1612
    • /
    • 2000
  • This paper proposes a simultaneous hardware resource allocation and binding algorithm for VLSI design. The proposed algorithm works on scheduled input graph and simultaneously allocates binds functional units, interconnections and registers by considering interdependency between operations and storage elements in each control step, in order to share registers and interconnections connected to functional units, as much as possible. Also, the register allocation is especially executes the allocation optima us-ing graph coloring techniques. Therefore the overall resource is reduced. This paper shows the effectiveness of the proposed algorithm by comparing experiments to determine number of functional unit in advance or to separate executing allocation and binding of existing system.

  • PDF

An Efficient Algorithm of Network Bandwidth Allocations for Multimedia Services (멀티미디어 서비스를 위한 효율적인 대역폭 할당)

  • 김정택;고인선
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.11C
    • /
    • pp.1112-1123
    • /
    • 2002
  • Providing a multimedia service requires efficient network bandwidth allocation scheduling. Typically, transmission of information with bursty characteristics, such as a video data stream, utilizes some type of smoothing technique that reduces the transmission rate fluctuation. While capable of a drastic reduction in the peak transmission rate, even the optimum smoothing algorithm proposed to date, however, is rather inadequate for multi-stream applications that share network bandwidth since such an algorithm has been designed and applied toward handling each independent stream. In this paper, we proposed an efficient bandwidth allocation algorithm that addresses these shortcomings. The proposed bandwidth allocation algorithm is divided into two steps, a static bandwidth allocation and a dynamic bandwidth allocation. In the former case, the peak rate reduction is achieved by maintaining the accumulated data in the user buffer at a high level, whereas the concept of real demand factor is employed to meet the needs of multi-stream bandwidth allocation in the latter case, Finally, the proposed algorithm's performance was verified with ExSpect 6.41, a Petri net simulation tool.