• Proceedings of the KAIS Fall Conference
• /
• 2004.06a
• /
• pp.148-150
• /
• 2004

송신자 개시 부하 균등 알고리즘에서는 전체 시스템이 과부하일 때 송신자(과부하 프로세서)가 부하를 이전하기 위해 수신자(저부하 프로세서)를 발견할 때까지 불필요한 이전 요청 메시지를 계속 보낸다. 따라서 이 같은 상황에서는 저부하 상태인 수신자 프로세서로부터 승인 메시지를 받기까지 불필요한 프로세서간 통신으로 인하여 프로세서의 이용률이 저하되고 또한 태스크의 처리율이 낮아지는 문제점이 발생한다. 본 논문에서는 이질형 분산 시스템에서의 동적 부하 균등을 위해 진화알고리즘을 기반으로 하는 접근 방법을 제안한다.

• Journal of KIISE:Software and Applications
• /
• v.31 no.10
• /
• pp.1345-1355
• /
• 2004

In a sender-initiated load redistribution algorithm, a sender(overloaded processor) continues to send unnecessary request messages for load transfer until a receiver(underloaded processor) is found while the system load is heavy. In a receiver-initiated load redistribution algorithm, a receiver continues to send unnecessary request messages for load acquisition until a sender is found while the system load is light. Therefore, it yields many problems such as low CPU utilization and system throughput because of inefficient inter-processor communications in this environment. This paper presents an approach based on genetic algorithm(GA) for adaptive load sharing in distributed systems. In this scheme, the processors to which the requests are sent off are determined by the proposed GA to decrease unnecessary request messages.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11b
• /
• pp.691-693
• /
• 2005

In a sender-initiated load balancing algorithm, a sender continues to send unnecessary request messages for load transfer until a receiver is found while the system load is heavy. Therefore, it yields many problems such as low cpu utilization and system throughput because of inefficient inter-processor communications until the sender receives an accept message from the receiver in this environment. This paper presents an approach based on evolutionary algorithm. The processors to which the requests are sent off are determined by the proposed algorithm to decrease unnecessary request messages.

• Proceedings of the KIEE Conference
• /
• 2005.07a
• /
• pp.786-788
• /
• 2005

전력 부하관리기기인 축냉시스템은 그동안 건물 냉방 공조용을 중심으로 보급되었다. 기저부하를 증진시키고 주간의 피크부하를 낮추어 주야간의 부하불균형을 해소하는 축냉시스템은 그동안 전력부하율 향상 및 부하평준화에 많이 기여해왔다. 산업용으로의 축냉기기보급의 타당성 및 부하평준화에 관한 연구시행 결과, 그 타당성과 보급확대의 필요성이 확인 되었다. 가스식 냉방기는 피크억제측면에서, 축냉식은 부하이전 측면에서 장점이 매우 크며, 전체 부하관리 측면에서 이들의 균형보급발전 노력이 필요하다. 산업용으로의 축냉기기 보급은 특히 주야간 부하불균형이 심한 하계의 부하평준화효과가 크며, 그 보급시장 및 전력절감 잠재량 규모를 감안할 때 국가적 편익과 추가 발전설비건설억제에 크게 기여할 것으로 예상된다.

• The Journal of Korean Association of Computer Education
• /
• v.9 no.1
• /
• pp.107-118
• /
• 2006

Load redistribution algorithm is a critical factor in computer system. In a receiver-initiated load redistribution algorithm, receiver(underloaded processor) continues to send unnecessary request messages for load transfer until a sender(overloaded processor) is found while the system load is light. Therefore, it yields many problems such as low cpu utilization and system throughput because of inefficient inter-processor communications until the receiver receives an accept message from the sender in this environment. This paper presents an approach based on genetic algorithm(GA) for dynamic load redistribution including self-adjustable in heterogeneous distributed systems. In this scheme the processors to which the requests are sent off are determined by the proposed GA to decrease unnecessary request messages.

• Journal of Internet Computing and Services
• /
• v.5 no.6
• /
• pp.93-101
• /
• 2004

In a receiver-initiated load redistribution algorithm, receiver(underloaded processor) continues to send unnecessary request messages for load transfer until a sender(overloaded processor) is found while the system load is light, Therefore, it yields many problems such as low cpu utilization and system throughput because of inefficient inter-processor communications until the receiver receives an accept message from the sender in this environment. This paper presents an approach based on genetic algorithm(GA) for dynamic load redistribution in heterogeneous distributed systems. In this scheme the processors to which the requests are sent off are determined by the proposed GA to decrease unnecessary request messages. The performance of proposed algorithm shows better than that of the conventional algorithm through various experiments.

• Proceedings of the KIEE Conference
• /
• 2009.07a
• /
• pp.179_180
• /
• 2009

계통에 외란이 발생하면 전압 붕괴 현상으로 이어져 제어될 수 없는 부하손실이나 캐스케이딩 현상의 형태로 발전 될 수 있다. 심각한 경우에 광역정전으로 확대되는 문제점이 생기는데, 이를 방지하기 위한 방안으로 최소한의 부하차단을 통하여 계통을 안정화시켜야 하며 불필요한 부하차단을 방지하기 위한 부하차단 다단계화가 수행 되어야 한다. 본 논문에서는 모선 전압의 민감도에 따른 적정한 부하차단 개소를 선택하였으며 부하차단 의사결정 방안으로 전압 변동률을 고려하여 다단계 부하차단 방안을 검토하였다. 전압변동율의 계산을 위하여 Least square 기법이 적용되었으며 2008년도 하계 최대부하 계통에 대한 동적 해석을 수행하였고, 계통 해석 결과를 바탕으로 이전에 제안 된 방안들에 비하여 향상되고 발전된 효율적인 저전압 부하차단 방안에 대하여 논의하였다.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.6 no.6
• /
• pp.506-512
• /
• 2005

Load redistribution algorithm is a critical factor in computer system. In a receiver-initiated Toad redistribution algorithm, receiver(underloaded processor) continues to send unnecessary request messages for load transfer until a sender(overloaded processor) is found while the system load is light. Therefore, it yields many problems such as low cpu utilization and system throughput because of inefficient inter-processor communications until the receiver receives an accept message from the sender in this environment. This paper presents an approach based on genetic algorithm(GA) for dynamic load redistribution including self-adjustable in heterogeneous distributed systems. In this scheme the processors to which the requests are sent off are determined by the proposed GA to decrease unnecessary request messages.

• The Journal of the Korea Contents Association
• /
• v.5 no.3
• /
• pp.183-191
• /
• 2005

In a sender-initiated load sharing algorithms, sender(overloaded processor) continues to send unnecessary request messages for load transfer until receiver(underloaded processor) is found while the system load is heavy. Therefore, it yields many problems such as low CPU utilization and system throughput because of inefficient inter-processor communications until the sender receives an accept message from the receiver in this environment. This paper presents an approach based on genetic algorithm(GA) for dynamic load sharing in heterogeneous distributed systems. In this scheme the processors to which the requests are sent off is determined by the proposed GA to decrease unnecessary request messages.

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

In a sender-initiated load balancing algorithm, a sender (overloaded processor) continues to send unnecessary request messages for load transfer until a receiver (underloaded processor) is found while the system load is heavy. Therefore, it yields many problems such as low cpu utilization and system throughput because of inefficient inter-processor communications until the sender receives an accept message from the receiver in this environment. This paper presents an approach based on genetic algorithm (GA) for dynamic load balancing in heterogeneous distributed systems. In this scheme the processors to which the requests are sent off are determined by the proposed GA to decrease unnecessary request messages.