• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 ITC-CSCC -2
• /
• pp.1070-1073
• /
• 2002

This study presents a parallel branch-and-bound (PBAB) method for traveling salesman problem (TSP). The PBAB method adopts intermediate form of central control and distributed control in terms of the lightness of the master process's role. Compared with fully distributed control, the control scheme involves less concentration of communication on the master. Moreover, in order to reduce the influence of communication, the worker is composed of a computation thread and a communication thread. The multithreadness realizes the almost blocking free communications on the master. We implement the proposed PBAB method on a network of PCs, which consists of one master and up to 16 workers. We experiment five TSP instances. The results shows that the efficiency increases with the problem size.

• ETRI Journal
• /
• 제28권6호
• /
• pp.815-818
• /
• 2006

In the global Internet, a constraint-based routing algorithm performs the function of selecting a routing path while satisfying some given constraints rather than selecting the shortest path based on physical topology. It is necessary for constraint-based routing to disseminate and update link state information. The triggering policy of link state updates significantly affects the volume of update traffic and the quality of services (QoS). In this letter, we propose an adaptive triggering policy based on link-usage statistics in order to reduce the volume of link state update traffic without deterioration of QoS. Also, we evaluate the performance of the proposed policy via simulations.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2005년도 춘계종합학술대회
• /
• pp.1017-1021
• /
• 2005

현대에 있어서 영상정보는 아주 큰 비중을 차지하고 있다. 따라서 이러한 영상정보를 얼마나 빨리 그리고 많이 압축 시킬 수 있는가가 핵심적인 관건이다. 본 논문에서는 공간적 압축 방식의 핵심인 DCT와 비교하여 블록킹 효과(Blocking Effect)과 없고, 우수한 압축 성능을 갖는 DWT(Discrete Wavelet Transform)알고리즘을 적용한 2차원 이산 웨이브렛 변환 필터를 설계하였다. 본 논문에서 구현한 DWT 필터는 FIR필터 방법으로 설계하였으며, Daubenchies-4 Tap을 이용하였고, 파이프라인 연산으로 승산기, 가산기를 병렬로 처리하여 고속연산을 수행하였다. 뿐만 아니라 메모리 맵핑 과정과 메모리 컨트롤 어드레스 발생기를 사용하여 메모리와 연산량을 최소화 하여 칩사이즈를 줄여 설계하였다.

• 한국정보과학회논문지:데이타베이스
• /
• 제29권4호
• /
• pp.297-310
• /
• 2002

실시간 데이타베이스 시스템에서 높은 우선 순위를 갖는 트랜잭션(High Priority Transaction; HPT)의 선행 처리를 보장하기 위해 2PL-HP(Two Phase Locking with High Priority) 방법이 사용된다. 이 방법은 충돌 발생 시 낮은 우선 순위를 갖는 트랜잭션(Low Priority Transaction; LPT)을 철회 또는 대기시킴으로써 충돌을 해결한다. 그러나 HPT가 마감시간을 지키지 못해서 시스템에서 제거되는 경우에는 LPT의 불필요한 철회 및 대기가 발생된다. 최근에 이러한 문제를 해결하고자 대체버전을 이용한 동시성 제어 알고리즘이 제안되었다. 그러나 이 알고리즘은 항상 대체 버전을 생성해야하며, 또한 복잡한 대체 버전을 관리하기 위한 기법이 추가적으로 요구된다. 본 논문에서는 불필요한 자원의 낭비를 막고 LPT의 불필요한 철회 및 대기를 제거할 수 있는 효율적인 동시성제어 알고리즘을 제안한다. 그리고 성능평가를 통해 제안하는 동시성제어 알고리즘이 기존의 대체버전을 이용한 동시성제어 알고리즘에 비해 성능이 우수함을 보인다.

• 한국통신학회:학술대회논문집
• /
• 한국통신학회 1988년도 추계학술발표회 논문집
• /
• pp.101-108
• /
• 1988

In this paper packet-swap Accptant Queveing system with synchronous single server and finite storage space is proposed for throughput improvement. Queueling systems are analyzed with Minisint Approximation reported by J.F CHANG and R.F Chang. Comparison between PSA. Queveing system and First-Come First Acceptant Queveing system via throughput and blocking probabilliy of test octet was performed The comparison showed that PAS Queweing system perfumes better than j.F ChANG’s Queveing system.

• 한국통신학회:학술대회논문집
• /
• 한국통신학회 1987년도 춘계학술발표회 논문집
• /
• pp.79-81
• /
• 1987

The traffic characteristicsof digitalswich network depend on the structure blocking probability, path searching method and etc. This paper presents the study of TDX-1 swicth network traffic capacity by considering some decisive factors such as call processing software, switch network structrure and control schme Conclusively the study shows that the switch network of TDX-1 can handle approximately up to 1650 Erlang.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1994년도 춘계공동학술대회논문집; 창원대학교; 08월 09일 Apr. 1994
• /
• pp.303-312
• /
• 1994

The problem of optimally allocating available communication channels in a cellular mobile system with nonuniform traffic distribution is considered. This problem is to minimize the weighted average blocking probability subject to cochannel interference constraints. We use the concept of pattern to deal with the problem more conveniently. Using Lagrangian relaxation and subgradient optimization techniques, we obtain high-quality solutions with information about their deviations from true optimal solutions. Computational experiments show that our method works very well.

• Journal of applied mathematics & informatics
• /
• 제33권1_2호
• /
• pp.211-217
• /
• 2015

A dynamic spectrum access scheme with channel partitioning for secondary handover calls in cognitive radio networks is proposed to reduce forced termination probability due to spectrum handover failure. A continuous-time Markov chain method for evaluating its performance such as blocking probability, forced termination probability, and throughput is presented. Numerical and simulation results are provided to demonstrate the effectiveness of the proposed scheme with channel partitioning.

• 한국경영과학회지
• /
• 제36권3호
• /
• pp.45-59
• /
• 2011

OFDMA systems have been expected to be widely used to provide multimedia services over wireless channels. To evaluate performance of the OFDMA system, power should be considered as system resource as well as subcarriers. This study propose a queueing traffic model incorporating two kinds of resources (power and subcarriers), and an extended model giving a priority to handoff calls over new calls. Some extensive experiments are conducted to illustrate the usefulness of the proposed traffic model.

• 대한화학회지
• /
• 제57권1호
• /
• pp.99-103
• /
• 2013

The present communication deals with the Pharmacophore modeling, 3D QSAR and docking analysis on series of Pyrimidine derivatives as potential calcium channel blockers. The computational studies showed hydrogen bond donor, hydrogen bond acceptor, and hydrophobic group are important features for calcium channel blocking activity. These studies showed that Pyrimidine scaffold can be utilized for designing of novel calcium channels blockers for CVS disorders.