• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.12 no.4
• /
• pp.651-658
• /
• 2001

A novel multi-section power divider configuration is proposed to obtain wide-band frequency performance up to microwave frequency region. Design procedures for the proposed microwave broadband power divider are composed of a planar multi-section three-ports hybrid and a waveguide transformer design procedures. The multi-section power divider is based on design theory of the optimum quarter-wave transformer. Furthermore, in order to obtain the broadband isolation performance between the two adjacent output ports, the odd mode equivalent circuit should be matched by using the lossy element such as resistor. The derived design formula for calculating these odd mode matching elements is based on the singly terminated filter design theory. The waveguide transformer section is designed to suppress the propagation of the higher order modes such as waveguide modes due to employing the metallic electric wall. Thus, each section of the designed waveguide transformer should be operated with evanescent mode over the whole design frequency band of the proposed microwave broadband power divider. This paper presents several simulations and experimental results of multi-section power divider to show validity of the proposed microwave broadband power divider configuration. Simulation and experiment show excellent performance of multi section power divider.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.37 no.1
• /
• pp.12-22
• /
• 2000

This paper presents the window-based permit distribution scheme for efficient medium access control to support multiclass traffic in APON(ATM over passive optical network). The proposed MAC protocol considers the characteristics of QoS(Quality of Service) for various traffic classes. A periodic RAU(request access unit) in upstream direction, includes dedicative request fields for each traffic category within the request slot. The transmission of upstream cell is permitted by the proposed window-based spacing scheme which distributes the requested traffic into several segments in the unit of one spacing window. The delay sensitive traffic source such as CBR or VBR with the stringent requirements on CDV and delay, is allocated prior to any other class. In order to reduce the CDV, so that the permit arrival rate close to the cell arrival rate, Running-Window algorithm is applied to permit distribution processing for these classes. The ABR traffic, which has not-strict CDV or delay criteria, is allocated flexibly to the residual bandwidth in FIFO manner. UBR traffic is allocated with the lowest priority for the remaining capacity. The performance of proposed protocol is evaluated in terms of transfer delay and 1-point CDV according to various offered load. The simulation results show that our protocol has the prominent improvement on CDV and delay performance with compared to the previous protocol.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10c
• /
• pp.835-837
• /
• 2001

컴퓨터의 급속한 보급과 인터넷의 사용이 급증하면서 사용자에게 좀 더 나은 서비스를 제공하기 위해 고성능 웹서버가 필요하게 되었다. 따라서 최근에는 리눅스 가상서버를 이용한 클러스터 웹 서버의 구축사례가 늘고 있다. 이는 기존의 단일 서버 시스템에 비해 가격이 저렴하면서도 지속적인 서비스를 할 수 있는 가용성과 서버의 수를 쉽게 늘릴 수 있는 확장성을 갖고 있다. 오픈소스인 리눅스와 여러 대의 저렴한 PC들을 이용하여 서버로 들어오는 부하를 분배서버가 여러 실제 서버에게 분산시킴으로써 웹 서버의 성능을 향상시키고, 서버의 가용성을 높이는 것이 클러스터 웹 서버의 목적이라 할 것이다. 본 논문에서는 서버에 들어오는 요청을 실제 서버들에게 분산시켜주는 스케줄링 알고리즘들을 알아보고 각각의 성능을 비교, 분석하였다. 그 결과 정적 스케줄링 알고리즘보다는 각 실제 서버의 부하를 고려한 알고리즘이 더 좋은 성능을 보인다는 것과 캐쉬 친화적 알고리즘이 캐쉬를 고려하지 않은 알고리즘 보다 더 좋은 성능을 보인다는 것을 알 수 있었다. 가장 중요한 결론으로는 알고리즘의 성능보다는 노드 개수 증가율이 클러스터 웹 서버 성능에 더 큰 영향을 미친다는 것을 알 수 있었다.

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.106-109
• /
• 1999

위성 인터넷망에서의 성능 향상을 위한 프록시의 대표적인 기법인 Snoop과 Spoofing에서의 TCP 성능을 모의실험을 통해 비교하고, 전체 메모리 크기에 따른 TCP 전송 특성 변화를 살펴보았다. Spoofing과 Snoop에서 모두 TCP 전송율이 향상됨을 확인할 수 있었고, Spoofing을 적용했을 경우 Snoop보다 높은 전송율을 얻을 수 있었으나 데이터를 저장하기 위한 버퍼 요구량이 매우 커졌다. 메모리 크기는 제한되어 있으므로 효율적인 메모리 분배 방법이 필요함을 고찰할 수 있었다.

• Journal of the korean Society of Automotive Engineers
• /
• v.4 no.1
• /
• pp.5-19
• /
• 1982

차량에 있어서 제동장치가 차지하는 중요도는 다른 부품에 비하여 매우 크다고 말할 수 있겠다. 그래서 차량 brake system을 적용하는데 있어서 가장 기초가 되는 수식 및 일반사항을 설명 함으로써 차량과 brake 관계를 넓게 이해하고 가장 적합한 제동장치의 설계에 도움을 주려는 데 본 기술의 목적이 있다. 우선 차량제원에 맞는 brake 성능에 관하여 생각하여 보자. 2개의 차 축을 갖고 있는 차량에서 제동할 경우 전 후 차축(front axle, rear axle)의 동하중(dynamic weight)은 정지상태 때의 하중과는 달라지게 된다. 그러므로 brake 성능은 이 동하중의 분배에 좌우되는 것이다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10a
• /
• pp.316-318
• /
• 2004

유비쿼터스 네트워크의 보안요구사항을 살펴보면 센서의 위치, 저 전력으로 인한 성능의 제약, 브로트 캐스팅에 의한 통신 등 들 수 있다. 그 중이 논문에서는 저 전력으로 인한 성능의 제약측면을 고려한 상호인증 (Mutual Authentication)프로토콜을 새롭게 제안한다. 상호인증 프로토콜은 RM(Register Manager)와 AM(Authentication Manager)로 구성되며 RM과 AM을 통해 각 센서 노드들의 한정된 전력문제를 해결하였고 가 각 센서노드에서의 메시지의 길이와 오퍼레이션 수를 최소화함으로 전력 낭비를 해결하였다. 또한 제안하는 프로토콜은 센서노드간의 상호인증을 통한 세션키 분배를 통해 안전한 통신이 가능하다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.12A
• /
• pp.1006-1013
• /
• 2009

This paper proposes a data stream allocation technique for fair capacity performance in multiuser multiple-input multiple-output (MIMO) systems using block diagonalization (BD) algorithm. Conventional studies have been focused on maximum sum capacity. Thus, there is a very large difference of capacity among users, since user capacity unfairly distributed according to each user channel environment. In additional, poor channel user has very small capacity, since base station allocates the power by using water-filling technique. Also, almost studies limited itself to obtain the additional gain by using the same number of data streams for all users. In this paper, we propose the technique for maximizing sum capacity under the fair performance constraint by allocating data stream according to user channel environment. Also, proposed algorithm has more gain of sum capacity and transmit power than conventional equal allocation via computer simulation.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.15 no.7
• /
• pp.4545-4553
• /
• 2014

Mobile GPU has led to the rapid development of smart phone graphic technology. Most recent smart phones are equipped with high-performance multi-core GPU. How a multi-core mobile GPU can be utilized efficiently will be a critical issue for improving the smart phone performance. On the other hand, most current research has focused on a single-core mobile GPU; studies of multi-core mobile GPU are rare. In this paper, the job scheduling patterns and the efficiency of multi-core mobile GPU are analyzed. In the profiling result, despite the higher number of GPU cores, the total processing time required for certain graphics applications were increased. In addition, when GPU is processing for 3D games, a substantial amount of overhead is caused by communication between not only the CPU and GPU, but also within the GPUs. These results confirmed that more active research for multi-core mobile GPU should be performed to optimize the present mobile GPUs.

• KIPS Transactions on Computer and Communication Systems
• /
• v.6 no.10
• /
• pp.407-414
• /
• 2017

Pig monitoring applications consisting of many tasks can take advantage of inherent data parallelism and enable parallel processing using performance accelerators. In this paper, we propose a task distribution method for pig monitoring applications into a heterogenous computing platform consisting of a multicore-CPU and a manycore-GPU. That is, a parallel program written in OpenCL is developed, and then the most suitable processor is determined based on the measured execution time of each task. The proposed method is simple but very effective, and can be applied to parallelize other applications consisting of many tasks on a heterogeneous computing platform consisting of a CPU and a GPU. Experimental results show that the performance of the proposed task distribution method on three different heterogeneous computing platforms can improve the performance of the typical GPU-only method where every tasks are executed on a deviceGPU by a factor of 1.5, 8.7 and 2.7, respectively.

• The Journal of the Korea Contents Association
• /
• v.13 no.2
• /
• pp.44-51
• /
• 2013

Routers should perform fast IP address lookup for Internet to provide high-speed service. In this paper, we present a hybrid parallel IP address lookup structure composed of four-stage pipeline. It achieves parallelism at low cost by using multiple SRAMs in stage 2 and partitioned TCAMs in stage 3, and improves the performance through pipelining. The smart distributor in stage 1 does not transfer any IP address identical to previous one toward the next stage, but only uses the result of the previous lookup. So it improves throughput of lookup by caching effects, and decreases the access conflict to TCAM bank in stage 3 as well. In the last stage, the reorder buffer rearranges the completed IP addresses according to the input order. We evaluate the performance of our parallel pipelined IP lookup structure comparing with previous hybrid structure, using the real routing table and traffic distributions generated by Zipf's law.