• The KIPS Transactions:PartA
• /
• v.8A no.3
• /
• pp.227-234
• /
• 2001

In this paper we propose a block-type parallel preconditioner for solving large sparse nonsymmetric linear systems, which we expect to be scalable. It is Multi-Color Block SOR preconditioner, combined with direct sparse matrix solver. For the Laplacian matrix the SOR method is known to have a nondeteriorating rate of convergence when used with Multi-Color ordering. Since most of the time is spent on the diagonal inversion, which is done on each processor, we expect it to be a good scalable preconditioner. We compared it with four other preconditioners, which are ILU(0)-wavefront ordering, ILU(0)-Multi-Color ordering, SPAI(SParse Approximate Inverse), and SSOR preconditiner. Experiments were conducted for the Finite Difference discretizations of two problems with various meshsizes varying up to $1025{\times}1024$. CRAY-T3E with 128 nodes was used. MPI library was used for interprocess communications, The results show that Multi-Color Block SOR is scalabl and gives the best performances.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.6 no.4
• /
• pp.216-223
• /
• 2013

As the fast growth of using Internet, the requests of clients having different types and pressing loads on the server have been increased in World Wide Web. Thus the interesting issue is how to measure the real capacity of a Web Server. There have been much recent studies about measuring the capacity of web server. But the cause of Server response time delay is not just server itself but also network packet loss. To measure the practical capacity of web server, we generate scalable clients using Posix Thread, transport packets which were generated by scalable clients to the server using UDP and receive the packets which were the remain packet from network packet loss using TCP. In this paper, we propose a method to measure the practical capacity of a web server using the Scalable Clients based on Posix Thread and the transport on Application level.

• Journal of Communications and Networks
• /
• v.10 no.3
• /
• pp.338-350
• /
• 2008

The differentiated services (DiffServ) is proposed to provide packet level service differentiations in a scalable manner. To provide an end-to-end service differentiation to users having a connection over multiple domains, as well as a flow marker, an intermediate marker is necessary at the edge routers, and it should not be operated at a flow level due to a scalability problem. Due to this operation requirement, the intermediate marker has a fairness problem among the transmission control protocol (TCP) flows since TCP flows have intrinsically unfair throughputs due to the TCP's congestion control algorithm. Moreover, it is very difficult to resolve this problem without individual flow state information such as round trip time (RTT) and sending rate of each flow. In this paper, to resolve this TCP fairness problem of an intermediate marker, we propose a fair scalable marker (FSM) as an intermediate marker which works with a source flow three color marker (sf-TCM) operating as a host source marker. The proposed fair scalable marker improves the fairness among the TCP flows with different RTTs without per-flow management. Through the simulations, we show that the FSM can improve TCP fairness as well as link utilization in multiple domain DiffServ networks.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.1 no.3
• /
• pp.91-96
• /
• 2008

An image scalablity function is noted as technology to embody One Source-Multi-use's Image division by the network Bandwidth and diversification of resolution of reception terminal recently. In MPEG present H.264/MPEG-4 AVC that do to standardization of SVC (Scalable Video Coding) that know go and SVC can offer space time SNR scalability. But, encoding that do scalable usually is known that encoding efficiency drops than encoding that do rain scalable during time and treatise that see. Examine technique to plan improvement of management quality as that aim to time, SNR scalability in treatise that see so and change FGS (Fine Granular Scalability) function that offer SNR scalability that do about scalability's particle size and encoding efficiency relation by SVC to foundation.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.3
• /
• pp.621-627
• /
• 2010

This paper proposes an efficient architecture of Inter layer up-sampling in decoder for SVC(scalable video coding). A register bank for horizontal and vertical up-sampling and interpolation units are designed, by introducing the proposed architecture, 41% memory bandwidth is reduced compared to JSVM. For real-time operation for HD 6 layer decoder having CIF, SD, HD resolution for CGS layer, the hardware is designed to operate at 127MHz. The gate count is about 3000.

• Information and Communications Magazine
• /
• v.30 no.9
• /
• pp.49-57
• /
• 2013

네트워크 기술과 멀티미디어 압축 기술이 발달함에 따라 사용자들은 고화질의 멀티미디어 콘텐츠를 무선 환경에서도 끊김 없이 제공 받기를 원하고 있다. 또한, 스마트폰과 스마트패드와 같은 다양한 멀티미디어 장치가 일상생활에서 보편적으로 사용되면서 디바이스 간에 끊김 없는 미디어의 연동을 가능케 하는 N-스크린 서비스가 점차 확산되고 있다. 이러한 시장의 흐름에 발맞춰 JCT-VC (Joint Collaborative Team on Video Coding)는 차세대 동영상 압축 표준 기술인 HEVC (High Efficiency Video Coding)를 바탕으로 공간적 (Spatial), 화질적 (Temporal) 스케일러빌리티 (Scalability)를 제공하는 확장 표준인 SHVC (Scalable HEVC)를 표준화 중에 있다. JCT-VC는 SHVC 부호화 기술들을 평가하기 위하여 SCE (Scalable Core Experiment)를 진행하고 있으며, SHVC 표준은 2014년 6월에 표준화가 완료 될 것으로 예상된다. 본 고에서는 비디오 스케일 러빌리티의 기본 개념 및 SHVC 표준화 과정에서 제안된 주요부호화 기술들과 이슈들을 소개한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.10b
• /
• pp.1311-1314
• /
• 2001

PC, Notebook, PDA, Cellular telephone, Smart phone 등 많은 형식의 인터넷 단말기가 사용되고 있지만, 인터넷 상에 존재하는 많은 그래픽 요소들은 이러한 단말기의 형식에 많은 제약을 받고 있다. 또한 사용자가 원하는 형태로 직접 변형하는 것이 어렵고, 그래픽 부분 요소의 재사용이 불가능하다. 본 논문에서는 차세대 마크업 언어로 각광받고 있는 XML(Extensible Markup Language)의 그래픽 표준인 SVG(Scalable Vector Graphic)를 이용하여 어떤 단말기에서도 같은 형식으로 디스플레이 되고 사용자가 원하는 형태로 이미지의 수정 및 부분 요소의 재사용성을 놀인 웹 캐릭터 빌더(Builder)를 설계 및 구현하였다. 연구 결과를 이용하면 에이전트 상의 웹 캐릭터 혹은 웹 상에서 일어날 수 있는 어떠한 컨텐츠에도 사용할 수 있는 기술을 구현한 수 있을 것이다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04a
• /
• pp.382-384
• /
• 2004

최근 인터넷의 발달과 함께 인터넷 상에서의 데이터 보안에 대한 요구가 매우 증가되고 있다. 그래서 공개키 또는 비밀키 알고리즘을 사용하여 데이터 보안을 해결하고 있다. 대부분의 공개키 알고리즘은 모듈러 연산들을 기반으로 살고 있으며 이 중 복잡도가 가장 높은 모듈러 멱승 연산은 모듈러 곱셈 연산을 반복 수행하여 계산된다. 그래서 모듈러 곱셈연산을 효율적으로 계산하기 위한 많은 방법들이 제안되어 왔으며 하드웨어 구현 시 속도와 효율성 문제로 몽고메리 곱셈기에 대한 연구가 주목을 받아 왔다. 현재 몽고메리 곱셈 알고리즘을 이용한 곱셈기는 대부분이 성능과 면적만을 고려한 구조로 보안성 향상을 위해 입력 데이터의 비트수 증가 시 곱셈기의 구조 변경이 요구된다. 따라서 본 논문에서는 비트수 길이가 변하더라도 곱셈기 구조는 변함이 없는 GF(p)상에서의 Scalable한 몽고메리 곱셈기 구조를 제안한다. Sealable한 곱셈기의 구조는 FPGA와 같이 메모리를 포함하는 하드웨어 플랫폼에 적합하다. 제안된 구조는 Xilinx FPGA를 이용하여 하드웨어로 구현하며 ModelSim Tool을 통해 기능 및 타이밍 시뮬레이션을 수행한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06c
• /
• pp.413-414
• /
• 2012

Currently the amount and variety of data being generated is unprecedented and dramatically changes the way individuals, groups, and societies act and make decisions. Visualization is one of the most important commonly used methods of analyzing and interpreting digital assets and the interactive environments are necessary to enable effective discovery and decision making. In this paper we present several examples and approaches to scalable functional representations and interactive visualization and analysis. The functional representations provide us unified, compact, continuous, multi-scale, and compressed representations in the data domain.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.16 no.3
• /
• pp.87-99
• /
• 2006

In this paper, we propose a method of conditional access control for encrypted SVC(scalable video coding) bitstream. The main purpose of the proposition is to provide a SVC suitable encryption algorithm and a efficient method for conditional access control using encrypted SVC bitstream. We analyzed requirements for conditional access control of a SVC bitstream. And based on the analysis, we proposed encryption algorithm suitable for SVC bitstream and a method of conditional access control of the encryped bitstream. The proposed conditional access control for encrypted SVC bitstream is performed by bitsream extraction and selective decryption. We verified the usefulness of the proposed method through experiments.