• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.10B
• /
• pp.1648-1664
• /
• 2000

This paper proposes a real-time dynamic storage allocation algorithm QSHF(quick-segregated-half-fit) that provides various memory allocation policies. that manages a free block list per each word size for memory requests of small size good(segregated)-fit policy that manages a free list per proper range size for medium size requests and half-fit policy that manages a free list per proper range size for medium size requests and half-fit policy that manages a free list per each power of 2 size for large size requests. The proposed algorithm has the time complexit O(1) and makes us able to easily estimate the worst case execution time(WCET). This paper also suggests two algorithm that finds the proper free list for the requested memory size in predictable time and if the found list is empty then finds next available non-empty free list in fixed time. In order to confirm efficiency of the proposed algorithm we simulated the memory utilization of each memory allocation policy. The simulation result showed that each policy guarantees the constant WCET regardless of memory size but they have trade-off between memory utilization and list management overhead.

• Proceedings of the KSR Conference
• /
• 2008.06a
• /
• pp.647-652
• /
• 2008

Railway signal system has been more complex, larger and required high reliability. So, maintenance by experience must be changed to optimize maintenance program or introduced systematic method for estabilish new maintenance program. In this paper, we introduced the maintenance period decision method which are Age based method and Block replacement method based on the failure distribution for the equipment. So, we allocated optimum maintenacne period for the railway signal equipment using block replacement method.

• IE interfaces
• /
• v.22 no.1
• /
• pp.63-72
• /
• 2009

This paper considers a transporter scheduling problem under dynamic block transportation environment in shipbuilding. In dynamic situations, there exist the addition, cancellation or change of block transportation requirements, sudden breakdowns and maintenance of transporters. The transportation of the blocks in the shipyard has some distinct characteristics. Some blocks are available to be picked up at a specific time during the planning horizon while some other blocks need to be delivered before a specific time. These requirements cause two penalty times: 1) delay times incurred when a block is picked up after a required start time, and 2) tardy times incurred when a block shipment is completed after the required delivery time. The blocks are located at different areas in the shipyard and transported by transporters. The objective of this paper is to propose a heuristic algorithm based on a network flow model which minimize the weighted sum of empty transporter travel times, delay times, and tardy times. Also, a rolling-horizon scheduling method is proposed for dynamic block transportation environment. The performance of the proposed heuristic algorithms are evaluated through a simulation experiment.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.5
• /
• pp.2233-2252
• /
• 2018

For the problem of cross-layer joint resource allocation (JRA) in the Long-Term Evolution (LTE)-Advanced standard using carrier aggregation (CA) technology, it is difficult to obtain the optimal resource allocation scheme. This paper proposes a joint resource allocation algorithm based on the weights of user's average quality of experience (JRA-WQOE). In contrast to prevalent algorithms, the proposed method can satisfy the carrier aggregation abilities of different users and consider user fairness. An optimization model is established by considering the user quality of experience (QoE) with the aim of maximizing the total user rate. In this model, user QoE is quantified by the mean opinion score (MOS) model, where the average MOS value of users is defined as the weight factor of the optimization model. The JRA-WQOE algorithm consists of the iteration of two algorithms, a component carrier (CC) and resource block (RB) allocation algorithm called DABC-CCRBA and a subgradient power allocation algorithm called SPA. The former is used to dynamically allocate CC and RB for users with different carrier aggregation capacities, and the latter, which is based on the Lagrangian dual method, is used to optimize the power allocation process. Simulation results showed that the proposed JRA-WQOE algorithm has low computational complexity and fast convergence. Compared with existing algorithms, it affords obvious advantages such as improving the average throughput and fairness to users. With varying numbers of users and signal-to-noise ratios (SNRs), the proposed algorithm achieved higher average QoE values than prevalent algorithms.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.11 no.4
• /
• pp.309-317
• /
• 2011

This paper describes a baseband analog (BBA) chain for wireless local area network (WLAN) applications. For the given specifications of the receiver BBA chain, the optimum allocation of the gain and filter rejection of each block in a BBA chain is achieved to maximize the SFDR. The fully integrated BBA chain is fabricated in 0.13 ${\mu}m$ CMOS technology. An input-referred third-order intercept point (IIP3) of 22.9 dBm at a gain of 0.5 dB and an input-referred noise voltage (IRN) of 32.2 nV/${\surd}$Hz at a gain of 63.3 dB are obtained. By optimizing the allocation of the gain and filter rejection using the proposed design methodology, an excellent SFDR performance of 63.9 dB is achieved with a power consumption of 12 mW.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.05a
• /
• pp.693-694
• /
• 2014

This paper proposes a new pipelined dynamic bandwidth allocation algorithm for XG-PON (10-Gbps-capable passive optical network) passive optical networks) system. The pipelined algorithm is used when a dynamic bandwidth allocation algorithm cannot finished in an unit time. In the proposed mechanism, the request is immediately transferred to each pipeline block to improve performance.

• IE interfaces
• /
• v.14 no.4
• /
• pp.394-402
• /
• 2001

In this study, we deal a spatial scheduling system for the block painting process in the shipbuilding industry. In general, the spatial scheduling for the block painting process is a very complicated task. Because spatial allocation of each block in blasting and painting cells is considered simultaneously. Thus the spatial scheduling for the block painting process is the problem of planning and control of operation, which arises in shipyard. This system is developed for blocks to meet the delivery date given by the shipyard production planning system, to maximize space utilization of blasting and painting cells and to balance workload among working teams. And it has been tested using actual scheduling data from a shipyard and successfully applied in a paint shop in a shipbuilding company.

• IE interfaces
• /
• v.21 no.3
• /
• pp.274-282
• /
• 2008

This paper considers a transporter scheduling problem under dynamic block transportation environment in shipbuilding. In dynamic situations, there exist the addition or cancellation of block transportation requirements, sudden breakdowns and maintenance of transporters. The transportation of the blocks in the shipyard has some distinct characteristics. Some blocks are available to be picked up at a specific time during the planning horizon while some other blocks need to be delivered before a specific time. These requirements cause two penalty times : 1) delay times incurred when a block is picked up after a required start time, and 2) tardy times incurred when a block shipment is completed after the required delivery time. The blocks are located at different areas in the shipyard and transported by transporters. The objective of this paper is to propose heuristic algorithms which minimize the weighted sum of empty transporter travel times, delay times, and tardy times. Four heuristic algorithms for transporter scheduling are proposed and their performance is evaluated.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.18 no.2
• /
• pp.511-527
• /
• 2024

This paper proposes a block-based self-organizing time-division multiple access (BSO-TDMA) protocol for very high frequency (VHF) data exchange system (VDES) in shipborne ad-hoc networks (SANETs). The BSO-TDMA reduces the collisions caused by the simultaneous transmission of automatic identification system (AIS) messages by uniformly allocating channel resources using a block-wise frame. For this purpose, the BSO-TDMA includes two functional operations: (1) frame configuration and (2) slot allocation. The first operation consists of block division and block selection. A frame is divided into multiple blocks, each consisting of fixed-size subblocks, by using the reporting interval (RI) of the ship. Then, the ship selects one of the subblocks within a block by considering the number of occupied slots for each subblock. The second operation allocates the slots within the selected subblock for transmitting AIS messages. First, one of the unoccupied slots within the selected subblock is allocated for the periodic transmission of position reports. Next, to transmit various types of AIS messages, an unoccupied slot is randomly selected from candidate slots located around the previously allocated slot. Experimental simulations are conducted to evaluate the performance of BSO-TDMA. The results show that BSO-TDMA has better performance than that of the existing SOTDMA.

• Journal of Satellite, Information and Communications
• /
• v.6 no.1
• /
• pp.19-27
• /
• 2011

In this paper, we propose the data stream allocation algorithms for maximizing sum capacity of downlink multiuser MIMO (Multiple-input Multiple-output) systems with BD (Block Diagonalization). The conventional BD precoding algorithms maximize the capacity by controlling power against channel gain of each user. In multiuser MIMO systems, however, the number of data streams for each user can be used to as another control parameter, which determines the capacity. This paper proposes the data stream allocation algorithm of BD for increasing capacity in multiuser MIMO systems. The proposed algorithm allocates unequal bit stream to each user based on channel matrix of each user for maximizing sum capacity. It is proved that proposed algorithm can achieve the significantly improved sum capacity by computer simulation.