DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Park, Dae-Yeon | - |
dc.contributor.advisor | 박대연 | - |
dc.contributor.author | Han, Jae-Sun | - |
dc.contributor.author | 한재선 | - |
dc.date.accessioned | 2011-12-14 | - |
dc.date.available | 2011-12-14 | - |
dc.date.issued | 2005 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=244903&flag=dissertation | - |
dc.identifier.uri | http://hdl.handle.net/10203/35284 | - |
dc.description | 학위논문(박사) - 한국과학기술원 : 전기및전자공학전공, 2005.2, [ viii, 89 p. ] | - |
dc.description.abstract | As computing and network capability increases, large-scale distributed services becomes popular where nodes are widely spread over Internet and the number of participants may scale to millions of nodes. Owing to fully decentralized architecture without central servers, they can obtain the ad-vantages of high scalability and robustness. In contrast, since participating nodes are volatile, that is frequently turned off, complicated recovery mechanism is needed. Also, it is difficult to develop them because they requires all middleware functions. For mitigating these difficulties, I proposed common self-organizing infrastructure helping these services. Each infrastructure node is provided by and belongs to individual organization. The key point is that infrastructure nodes are self-organized into adaptive hierarchical ring (AHR) overlay. In AHR overlay, each infrastructure node belongs to a ring and inter-rings are formed for interaction between rings. With the change of environment like the number of nodes, AHR overlay is reconstructed by ring division and merging for restricting the round trip time of rings within a desired de-lay bound. AHR overlay not only helps self-organizing configuration but also provides information broadcast channel where fresh information of each organization are broadcasted. It enables fast service and resource discovery in local infrastructure node. The self-organizing infrastructure provides another common service, scheduling proxy, for improving the inefficient scheduling of distributed computing. A scheduling proxy enables adaptive-grained scheduling between a master and workers by scheduling work units between them. It reduces the turnaround time of work unit and the waste of CPU time by timeout without increasing the performance cost of contention at the master. | eng |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.subject | service and resource discovery | - |
dc.subject | self-organizing | - |
dc.subject | infrastructure | - |
dc.subject | Large-scale distributed services | - |
dc.subject | p2polensng | - |
dc.subject | 피어투피어 | - |
dc.subject | 서비스와 자원 발견 | - |
dc.subject | 자기조직화 | - |
dc.subject | 인프라스트럭쳐 | - |
dc.subject | 대규모 분산서비스 | - |
dc.title | Design and implementation of self-organizing infrastructure for large-scale distributed services | - |
dc.title.alternative | 대규모 분산서비스를 위한 자기 조직화하는 인프라스트럭쳐의 설계와 구현 | - |
dc.type | Thesis(Ph.D) | - |
dc.identifier.CNRN | 244903/325007 | - |
dc.description.department | 한국과학기술원 : 전기및전자공학전공, | - |
dc.identifier.uid | 020005340 | - |
dc.contributor.localauthor | Park, Dae-Yeon | - |
dc.contributor.localauthor | 박대연 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.