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

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.149.3-149
• /
• 2001

Task allocation is a key problem in multiagent systems. The importance of automated negotiation protocols for solving the task allocation problem is increasing as a consequence of increased multi-agent applications. In this paper, we introduce the multiagent Traveling Salesman Problem(TSP) as an example of task reallocation problem, and suggest Vickery auction as an inter-agent coordination mechanism for solving this problem. In order to apply this market-based coordination mechanism into multiagent TSPs, we define the profit of each agent, the ultimate goal of negotiation, cities to be traded out through auctions, the bidding strategy, and the order of auctions. The primary advantage of such approach is that it can find an optimal task allocation ...

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

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.11
• /
• pp.9-15
• /
• 2014

In this paper, We propose a block reallocation algorithm for reducing network traffic in Hadoop cluster. The scheduler of Hadoop cluster receives a job from users. And the job is divided into multiple tasks assigned to nodes. At this time, the scheduler allocates the task to the node that satisfied data locality. If a task is assigned to the node that does not have the data(block) to be processed, the task is processed after the data transmission from another node. There is difference of workload among nodes because blocks in cluster have different access frequency. Therefore, the proposed algorithm relocates blocks according to the task allocation pattern of Hadoop scheduler. Eventually, workload of nodes are leveled, and the case of the task processing in a node that does not have the block to be processing is reduced. Thus, the network traffic of the cluster is also reduced. We evaluate the proposed block reallocation algorithm by a simulation. The simulation result shows maximum 23.3% reduction of network consumption than default delay scheduling for jobs processing.

• Journal of information and communication convergence engineering
• /
• v.1 no.3
• /
• pp.109-114
• /
• 2003

There is an emergence of Internet applications that have real-time requirements. These applications require IP to support guaranteed capacity, higher priority and lower packet loss rate. To address this, the Internet Engineering Task Force (IETF) is developing a set of protocols and standards for Integrated Services on the Internet. Using RSVP and policies to manage the allocation of network resources in order to provide different levels of service is a topic of great interest to service providers. Currently, it is not possible to dynamically reallocate resources during an application's session. This paper discusses how policies in conjunction with new service class can provide a more enhanced network resource allocation by allowing for this dynamic reallocation.

• Journal of Ocean Engineering and Technology
• /
• v.16 no.6
• /
• pp.76-81
• /
• 2002

The purpose of this study is to set up the optimum economical formation of the purse seiner fishing system. For this task, the characteristics of existing purse-seiner fishing system were reviewed, and the possible formations of the fleet in tile purse-seiner fishing system were examined through the reallocation of function for each individual vessel. In addition, economic evaluations of the possible formations of the fleet are carried out. Consequently, it was found that 2-vessel formations have the most economic efficiency. Then, a conceptual system design for the main vessel in the 2-vessel formations was performed. As a result, this paper can be used as a helpful guideline to develop the most profitable and economical fishing system in the fleet type fishery.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10b
• /
• pp.85-87
• /
• 2001

다수의 이익-추구형 에이전트들 간의 자동화된 협상 과정을 통해 합리적으로 작업 분배가 이루어질 수 있도록 조정하는 것은 대부분의 다중 에이전트 시스템에서 매우 중요한 문제이다. 본 연구에서는 대표적인 다중 에이전트 작업 재할당 문제의 하나로서 다중 에이전트 외판원 여행 문제를 설명하고, 이 문제를 풀기 위한 조정 메커니즘으로 Vickrey 경매 프로토콜의 적용을 제안하였다. 대표적인 시장기반의 조정 메커니즘인 Vickrey 경매의 적용을 위해 본 논문에서는 각 에이전트의 이익, 협상의 최종 목표, 경매대상, 각 에이전트의 입찰전략, 전체적인 경매 진행과정 등을 정의하였다. 이와 같이 설계된 시장기반의 조정메커니즘의 장점은 각 에이전트의 이익만을 고려함으로써 문제를 단순화할 수 있고, 복잡도가 큰 중앙-집중식 제어 메커니즘이 필요치 않으며, 따라서 각 에이전트의 자율성을 최대한 보장할 수 있고, 큰 협상비용을 들이지 않고 최적의 할당에 도달할 수 있다는 점등이다. 본 논문에서는 하나의 다중 에이전트 외판원 여행문제에 대한 풀이과정을 통해 앞서 설계된 Vickrey 경매프로토콜의 진행방식을 설명하고 그 효과와 효율성을 예시하였다.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.36 no.3
• /
• pp.573-586
• /
• 2016

In construction jobs, a combination of various kinds of machinery is used to perform earthworks at a large-scale site. Individual equipments essentially cooperate with each other on task such as excavation, load, transfer and compaction. While other area have studied cooperation system, related study in domestic construction is in poor condition. In this study, construction equipment fleet management system is developed for solving this problem and find way to improving efficiency in earthworks site. The entire concept of the fleet management system, including its components and process, has been systematically outlined in this paper. An operational methodology has also been suggested, where a number of machines, such as the excavators, trucks and compactors, are chosen and further grouped into a cluster. A case study verify fleet management system's effectiveness on performing task package by comparing existing work method with methodology in this study. Fleet management system in this study is expected to curtail fuel consumption by the reduction of working time and moving distance. Furthermore, it can be anticipated to declining carbon emission effect.

• Journal of KIISE:Information Networking
• /
• v.32 no.4
• /
• pp.471-482
• /
• 2005

The high-speed network permits Grid computing to handle large problem of management areas and share various computational resources. As there are many resources and changes of them in Grid computing, the resources should be detected effectively and matched correctly with tasks to provide high performance. In this paper, we propose a mechanism that maximizes the performance of Grid computing systems. According to a priority, grade and site of heterogeneous resources, we assign tasks to those resources. Initially, a volunteer's priority and ranking are determined by static information like as CPU speed, RAM size, storage size and network bandwidth. And then, the rank of resources is decided by considering dynamic information such as correctness, response time, and error rate. We find that overall Grid system performance is improved and high correctness using resource reallocation mechanism is achieved.