• Journal of KIISE:Computing Practices and Letters
• /
• v.13 no.5
• /
• pp.252-259
• /
• 2007

With the rapid development of multimedia applications and wireless communication networks, consumer demand for video-over-wireless capability on mobile computing systems is growing rapidly. In this regard, this paper introduces YUV-aware instructions that enhance the performance and efficiency in the processing of color image and video. Traditional multimedia extensions (e.g., MMX, SSE, VIS, and AltiVec) depend solely on generic subword parallelism whereas the proposed YUV-aware instructions support parallel operations on two-packed 16-bit YUV (6-bit Y, 5-bits U, V) values in a 32-bit datapath architecture, providing greater concurrency and efficiency for color image and video processing. Moreover, the ability to reduce data format size reduces system cost. Experiment results on a representative dynamically scheduled embedded superscalar processor show that YUV-aware instructions achieve an average speedup of 3.9x over the baseline superscalar performance. This is in contrast to MMX (a representative Intel#s multimedia extension), which achieves a speedup of only 2.1x over the same baseline superscalar processor. In addition, YUV-aware instructions outperform MMX instructions in energy reduction (75.8% reduction with YUV-aware instructions, but only 54.8% reduction with MMX instructions over the baseline).

• Journal of KIISE:Information Networking
• /
• v.34 no.3
• /
• pp.203-217
• /
• 2007

In this paper, a performance evaluation model of Networks with the multiple-buffered crossbar switches is proposed and examined. Buffered switch technique is well known to solve the data collision problem of the switch networks. The characteristic of a network with crossbar switches is determined by both the connection pattern of the switches and the limitation of data flow in a each switch. In this thesis, the evaluation models of three different networks : Multistage interconnection network, Fat-tree network, and other ordinary communication network are developed. The proposed evaluation model is developed by investigating the transfer patterns of data packets in a switch with output-buffers. Two important parameters of the network performance, throughput and delay, are evaluated. The proposed model takes simple and primitive switch networks, i.e., no flow control and drop packet, to demonstrate analysis procedures clearly. It, however, can not only be applied to any other complicate modern switch networks that have intelligent flow control but also estimate the performance of any size networks with multiple-buffered switches. To validate the proposed analysis model, the simulation is carried out on the various sizes of networks that uses the multiple buffered crossbar switches. It is shown that both the analysis and the simulation results match closely. It is also observed that the increasing rate of Normalized Throughput is reduced and the Network Delay is getting bigger as the buffer size increased.

• Journal of KIISE:Information Networking
• /
• v.28 no.4
• /
• pp.586-601
• /
• 2001

We propose a mesh based multicast routing protocol referred to as HMMRP for ad-hoc networks. In HMMRP, a limited number of sources are selected as core sources, and the rest of the sources of a multicast group are connected to one of those core sources. The sources and the receivers of a multicast group are also connected through per source trees. In HMMRP, the data delivery mesh of a multicast group are composed of the nodes on these paths, and are reconfigured at regular intervals. Furthermore, each mesh member that lies on the paths between the sources and the core sources as well as be-tween the core sources and the receivers keeps checking if there is a symptom of mesh separation around itself. When a mesh member finds such symptom, it tries to patch itself to the mesh with a local flooding. As a result, the part of the data delivery mesh on those paths are kept connected with a lot higher probability than the rest of the data delivery mesh. That is, for a certain source receiver pair, it is very likely that at least there exists a data delivery path that route from the source to a core source and then to the receiver. Therefore, HMMRP may provide very high data delivery ratio without frequent entire data delivery mesh reconfiguration even when the nodal mobility is high. Simulation results show that HMMRP shows relatively little performance degradation with respect to mobility. Furthermore, the performance degradation with respect to mobility is even smaller when the size of the multicast group becomes larger.

• Journal of KIISE:Databases
• /
• v.33 no.6
• /
• pp.620-630
• /
• 2006

Event-detection is an important application of sensor networks. Join operations can facilitate event-detection with a condition table predefined by a user. When join operations are used for event-detection, it is desirable, if possible, to do in-network join processing to reduce communication costs. In this paper, we propose an energy-efficient in-network join algorithm, called PBA. In PBA, each partition of a condition table is stored along the path from each node to the base station, and then in-network joins are performed on the path. Since each node can identify the parts to store in its storage by its level, PBA reduces the cost of disseminating a condition table considerably Moreover, while the existing method does not work well when the ratio of the size of the condition table to the density of the network is a little bit large, our proposed method PBA does not have such a restriction and works efficiently in most cases. The results of experiments show that PBA is efficient usually and especially provides significant cost reduction over existing one when a condition table is relatively large in comparison with the density of the network, or the routing tree of the network is high.

• Information and Communications Magazine
• /
• v.13 no.4
• /
• pp.56-63
• /
• 1996

In this paper, the phisical layer of 4.3008 Mcps wideband CDMA which is proposed as the standard of personal communication service system is introduced. It is designed to fit 5 MHz bandwidth by using $28{\times}2^n$ Hadamard code. 13 kbps CELP vocoder is chosen as the main one and 32 kbps ADPCM can be applied. In the reverse link, the burst pilot scheme is proposed and produces the increase of capacity compared with the continuous pilot method. In order to maintain the service quality when the signaling data is increased, the information data and signaling data are time-multiplexed and making use of signaling activity brings the increase of capacity. QPSK data and QPSK spreading, variable frame size, and code pair assignment for high data rate are accomplished and then information data is transmited up to 64 kbps. It is expected that the proposed techiniques here are used in the FPLMTS.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.4
• /
• pp.192-200
• /
• 2002

The performance of a PC cluster system is limited by the use of traditional communication protocols, such as TCP/IP because these protocols are accompanied with significant software overheads. To overcome the problem, systems based on user-level interface for message passing without intervention of kernel have been developed. The VIA(Virtual Interface Architecture) is one of the representative user-level interfaces which provide low latency and high bandwidth. In this paper, a VIA system is implemented on an SCI(Scalable Coherent Interface) network based PC cluster. The system provides both message-passing and shared-memory programming environments and shows the maximum bandwidth of 84MB/s and the latency of $8{\mu}s$. The system also shows better performance in comparison with other comparable computer systems in carrying out parallel benchmark programs.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.1
• /
• pp.237-245
• /
• 1997

In this paper, a flow control mechanism is proposed which is based on the priority control between communication path of a node. In this scheme, demanding length of a data queue for any pre-defined, then each node in that path is forced to maintains buffer size under the limit by controlling priority level of the path. The communication path which requires higher bandwidth sets its demanding queue length smaller. By providing relationship between the priority of a path and length of its queue, the high bandwidth requesting path has a better chance to get high bandwidth by defining the smaller demanding queue size. And also, by forcing a path which has high flow rate to maintain small queue size in the path of the communication, the scheme keep the transmission delay of the path small. The size of the demanding queue of a path is regularly adjusted to meet the applications requirement, and the load status of the network during the life time of the communication. The priority control based on the demanding queue size is also provided in the intermediate nodes as well as the end nodes. By that the flow control can provide a quicker result than end to-end flow control, it provides better performance advantage especially for the high speed network.

• Information and Communications Magazine
• /
• v.11 no.10
• /
• pp.120-138
• /
• 1994

최근에 정보 고속도로 사업계획과 관련하여 세계 여러나라들이 실시하거나 실시 예정인 VOD 시험서비스에 많은 관심이 일고 있다. VOD서비스와 같은 대화형 TV 서비스(I-TV, Interactive-TV Service)는 컴퓨터, 통신 가전업체 그리고 영화 제작사등이 함께 참여하고 있다. 본 기고에서는 차세대 통합 멀티미디어 사업이라는 대화형 TV서비스의 개요와 요소기술, 그리고 서비스의 동향 및 전망을 알아보기로 한다. 1. 대화형 TV 서비스(Interactive TV Service)의 개요 현재까지 대부분의 TV 시청자들은 방송국으로부터 송신되는 공중파나 CATV서비스를 통해 프로그램 서비스를 받아보는 방송(broadcasting)방식 형태의 서비스를 이용해 왔다. 그러나 이러한 일방적인 수신방식은 최근 미국의 클린턴 행정부가 미국의 차세대 기반 통신망 구축 정책(정보 고속도로 사업; Information Super High-way)의 일환으로, CATV 사업자뿐만 아니라 지역 전화회사까지도 참여하고 있는 VOD(Video On Demand) 시험서비스가 시행됨에 따라서 미국은 물론, 우리나라를 비롯한 여러나라에서 대화형식의 TV서비스를 시행하려는 움직임이 일어나고 있다. 이러한 움직임은 지난 ‘92년 7월 16일 미 연방통신위원회(FCC. Federal Communication Committee)가 그동안 전화회사에 대해 CATV 시업진출을 금지하였던 정책을 바꿔서, CATV에 대항한 경쟁도입과 기반 정보통신망 정비를 목표로 하여 비디오 다이얼톤(VDT(주), Video Dial Tone)이라는 이름하에 공중통신 사업자에게도 영상신호를 전송을 인가함에 따라 시작되었다. VOD서비스와 같은 대화형 TV서비스는 가입자가 원하는 서비스를 시간에 관계없이 댁내의 통신회선(일반전화망, 케이블망, 광화이버망, 위성망)을 통해서 요구 즉시 실시간에 서비스를 받아볼 수 있는 멀키미디어의 통합서비스 방식이다. 도한 이 서비스는 음성통신과 방송의 통합형 서비스로서, 방송국, 전화회사 혹은 서비스 제공업자(ISP ; Information Service Provider)에 의해 제공된 디지탈 영상 및 일반 데이터 등을 압축하여 서버에 저장한 후, 소비자의 요청이 있을 경우에 통신회선을 통해 즉시 서비스 해준다. 이와 같은 대화형 TV 서비스의 구성요소로는 다양한 영상정보 및 데이타를 보유하고 있는 정보제공자, 전화선이나 CATV 또는 위성방송과 연결해 주는 지역별 비디오 서버 및 교환장치, 통신회선을 통해 전송된 서비스를 영상정보로 만들어주고 또한 가입자의 요구를 즉시 정보제공자에게 알려줄 수 있는 가정용 단말기 (STB. Set Top Box)로 이루어진다. 여기서, 비디오 서버는 다양한 대화형 TV 서비스를 제공해 주는 중계자로서, 영화, 홈쇼핑, 홈뱅킹, 대화형 교육, 비디오 게임 등을 가정에서도 가능하게 해 줄 뿐 아니라, 가입자를 관리하는 기능을 가지고 있어서 가입자 정보는 물론, 각종 서비스 사용료, 개인 통계자료 분석 등도 집계할 수 있는 기능을 가지고 있다.(그림1) 본 기고에서는 이러한 대화형 TV서비스 중에 대표적 응용서비스인 VOD 서비스에 사용되는 기술요소와 각국에서 진행되고 있는 VOD 서비스 동향 및 전망에 대해 알아보고자 한다. (주) VDT(Video Dial Tone) : FCC가 ‘92년 7월 16일에 인가한 지역 전화회사에 의한 가정용 영상 전송서비스 및 CATV에 대항한 경쟁도입과 Infrastructure의 정비를 목표로 하여 결정한 내용은 다음과 같다. 지역 전화회사에 대하여 (1) 공중통신사업자에 대하여 서비스 제공자에 대한 영상신호의 전송을 인가(기본서비스), (2) Video Gateway 서비스, 비디오 기기 제공, 서비스 제공사업자에 대한 과금, 요금징수 대행을 인가(고도서비스), (3) 프로그램 제공자에 대하여 자본출자율을 5%로 높이는 외에 (종래는 1%) 업무 관계의 확대(합병회사 설립 및 consultant 계약 등)를 인가. (4) Rural 지역(영업지역의회의 지방)에 대한 직접 프로그램 제공의 특별인가(주민이 1만세데 미만의 지방 공공 단체만 가능, 영업지역내에서는 제한없음), (5) 지방공공 사업체에 의한 영업면허의 불요(지역 전화회사가 직접 사용자에 서비스를 제공하지 않기 때문에 CATV 서비스로는 보지 않기 때문). (6)의 회로의 권고(케이블 정책법으로 결정되어 있는 통신사업자와 CATV회사 자본의 상호보유 금지의 해제) 등이다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.7B
• /
• pp.1313-1321
• /
• 1999

The two-phase locking protocol(2PL) is the most widely-used concurrency control mechanism for guaranteeing logical consistency of data in a database environment where a number of transactions perform concurrently. The problem inherent in the 2PL protocol is a deadlock, where a set of transactions holding some locks indefinitely wait an additional lock that is already held by other transactions in the set. The deadlock detector is a DBMS sub-component that examines periodically whether a system is in a deadlock state based on lock waiting information of transactions. The deadlock detector and transactions execute concurrently in a DBMS and read and/or write the lock waiting information simultaneously. Since the lock waiting information is a shared one, we need an efficient method guaranteeing its physical consistency by using mutual exclusion. The efficiency of the mutual exclusion method is crucial especially in a main memory DBMS with high performance since it seriously affects the performance of an entire system. In this paper, we propose a new method that effectively guarantees physical consistency of lock waiting information. Two primary goals of our method are to minimize the processing overhead and to maximize system concurrency.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.11 no.3
• /
• pp.179-196
• /
• 1986

In this paper, the peformance of a statistical packet voice/data multiplexer is studied. In ths study we assume that in the packet voice/data multiplexer two separate finite queues are used for voice and data traffics, and that voice traffic gets priority over data. For the performance analysis we divide the output link of the multiplexer into a sequence of time slots. The voice signal is modeled as an (M+1) - state Markov process, M being the packet generation period in slots. As for the data traffic, it is modeled by a simple Poisson process. In our discrete time domain analysis, the queueing behavior of voice traffic is little affected by the data traffic since voice signal has priority over data. Therefore, we first analyze the queueing behavior of voice traffic, and then using the result, we study the queueing behavior of data traffic. For the packet voice multiplexer, both inpur state and voice buffer occupancy are formulated by a two-dimensional Markov chain. For the integrated voice/data multiplexer we use a three-dimensional Markov chain that represents the input voice state and the buffer occupancies of voice and data. With these models, the numerical results for the performance have been obtained by the Gauss-Seidel iteration method. The analytical results have been verified by computer simylation. From the results we have found that there exist tradeoffs among the number of voice users, output link capacity, voic queue size and overflow probability for the voice traffic, and also exist tradeoffs among traffic load, data queue size and oveflow probability for the data traffic. Also, there exists a tradeoff between the performance of voice and data traffics for given inpur traffics and link capacity. In addition, it has been found that the average queueing delay of data traffic is longer than the maximum buffer size, when the gain of time assignment speech interpolation(TASI) is more than two and the number of voice users is small.