• Journal of the Korea Society for Simulation
• /
• v.21 no.2
• /
• pp.59-67
• /
• 2012

A grid computing consists of the physical resources for processing one of the large-scale jobs. However, due to the recent trends of rapid growing data, the grid computing needs a parallel processing method to process the job. In general, each physical resource divides a requested large-scale task. And a processing time of the task varies with an efficiency and a distance of each resource. Even if some resource completes a job, the resource is standing by until every divided job is finished. When every resource finishes a processing, each resource starts a next job. Therefore, this paper proposes a dynamic resource reallocation scheduling model (DDRSM). DDRSM finds a waiting resource and reallocates an unfinished job with an efficiency and a distance of the resource. DDRSM is an efficient method for processing multiple large-scale jobs.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.30 no.1
• /
• pp.8-14
• /
• 2007

This paper addresses the allocation planning of the storage location in a warehouse system that the dedicated storage method is used. In the discrete finite time period model, the demands for storage location of products are dynamic for time periods. The planning is to determine the reallocation time period and the storage location of the products in reallocation time period, which minimizes costs. The cost factors are the reallocation cost, the travel cost within warehouse and the surplus storage location cost. A model is formulated, and the property of optimal solution is characterized. The dynamic programming algorithm is developed, and a numerical example is shown.

• Journal of Information Technology and Architecture
• /
• v.10 no.1
• /
• pp.1-11
• /
• 2013

Various computing systems are used in naval ships. Since each system has a single purpose and its applications are tightly coupled with the physical machine, applications cannot share physical resources with each other. It is hard to utilize resources efficiently in conventional naval shipboard computing environment. In this paper, we present an integration architecture for virtualized naval shipboard computing systems based on open architecture. Our proposed architecture integrates individual computing resources into one single integrated hardware pool so that the OS and applications are encapsulated as a VM. We consider the issue of varying needs of all applications in a naval ship that have different purposes, priorities and requirements. We also present parallel VM migration algorithm that improves the process time of resource reallocation of given architecture. The evaluation results with the prototype system show that our algorithm performs better than conventional resource reallocation algorithm in process time.

• The KIPS Transactions:PartC
• /
• v.10C no.1
• /
• pp.95-102
• /
• 2003

In order to guarantee the survivability of essential services against attacks based on new methodology, we need a solution to recognize important resources for the services and to adapt the urgent situation properly. In this paper, we present a dynamic resource reallocation scheme which is one of the core technologies for the construction of intrusion tolerant systems. By means of resource reallocation within a host, this scheme enables selected essential services to survive even after the occurrence if a system attack. Experimental result obtained on a test-bed reveals the validity of the proposed scheme for resource reallocation. This scheme may work together with IDS (Intrusion Detection System) to produce more effective responsive mechanisms against attacks.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.17 no.2
• /
• pp.83-92
• /
• 2024

Currently, various countries are enhancing accessibility by providing bicycle rental services for convenient usage within daily life. This paper introduces the Nubija public bicycle service in Changwon, South Korea, aiming to address the imbalance between demand and supply of Nubija bicycles. We propose a Highest Priority Reallocation Scheme to prevent this disparity. Comparing this scheme with others that randomly visit terminals for redistribution and those that prioritize terminals closest to current locations, we illustrate its superior efficiency. Our proposed Highest Priority Reallocation Scheme prioritizes terminals with the highest demand and shortest distances nearby. Through experiments, our proposed scheme demonstrates superior performance, with the lowest average of 817.44km distance and an average of 6437.45 times, i.e., 88.14% successful rental occurrences. This highlights its superiority over the other two algorithms.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.22 no.4
• /
• pp.173-182
• /
• 1997

In this paper, an efficient dynamic channel assignment scheme is suggested, which consists of two types of channel allocation strategies : ordinary channel allocation strategy and channel reallocation strategy. An analysis on the handoff probabilities of handoff and new calls is also performed, and using the analyzed handoff probability, the presented scheme is compared with other existing schemes in terms of three types of blocking probabilities- new call blocking probability, handoff call blocking probability, and network blocking probability (incomplete service probability). Simulation results show that the presented scheme significantly reduces those blocking probabilities over the existing schemes. Furthermore, the scheme has much smaller number of reallocation than other schemes.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.12
• /
• pp.714-723
• /
• 2003

In order to guarantee system survivability against attacks based on new methodology, we need a solution to recognize important resources for essential services and to adapt the urgent situation properly. In this paper, we present a dynamic resource reallocation scheme which is one of the core technologies for the implementation of intrusion tolerant systems. By means of resource reallocation within a node, this scheme enables the essential services to survive even after the occurrence of a system attack. If the settlement does not work within the node, resource reallocation among nodes takes places, thus the essential services are transferred to another prepared server node. Experimental result obtained on a testbed reveals the validity of the proposed scheme for resource reallocation. This scheme may work together with IDS(Intrusion Detection System) to produce effective responsive mechanism against attacks.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.4
• /
• pp.31-37
• /
• 2008

In this paper, we propose a dynamic job relocation strategy that considering application's characteristics in multiple grid sites. This scheme classifies application to execute in multiple grid sites by their characteristics : computing intensive application, network intensive application. Also, it eliminates the communication between sites by allocating the network intensive application in single site, thus reducing the total job execution time. But if a number of free nodes to execute the network intensive application aren't found in single site, the proposed scheme the first allocates the network intensive application in multiple sites to minimize network latency. Then if the network intensive application being executed in multiple sites suitable free nodes are found in single site. the proposed scheme relocates the application being executed in multiple sites to another single site. This results in reducing the total job execution time. Through simulation, we show that the proposed dynamic job reallocation strategy improves the performance of Data Grid environment compared with previous strategies.

• Journal of KIISE:Computing Practices and Letters
• /
• v.8 no.3
• /
• pp.251-260
• /
• 2002

The parallel/distributed processing with a lot of the idle hosts on the web has the high coot-performance ratio for large-scale applications. It's processing has to show the solutions for unpredictable status such as heterogeneity of hosts, variability of hosts, autonomy of hosts, the supporting performance continuously, and the number of hosts which are participated in computation and so on. In this paper, we propose the strategy of adaptive tack reallocation based on performance the host job processing, spread out geographically Also, It shows the scheme of dynamic host management with dynamic environment, which is changed by lots of hosts on the web during parallel processing for large-scale applications. This paper implements the PDSWeb (Parallel/Distributed Scheme on Web) system, evaluates and applies It to the generation of rendering image with highly intensive computation. The results are showed that the adaptive task reallocation with the variation of hosts has been increased up to maximum 90% and the improvement in performance according to add/delete of hosts.

• The KIPS Transactions:PartA
• /
• v.10A no.1
• /
• pp.7-14
• /
• 2003

In order to cope with DoS (Denial of Service) attacks disturbing delivery of intended services by exhausting resources of computing nodes, we need a solution to recognize important resources for the essential services which have to be maintained under any circumstances and to adapt the system to the urgent situation and reconfigure itself properly. In this paper, we present a two-phase scheme to handle the problem. In the first phase, by means of dynamic resource reallocation within a computing node, we try to make the selected essential services survive even after the occurrence of an attack. For the second phase when it becomes impossible to continue the service in spite of the actions taken in the first phase, we apply server replication in order to continue the transparent provision of the essential services with the end users by utilizing redundant computing nodes previously arranged. Experimental result obtained on a testbed reveals the validity of the proposed scheme. A comparison with other proposed schemes has been conducted by analyzing the performance and the cost.