• The Transactions of the Korea Information Processing Society
• /
• v.4 no.9
• /
• pp.2221-2234
• /
• 1997

Distributed mutual exclusion algorithms have employed two approaches to achieve mutual exclusion and can be divided into two broad classes:token-based and permission-based. Token-based algorithms share a unique token among the nodes and a node is allowed to access its common resources if it possesses the token. Permission-based algorithms require one or more successive rounds of message exchanges among the nodes to obtain the permission to access the common resources. A hypercube architecture has earned wide acceptance in multiprocessor systems in the past few years because of its simple, yet rich topology. Accordingly, we study distributed permission-based mutual exclusion algorithms for hypercubes, and design a distributed permission-based mutual exclusion algorithm based on a new information structure adapted to the hypercubes. The new information structure is a request set of T-pattern from a logical mesh that is embedded into a hypercube. If a node wants to access the common resources, it sends request message to all nodes in the request set by Lan's multicast algorithm. Once the node receives a grant message from all nodes in the request set, it accesses the common resource. We evaluate our algorithm with respect to minimum round-trip delay, blocking delay, and the number of messages per access to the common resource.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.6
• /
• pp.683-692
• /
• 1999

관계형 데이터베이스 시스템에서 결합 연산자는 데이터베이스 질의를 구성하는 연산자들 중 가장 많은 처리시간을 요구한다. 따라서 이러한 결합연산자를 효율적으로 처리하기 위해 많은 병렬 알고리즘들이 소개되었다. 그 중 하이브리드 해쉬 결합 알고리즘은 가장 우수한 것으로 알려져왔다. 그러나 이 알고리즘은 여러 노드로 데이터를 분할하는 과정에서 데이터의 편중 문제가 발생하며, 이는 전체 시스템의 성능을 크게 저하시키게된다. 본 논문에서는 이러한 데이터 편중문제를 해결한 변형된 하이퍼퀵 정렬을 이용한 병렬 결합 알고리즘을 non-equijoin을 위한 알고리즘으로 확장하였다. 또한 T805로 연결된 하이퍼큐브 구조 시스템에서 시뮬레이션하여 얻은 결과를 수치 계산적 비용모델의 결과와 비교를 통해 변형된 하이퍼 퀵 정렬을 이용한 병렬 결합 알고리즘의 성능을 분석하고 , 비용모델의 타당성을 입증하였다.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2013.04a
• /
• pp.520-521
• /
• 2013

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.46 no.10
• /
• pp.867-875
• /
• 2018

Conventional nylon wire cutting-type holding and release mechanisms (HRMs) are limited to securely hold the solar panel under launch environment as the size of the panel increases because the nylon wire is tightened directly on the surface of the solar panel. In this study, we proposed a nylon wire cutting-type HRM for 6U CubeSat's solar panel applying elliptic-shaped bracket with a Ball & Socket interface. The proposed HRM has the advantage of higher holding capability along in-plane and out-of plane directions of solar panel and simplicity in tightening process of nylon wire. The design drivers of structural design of CubeSat's solar panel with the proposed HRM were defined by structural analysis under launch loads. In addition, The design effectiveness of the proposed HRM was verified through the functional tests according to the thickness of nylon wire and the number of wire winding under various temperature conditions.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.12C
• /
• pp.1123-1130
• /
• 2009

The advances in networking technology and importance of multimedia communication require real time transaction. In many applications, high reliable real-time communications are required more frequently. In this paper, we propose a reliable communication in cube-based multi -computer using the safety vector. Each node in a cube-based n dimensional multi-computer is associated with a safety vector of n bits, which is an approximated measure of the number and distribution of faults in the neighborhood. We propose an algorithm that can establish detour paths using the safety vector. The established detour paths are disjoint with the primary real-time channel. Therefore, our algorithm is more efficient than earlier proposed algorithms.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2017.11a
• /
• pp.168-169
• /
• 2017

기존의 정형적인 디스플레이 형태뿐만 아니라 비정형적인 구조의 디스플레이의 관심이 증가하고 있다. 미래에는 기존의 직사각형의 디스플레이와 더불어 비정형적인 디스플레이의 기술이 발전할 전망으로 보인다. 이러한 비정형 사이니지 기술이 발전함에 따라 비정형 영상 표출에 대한 연구가 시행될 필요성이 있다. 하지만 큐브 디스플레이와 같은 비정형 디스플레이에 바로 영상을 표출하기에는 실질적으로 구현이 어려운 점이 있다. 따라서 현실적인 하드웨어 구현이 아닌 비정형 영상 시뮬레이션을 실행할 수 있는 환경을 구축함으로써 이러한 한계를 극복하고자 한다. 본 논문은 립모션(Leap Motion)과 유니티(Unity3D)를 연동하여 제스처 인식 기반의 비정형 디스플레이 표출 시뮬레이션을 시행하였다. 사용자의 명령에 따라 큐브모형이 제어가 되어 비정형 디스플레이로 인식하고 영상을 표출한다. 이는 실제 공간에서 사용할 수 있는 조립형 큐브 디스플레이에 영상을 직접 표출하기 전 시뮬레이션으로 활용 할 수 있을 것으로 기대된다.

• Journal of Korea Multimedia Society
• /
• v.11 no.9
• /
• pp.1227-1237
• /
• 2008

In this paper, we analyze topological properties and embedding of Folded Hyper-Star network to further improve the network cost of Hypercube, a major interconnection network. Folded Hyper-Star network has a recursive expansion and maximal fault tolerance. The result of embedding is that Folded Hypercube $FQ_n$ and $n{\times}n$ Torus can be embedded into Folded Hyper-Star FHS(2n,n) with dilation 2. Also, we show Folded Hyper-Star FHS(2n,n) can be embedded into Folded Hypercube $FQ_{2n-1}$ with dilation 1.

• The KIPS Transactions:PartA
• /
• v.8A no.2
• /
• pp.99-106
• /
• 2001

In this paper, we study fault-tolerant multicasting in multicomputers based on multistage interconnection networks (MIN’s). In addition to one-to-one routing among processing nodes, efficient multicasting has an important effect on the performance of multicomputers. This paper presents a multicasting algorithm to tolerate faulty switching elements. The proposed algorithm uses the cube encoding scheme to represent multicast destinations in MIN, and is based on a recursive scheme in order to bypass faults. This algorithm can route any multicast message to its own destinations in only two passes through the MIN containing several faulty switching elements. Moreover, we prove the correctness of our algorithm by exploiting well-known nonblocking property of MIN.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.6 no.4
• /
• pp.49-60
• /
• 1996

The objective of this paper is to develop an adaptive learning method for fuzzy hypercubes using a neural network. An intelligent control system is proposed by exploiting only the merits of a fuzzy logic controller and a neural network, assuming that we can modify in real time the consequential parts of the rulebase with adaptive learning, and that initial fuzzy control rules are established in a temporarily stable region. We choose the structure of fuzzy hypercubes for the fuzzy controller, and utilize the Perceptron learning rule in order to upda1.e the fuzzy control ru1c:s on-line with the output errors. As a result, the effectiveness and the robustness of this intelligent controller are shown with application of the proposed adaptive fuzzy-neuro controller to control of the cart-pole system.

• Journal of KIISE:Databases
• /
• v.28 no.4
• /
• pp.587-595
• /
• 2001

Precomputation and materialization of parts. commonly called views of a data cube is a common technique in data warehouses The view is defined as the result of a query which is defined through aggregate functions In this paper we introduce the concept of fine granule view. The fine granule view is the result of a query defined through aggregate functions and the range on each dimension, where the subdivision of each dimension is based on queries access patterns. For the representation and selection of fine granule views to materialize, we define the ANO-OR cube graph and AND-OR minimum cost graph. With these structures, we propose a fine granule view materialization method. And through experiments, we evaluate the performance of the proposed method.