• Title/Summary/Keyword: Data Memory

Search Result 3,302, Processing Time 0.032 seconds

A Design of 4×4 Block Parallel Interpolation Motion Compensation Architecture for 4K UHD H.264/AVC Decoder (4K UHD급 H.264/AVC 복호화기를 위한 4×4 블록 병렬 보간 움직임보상기 아키텍처 설계)

  • Lee, Kyung-Ho;Kong, Jin-Hyeung
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.5
    • /
    • pp.102-111
    • /
    • 2013
  • In this paper, we proposed a $4{\times}4$ block parallel architecture of interpolation for high-performance H.264/AVC Motion Compensation in 4K UHD($3840{\times}2160$) video real time processing. To improve throughput, we design $4{\times}4$ block parallel interpolation. For supplying the $9{\times}9$ reference data for interpolation, we design 2D cache buffer which consists of the $9{\times}9$ memory arrays. We minimize redundant storage of the reference pixel by applying the Search Area Stripe Reuse scheme(SASR), and implement high-speed plane interpolator with 3-stage pipeline(Horizontal Vertical 1/2 interpolation, Diagonal 1/2 interpolation, 1/4 interpolation). The proposed architecture was simulated in 0.13um standard cell library. The maximum operation frequency is 150MHz. The gate count is 161Kgates. The proposed H.264/AVC Motion Compensation can support 4K UHD at 72 frames per second by running at 150MHz.

A Study on Efficient Cell Queueing and Scheduling Algorithms for Multimedia Support in ATM Switches (ATM 교환기에서 멀티미디어 트래픽 지원을 위한 효율적인 셀 큐잉 및 스케줄링 알고리즘에 관한 연구)

  • Park, Jin-Su;Lee, Sung-Won;Kim, Young-Beom
    • Journal of IKEEE
    • /
    • v.5 no.1 s.8
    • /
    • pp.100-110
    • /
    • 2001
  • In this paper, we investigated several buffer management schemes for the design of shared-memory type ATM switches, which can enhance the utilization of switch resources and can support quality-of-service (QoS) functionalities. Our results show that dynamic threshold (DT) scheme demonstrate a moderate degree of robustness close to pushout(PO) scheme, which is known to be impractical in the perspective of hardware implementation, under various traffic conditions such as traffic loads, burstyness of incoming traffic, and load non-uniformity across output ports. Next, we considered buffer management strategies to support QoS functions, which utilize parameter values obtained via connection admission control (CAC) procedures to set tile threshold values. Through simulations, we showed that the buffer management schemes adopted behave well in the sense that they can protect regulated traffic from unregulated cell traffic in allocating buffer space. In particular, it was observed that dynamic partitioning is superior in terms of QoS support than virtual partitioning.

  • PDF

Analysis on the Performance and Temperature of the 3D Quad-core Processor according to Cache Organization (캐쉬 구성에 따른 3차원 쿼드코어 프로세서의 성능 및 온도 분석)

  • Son, Dong-Oh;Ahn, Jin-Woo;Choi, Hong-Jun;Kim, Jong-Myon;Kim, Cheol-Hong
    • Journal of the Korea Society of Computer and Information
    • /
    • v.17 no.6
    • /
    • pp.1-11
    • /
    • 2012
  • As the process technology scales down, multi-core processors cause serious problems such as increased interconnection delay, high power consumption and thermal problems. To solve the problems in 2D multi-core processors, researchers have focused on the 3D multi-core processor architecture. Compared to the 2D multi-core processor, the 3D multi-core processor decreases interconnection delay by reducing wire length significantly, since each core on different layers is connected using vertical through-silicon via(TSV). However, the power density in the 3D multi-core processor is increased dramatically compared to that in the 2D multi-core processor, because multiple cores are stacked vertically. Unfortunately, increased power density causes thermal problems, resulting in high cooling cost, negative impact on the reliability. Therefore, temperature should be considered together with performance in designing 3D multi-core processors. In this work, we analyze the temperature of the cache in quad-core processors varying cache organization. Then, we propose the low-temperature cache organization to overcome the thermal problems. Our evaluation shows that peak temperature of the instruction cache is lower than threshold. The peak temperature of the data cache is higher than threshold when the cache is composed of many ways. According to the results, our proposed cache organization not only efficiently reduces the peak temperature but also reduces the performance degradation for 3D quad-core processors.

An Optimization of Hashing Mechanism for the DHP Association Rules Mining Algorithm (DHP 연관 규칙 탐사 알고리즘을 위한 해싱 메커니즘 최적화)

  • Lee, Hyung-Bong;Kwon, Ki-Hyeon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.15 no.8
    • /
    • pp.13-21
    • /
    • 2010
  • One of the most distinguished features of the DHP association rules mining algorithm is that it counts the support of hash key combinations composed of k items at phase k-1, and uses the counted support for pruning candidate large itemsets to improve performance. At this time, it is desirable for each hash key combination to have a separate count variable, where it is impossible to allocate the variables owing to memory shortage. So, the algorithm uses a direct hashing mechanism in which several hash key combinations conflict and are counted in a same hash bucket. But the direct hashing mechanism is not efficient because the distribution of hash key combinations is unvalanced by the characteristics sourced from the mining process. This paper proposes a mapped perfect hashing function which maps the region of hash key combinations into a continuous integer space for phase 3 and maximizes the efficiency of direct hashing mechanism. The results of a performance test experimented on 42 test data sets shows that the average performance improvement of the proposed hashing mechanism is 7.3% compared to the existing method, and the highest performance improvement is 16.9%. Also, it shows that the proposed method is more efficient in case the length of transactions or large itemsets are long or the number of total items is large.

Preparation of Fragrant Microcapsule for Reducing Stress (긴장완화를 위한 향기나는 마이크로캡슐의 제조)

  • Kim, Yoon A;Kim, So Hyun;Park, Ji Su;Lee, Da Som;Kim, Jin Gon;Shin, Jae Sup
    • Journal of Adhesion and Interface
    • /
    • v.13 no.1
    • /
    • pp.17-23
    • /
    • 2012
  • A fragrant microcapsule was prepared for use by students to reduce the stress of taking examinations. Rosmarinic acid was used as a fragrant oil which had the effect of relaxing stress, polycaprolactone (PCL) was used as a capsule wall material, and poly(vinyl alcohol) (PVA) as a stabilizer. The solvent evaporation method was used to form the microcapsule. The microcapsules were prepared by changing the stirring rate, the concentration of the stabilizer, and the molecular weight of PCL. The shape of the microcapsule was characterized by scanning electron microscopy (SEM). The size of the microcapsule was reduced by increasing the stirring speed. The release rate of rosmarinic acid was decreased when the higher molecular weight PCL was used. When the prepared microcapsule was tested in an aromatherapy class, the microencapsulated fragrant oil had a longer release time than the original fragrant oil. The study data showed that this fragrant oil was effective for increasing concentration ability, reducing stress, increasing digestive power, and increasing memory for the students.

Accelerating GPU-based Volume Ray-casting Using Brick Vertex (브릭 정점을 이용한 GPU 기반 볼륨 광선투사법 가속화)

  • Chae, Su-Pyeong;Shin, Byeong-Seok
    • Journal of the Korea Computer Graphics Society
    • /
    • v.17 no.3
    • /
    • pp.1-7
    • /
    • 2011
  • Recently, various researches have been proposed to accelerate GPU-based volume ray-casting. However, those researches may cause several problems such as bottleneck of data transmission between CPU and GPU, requirement of additional video memory for hierarchical structure and increase of processing time whenever opacity transfer function changes. In this paper, we propose an efficient GPU-based empty space skipping technique to solve these problems. We store maximum density in a brick of volume dataset on a vertex element. Then we delete vertices regarded as transparent one by opacity transfer function in geometry shader. Remaining vertices are used to generate bounding boxes of non-transparent area that helps the ray to traverse efficiently. Although these vertices are independent on viewing condition they need to be reproduced when opacity transfer function changes. Our technique provides fast generation of opaque vertices for interactive processing since the generation stage of the opaque vertices is running in GPU pipeline. The rendering results of our algorithm are identical to the that of general GPU ray-casting, but the performance can be up to more than 10 times faster.

The effect on purchasing intention of Hotel Brand-image and Choice-attribution (호텔 브랜드이미지와 선택속성이 구매의도에 미치는 영향에 관한 연구)

  • Lee, Ji-Yeong;Kim, Tae-Jin
    • Journal of Applied Tourism Food and Beverage Management and Research
    • /
    • v.16 no.1
    • /
    • pp.43-69
    • /
    • 2005
  • Generally, brand is the title for discriminating their own goods and service from other competitive company, brand-image means customer's good and bad affection or loyalty the brand of specific company. Customers often choose the goods according to the value of goods brand. In terms of this viewpoint, the value of company's brand is very important factor to the company's success. Brand-image also effects customers on selling company's goods. Specially, to the hotel business that should ensure lots of customer for a long period with the interest and credit of customers, its brand-image is more significant. What the image is looked upon as a important factor in marketing is due to the difficulty of discrimination against goods standardized in price and quality. Therefore, the company's image acts as a more important marketing factor in the high industrial society. Also it means a lot to the customer's purchasing behavior. When the company's brand-image is recognized or discriminated, customer's memory is longer and customer's reliability is raised than other company's advertisement and public information. Nowadays, most of hotels are perceiving the importance on their own brand-image but in the lack of deep study and systematic strategy in reality. The purpose of this study is to research the effect on customer's purchasing intention of hotel brand-image and choice-attribution. The empirical research has been done from 23April, 2004 to 20May, 2004. Data were collected from general customers who are using hotel located in Taegu. In conclusion, hotel brand-image depends highly on, the service quality of hotel staff and reputation of hotel. Besides, this acts on customer's hotel choice decisively.

  • PDF

국가전자도서관 DL 사례

  • 공봉석
    • Proceedings of the Korea Database Society Conference
    • /
    • 1998.09a
    • /
    • pp.293-312
    • /
    • 1998
  • $\square$ 정보화 혁명의 대국민 인식수단과 초고속정보통신망의 주요 응용 서비스로서 부각 $\square$ 전통적인 정보이용방법에 대한 이용자들의 인식의 변화로 도서관 활성화 방안으로써 정보통신기술의 도입 $\square$ 선진 각국의 전자도서관 구축의 국가적 추진 $\square$ 국내 초고속정보통신망의 구축과 보급 확대 $\square$ 모든 국민이 지역, 시간의 제약없이 도서관에 접근하여 필요한 자료를 획득 $\square$ 정보획득시간 단축으로 국내연구자들의 연구력 증진 $\square$ 정보화의 지역격차 해소 $\square$ 국내 도서관의 전자도서관 사업 촉진 $\square$ 주요 전자도서관의 통합연동체제를 마련 $\square$ 주요 도서관별 대상분야 조정으로 중복투자 방지 $\square$ 초고속정보통신망의 주요한 응용서비스로 가시화 - 초고속정보통신망의 선도적 대국민 가시화 - 이에 따른 민간부문의 참여 및 투자 촉진 $\square$ 국가, 산업, 국민생활 정보화의 주요한 기반 구축 $\square$ 지역적 정보불균형 해소 - 일부지역에 편중되어 있는 정보를 인터넷을 이용하여 시.공간 제약없이 제공함으로써 정보의 불균형 해소 $\square$ 전자도서관의 기본모델 제시 -전자도서관의 주요기능인 타기관간 자료연동 및 검색시스템을 구현함으로써 향후 구축되는 전자도서관의 기본모델 제시 $\square$ 전자도서관간 자료공유체제 구축 -시범사업 참여도서관간 분산 관리하고 있는 정보의 공유를 위한 표준체제 구축(중략) 것으로 나타났다.까지 증가율을 보여 주었다. 것으로 나타났다.대표하는 압밀계수의 추정이 가능할 것으로 사료된다. $O_3$/라는 결정학적 관계를 가지며 에피탁샬 성장했음을 알 수 있었다.있었다.다(p<0.05)..8800-0.6800로 각각 표시되었다.~$\pm$10 V의 측정범위에서 memory window가 계속 증가하는 것을 보여주었다./$^{\circ}C$의 고주파 유전특성을 얻었다. 얻었다.끼쳤다.보였다.다. 싸이클링 성능을 보였다.다.보였다.다.고 입력 반사손실을 그림 I, 2, 3에 각각 나타내었다. 대책을 요구하고 있다.하는 경향을 보였다. 생존율은 48시간째부터 폐사하기 시작하여 144시간째에는 전량폐사하였다. 삼투압 조절 능력을 위한 여러가지 파라메타에서 15 $\textperthousand$구는 이상이 없는 것으로 추측되나, 0 $\textperthousand$구에서는 코티졸, Na$^{+}$, K$^{+}$, Cl ̄, 총단백질 및 AST에서 시간경과에 따른 삼투압 조절 능력에 문제가 있는 것으로 보여진다.c}C$에서 5시간 가열조리 후 잔존율은 각각 84.7% 및 73.3%였고, 질소가스 통기하에서는 잔존율이 88.9% 및 81.8%로 더욱 안정하였다.8% 및 12.44%, 201일 이상의 경우 13.17% 및 11.30%로 201일 이상의 유기의 경우에만 대조구와 삭제 구간에 유의적인(p<0.05) 차이를 나타내었다.는 담수(淡水)에서 10%o의 해수(海水)로 이주된지 14일(日) 이후에 신장(腎臟)에서 수축된 것으로 나타났다. 30%o의 해수(海水)에 적응(適應)된 틸라피아의 평균 신사구체(腎絲球體)의 면적은 담수(淡水)에 적응된 개체의 면적보다 유의성

  • PDF

Reinforcement Mining Method for Anomaly Detection and Misuse Detection using Post-processing and Training Method (이상탐지(Anomaly Detection) 및 오용탐지(Misuse Detection) 분석의 정확도 향상을 위한 개선된 데이터마이닝 방법 연구)

  • Choi Yun-Jeong;Park Seung-Soo
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2006.06b
    • /
    • pp.238-240
    • /
    • 2006
  • 네트워크상에서 발생하는 다양한 형태의 대량의 데이터를 정확하고 효율적으로 분석하기 위해 설계되고 있는 마이닝 시스템들은 목표지향적으로 훈련데이터들을 어떻게 구축하여 다룰 것인지에 대한 문제보다는 대부분 얼마나 많은 데이터 마이닝 기법을 지원하고 이를 적용할 수 있는지 등의 기법에 초점을 두고 있다. 따라서, 점점 더 에이전트화, 분산화, 자동화 및 은닉화 되는 최근의 보안공격기법을 정확하게 탐지하기 위한 방법은 미흡한 실정이다. 본 연구에서는 유비쿼터스 환경 내에서 발생 가능한 문제 중 복잡하고 지능화된 침입패턴의 탐지를 위해 데이터 마이닝 기법과 결함허용방법을 이용하는 개선된 학습알고리즘과 후처리 방법에 의한 RTPID(Refinement Training and Post-processing for Intrusion Detection)시스템을 제안한다. 본 논문에서의 RTPID 시스템은 active learning과 post-processing을 이용하여, 네트워크 내에서 발생 가능한 침입형태들을 정확하고 효율적으로 다루어 분석하고 있다. 이는 기법에만 초점을 맞춘 기존의 데이터마이닝 분석을 개선하고 있으며, 특히 제안된 분석 프로세스를 진행하는 동안 능동학습방법의 장점을 수용하여 학습효과는 높이며 비용을 감소시킬 수 있는 자가학습방법(self learning)방법의 효과를 기대할 수 있다. 이는 관리자의 개입을 최소화하는 학습방법이면서 동시에 False Positive와 False Negative 의 오류를 매우 효율적으로 개선하는 방법으로 기대된다. 본 논문의 제안방법은 분석도구나 시스템에 의존하지 않기 때문에, 유사한 문제를 안고 있는 여러 분야의 네트웍 환경에 적용될 수 있다.더욱 높은성능을 가짐을 알 수 있다.의 각 노드의 전력이 위험할 때 에러 패킷을 발생하는 기법을 추가하였다. NS-2 시뮬레이터를 이용하여 실험을 한 결과, 제안한 기법이 AOMDV에 비해 경로 탐색 횟수가 최대 36.57% 까지 감소되었음을 알 수 있었다.의 작용보다 더 강력함을 시사하고 있다.TEX>로 최고값을 나타내었으며 그 후 감소하여 담금 10일에는 $1.61{\sim}2.34%$였다. 시험구간에는 KKR, SKR이 비교적 높은 값을 나타내었다. 무기질 함량은 발효기간이 경과할수록 증하였고 Ca는 $2.95{\sim}36.76$, Cu는 $0.01{\sim}0.14$, Fe는 $0.71{\sim}3.23$, K는 $110.89{\sim}517.33$, Mg는 $34.78{\sim}122.40$, Mn은 $0.56{\sim}5.98$, Na는 $0.19{\sim}14.36$, Zn은 $0.90{\sim}5.71ppm$을 나타내었으며, 시험구별로 보면 WNR, BNR구가 Na만 제외한 다른 무기성분 함량이 가장 높았다.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-performanc

  • PDF

An Improved Estimation Model of Server Power Consumption for Saving Energy in a Server Cluster Environment (서버 클러스터 환경에서 에너지 절약을 위한 향상된 서버 전력 소비 추정 모델)

  • Kim, Dong-Jun;Kwak, Hu-Keun;Kwon, Hui-Ung;Kim, Young-Jong;Chung, Kyu-Sik
    • The KIPS Transactions:PartA
    • /
    • v.19A no.3
    • /
    • pp.139-146
    • /
    • 2012
  • In the server cluster environment, one of the ways saving energy is to control server's power according to traffic conditions. This is to determine the ON/OFF state of servers according to energy usage of data center and each server. To do this, we need a way to estimate each server's energy. In this paper, we use a software-based power consumption estimation model because it is more efficient than the hardware model using power meter in terms of energy and cost. The traditional software-based power consumption estimation model has a drawback in that it doesn't know well the computing status of servers because it uses only the idle status field of CPU. Therefore it doesn't estimate consumption power effectively. In this paper, we present a CPU field based power consumption estimation model to estimate more accurate than the two traditional models (CPU/Disk/Memory utilization based power consumption estimation model and CPU idle utilization based power consumption estimation model) by using the various status fields of CPU to get the CPU status of servers and the overall status of system. We performed experiments using 2 PCs and compared the power consumption estimated by the power consumption model (software) with that measured by the power meter (hardware). The experimental results show that the traditional model has about 8-15% average error rate but our proposed model has about 2% average error rate.