• Annual Conference of KIPS
• /
• 2014.11a
• /
• pp.227-230
• /
• 2014

LTE 3GPP standard defines several QCI (QoS Class Identifier) classes to provide differential QoS, depending on the requirements of different user applications.These QCI values have been characterized in terms of priority, packet loss and delay budget. In spite of the availability of this robust QoS framework in LTE, there is no such scheduling algorithm that has its working principle based on this framework. The responsibility of fulfilling the user requirements, while satisfying the service class requirements is left upon the cellular service provider and it is an open issue at present. To solve this problem, we have proposed a MAC scheduler, which defines the priority of different users based on their bearer specification and provides desired QoS in terms of the achieved throughput through the resource block allocation based on calculated user priority.

• Journal of Information Technology Services
• /
• v.20 no.3
• /
• pp.87-101
• /
• 2021

Since the introduction of block chain technology, its potential use in financial service area have been increasing, and financial firms are seeking ways to take advantage of the benefits of it. The purpose of this study is to present an approach to prioritize block chain-based services for bank. Toward this, we picked out potential financial services through focus group interview and derived the criteria that can be used in evaluating the priorities of block chain-based banking services in the same way. Then, we propose an analytic hierarchy process model to help decision makers prioritize the banking services while considering multiple criteria of technology issues, governmental regulations in the financial industry, cost, managerial issues, customers' needs, and the business opportunity for the bank. By using the analytic hierarchy process model, we can estimate the weighting coefficients to be assigned to each criteria and determine the order of priority in determining the best block chain-based service for the case study bank. The results show that banking login authentication would be forefront service, followed by money transfer, document notarization, and trade financing service in the order, and the trade financing could be most important service in terms of the business profitability for the bank in the future.

• Journal of the Korea Safety Management & Science
• /
• v.13 no.3
• /
• pp.45-53
• /
• 2011

The research proposes seven elimination rules of redundant gates and blocks in Fault Tree Analysis (FTA) and Reliability Block Diagram (RBD). The computational complexity of cut sets and path sets is NP-hard. In order to reduce the complexity of Minimal Cut Set (MCS) and Minimal Path Set (MPS), the paper classifies generation algorithms. Moreover, the study develops six implementation steps which reflect structural importance (SI) and reliability importance (RI) from Reliability Centered Maintenance (RCM) that a priority of using the functional logic among components is to reduce (improve) the system unavailability (or availability). The proposed steps include efficient generation of state structure function by Rare Event Enumeration (REA). Effective use of importance measures, such as SI and ill measures, is presented based on the number and the size of MCS and MPS which is generated from the reference[5] of this paper. In addition, numerical examples are presented for practitioners to obtain the comprehensive understanding of six steps that is proposed in this research.

• Journal of The Korean Digital Architecture Interior Association
• /
• v.8 no.2
• /
• pp.83-92
• /
• 2008

This study is about architectural design for rural housing block redevelopment for districts with existing residents considering sustainable development. The study suggests development direction focusing on preserving the regional characteristics, and presentation of suburban-style housing complex reflecting on the future tenant's individuality and demand. The preexisting development approach for suburban-style housing complex which was planned by the developer, failed to recognize taste of the future tenants. Profitability being the priority, it also resulted in a serious environmental disruption. In this development however, through a systematic direction for site development and site analysis, conducting surveys through future tenants, attempted for a continuous growth of the community. The study is presented covering the following areas; site's pathway system, nature conservation plan, lot plan, land use, arrangement plan, housing plan and community facility.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.10
• /
• pp.82-94
• /
• 2015

In this paper, we propose hardware prefetch mechanism with an efficient cache replacement policy by giving priority to the trigger block in which a spatial region and producing a spatial region by using the displacement field. It could be taken into account the sequence of the program since a history is based on the trigger block of history record, and it could be quickly prefetching the instructions or data address by adding a stored value to the trigger address and displacement field since a history is stored as a displacement value. Also, we proposed a method of replacing at random by the cache replacement policy from the low priority block when the cache area is full after giving priority to the trigger block. We analyzed using the memory simulator program gem5 and PARSEC benchmark to assess the performance of the hardware prefetcher. As a result, compared to the existing hardware prefecture to generate the spatial region using a bit vector, L1 data cache miss rate was reduced about 44.5% on average and an average of 26.1% of L1 instruction misses occur. In addition, IPC (Instruction Per Cycle) showed an improvement of about 23.7% on average.

• Industrial Engineering and Management Systems
• /
• v.11 no.3
• /
• pp.276-287
• /
• 2012

Determining storage locations of containers is an important issue for efficient operation of container terminals. This study assumes a storage yard with a horizontal layout in which blocks are laid out in parallel to the quay and trucks enter at the side of a block to deliver (receive) a container to (from) the yard crane. Various storage rules for determining storage locations of containers are introduced. Simulation studies are conducted for evaluating various rules. The following guidelines are derived from the result of our simulation study: when designing a block, consider a block configuration in which the longest gantry and the longest trolley travel times of rail-mounted gantry cranes (RMGCs) are similar; do not restrict the types of containers that can be stored in a storage area; if different roles are to be assigned to different storage areas, one possible way is to divide a bay into two areas so that some rows in the bay are allocated to inbound containers while the other rows in the same bay are allocated to outbound containers; reserve the space in bay unit for a high productivity of RMGCs but reserve the space in stack unit when the storage space is not enough; when the storage space is not sufficient, allocate storage location in a way of starting from the end and ending at the middle of a block; for reducing the travel distance of internal trucks, provide a higher priority to a block nearer to the berthing position of the corresponding vessel.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.7
• /
• pp.369-376
• /
• 2002

Although LRU is not adequate for database that has non-uniform reference pattern, it has been adopted in most database systems due to the absence of the proper alternative. We analyze database block reference pattern with the realistic database trace. Based on this analysis, we propose a new cache replacement policy. Trace analysis shows that extremely non-popular blocks take up about 70 % of the entire blocks. The influence of recency on blocks' re-reference likelihood is at first strong due to temporal locality, however, it rapidly decreases and eventually becomes negligible as stack distance increases. Based on this observation, RCB(Reference Characteristic Based) cache replacement policy, which we propose in this paper, classifies the entire blocks into four block groups by blocks' recency and re-reference likelihood, and operates different priority evaluation methods for each block group. RCB policy evicts non-popular blocks more quickly than the others and evaluates the priority of the block by frequency that has not been referenced for a long time. In a trace-driven simulation, RCB delivers a better performance than the existing polices(LRU, 2Q, LRU-K, LRFU). Especially compared to LRU. It reduces miss count by 5~l2.7%. Time complexity of RCB is O(1), which is the same with LRU and 2Q and superior to LRU-K(O(log$_2$N)) and LRFU(O(l) ~ O(log$_2$N)).

• Journal of the Society of Naval Architects of Korea
• /
• v.50 no.5
• /
• pp.298-306
• /
• 2013

Nowadays, a transporter manager plans the schedule of the block transportation by considering the experience of the manager, the production process of the blocks and the priority of the block transportation in shipyard. The schedule planning of the block transportation should be rearranged for the reflection of the path blocking cases occurred by unexpected obstacles or delays in transportation. In this paper, the optimal block transportation path planning system is developed for rearranging the schedule of the block transportation by considering the damaged path. $A^*$ algorithm is applied to calculate the new shortest path between the departure and arrival of the blocks transported through the damaged path. In this algorithm, the first node of the damaged path is considered as the starting position of the new shortest path, and then the shortest path calculation is completed if the new shortest path is connected to the one of nodes in the original path. In addition, the data structure for the algorithm is designed. This optimal block transportation path planning system is applied to the Philippine Subic shipyard and the ability of the rapid path modification is verified.

• Proceedings of the Korea Society of Information Technology Applications Conference
• /
• 2005.11a
• /
• pp.179-182
• /
• 2005

The Home Phoneline Networking Alliance (HomePNA) 2.0 technology can establish a home network using existing in-home phone lines, which provides a channel rate of 4 - 32 Mbps. HomePNA 2.0 Medium Access Control (MAC) protocol adopts an IEEE 802.3 Carrier Sense Multiple Access with Collision Detection (CSMA/CD) access method, a Quality of Service (QoS) algorithm, and a Distributed Fair Priority Queuing (DFPQ) collision resolution algorithm. In this paper, we analyze the HomePNA 2.0 MAC protocol and propose the architecture of HomePNA 2.0 MAC controller circuit. Then, we present the simulation result of each block included in the HomePNA 2.0 MAC controller.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.11 no.1
• /
• pp.33-39
• /
• 2011

H.264 decoders usually have pipeline architecture by a macroblock or a 4 ${\times}$ 4 sub-block. The period of the pipeline is usually fixed to guarantee the operation in the worst case which results in many idle cycles and higher data bandwidth. Adaptive pipeline architecture for H.264 decoders has been proposed for efficient decoding and lower the requirement of the bandwidth for the memory bus. However, it requires a controller for the adaptive priority control to utilize the advantage. We propose a smart bus arbiter that replaces the controller. It is introduced to adjust the priority adaptively the QoS (Quality of Service) control of the decoding process. The smart arbiter can be integrated the arbiter of bus systems and it works when certain conditions are met so that it does not affect the original functions of the arbiter. An H.264 decoder using the proposed architecture is designed and implemented to verify the operation using an FPGA.