• Title/Summary/Keyword: 블록배치

Search Result 169, Processing Time 0.027 seconds

A wear-leveling improving method by periodic exchanging of cold block areas and hot block areas (Cold 블록 영역과 hot 블록 영역의 주기적 교환을 통한 wear-leveling 향상 기법)

  • Jang, Si-Woong
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2008.05a
    • /
    • pp.175-178
    • /
    • 2008
  • While read operation on flash memory is fast and doesn't have any constraints, flash memory can not be overwritten on updating data, new data are updated in new area. If data are frequently updated, garbage collection, which is achieved by erasing blocks, should be performed to reclaim new area. Hence, because the number of erase operations is limited due to characteristics of flash memory, every block should be evenly written and erased. However, if data with access locality are processed by cost benefit algorithm with separation of hot block and cold block, though the performance of processing is high, wear-leveling is not even. In this paper, we propose CB-MG (Cost Benefit between Multi Group) algorithm in which hot data are allocated in one group and cold data in another group, and in which role of hot group and cold group is exchanged every period. Experimental results show that performance and wear-leveling of CB-MG provide better results than those of CB-S.

  • PDF

Display Types for Alleviating Negative Attitude toward Advertisements Attached to Web Articles (인터넷 신문기사에 첨부된 광고의 거부감 경감을 위한 광고 제시 방식)

  • Yu, Hyun-Jin;Lim, Seong-Taek;Chung, Jin-Gu;Lee, Ju-Hwan
    • 한국HCI학회:학술대회논문집
    • /
    • 2007.02b
    • /
    • pp.554-559
    • /
    • 2007
  • 최근 인터넷 관련 기술의 급속한 발전으로 사람들의 다양한 사회적, 경제적 행위들이 인터넷을 기반으로 확대되고 있다. 특히 우리나라의 경우 초고속 통신망의 확산과 더불어 인터넷 쇼핑몰과 상거래시장 또한 빠르게 성장하였다. 이러한 상황에서 인터넷을 매체로 하는 광고기법 또한 다양하게 적용되고 있는데, 인터넷을 통한 광고 효과를 극대화하기 위해 인터넷 신문기사 주변에 배치된 배너광고, 팝업광고 등 여러 가지 시도들이 있어왔다. 이러한 시도들은 인터넷 사용자의 편의에 대한 고려보다는 광고내용을 얼마나 잘 전달할 수 있는가에 초점이 맞추어져 있었다. 그러나 광고내용이 잘 전달된다 하더라도 소비자가 그 광고에 대해 불쾌감을 느끼게 된다면 과연 인터넷 광고효과가 높다고 말할 수 없을 것이다. 예를 들어, 팝업광고에 대한 대응책으로 개인적으로 팝업 블록커(pop-up blocker)를 사용하겠는가에 대한 설문조사 결과를 보면 사람들이 팝업 블록커를 이용해서라도 팝업광고를 피하고자 하는 비율이 77%에 달한다는 것을 알 수 있다. 실제로 Windows XP 서비스팩 2 이후의 버전은 인터넷 사용자들의 편의를 위해 자동 팝업 차단기능을 갖추고 있는 실정이다. 팝업광고를 통해 아무리 높은 정보전달 효과가 발생한다 하더라도 사용자들은 팝업광고에 대하여 거부감이나 부정적 감정을 느낄 수 있다. 그리고 광고정보가 전달된다 하더라도 팝업광고에 대한 사용자들의 불편함이 그 광고에 대한 부정적 감정으로 전이되어 광고대상에 대한 이미지에 악영향을 미칠 수 있음에 유의해야 한다. 그러므로 광고효과는 극대화하면서, 혹은 기존의 수준을 유지하면서 광고에 대한 거부감을 줄인 광고형태를 찾기 위한 다양한 노력들이 필요하다. 이를 위해 본 연구에서는 인터넷 신문기사에 첨부된 광고에 대한 사용자의 거부감을 줄일 수 있는 새로운 광고 제시 방식을 찾고자 일반적으로 사용되는 배너와 팝업 등 두 가지 광고 제시 방식과 전면에 돌출하지 않는 형태로 인터넷 신문기사의 배경에 삽입된 광고 제시 방식을 비교하였다. 그 결과, 인터넷 신문기사 영역의 주변 특정 부분(코너나 중간 부분 등)에 광고를 삽입한 배너 형태의 광고와 인터넷 신문기사 위에 광고가 돌출 등장하여 콘텐츠를 가리는 팝업 형태의 광고 제시 방식보다 새롭게 제안된 백그라운드 형태의 광고 제시 방식이 인터넷 신문기사를 읽는 사용자에게 거부감을 줄이며 동시에 광고효과를 유지할 수 있음을 확인하였다. 이러한 결과를 인터넷 광고 제시 방식으로 활용한다면 인터넷 사용자에게 콘텐츠를 방해하여 발생하는 명시적인 거부감(explicit negative attitude)을 줄이면서도 암묵적인(implicit) 광고효과를 얻을 수 있을 것이다.

  • PDF

A Moving Picture Coding Method Based on Region Segmentation Using Genetic Algorithm (유전적 알고리즘을 이용한 동화상의 영역분할 부호화 방법)

  • Jung, Nam-Chae
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.10 no.1
    • /
    • pp.32-39
    • /
    • 2009
  • In this paper, the method of region segmentation using genetic algorithm is proposed for an improvement of efficiency in moving picture coding. A genetic algorithm is the method that searches a large probing space using only a function value for a optimal combination consecutively. By progressing both motion presumption and region segmentation at once, we can assign the motion vector in a image to a small block or a pixel respectively, and transform the capacity of coding and a signal to noise rate into a problem of optimization. That is to say, there is close correlation between region segmentation and motion presumption in motion-compensated prediction coding. This is to optimize the capacity of coding and a S/N ratio. This is to arrange the motion vector in each block of picture according to the state of optimization. Therefore, we examined both the data type of genetic algorithm and the method of data processing to obtain the results of optimal region segmentation in this paper. And we confirmed the validity of a proposed method using the test pictures by means of computer simulation.

  • PDF

A Study On Distributed Remote Lecture Contents for QoS Guarantee Streaming Service (QoS보장형 스트리밍 서비스를 위한 분산 원격강의 컨텐츠에 대한 연구)

  • Choi, Yong-jun;Ku, Ja-hyo;Leem, In-taek;Choi, Byung-do;Kim, Chong-gun
    • The KIPS Transactions:PartA
    • /
    • v.9A no.4
    • /
    • pp.603-614
    • /
    • 2002
  • Delivery efficiency of e-learning media can be influenced by authoring processes. Generally, a moving picture recorded by video camera can be delivered to student by multimedia streaming service, using media server technology. A e-learning media authored by lecture authoring tool is played in a student application by download-based delivery system. Recently, some animation know-how are applied to author e-learning media by hand-operation. In this paper, we suggest a client-based streaming service for the e-leaning media consists of media files and integration data The lecture of e-learning media nay be divided into some time-based small blocks. Each blocks can be located distributed site. The student system gather those blocks by download-scheduling. This is a valid method for QoS guarantee streaming services. In addition to our study, lecturers can author composite e-learning media includes media files and dynamic web pages simply, The distributed e-learning media files of our study is managed by multi-author and updated rapidly.

PRMS: Page Reallocation Method for SSDs (PRMS: SSDs에서의 Page 재배치 방법)

  • Lee, Dong-Hyun;Roh, Hong-Chan;Park, Sang-Hyun
    • The KIPS Transactions:PartD
    • /
    • v.17D no.6
    • /
    • pp.395-404
    • /
    • 2010
  • Solid-State Disks (SSDs) have been currently considered as a promising candidate to replace hard disks, due to their significantly short access time, low power consumption, and shock resistance. SSDs, however, have drawbacks such that their write throughput and life span are decreased by random-writes, nearly regardless of SSDs controller designs. Previous studies have mostly focused on better designs of SSDs controller and reducing the number of write operations to SSDs. We suggest another method that reallocates data pages that tend to be simultaneously written to contiguous blocks. Our method gathers write operations during a period of time and generates write traces. After transforming each trace to a set of transactions, our method mines frequent itemsets from the transactions and reallocates the pages of the frequent itemsets. In addition, we introduce an algorithm that reallocates the pages of the frequent itemsets with moderate time complexity. Experiments using TPC-C workload demonstrated that our method successfully reduce 6% of total logical block access.

A Study on the Layout Patterns of Public Schools in Manhattan - Focused on Relationship between Manhattan Grid Plan and Open Space - (뉴욕시 공립학교에 나타난 배치 특성에 관한 연구 - 맨하튼 가로체계와 외부공간의 관계를 중심으로 -)

  • Kim, Pil-Soo;Jeon, You-Chang
    • Journal of the Korean Institute of Educational Facilities
    • /
    • v.20 no.2
    • /
    • pp.3-14
    • /
    • 2013
  • The purpose of this study is to analyze patterns of public school building layout types, open space and relationship with communities in the Manhattan grid plan. The study illustrates how building layout patterns of school facilities are influenced by societal demands in the urban grid environment. During the nineteenth century, the Island of Manhattan was transformed into a physical representation of the Cartesian coordinate system via the development of the grid street plan. In order to take advantage of streets as urban space, it is quite important to understand characteristics of communities and open space relationships between buildings and streets. Moreover, the strategic planning of schools' outdoor space vitalizes public streets as a critical community anchor. This research reviews 118 Manhattan public schools and categorizes them by (1) building layout type, (2) site type, (3) circulation and public open space, which are the biggest factors that determine the layout patterns of the public schools in Manhattan. As a result of analysis, the layout patterns are classified into seven types : "ㅡ", "L", "ㄷ", "ㅁ", "H", "T" and "other" type. Of these, "ㅡ" type and "L" type occur most frequently, because these configurations most flexibly fit into the limited grid-locked blocks, the various types of site & topography, and adapt most dynamically to the open spaces created by using avenues and streets. The ultimate objective of this study is to provide a case study for future efforts to plan open spaces for campuses that effectively utilize the streets in proximity.

A Case Study of Simulation for the Design of Crankshaft Line in an Automotive Engine Shop (자동차 엔진공장의 크랭크샤프트 라인설계를 위한 시뮬레이션 사례연구)

  • Moon, Dug-Hee;Xu, Te;Shin, Woo-Young
    • Journal of the Korea Society for Simulation
    • /
    • v.17 no.2
    • /
    • pp.1-12
    • /
    • 2008
  • The major components of an engine are the cylinder block, cylinder head, crankshaft, connecting rod, and camshaft, which are more popularly known as the 5 C's. Thus, the engine shop usually consists of six sub-lines, including five machining lines and one assembly line. The flow line is the typical concept of the layout when the engineer designs the engine shop. This paper introduces a simulation study regarding the new crankshaft machining line in a Korean automotive factory. The major factors for designing the machining line are considered, and their effects on the system performance are evaluated with a three-dimensional(3D) simulation model that is developed with $QUEST^{(R)}$. The initial layout is analyzed using the simulation model, and we suggest some ideas for improvement.

  • PDF

Pole Placement Method of a Double Poles Using LQ Control and Pole's Moving-Range (LQ 제어와 근의 이동범위를 이용한 중근의 극배치 방법)

  • Park, Minho
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.21 no.1
    • /
    • pp.20-27
    • /
    • 2020
  • In general, a nonlinear system is linearized in the form of a multiplication of the 1st and 2nd order system. This paper reports a design method of a weighting matrix and control law of LQ control to move the double poles that have a Jordan block to a pair of complex conjugate poles. This method has the advantages of pole placement and the guarantee of stability, but this method cannot position the poles correctly, and the matrix is chosen using a trial and error method. Therefore, a relation function (𝜌, 𝜃) between the poles and the matrix was derived under the condition that the poles are the roots of the characteristic equation of the Hamiltonian system. In addition, the Pole's Moving-range was obtained under the condition that the state weighting matrix becomes a positive semi-definite matrix. This paper presents examples of how the matrix and control law is calculated.

An Efficient Data Replacement Algorithm for Performance Optimization of MapReduce in Non-dedicated Distributed Computing Environments (비-전용 분산 컴퓨팅 환경에서 맵-리듀스 처리 성능 최적화를 위한 효율적인 데이터 재배치 알고리즘)

  • Ryu, Eunkyung;Son, Ingook;Park, Junho;Bok, Kyoungsoo;Yoo, Jaesoo
    • The Journal of the Korea Contents Association
    • /
    • v.13 no.9
    • /
    • pp.20-27
    • /
    • 2013
  • In recently years, with the growth of social media and the development of mobile devices, the data have been significantly increased. MapReduce is an emerging programming model that processes large amount of data. However, since MapReduce evenly places the data in the dedicated distributed computing environment, it is not suitable to the non-dedicated distributed computing environment. The data replacement algorithms were proposed for performance optimization of MapReduce in the non-dedicated distributed computing environments. However, they spend much time for date replacement and cause the network load for unnecessary data transmission. In this paper, we propose an efficient data replacement algorithm for the performance optimization of MapReduce in the non-dedicated distributed computing environments. The proposed scheme computes the ratio of data blocks in the nodes based on the node availability model and reduces the network load by transmitting the data blocks considering the data placement. Our experimental results show that the proposed scheme outperforms the existing scheme.

A File System for User Special Functions using Speed-based Prefetch in Embedded Multimedia Systems (임베디드 멀티미디어 재생기에서 속도기반 미리읽기를 이용한 사용자기능 지원 파일시스템)

  • Choe, Tae-Young;Yoon, Hyeon-Ju
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.7
    • /
    • pp.625-635
    • /
    • 2008
  • Portable multimedia players have some different properties compared to general multimedia file server. Some of those properties are single user ownership, relatively low hardware performance, I/O burst by user special functions, and short software development cycles. Though suitable for processing multiple user requests at a time, the general multimedia file systems are not efficient for special user functions such as fast forwards/backwards. Soml' methods has been proposed to improve the performance and functionality, which the application programs give prediction hints to the file system. Unfortunately, they require the modification of all applications and recompilation. In this paper, we present a file system that efficiently supports user special functions in embedded multimedia systems using file block allocation, buffer-cache, and prefetch. A prefetch algorithm, SPRA (SPeed-based PRefetch Algorithm) predicts the next block using I/O patterns instead of hints from applications and it is resident in the file system, so doesn't affect application development process. From the experimental file system implementation and comparison with Linux readahead-based algorithms, the proposed system shows $4.29%{\sim}52.63%$ turnaround time and 1.01 to 3,09 times throughput in average.