• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.11
• /
• pp.1318-1332
• /
• 1999

본 논문에서는 입출력 응용을 위해 collective I/O 기법을 기반으로 한 실행시간 시스템의 설계, 구현 그리고 그 성능평가를 기술한다. 여기서는 모든 프로세서가 동시에 I/O 요구에 따라 스케쥴링하며 I/O를 수행하는 collective I/O 방안과 프로세서들이 여러 그룹으로 묶이어, 다음 그룹이 데이터를 재배열하는 통신을 수행하는 동안 오직 한 그룹만이 동시에 I/O를 수행하는 pipelined collective I/O 등의 두 가지 설계방안을 살펴본다. Pipelined collective I/O의 전체 과정은 I/O 노드 충돌을 동적으로 줄이기 위해 파이프라인된다. 이상의 설계 부분에서는 동적으로 충돌 관리를 위한 지원을 제공한다. 본 논문에서는 다른 노드의 메모리 영역에 이미 존재하는 데이터를 재 사용하여 I/O 비용을 줄이기 위해 collective I/O 방안에서의 소프트웨어 캐슁 방안과 두 가지 모형에서의 chunking과 온라인 압축방안을 기술한다. 그리고 이상에서 기술한 방안들이 입출력을 위해 높은 성능을 보임을 기술하는데, 이 성능결과는 Intel Paragon과 ASCI/Red teraflops 기계 상에서 실험한 것이다. 그 결과 응용 레벨에서의 bandwidth는 peak point가 55%까지 측정되었다.Abstract In this paper we present the design, implementation and evaluation of a runtime system based on collective I/O techniques for irregular applications. We present two designs, namely, "Collective I/O" and "Pipelined Collective I/O". In the first scheme, all processors participate in the I/O simultaneously, making scheduling of I/O requests simpler but creating a possibility of contention at the I/O nodes. In the second approach, processors are grouped into several groups, so that only one group performs I/O simultaneously, while the next group performs communication to rearrange data, and this entire process is pipelined to reduce I/O node contention dynamically. In other words, the design provides support for dynamic contention management. Then we present a software caching method using collective I/O to reduce I/O cost by reusing data already present in the memory of other nodes. Finally, chunking and on-line compression mechanisms are included in both models. We demonstrate that we can obtain significantly high-performance for I/O above what has been possible so far. The performance results are presented on an Intel Paragon and on the ASCI/Red teraflops machine. Application level I/O bandwidth up to 55% of the peak is observed.he peak is observed.

• Journal of Broadcast Engineering
• /
• v.6 no.1
• /
• pp.66-71
• /
• 2001

This paper Introduces an implementation of MPEG-2 AAC codec system for digital audio broadcasting. This system consists of the encoder and the decoder. This system includes MPEG-2 system multiplexing and demultiplexing modules for Interfacing to the ETRI-DAB system. Four DSPs are adopted for the encoder and three DSPs for 7he decoder. Each DSP Processes system control. 1/0 control, audio signal processing. multiplexing and demultiplexing. This Paper also discusses some near future estimations relaxed to the DAB system and it\`s services. Currently a stereo audio codec is available but multi-channel audio codec and MPEG-4 audio cosec wall be also Implemented.

• Proceedings of the KIEE Conference
• /
• 2001.07b
• /
• pp.1041-1043
• /
• 2001

LCD 모니터 화면의 대형화와 슬림화에 따른 모니터 내의 백 라이트용 냉음극 방전램프(CCFL)도 가늘어지고 길어지고 있으며, 하나의 램프를 이용한 백 라이트로는 휘도의 한계가 있어 램프를 병렬로 사용해 필요한 휘도를 만들고있다. 멀티램프 구동용 인버터는 소형, 고효율화 뿐만 아니라 대출력이 요구된다. 방전램프가 정밀하고 동일한 제작 과정을 거치더라도 점등, 주파수, 전압, 전류 등 여러 가지 특성이 동일하지 못하다. 이는 각기 상이한 램프특성 때문에 초기 점등조건이나 점등 후 동일한 휘도를 갖기 어렵다. 본 논문에서는 멀티램프를 최소의 인버터 개수로 같은 입력조건에서 같은 출력을 갖도록 설계한다. LCD 모니터 내부에 상하 각 2개씩 4개의 램프를 내장하고 있는 18인치형을 이용하였다. 하나의 구동용 인버터를 이용하였으며, 결과적으로 90%이상의 휘도대비 입출력 효율을 얻었으며, 램프간의 출력차이가 미소하여 상용화 가능하며, 또 다른 방전램프의 멀티구동에 이용 가능하다.

• Proceedings of the KIPE Conference
• /
• 2001.07a
• /
• pp.340-343
• /
• 2001

LCD 모니터 화면의 대형화와 슬림화에 따른 모니터 내의 백 라이트용 냉음극 방전램프(CCFL)도 가늘어지고 길어지고 있으며, 하나의 램프를 이용한 백 라이트로는 휘도의 한계가 있어 램프를 병렬로 사용해 필요한 휘도를 만들고있다. 멀티램프 구동용 인버터는 소형, 고효율화 뿐만 아니라 대출력이 요구된다. 방전램프가 정밀하고 동일한 제작 과정을 거치더라도 점등, 주파수, 전압, 전류 등 여러가지 특성이 동일하지 못하다. 이는 각기 상이한 램프특성 때문에 초기 점등조건이나 점등 후 동일한 휘도를 갖기 어렵다. 본 논문에서는 멀티램프를 최소의 인버터 개수로 같은 입력조건에서 같은 출력을 갖도록 설계한다. LCD 모니터 내부에 상하각 2개씩 4개의 램프를 내장하고 있는 18인치형을 이용하였다. 하나의 구동용 인버터를 이용하였으며, 결과적으로 $90\%$이상의 휘도대비 입출력 효율을 얻었으며, 램프간의 출력차이가 미소하여 상용화 가능하며, 또 다른 방전램프의 멀티구동에 이용 가능하다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.11
• /
• pp.1490-1501
• /
• 2016

In this paper, we propose an image-based indoor localization system using parallel distributed computing. In order to reduce computation time for indoor localization, an scale invariant feature transform (SIFT) algorithm is performed in parallel by using Apache Spark. Toward this goal, we propose a novel image processing interface of Apache Spark. The experimental results show that the speed of the proposed system is about 3.6 times better than that of the conventional system.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.6
• /
• pp.1313-1320
• /
• 2015

In this paper, we propose a user detection technique based on parallel orthogonal matching pursuit (POMP) for uplink multi-user random access networks (RANs) with a number of users and receiver antennas. In general RANs, it is difficult to estimate the number of users simultaneously transmitting packets at the receiver because users with data send the data without grant of BS. In this paper, therefore, we modify the original POMP for the RAN and evaluate its performances through extensive computer simulations. Simulation results show that the proposed POMP can effectively detect activated users more than about 2%~8% compared with the conventional OMP in RANs.

• KIPS Transactions on Software and Data Engineering
• /
• v.5 no.6
• /
• pp.273-282
• /
• 2016

Visualization tool can be divided by three components - data I/O, visual transformation and interactive rendering. In this paper, we present requirements of three major components on visualization tools for massive scientific dataset and propose strategies to develop the tool which satisfies those requirements. In particular, we present how to utilize open source softwares to efficiently realize our goal. Furthermore, we also study the way to combine several open source softwares which are separately made to produce a single visualization software and optimize it for realtime visualization of massiv espatio-temporal scientific dataset. Finally, we propose a distributed shared memory based scientific visualization tool which is called "GLOVE". We present a performance comparison among GLOVE and well known open source visualization tools such as ParaView and VisIt.

• Journal of Astronomy and Space Sciences
• /
• v.24 no.4
• /
• pp.349-366
• /
• 2007

We designed and developed a multi-purpose CCD camera system for three kinds of CCDs; KAF-0401E($768{\times}512$), KAF-1602E($1536{\times}1024$), KAF-3200E($2184{\times}1472$) made by KODAK Co.. The system supports fast USB port as well as parallel port for data I/O and control signal. The packing is based on two stage circuit boards for size reduction and contains built-in filter wheel. Basic hardware components include clock pattern circuit, A/D conversion circuit, CCD data flow control circuit, and CCD temperature control unit. The CCD temperature can be controlled with accuracy of approximately $0.4^{\circ}C$ in the max. range of temperature, ${\Delta}33^{\circ}C$. This CCD camera system has with readout noise $6\;e^-$, and system gain $5\;e^-/ADU$. A total of 10 CCD camera systems were produced and our tests show that all of them show passable performance.

• The KIPS Transactions:PartD
• /
• v.11D no.5
• /
• pp.1011-1020
• /
• 2004

A lot of work has been done to improve the I/O performance of such a system that store and manage a massive amount of data by distributing them across multiple disks and access them in parallel. Most of the previous work has focused on an efficient mapping from a grid ceil, which is determined bY the interval number of each dimension, to a disk number on the assumption that each dimension is split into disjoint intervals such that entire data space is GRID-like partitioned. However, they have ignored the effects of a GRID partitioning scheme on declustering performance. In this paper, we enhance the performance of mapping function based declustering algorithms by applying a good GRID par-titioning method. For this, we propose an estimation model to count the number of grid cells intersected by a range query and apply a GRID partitioning scheme which minimizes query result size among the possible schemes. While it is common to do binary partition for high-dimensional data, we choose less number of dimensions than needed for binary partition and split several times along that dimensions so that we can reduce the number of grid cells touched by a query. Several experimental results show that the proposed estimation model gives accuracy within 0.5% error ratio regardless of query size and dimension. We can also improve the performance of declustering algorithm based on mapping function, called Kronecker Sequence, which has been known to be the best among the mapping functions for high-dimensional data, up to 23 times by applying an efficient GRID partitioning scheme.

• Journal of KIISE:Databases
• /
• v.31 no.6
• /
• pp.596-608
• /
• 2004

A lot of work has been done to reduce disk access time in I/O intensive systems, which store and handle massive amount of data, by distributing data across multiple disks and accessing them in parallel. Most of the previous work has focused on an efficient mapping from a grid cell to a disk number on the assumption that data space is regular grid-like partitioned. Although we can achieve good performance for low-dimensional data by grid-like partitioning, its performance becomes degenerate as grows the dimension of data even with a good disk allocation scheme. This comes from the fact that they partition entire data space equally regardless of distribution ratio of data objects. Most of the data in high-dimensional space exist around the surface of space. For that reason, we propose a new declustering algorithm based on the partitioning scheme which partition data space from the surface. With an unbalanced partitioning scheme, several experimental results show that we can remarkably reduce the number of data blocks touched by a query as grows the dimension of data and a query size. In this paper, we propose disk allocation schemes based on the layout of the resultant data blocks after partitioning. To show the performance of the proposed algorithm, we have performed several experiments with different dimensional data and for a wide range of number of disks. Our proposed disk allocation method gives a performance within 10 additive disk accesses compared with strictly optimal allocation scheme. We compared our algorithm with Kronecker sequence based declustering algorithm, which is reported to be the best among the grid partition and mapping function based declustering algorithms. We can improve declustering performance up to 14 times as grows dimension of data.