DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Chon, Kil-Nam | - |
dc.contributor.advisor | 전길남 | - |
dc.contributor.author | Chung, Chul | - |
dc.contributor.author | 정철 | - |
dc.date.accessioned | 2011-12-13T05:22:23Z | - |
dc.date.available | 2011-12-13T05:22:23Z | - |
dc.date.issued | 1989 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=61306&flag=dissertation | - |
dc.identifier.uri | http://hdl.handle.net/10203/32968 | - |
dc.description | 학위논문(박사) - 한국과학기술원 : 전산학과, 1989.2, [ [vi], 120 p. ] | - |
dc.description.abstract | We propose a scalable load balancing mechanism based on asynchronous migration. For a load balancing mechanism to be scalable, the communication overhead must be insensitive to the size of the systems. The previous models migrate processes synchronously between senders and receivers. We identified the massive communication overhead in the previous model due to the synchrony. In the proposed model, the senders release the saturated processes on the sharable bulletin boards, and the receivers draw the released processes depending on the local load condition. The asynchronous migration takes advantages in reducing the communication overhead and supporting the interoperability among the heterogeneous management principles. The goal of the paper is to investigate the behavior of the asynchronous migration in the sacalable load balancing mechanism. Keywords: Load Balancing, Asynchronous Migration, Bulletin Boards, Client-Solicitor Interactions | eng |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.subject | 비동기 전송. | - |
dc.title | Scalable load balancing mechanism by asynchronous migrations | - |
dc.title.alternative | 비동기 프로세스 이전에 의한 가변적 부하균등화 기법 | - |
dc.type | Thesis(Ph.D) | - |
dc.identifier.CNRN | 61306/325007 | - |
dc.description.department | 한국과학기술원 : 전산학과, | - |
dc.identifier.uid | 000835380 | - |
dc.contributor.localauthor | Chon, Kil-Nam | - |
dc.contributor.localauthor | 전길남 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.