• Title/Summary/Keyword: Spacial Locality

Search Result 8, Processing Time 0.02 seconds

Efficient Shear-warp Volume Rendering using Spacial Locality of Memory Access (메모리 참조 공간 연관성을 이용한 효율적인 쉬어-왑 분해 볼륨렌더링)

  • 계희원;신영길
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.31 no.3_4
    • /
    • pp.187-194
    • /
    • 2004
  • Shear-Warp volume rendering has many advantages such as good image Quality and fast rendering speed. However in the interactive classification environment it has low efficiency of memory access since preprocessed classification is unavailable. In this paper we present an algorithm using the spacial locality of memory access in the interactive classification environment. We propose an extension model appending a rotation matrix to the factorization of viewing transformation, it thus performs a scanline-based rendering in the object and image space. We also show causes and solutions of three problems of the proposed algorithm such as inaccurate front-to-back composition, existence of hole, increasing computational cost. This model is efficient due to the spacial locality of memory access.

An Efficient Flash Translation Layer Considering Temporal and Spacial Localities for NAND Flash Memory Storage Systems

  • Kim, Yong-Seok
    • Journal of the Korea Society of Computer and Information
    • /
    • v.22 no.12
    • /
    • pp.9-15
    • /
    • 2017
  • This paper presents an efficient FTL for NAND flash based SSDs. Address translation information of page mapping based FTLs is stored on flash memory pages and address translation cache keeps frequently accessed entries. The proposed FTL of this paper reduces response time by considering both of temporal and spacial localities of page access patterns in translation cache management. The localities of several well-known traces are evaluated and determine the structure of the cache for high hit ratio. A simulation with several well-known traces shows that the presented FTL reduces response time in comparison to previous FTLs and can be used with relatively small size of caches.

Reversible data hiding algorithm using spatial locality and the surface characteristics of image

  • Jung, Soo-Mok;On, Byung-Won
    • Journal of the Korea Society of Computer and Information
    • /
    • v.21 no.8
    • /
    • pp.1-12
    • /
    • 2016
  • In this paper, we propose a very efficient reversible data hiding algorithm using spatial locality and the surface characteristics of image. Spacial locality and a variety of surface characteristics are present in natural images. So, it is possible to precisely predict the pixel value using the locality and surface characteristics of image. Therefore, the frequency is increased significantly at the peak point of the difference histogram using the precisely predicted pixel values. Thus, it is possible to increase the amount of data to be embedded in image using the spatial locality and surface characteristics of image. By using the proposed reversible data hiding algorithm, visually high quality stego-image can be generated, the embedded data and the original cover image can be extracted without distortion from the stego-image, and the embedding data are much greater than that of the previous algorithm. The experimental results show the superiority of the proposed algorithm.

An Efficient Cache Management Scheme of Flash Translation Layer for Large Size Flash Memory Drives

  • Choi, Hwan-Pil;Kim, Yong-Seok
    • Journal of the Korea Society of Computer and Information
    • /
    • v.20 no.11
    • /
    • pp.31-38
    • /
    • 2015
  • Nowadays, large size flash memory drives with more than a couple of hundreds of gigabytes are common. This paper presents an efficient cache management scheme of flash translation layer, called TPC-FTL, for large size flash memory drives. Since flash drives of large size usually contain large size RAM, we can enhance the performance of page mapping cache by using more RAM for the cache. But if the size exceeds a threshold, the existing schemes are impractical for real devices, because the time for cache manipulation becomes too long. TPC-FTL manages the cache in translation page unit, not in logical page number unit used in existing schemes. Since a translation page covers a large number of logical page numbers (for example, 512 for 2KB size page), the number of cache elements can be reduced up to a practical level. A performance evaluation shows that average response time, an important performance measure, is better than existing schemes via the effect of utilizing spacial locality in addition to temporal locality.

Prefetching Methods of User's Moving Pattern with Spacial and Temporal Locality in Mobile Information Service Environment (이동 정보 서비스 환경에서 공간.시간 지역성을 가진 사용자의 이동 패턴을 고려한 프리페칭)

  • Choi, In-Seon;Kim, Hyung-Jin
    • Proceedings of the KAIS Fall Conference
    • /
    • 2011.05a
    • /
    • pp.433-436
    • /
    • 2011
  • 사용자의 이동성으로 인하여 이동 정보서비스 환경에서 안정된 서비스 품질(QoS)로 사용자가 원하는 정보를 제공받는데 많은 한계점이 있다. 이동성과 더불어 무선 네트워크의 낮은 대역폭, 높은 전송지연 등의 고유 특성을 부분적으로 보완하기 위해서 유효 데이터의 캐쉬 혹은 프리페칭 기법의 적용이 심도 있게 연구되고 있다. 본 논문은 공간지역성과 시간지역성을 가진 사용자의 이동패턴을 고려한 프리페칭기법을 제안한다. 제안한 프리페칭기법은 사용자의 특정 영역의 방문 빈도수와 일정 시간 이상 머물러 있었던 정도에 따라 정보의 중요도가 높은 것으로 판단하여 이를 적용함으로써 프리페칭의 유효성을 높이는 기초를 제공한다.

  • PDF

A study on Architectural Characteristics of Exhibited Houses at the Choseon Exhibition(1929) - Focused on the Relationship of Exhibited Houses in Japan - (조선박람회 출품주택의 건축계획 특성에 관한 연구 - 일본의 박람회 출품주택과 관계를 중심으로 -)

  • Chung, Soon-Young
    • Journal of architectural history
    • /
    • v.17 no.2
    • /
    • pp.7-25
    • /
    • 2008
  • This study aims to clarify the architectural characteristics of three houses of Choseon Exhibition. Exposition/exhibitions were thought to be a model for the world. It shows the real status of the development, and thinking with visions at that times; therefore, exhibited house models would be a good source for what to be considered for the ideal houses of that times. Through the study, we could find out as belows. 1. The houses exhibited conserved the sitting-on-floor living style, otherwise the most proposals for house improvement suggested a chair-and-table style because of its hygienic quality and integration of the life at home and at work(school, too). 2. The spacial scheme for-family prior over for-guest was emphasized, but models at the exhibition were structured with Japanese traditional spacial program, such as Jashiki(座敷), Kyakunoma(客の間) or Tsuginoma(次の間), which were all Tatami-floored. 3. Through this exhibition, it is clarified that the architectural society in colonial Korea also tried to improve the modern housings, not only direct reception of the developed proposals. These houses was planned with the acceptance of the locality, such like Ondol, a floor heating facility which the Japanese engineer improve the efficiency. 4. Also these exhibited houses became a start to recognize a house as a product, and spurred on commercialization. As the result, we could find out that these exhibited houses accepted the modern housing proposals selectively, and that even if the exhibitions shows the advance in usual these houses were planned with the very conservative notions.

  • PDF

Communication Schedule for GEN_BLOCK Redistribution (GEN_BLOCK간 재분산을 위한 통신 스케줄)

  • Yook, Hyun-Gyoo;Park, Myong-Soon
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.27 no.5
    • /
    • pp.450-463
    • /
    • 2000
  • Array redistribution is usually required to enhance algorithm performance in many parallel programs on distributed memory multicomputers. GEN_BLOCK redistribution, which is redistribution between different GEN_BLOCKs, is essential for load balancing. However, prior research on redistribution has been focused on regular redistribution, such as redistribution between different CYCLIC(N)s. GEN_BLOCK redistribution is very different from regular redistribution. Message passing in regular redistribution involves repetitions of basic message passing patterns, while message passing for GEN_BLOCK redistribution shows locality. This paper proves that two optimal condition, reducing the number of communication steps and minimizing redistribution size, are essential in GEN_BLOCK redistribution. Additionally, by adding a relocation phase to list scheduling, we make an optimal scheduling algorithm for GEN_BLOCK redistribution. To evaluate the performance of the algorithm, we have performed experiments on a CRAY T3E. According to the experiments, it was proven that the scheduling algorithm shows better performance and that the conditions are critical in enhancing the communication speed of GEN_BLOCK redistribution.

  • PDF

The Patterns and Characteristics of Traditional Houses in Modernization Period(1876-1945) in Kyungpuk Province -Mainly about the Patterns of Site Plan and Plan Layout- (경북지방(慶北地方) 근대(近代) 한옥(韓屋)의 유형과 성격 -배치 및 평면유형을 중심으로-)

  • Lee, Ho-Yeol
    • Journal of architectural history
    • /
    • v.6 no.3 s.13
    • /
    • pp.89-108
    • /
    • 1997
  • This study has been researched mainly about the gradual changing patterns of site plan and plan layout of 17 sampling traditional houses in kyungpuk province during the time period of 1877-1945. The objective of this study is to closely examine the characteristics of locality and trend of the times. Survey and Measured drawing, personal interviews with clients has been carried out and the result is as down below; 1.The certain changes have shown that the furnace in sarangchae(outer wing for men) in ㅁ shaped and ${\ulcorner}$ ${\lrcorner}$ shaped houses served only for that purpose and inner gate has been built in sideward of sarangchae. 2.As living standard was upgraded storage space and size of the rooms got bigger. On the other hand, spacial formation was emphasized by its function accordding to house activities and living circulation because the family members in direct line became reality of the time. 3.The modernistic thought of rationalism and convenience are well expressed in the plan layout and house living as a whole.

  • PDF