• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.10a
• /
• pp.629-632
• /
• 2000

본 연구에서는 인터넷에 연결된 유휴자원을 자율적으로 묶어 하나의 분산시스템을 구축하고 이를 이용하여 사용자에게 병렬 프로그램밍 시스템을 설계, 구현하는 방법에 관하여 기술하였다. 제안된 자율적 웹 분산 컴퓨팅 환경은 인터넷 컴퓨팅 구축에 있어서 필수적인 동적자원의 중계, 작업의 분배방법을 제시한다. 또한 제안된 시스템 구축방안은 지니 기술을 이용함으로써 자율적 웹 분산환경구축이 가능하였고 실험을 통하여 인터넷의 유휴자원을 이용함으로써 적은 비용으로 높은 생산성을 얻을 수 있는 가능성을 제시하였다.

• Proceedings of the Korean Society for Information Management Conference
• /
• 1999.08a
• /
• pp.241-244
• /
• 1999

현재 인터넷자원은 분산된 네비게이션환경에서 배포되고 있다. 이러한 분산된 정보자원을 통합할 수 있는 표준형식으로 Dublin Core가 성장하기 위해서는 기술내용뿐만 아니라, 기술방법을 정의하여 작성된 레코드의 일관성을 확보하여야 한다. 그리고 더 나아가 다언어문화와 자원의 유형에 상관없이 통합 기술할 수 있는 보다 세련된 메타데이터 형식으로 발전시켜야 한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.11a
• /
• pp.165-168
• /
• 2013

분산 클라우드 환경은 분산된 다수의 컴퓨팅 자원을 하나의 집합으로 묶고 하이퍼바이저를 이용하여 생성한 가상머신을 서비스 요구사항에 알맞게 할당하여 작업을 처리한다. 클라우드를 이용하여 제공하고자 하는 서비스는 이용되는 자원을 해당 서비스 대상 지역에 가장 높은 수준의 서비스 품질을 제공할 수 있는 데이터 센터로부터 할당 받는다. 그러나, 대부분의 클라우드 자원 제공자들은 해당 자원을 하나의 서비스 지역에 기반하여 할당한다. 따라서, 본 논문에서는 여러 지역에 애플리케이션 서비스를 제공하고자 하는 사업자들에게 전체 서비스의 최적 품질을 보장하는 다중 서비스 지역 기반 자원 할당 기법을 제안한다.

• Proceedings of the KSEEG Conference
• /
• 2002.04a
• /
• pp.56-58
• /
• 2002

• Proceedings of the KSEEG Conference
• /
• 2007.04a
• /
• pp.398-400
• /
• 2007

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.15 no.6
• /
• pp.440-448
• /
• 2022

Recently, due to the introduction of distributed energy resources, the optimal resource allocation problem of the power network is more and more important, and the distributed resource allocation method is required to process huge amount of data in large-scale power networks. In the optimal resource allocation problem, many studies have been conducted on the case when the supply-demand balance is satisfied due to the limitation of the generation capacity of each generator, but the studies considering the supply-demand imbalance, that total demand exceeds the maximum generation capacity, have rarely been considered. In this paper, we propose the consensus-based distributed algorithm for the optimal resource allocation of power network considering the supply-demand imbalance condition as well as the supply-demand balance condition. The proposed distributed algorithm is designed to allocate the optimal resources when the supply-demand balance condition is satisfied, and to measure the amount of required resources when the supply-demand is imbalanced. Finally, we conduct the simulations to verify the performance of the proposed algorithm.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.37 no.2
• /
• pp.141-151
• /
• 2013

Process planning can be defined as determining detailed methods by which parts can be manufactured from the initial to the finished stage. Process planning starts with determining the manufacturing process based on the geometric shape of the part and the machines and tools required for performing this process. Distributed process planning enables production planning to be performed easily by combining the extracted process and various manufacturing resources such as operations and tools. This study proposes an algorithm to determine the process for a feature-based model and to combine manufacturing resources for the process and implements a distributed process planning system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.7
• /
• pp.512-518
• /
• 2013

A resource allocation algorithm has a high impact on user satisfaction as well as the ability to accommodate and process services in a distributed cloud computing. In other words, service rejections, which occur when datacenters have no enough resources, degrade the user satisfaction level. Therefore, in this paper, we propose a resource allocation algorithm considering the cloud domain's remaining resources to minimize the number of service rejections. The resource allocation rate based on Q-Learning increases when the remaining resources are sufficient to allocate the maximum allocation rate otherwise and avoids the service rejection. To demonstrate, We compare the proposed algorithm with two previous works and show that the proposed algorithm has the smaller number of the service rejections.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.8
• /
• pp.1486-1492
• /
• 2007

Searching distributed resources efficiently is very important in distributed computing environments like P2P. But distributed resource searching may have system overheads and take a lot of time in proportion to the searching number, because distributed resource searching has to circuit many peers for searching information. In this paper, we design a proxy peer algorithm based on DHT(Distributed Hash Table) for efficient distributed resource searching in JXTA network environments. By containing the rendezvous information in proxy peer and searching a rendezvous peer firstly which has higher hit ratio, we can reduce the searching number and minimize system overheads.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.8
• /
• pp.1049-1062
• /
• 2002

As the distributed resources in the networks have become increasingly popular, the accesses to these resources having been activated. Especially, the accesses to the distributed resources using the mobile agent technologies provide the mechanisms supporting mobility with mobile users as well as the dynamic accesses to the resources in the fixed networks. Proxy-based mobile agent model is defined as mobile agent network model which allocates the hierarchical domains to the distributed resources changed dynamically, assigns one proxy server for each domain, and promotes the management and the cooperation of the mobile agents. In this paper, we introduce the architecture and the execution scenario for proxy-based mobile agent model which is suitable for the hierarchical management domains. In simulation, we evaluate the proxy server's route optimization functionality and the performance reducing execution time of the mobile agents.