• Journal of the Korea Society for Simulation
• /
• v.8 no.4
• /
• pp.61-72
• /
• 1999

This paper presents an estimation method of container handling capacity and selection of resource allocation strategies of container terminals using the computer simulation models. Simulation models are developed to model container terminal consisting of 4 berths considering the berth allocation strategies, crane allocation strategies and the total number of container cranes using Arena simulation package. The proposed models do not consider the yard operations and gate operations. All the input parameters for the models are estimated on the basis of the existing container terminal operation data and the planning data for the automated container terminal planned by Korean government. Four berth allocation strategies and three crane allocation strategies are considered. The total number of container cranes considered ranges from 12 to 15. Non-terminating simulation techniques are utilized for the performance comparison among alternatives. The performance measures such as average ship turnaround time, average ship waiting time, average ship service time, the number of containers handled per year, and the number of ships processed per year are used. The result shows that the berth allocation strategy minimizing the sum of the number of ships waiting, the number of busy container cranes and number of ships handled performs better than any other berth allocation strategies. In addition, the crane allocation strategy allocating up to 5 container cranes per berth performs better than any other crane allocation strategies. Finally there are no significant performance differences among the alternatives consisting of different total number of container cranes allocated.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.1
• /
• pp.204-226
• /
• 2018

Big data processing applications have been migrated into cloud gradually, due to the advantages of cloud computing. Hadoop Distributed File System (HDFS) is one of the fundamental support systems for big data processing on MapReduce-like frameworks, such as Hadoop and Spark. Since HDFS is not aware of the co-location of virtual machines in the cloud, the default scheme of block allocation in HDFS does not fit well in the cloud environments behaving in two aspects: data reliability loss and performance degradation. In this paper, we present a novel location-aware data block allocation strategy (LDBAS). LDBAS jointly optimizes data reliability and performance for upper-layer applications by allocating data blocks according to the locations and different processing capacities of virtual nodes in the cloud. We apply LDBAS to two stages of data allocation of HDFS in the cloud (the initial data allocation and data recovery), and design the corresponding algorithms. Finally, we implement LDBAS into an actual Hadoop cluster and evaluate the performance with the benchmark suite BigDataBench. The experimental results show that LDBAS can guarantee the designed data reliability while reducing the job execution time of the I/O-intensive applications in Hadoop by 8.9% on average and up to 11.2% compared with the original Hadoop in the cloud.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.1
• /
• pp.17-27
• /
• 2012

Broadcast-based data dissemination has become a widely accepted approach of communication in the mobile computing environment. However, with a large set of data items, the expected delay of receiving a desired data increases due to the sequential nature of the broadcast channel. This paper explores the issue of designing proper data allocation on multiple broadcast channels to reduce this wait time, and proposes a new data allocation scheme named near optimal data allocation(NODA). The proposed scheme first partitions all data items in K group based on the theoretical lower-bound of the average expected delay to determine data items which each broadcast channel has to broadcast. Then, NODA further partitions each group of data items in B groups using extended dynamic programming algorithm to broadcast data items allocated on the same broadcast channel in different frequencies. The proposed scheme is capable of minimizing the average expected delay time since it can broadcast data items allocated on the same channel reflecting their popularities.

• Industrial Engineering and Management Systems
• /
• v.14 no.4
• /
• pp.413-419
• /
• 2015

This study solved the problem of unstable production chains by considering allocation rate conformance. We proposed two phased algorithm suitable for solving production planning that considers allocation rate conformance; the first phase was heuristic initial solution generation, and the second phase was tabu-search based solution improvement. By using three data sets which have different sizes of data and three different criteria, the results of proposed algorithm were compared with MIP results. The proposed algorithm showed the best production plan in terms of allocation rate conformance, and it was appropriate for other criteria; it solved the problem of unstable production chains by solving concentrated and unfair allocation.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.6
• /
• pp.592-598
• /
• 2000

The locality of data references at the distributed shared memory systems affects the performance significantly. Data allocation methods by considering the locality of data references can improve the performance of DSM systems. This paper evaluates the performance for the dynamic limited directory scheme which data allocation methods can apply very effectively. The information of the data allocation is used by the dynamic limited directory scheme to set the presence bit effectively. And the proper use of the presence bit improves the performance by reducing memory overhead and using directory pool efficiently. Simulations are conducted using three application programs which have various data sharing. The results show that the optimal data allocation method improves the performance up to 3.6 times in the proposed scheme.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.2
• /
• pp.1-7
• /
• 2016

In this paper, we propose in this paper present a novel locality data allocation policy as COLD(Correlated Locality Data) allocation policy. COLD is defined as a set of data that will be updated together later. By distributing a COLD into a NAND block separately, it can preserve th locality. In addition, by handling multiple COLD simultaneously, it can obtain the parallelism among NAND chips. We perform two experiment to demonstrate the effectiveness of the COLD data allocation policy. First, we implement COLD detector, and then, analyze a well-known workload. And we confirm the amount of COLD found depending on the size of data constituting the COLD. Secondly, we compared the traditional page-level mapping policy and COLD for garbage collection overhead in actual development board Cosmos OpenSSD. Experimental results have shown that COLD data allocation policy is significantly reduces the garbage collection overhead. Also, we confirmed that garbage collection overhead vary depending on the COLD size.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.8
• /
• pp.1-8
• /
• 2007

In this paper, we evaluate a performance on a resource allocation algorithm for prioritized data services in CDMA networks supporting real-time and non-real-time data services. The weighted aggregate data throughput is used to characterize the performance of the prioritized data service. Our prioritized data service is implemented so that the weighted aggregate data throughput is maximized via efficient power and spreading gain allocation. Numerical experiments are performed to evaluate a suboptimal resource allocation algorithm for typical parameters.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.16 no.1
• /
• pp.33-39
• /
• 2020

A smart grid is a next-generation power grid that can improve energy efficiency by applying information and communication technology to the general power grid. The smart grid makes it possible to exchange information about electricity production and consumption between electricity providers and consumers in real-time. Advanced metering infrastructure (AMI) is the core technology of the smart grid. The AMI provides two-way communication by installing a modem in an existing digital meter and typically include smart meters, data collection units, and meter data management systems. Because the AMI requires data collection units to control multiple smart meters, it is essential to ensure network availability under heavy network loads. If the load on the work done by the data collection unit is high, it is necessary to allocation new data collection units to ensure availability and improve energy efficiency. In this paper, we discuss the allocation scheme of data collection units for the energy efficiency of the AMI.

• Journal of Korea Multimedia Society
• /
• v.5 no.3
• /
• pp.316-322
• /
• 2002

In this paper we consider continuous block allocation scheme of UNIX file system to support real time retrieval service. The proposed block allocation scheme is designed to place real time data at appropriate disk block location in considering the consume-rate that is given with real time data. To effectively determine the disk block location we analyze the relationship between consume-rate and the two variable factors that are the number of continuous blocks and the cylinder distance of logically consecutive data. In traditional UNIX block allocation scheme it is in fact impossible to find continuous free disk blocks in a specific cylinder location. Thus we propose new bitmap-based free block allocation scheme that enables to determine whether a block in specific cylinder location is free state, or not.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.97-100
• /
• 1997

Fieldbuses are used as the lowest level communication network for real-time communication in factory automation and process control systems. Data generated from field devices can be divided into three categories: sporadic real-time, periodic real-time and non real-time data. Since these data share one fieldbus network medium, it needs a method that allocate the limited bandwidth of fieldbus network to the sporadic real-time, periodic real-time and non real-time traffic. This paper introduces an implementation method of bandwidth allocation scheme introduced in [51 on PROFIBUS. Using the modified PROFIBUS FDL(Fieldbus Data Link layer), the bandwidth allocation scheme introduced in [51 is verified by the experiments.