• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.3
• /
• pp.324-336
• /
• 2000

The paper proposes an efficient buffer management scheme to enhance performance of the disk I/O system. Without any user level information, the proposed scheme automatically detects the block reference patterns of applications by associating block attributes with forward distance of a block. Based on the detected patterns, the scheme applies an appropriate replacement policy to each application. We also present a new block allocation scheme to improve the performance of buffer cache when kernel needs to allocate a cache block due to a cache miss. The allocation scheme analyzes the cache hit ratio of each application based on block reference patterns and allocates a cache block to maximize cache hit ratios of system. These all procedures are performed on-line, as well as automatically at system level. We evaluate the scheme by trace-driven simulation. Experimental results show that our scheme leads to significant improvements in hit ratios of cache blocks compared to the traditional schemes and requires low overhead.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.4A
• /
• pp.282-287
• /
• 2005

The space time block code(STBC) can not provide simultaneously both full diversity and full transmission rate in a transmit diversity system having more than two transmit antennas.. There are a quasi orthogonal STBC for four transmit antennas that provides full transmission rate and minimized interference. Recently, a simple correlation canceling algorithm is introduced to achieve full diversity from STBC considering four transmit antennas. In this paper, we propose a new decoding procedure using the power allocation at the transmitter and subtraction interference process at the receiver to achieve a better performance without noise enhancement.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.1
• /
• pp.136-140
• /
• 2015

Linux environment that is commonly used at embedded systems supports various file systems as Ext2, FAT, NTFS, etc. The file system that is equiped on the embedded system is mostly implemented on mini hard disk or flash memory. The types of the file system of the system make an effect on the performance of a application programs. The factors of file system performance on a same media are block read, block write and block free time. On these factors, block read and block free time are not so different according to the type of file systems. This paper evaluates the performance benchmark of file systems supported by linux about block allocation and write performance. The results obtained from various experiments shows the characteristics of each file system.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.2 no.2
• /
• pp.52-60
• /
• 1999

By implementing the Systems Engineering process for the aircraft preliminary design, functional analysis study is performed, hence Functional Interface Data Flow(FIDF) and Functional Flow Block Diagram(FFBD) are generated. Based on FIDF and FFBD, allocable and non-allocable design/performance/RM＆S requirements are allocated to the appropriate levels. Weight and cost tracking and design margin management methodologies are studied and implemented for the balanced aircraft design.

• Journal of KIISE:Computer Systems and Theory
• /
• v.37 no.5
• /
• pp.272-284
• /
• 2010

Flash Memory differs from the hard disk, because it cannot be overwritten. Most of the flash memory file systems use not-in-place update mechanisms for the update. Flash memory file systems execute sometimes block cleaning process in order to make writable space while performing not-in-place update process. Block cleaning process collects the invalid pages and convert them into the free pages. Block cleaning process is a factor that affects directly on the performance of the flash memory. Thus this paper suggests the efficient page allocation method, which reduces block cleaning cost by minimizing the numbers of block that has valid and invalid pages at a time. The result of the simulation shows an increase in efficiency by reducing more block cleaning costs than the original YAFFS.

• Journal of Satellite, Information and Communications
• /
• v.5 no.1
• /
• pp.94-99
• /
• 2010

In this paper, we discuss a proposed two hop relay network with PB/MC-CDMA(partial block MC-CDMA) technique. The main advantages of PB/MC-CDMA system are the increased cell capacity and the high quality of performances. In the system, we employ relay scheme to focus on the coverage reduction and hotspot problem, hotspot is a location where a cluster of users are blocked or dropped for the reason of insufficient frequency resources. Frequency resource allocation scheme is put forward in a three cells system according to each problem. The simulation result shows the performance of the two hop transmission is better than the direct transmission and the proposed network can support much more users to relief hotspot effect compared to the conventional one.

• The KIPS Transactions:PartA
• /
• v.13A no.5 s.102
• /
• pp.387-398
• /
• 2006

In this paper, we propose a new page allocation scheme for flash memory file system. The proposed scheme allocates pages by exploiting the concept of Purity, which is defined as the fraction of blocks where valid Pages and invalid Pages are coexisted. The Pity determines the cost of block cleaning, that is, the portion of pages to be copied and blocks to be erased for block cleaning. To enhance the purity, the scheme classifies hot-modified data and cold-modified data and allocates them into different blocks. The hot/cold classification is based on both static properties such as attribute of data and dynamic properties such as the frequency of modifications. We have implemented the proposed scheme in YAFFS and evaluated its performance on the embedded board equipped with 400MHz XScale CPU, 64MB SDRAM, and 64MB NAND flash memory. Performance measurements have shown that the proposed scheme can reduce block cleaning time by up to 15.4 seconds with an average of 7.8 seconds compared to the typical YAFFS. Also, the enhancement becomes bigger as the utilization of flash memory increases.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.6
• /
• pp.99-105
• /
• 2022

This paper deals with the problem of appropriately allocating multiple processors arriving at the ready queue to the block in the user space of the main memory is divided into blocks of variable size at compilation time. The existing allocation methods, first fit(FF), best fit(BF), worst fit(WF), and next fit(NF) methods, had the disadvantage of waiting for a specific processor because they failed to allocate all processors arriving at the ready queue. The proposed algorithm in this paper is a simple block packing algorithm that allocates as many processors as possible to the largest block by sorting the size of the partitioned blocks(holes) and the size of the processor in the ready queue in descending order. The application of the proposed algorithm to nine benchmarking experimental data showed the performance of allocating all processors while having minimal internal fragment(IF) for all eight data except one data in which the weiting processor occurs due to partition errors.

• ETRI Journal
• /
• v.24 no.4
• /
• pp.280-289
• /
• 2002

In this work, we present a novel approach to the bit allocation problem that aims to minimize overall distortion subject to a bit rate constraint. The optimal solution can be found by the Lagrangian method with dynamic programming. However, the optimal bit allocation for block-based interframe coding is practically unattainable because of the interframe dependency of macroblocks caused by motion compensation. To reduce the computational burden while maintaining a result close to the optimum, i.e., near optimum, we propose an alternative method. First, we present a partitioned form of the bit allocation problem: a "frame-level problem" and "one-frame macroblock-level problems." We show that the solution to this new form is also the solution to the conventional bit allocation problem. Further, we propose a bit allocation algorithm using a "two-phase optimization technique" with an interframe dependency model and a rate-distortion model.

• Journal of Navigation and Port Research
• /
• v.32 no.9
• /
• pp.737-742
• /
• 2008

In this paper, we deal with an allocation model of vertical type container yard for minimizing the total ATC (Automated Transfer Crane) working time and the equivalence of ATC working load in each block on automated container terminal. Firstly, a layout of automated container terminal yard is shown The characteristic of equipment which work in the terminal and its basic assumption are given Next, an allocation model which concerns with minimizing the total working time and the equivalence of working load is proposed for effectiveness of ATC working in automated container terminal. Also, a weight values on critical function are suggested to adjust the critical values by evaluating the obtained allocation plan. For ATC allocation algorithm, we suggest a simple repeat algorithm for on-line terminal operation.