• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.8
• /
• pp.377-384
• /
• 2007

With the advance of VLSI technology, the capacity and density of memories is rapidly growing. In this paper, We proposed a reallocation algorithm for faulty memory part to efficient reallocation with row and column redundant memory. Reallocation information obtained from faulty memory by only every test. Time overhead problem occurs geting reallocation information as every test. To its avoid, one test resulted from reallocation information can save to flash memory. In this paper, reallocation information increases efficiency using flash memory.

• The KIPS Transactions:PartB
• /
• v.8B no.6
• /
• pp.601-608
• /
• 2001

The automated assignment of multiple tasks to executing agents is a key problem in the area of multi-agent systems. In many domains, significant savings can be achieved by reallocating tasks among agents with different costs for handling tasks. The automation of task reallocation among self-interested agents requires that the individual agents use a common negotiation protocol that prescribes how they have to interact in order to come to an agreement on "who does what". In this paper, we introduce the multi-agent Traveling Salesman Problem(TSP) as an example of task reallocation problem, and suggest the Vickery auction as an interagent negotiation protocol for solving this problem. In general, auction-based protocols show several advantageous features: they are easily implementable, they enforce an efficient assignment process, and they guarantce an agreement even in scenarios in which the agents possess only very little domain-specific Knowledge. Furthermore Vickrey auctions have the additional advantage that each interested agent bids only once and that the dominant strategy is to bid one′s true valuation. In order to apply this market-based protocol into task reallocation among self-interested agents, we define the profit of each agent, the goal of negotiation, tasks to be traded out through auctions, the bidding strategy, and the sequence of auctions. Through several experiments with sample multi-agent TSPs, we show that the task allocation can improve monotonically at each step and then finally an optimal task allocation can be found with this protocol.

• Journal of Broadcast Engineering
• /
• v.15 no.1
• /
• pp.89-98
• /
• 2010

In this paper, the technical analyzing methodology has been suggested to preserve the same transmission quality of a M/W system used for FM broadcasting link after the frequency reallocation. The simulation was also performed for the actual M/W system operating in each frequency band, and its results were evaluated in terms of an availability based upon a fade margin. It was confirmed that only if the relative fade margin of more than 2.6 dB at 1700 MHz is provided, the equivalent service quality may be obtained regardless of the frequency reallocation. The suggested method will be expected to be widely used for accessing service quality of the M/W system concerned with the frequency reallocation.

• Nuclear Engineering and Technology
• /
• v.55 no.7
• /
• pp.2432-2437
• /
• 2023

Methodology for suppressing or recovering the distorted spectra, which may occur due to mutual non-uniformity and nonlinear response when a multi-detector is simultaneously operated for gamma spectroscopy, is presented with respect to its applicability to stabilization of spectra having the non-identical feature using modified full spectrum reallocation method. The modified full-spectrum reallocation method is extended to provide multiple coefficients that describe the gain drift for multi-division of the spectrum and they were incorporated into an optimization process utilizing a random sampling algorithm. Significant performance improvements were observed with the use of multiple coefficients for solving partial peak dislocation. In this study, our achievements to confirm the stabilization of spectrum having differences in moments and modify the full spectrum reallocation method provide the feasibility of the method and ways to minimize the implication of the non-linear responses normally associated with inherent characteristics of the detector system. We believe that this study will not only simplify the calibration process by using an identical response curve but will also contribute to simplifying data pre-processing for various studies as all spectra can be stabilized with identical channel widths and numbers.

• Journal of Labour Economics
• /
• v.27 no.2
• /
• pp.29-66
• /
• 2004

In this paper, I investigate job creation and destruction in Korean mining and manufacturing between 1982 and 2000 using the raw data of Annual Mining and Manufacturing Survey. The rate of job creation and destruction of continuing plants averaged 9.75 and 10.33, respectively, which are higher than those of OECD countries, Chile, and Colombia. The created jobs showed weak persistence and the concentration of job reallocation is high, compared with other countries. Job reallocation accounts for major fraction of worker reallocation and the fraction has increased before 1997. Analysis of time series data of job flow revealed a general pattern of pro-cyclic job creation and counter-cyclic job destruction. However job reallocation in Korea is strongly acyclic whereas the rate is known to be counter-cyclical in the U.S.

• 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.

• 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.

• Industrial Engineering and Management Systems
• /
• v.7 no.1
• /
• pp.57-65
• /
• 2008

Available-to-promise (ATP) exhibiting availability of manufacturing resources can be used to support customer order promising. Recently, one advanced function called Capable-to-promise (CTP) is provided by several modern APS (advanced planning system) that checks available capacity for placing new production orders or increasing already scheduled production orders. At the customer enquiry stage while considering the order delivery date and quantity to quote, both ATP and CTP are allocated to support order promising. In particular, current trends of mass customization and multi-side production chain derive several new constraints that should be considered when ATP/CTP allocation planning for order promising - such as customer's preference plants or material vendors, material compatibility, etc. Moreover, ATP/CTP allocation planning would be executed over a rolling time horizon. To utilize capacity and material manufacturing resource flexibly and fulfill more customer orders, ATP/CTP rolling planning should possess resource reallocation mechanism under the constraints of order quantities and delivery dates for all previous order promising. Therefore, to enhance order promising with reliability and flexibility to reallocate manufacturing resource, the ATP/CTP reallocation planning mechanism is needed in order to reallocate material and capacity resource for fulfilling all previous promised and new customer orders beneficially with considering new derived material and capacity constraints.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.45 no.2
• /
• pp.69-81
• /
• 2008

The density of Memory has been increased by great challenge for memory technology, so elements of memory become smaller than before and the sensitivity to faults increases. As a result of these changes, memory testing becomes more complex. The number of storage elements is increased per chip, and the cost of test becomes more remarkable as the cost per transistor drops. Proposed design doesn't need to control from outside environment, because it integrates into memory. The proposed scheme supports the various memory testing algorithms. Consequently, the proposed one is more efficient in terms of test cost and test data to be applied. Moreover, we proposed a reallocation algorithm for faulty memory parts. It has an efficient reallocation scheme with row and column redundant memory. Previous reallocation information is obtained from faulty memory every each tests. However proposed scheme avoids to this problem. because onetime test result from reallocation information can save to flash memory. In this paper, a reallocation scheme has been increased efficiency because of using flash memory.

• 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.