• Journal of KIISE:Computer Systems and Theory
• /
• v.37 no.3
• /
• pp.172-183
• /
• 2010

Virtual memory systems (VM) reduce disk I/Os caused by page faults using page prefetching, which reads pages together with a desired page at a page fault in a single disk I/O. Operating systems including 4.4BSD attempt to prefetch as many pages as possible at a page fault regardless of page access patterns of applications. However, such an approach increases a disk access time taken to service a page fault when a high portion of the prefetched pages is not referenced. More seriously, the approach can cause the memory pollution, a problem that prefetched pages not to be accessed evict another pages that will be referenced soon. To solve these problems, we propose an adaptive page prefetching control scheme (APC), which periodically monitors access patterns of prefetched pages in a process unit. Such a pattern is represented as the ratio of referenced pages among prefetched ones before they are evicted from memory. Then APC uses the ratio to adjust the number of pages that 4.4BSD VM intends to prefetch at a page fault. Thus APC allows 4.4BSD VM to prefetch a proper number of pages to have a better effect on reducing disk I/Os, though page access patterns of an application vary in runtime. The experiment of our technique implemented in FreeBSD 6.2 shows that APC improves the execution times of SOR, SMM, and FFT benchmarks over 4.4BSD VM by up to 57%.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.6
• /
• pp.23-33
• /
• 1996

The exploitation of locality of reference in shared memory NUMA multiprocessors is one of the improtant problems in parallel processing today. In this paper, we propose a revised hardeare reference counter to help operating system to manage locality. In contrast to the previous one, the value of counter can abe adjusted dynamically and periodically to adapt the page replication policy to the various memory reference patterns of processors. We use execution-driven simulation of real applications to evaluate the effectiveness of our adjustable DELAY counter. Our main conclusijon is that by using the adjustable DELAY counter the t normalized average memory access costs and the variance of them become smaller for most applications than the previous one and more robust memory management policies can be provided for the operating systems.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.9
• /
• pp.1870-1877
• /
• 2012

Transient signals generally have short duration and variable length with time-varying and non-stationary characteristics. Thus frame-based pattern matching method is useful for classification of transient signals. In this paper, we propose a new method for classification of underwater transient signals using a Gaussian mixture model(GMM). We carried out classification experiments for various underwater transient signals depending upon the types of noise, signal-to-noise ratio, and number of mixtures in the GMM. Experimental results have verified that the proposed method works quite well for classification of underwater transient signals.

• Journal of the Korean Society of Manufacturing Technology Engineers
• /
• v.22 no.1
• /
• pp.77-84
• /
• 2013

In this paper, we review two-dimensional measuring methods referring to target patterns. The patterns consist of two linearly-repeated patterns or is designed repeatedly in two-dimension. The repeated properties are reflectivity, refractivity, air-gapping distance, capacitance, magnetic reluctance, electrical resistance and sloping gradient, etc. However, the optical methods are generally used for high speed processing and density, and their encoding principles are treated here. In case of two-dimensional pattern, as there is not inherently error between single units encoding the pattern except for the metrology frame errors, the end-effector position of an object accompanying the pattern can be measured with respect of the global frame without via error. Therefore, it is regarded as a substitute for laser interferometer with severe environmental constraints and has been applied to the high-accurate planar actuator.

• Journal of Digital Contents Society
• /
• v.9 no.1
• /
• pp.77-86
• /
• 2008

False sharing is a result of co-location of unrelated data in the same unit of memory coherency, and is one source of unnecessary overhead being of no help to keep the memory coherency in multiprocessor systems. Moreover, the damage caused by false sharing becomes large in proportion to the granularity of memory coherency. To reduce false sharing in page-based DSM systems, it is necessary to allocate unrelated data objects that have different access patterns into the separate shared pages. In this paper we propose sized and call-site tracing-based shared memory allocator, shortly SCSTallocator. SCSTallocator places each data object requested from the different call-sites into the separate shared pages, and at the same time places each data object that has different size into different shared pages. Consequently data objects that have the different call-site and different object size prohibited from being allocated to the same shared page. Our observations show that our SCSTallocator outperforms the existing dynamic shared memory allocators. By combining the two existing allocation technique, we can reduce a considerable amount of false sharing misses.

• The KIPS Transactions:PartB
• /
• v.13B no.5 s.108
• /
• pp.547-552
• /
• 2006

There have been various cohesion measurements studied considering reference relation among attributes and methods in a class. Generally, these cohesion measurement are camed out in one class. If the range of reference relation considered are extended from one class to two classes, we could find out the reference relation between two classes. Tn this paper, we proposed a neural network to determine the method location. Neural network is effective to predict output value from input data not to be included in training and generalize after training input and output pattern repeatedly. Learning vector is generated with 30-dimensional input vector and one target binary values of method location in a constraint that there are two classes which have less than or equal to 5 attributes and methods The result of the proposed neural network is about 95% in cross-validation and 88% in testing.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.1
• /
• pp.42-50
• /
• 2016

Recently, researches about the communication between LED array and the camera (alias 'Visual-MIMO'), have been actively conducted, and the application to the vehicle and a smart phone is expected to be maximized. Since the bit error may occur if the ISI is severe in a LED array, it is necessary to switch from the multiplexing to the diversity mode. In this paper, according to the use or not of a reference array pattern, a method for determining the transition time to the diversity mode is suggested and verified. When using the reference pattern, it determines the transition time to the diversity mode from the multiplexing using the brightness information of the received image. If the reference array pattern is not used, the size of LED array compared to the entire image according to the distance is used and the size of the LED array at the distance of a severe ISI may be used for the determination of transition time to the diversity. Finally, the proposed method is verified through the simulation and hardware experiments as well as by analyzing the performance in accordance with the ISI level and the distance.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.8
• /
• pp.2253-2261
• /
• 1999

ACK generates optimized code using the string pattern matching technique in pattern table generator and peephole optimizer. But string pattern matching method is not effective due to the many comparative actions in pattern selection. We designed and implemented the EM intermediate code optimizer using tree pattern matching algorithm composed of EM tree generator, optimization pattern table generator and tree pattern matcher. Tree pattern matching algorithm practices the pattern matching that centering around root node with refer to the pattern table, with traversing the EM tree by top-down method. As a result, compare to ACK string pattern matching methods, we found that the optimized code effected to pattern selection time, and contributed to improved the pattern selection time by about 10.8%.

• Proceedings of the Korea Contents Association Conference
• /
• 2007.11a
• /
• pp.426-429
• /
• 2007

CrossRef operates a cross-publisher citation linking system based on the DOI(R) global identifier. The number of organization building a reference citations linking structure through CrossRef is increasing. This paper concentrates on developing a Citation Matcher Solution to effectively build the reference linking structure. Citation Matcher automatically builds and processes the reference citation and identifier mapping which used to be handled manually. After the copy & paste of the reference citation, analyzation is processed to parse the journal title, author name, volume, issue, and start pages from the free style text. CrossRef, PubMed, and YesKISTI's identifiers are collected by through a standardized method. Renovation of the building process for domestic scholastic resources' reference linking and matching will be made possible by using a Citation Matcher. The connection between resources and seamless access for the electronic full-text will enhance the usability.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.8
• /
• pp.1899-1907
• /
• 2013

This paper presents an efficient defect detection and classification system based on reference image for COF (Chip-on-Film) which encounters fatal defects after ultra fine pattern fabrication. These defects include typical ones such as open, mouse bite (near open), hard short and soft short. In order to detect these defects, conventionally it needs visual examination or electric circuits. However, these methods requires huge amount of time and money. In this paper, based on reference image, the proposed system detects fatal defect and efficiently classifies it to one of 4 types. The proposed system includes the preprocessing of the test image, the extraction of ROI, the analysis of local binary pattern and classification. Through simulations with lots of sample images, it is shown that the proposed system is very efficient in reducing huge amount of time and money for detecting the defects of ultra fine pattern COF.