• Title/Summary/Keyword: non-locality

Search Result 46, Processing Time 0.023 seconds

Analysis of Web Server Referencing Characteristics and performance Improvement of Web Server (웹 서버의 참조 특성 분석과 성능 개선)

  • Ahn, Hyo-Beom;Cho, Kyung-San
    • The KIPS Transactions:PartA
    • /
    • v.8A no.3
    • /
    • pp.201-208
    • /
    • 2001
  • Explosive growth of the Web and the non-uniform characteristics of client requests result in the performance degradation of Web servers, and server cache has been recognized as the solution. We analyzed Web server accessing characteristics-repetition, size, and locality of access. Based on the result, we analyzed the cache removal policies and proposed a prefetch strategy to improve the hit ratio of server caches. In addition, through the trace-driven simulation based on the traces from real Web sites, we showed the performance improvement by our proposal.

  • PDF

Duplication-Aware Garbage Collection for Flash Memory-Based Virtual Memory Systems (플래시 메모리 기반의 가상 메모리 시스템을 위한 중복성을 고려한 GC 기법)

  • Ji, Seung-Gu;Shin, Dong-Kun
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.37 no.3
    • /
    • pp.161-171
    • /
    • 2010
  • As embedded systems adopt monolithic kernels, NAND flash memory is used for swap space of virtual memory systems. While flash memory has the advantages of low-power consumption, shock-resistance and non-volatility, it requires garbage collections due to its erase-before-write characteristic. The efficiency of garbage collection scheme largely affects the performance of flash memory. This paper proposes a novel garbage collection technique which exploits data redundancy between the main memory and flash memory in flash memory-based virtual memory systems. The proposed scheme takes the locality of data into consideration to minimize the garbage collection overhead. Experimental results demonstrate that the proposed garbage collection scheme improves performance by 37% on average compared to previous schemes.

Effecient Prefetching Scheme for Hybrid Hard Disk (하이브리드 하드디스크를 위한 효율적인 선반입 기법)

  • Kim, Jeong-Won
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.6 no.5
    • /
    • pp.665-671
    • /
    • 2011
  • The Competitiveness of Hybrid hard disk drive(H-HDD) for solid state disk(SSD) comes from both lower power consumption and higher reading speed. This paper suggests a prefetching scheme that can improve the performance of Non-Volatile cache(NVCache) memory installed on the H-HDD through prefetching disk blocks as well as files to the NVCache. The proposed scheme makes the highly used data such as booting files copy to the NVCache as an unit of file and the frequently accessed blocks copy to the NVCache. This prefetching is done on the idle time of disk queue and the priorities of prefetched target blocks are based on both time and spatial locality of blocks. Experiments results show that the suggested method can improve response time of H-HDD and also lower the power consumption.

Gated Recurrent Unit based Prefetching for Graph Processing (그래프 프로세싱을 위한 GRU 기반 프리페칭)

  • Shivani Jadhav;Farman Ullah;Jeong Eun Nah;Su-Kyung Yoon
    • Journal of the Semiconductor & Display Technology
    • /
    • v.22 no.2
    • /
    • pp.6-10
    • /
    • 2023
  • High-potential data can be predicted and stored in the cache to prevent cache misses, thus reducing the processor's request and wait times. As a result, the processor can work non-stop, hiding memory latency. By utilizing the temporal/spatial locality of memory access, the prefetcher introduced to improve the performance of these computers predicts the following memory address will be accessed. We propose a prefetcher that applies the GRU model, which is advantageous for handling time series data. Display the currently accessed address in binary and use it as training data to train the Gated Recurrent Unit model based on the difference (delta) between consecutive memory accesses. Finally, using a GRU model with learned memory access patterns, the proposed data prefetcher predicts the memory address to be accessed next. We have compared the model with the multi-layer perceptron, but our prefetcher showed better results than the Multi-Layer Perceptron.

  • PDF

Master plan of Seomoon Bridge Area (서문교 활용방안 기본계획)

  • 임영균;유헌준;박종덕;장태현;홍형순
    • Journal of the Korean Institute of Landscape Architecture
    • /
    • v.29 no.3
    • /
    • pp.55-60
    • /
    • 2001
  • The Seomoon Bridge, a new planning site, is located in Sangdang-Gu Seomoon-Dong, Chongju and is the oldest bridge built during the rule of Japanese imperialism. As the name implies, Seomoon Bridge is located on the site adjacent to west gate. The Seomoon Bridge is an important bridge as an historical trace of the vanished town of Chongu. However, as new roads and bridges are built, the Seomoon Bridge is losing its functional aspects and has become an area crowed by many street stalls. Closely located newer to Sajic Fountain, the Seomoon Bridge, which has symbolically significant meaning, now faces many problems such as non-practical use of bridge, indifferent management and non-locality, which creates a negative effect on the surrounding cityscape. given this situation, in 2001, 2, Chongju city published an appeal for public subscription of a practical use plan which may design a new, landmark and establish resting spaces for the public. The basic direction of this planning is designed to be place as the symbolic space representing Chongju, and integrated with the surrounding environmental elements such as Moosim-Cheon(stream) and Sajic Fountain, and as a recreational, resting and leisure space of the public. Especially nightscape of the bridge inspires a fresh impact on many people. Because of the widespread influence of developed cities, diverse spaces which already exist or have disappeared may be reclaimed. By establishing appropriate use plans rather than negligence, this project will propose the improved quality of cityscape and show the possibility of bublic´s outdoor living space, and our team will find out the meaning in these approach methods.

  • PDF

New Flash Memory Management Method for Reliable Flash Storage Systems (신뢰성 있는 플래시메모리 저장시스템 구축을 위한 플래시메모리 저장 공간 관리 방법)

  • Kim, Han-Joon;Lee, Sang-Goo
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.27 no.6
    • /
    • pp.567-582
    • /
    • 2000
  • We propose a new way of managing flash memory space for flash memory-specific file system based on log-structured file system. Flash memory has attractive features such as non-volatility, and fast I/O speed, but it also suffers from inability to update in place and limited usage cycles. These drawbacks require many changes to conventional storage (file) management techniques. Our focus is on lowering cleaning cost and evenly utilizing flash memory cells while maintaining a balance between the two often-conflicting goals. The proposed cleaning method performs well especially when storage utilization and the degree of locality are high. The cleaning efficiency is enhanced by dynamically separating cold data and non-cold data. The second goal, cycle-leveling is achieved to the degree where the maximum difference between erase cycles is below the error range of the hardware. Simulation results show that the proposed method has significant benefit over naxve methods: maximum of 35% reduction in cleaning cost with even spreading writes across segments.

  • PDF

DETECTING VARIABILITY IN ASTRONOMICAL TIME SERIES DATA: APPLICATIONS OF CLUSTERING METHODS IN CLOUD COMPUTING ENVIRONMENTS

  • Shin, Min-Su;Byun, Yong-Ik;Chang, Seo-Won;Kim, Dae-Won;Kim, Myung-Jin;Lee, Dong-Wook;Ham, Jae-Gyoon;Jung, Yong-Hwan;Yoon, Jun-Weon;Kwak, Jae-Hyuck;Kim, Joo-Hyun
    • The Bulletin of The Korean Astronomical Society
    • /
    • v.36 no.2
    • /
    • pp.131.1-131.1
    • /
    • 2011
  • We present applications of clustering methods to detect variability in massive astronomical time series data. Focusing on variability of bright stars, we use clustering methods to separate possible variable sources from other time series data, which include intrinsically non-variable sources and data with common systematic patterns. We already finished the analysis of the Northern Sky Variability Survey data, which include about 16 million light curves, and present candidate variable sources with their association to other data at different wavelengths. We also apply our clustering method to the light curves of bright objects in the SuperWASP Data Release 1. For the analysis of the SuperWASP data, we exploit a elastically configurable Cloud computing environments that the KISTI Supercomputing Center is deploying. Two quite different configurations are incorporated in our Cloud computing test bed. One system uses the Hadoop distributed processing with its distributed file system, using distributed processing with data locality condition. Another one adopts the Condor and the Lustre network file system. We present test results, considering performance of processing a large number of light curves, and finding clusters of variable and non-variable objects.

  • PDF

Efficient Radix-4 Systolic VLSI Architecture for RSA Public-key Cryptosystem (RSA 공개키 암호화시스템의 효율적인 Radix-4 시스톨릭 VLSI 구조)

  • Park Tae geun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.12C
    • /
    • pp.1739-1747
    • /
    • 2004
  • In this paper, an efficient radix-4 systolic VLSI architecture for RSA public-key cryptosystem is proposed. Due to the simple operation of iterations and the efficient systolic mapping, the proposed architecture computes an n-bit modular exponentiation in n$^{2}$ clock cycles since two modular multiplications for M$_{i}$ and P$_{i}$ in each exponentiation process are interleaved, so that the hardware is fully utilized. We encode the exponent using Radix-4. SD (Signed Digit) number system to reduce the number of modular multiplications for RSA cryptography. Therefore about 20% of NZ (non-zero) digits in the exponent are reduced. Compared to conventional approaches, the proposed architecture shows shorter period to complete the RSA while requiring relatively less hardware resources. The proposed RSA architecture based on the modified Montgomery algorithm has locality, regularity, and scalability suitable for VLSI implementation.

Design and Implementation of Trajectory Preservation Indices for Location Based Query Processing (위치 기반 질의 처리를 위한 궤적 보존 색인의 설계 및 구현)

  • Lim, Duk-Sung;Hong, Bong-Hee
    • Journal of Korea Spatial Information System Society
    • /
    • v.10 no.3
    • /
    • pp.67-78
    • /
    • 2008
  • With the rapid development of wireless communication and mobile equipment, many applications for location-based services have been emerging. Moving objects such as vehicles and ships change their positions over time. Moving objects have their moving path, called the trajectory, because they move continuously. To monitor the trajectory of moving objects in a large scale database system, an efficient Indexing scheme to processed queries related to trajectories is required. In this paper, we focus on the issues of minimizing the dead space of index structures. The Minimum Bounding Boxes (MBBs) of non-leaf nodes in trajectory-preserving indexing schemes have large amounts of dead space since trajectory preservation is achieved at the sacrifice of the spatial locality of trajectories. In this thesis, we propose entry relocating techniques to reduce dead space and overlaps in non-leaf nodes. we present performance studies that compare the proposed index schemes with the TB-tree and the R*-tree under a varying set of spatio-temporal queries.

  • PDF

A study of the Implications of French vocabularies and the de-locality in LEE Sang's Poems (이상(李箱)의 시 작품에 구사되는 프랑스어와 탈 지방성)

  • Lee, Byung-soo
    • Cross-Cultural Studies
    • /
    • v.53
    • /
    • pp.1-24
    • /
    • 2018
  • This following research is a study on the use of French and de-locality in the modern Korean poet Lee Sang's poetry (1910-1937). His hometown was Kyung Sung, Seoul. He mainly wrote his works in Korean, Chinese character, and Japanese, using the language of education and his native language at that time. So then, what was the spirit that he wanted to embody through use of French words? By using words like "ESQUISSE", "AMOUREUSE", Sang's French was not a one-time use of foreign words intended to amuse, but to him the words were as meticulously woven as his intentions. French words were harmonized with other non-poetic symbols such as "${\Box}$, ${\triangle}$, ${\nabla}$", and described as a type of typographical hieroglyphics. Instead of his mother-tongue language, French was applied as a surrealistic vocabulary that implemented the moral of infinite freedom and imagination, and expressed something new or extrasensory. Subsequently, the de-localized French (words) in his poetry can be seen as poetic words to implement a "new spirit", proposed by western avant-garde artists. Analysis of French in his poetry, showed a sense of yearning for the scientific civilization, calling for his sense of defeat and escape from the colonized inferior native land. Most of all, comparing his pursuit of western civilization and avant-garde art to French used in his poetry, is regarded as world-oriented poetry intended to implement the new tendency of the "the locomotive of modernity," transcending the territory of the native country.