DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Lee, Joon-Won | - |
dc.contributor.advisor | 이준원 | - |
dc.contributor.author | Lee, Sang-Bum | - |
dc.contributor.author | 이상범 | - |
dc.date.accessioned | 2011-12-13T05:24:43Z | - |
dc.date.available | 2011-12-13T05:24:43Z | - |
dc.date.issued | 1998 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=143510&flag=dissertation | - |
dc.identifier.uri | http://hdl.handle.net/10203/33123 | - |
dc.description | 학위논문(박사) - 한국과학기술원 : 전산학과, 1998.8, [ ix, 131 p. ] | - |
dc.description.abstract | The distributed shared memory (DSM) across a network of workstations (NoW) gains wide interests due to good scalability and cost/performance empowered by easy programming paradigm. Among various implementation approaches, page-based DSM utilizes an existing paged virtual memory scheme for providing shared memory view. Page-based DSM systems, however, suffer from coherence overhead mainly due to false sharing since they use a large page as a coherence unit. The optimal page size is required to satisfy communication efficiency as well as computational locality which are dynamically affected by application characteristics. Therefore, a fixed-size page cannot satisfy various applications even if it is small as a cache line size. At the same time, for some applications an invalidation-based protocol is preferred while for others an update-based protocol is more desirable. Even within a single application, different portion of shared data may be better handled by one protocol or the other. That means, a single protocol cannot satisfy various applications. Many previous researches use multiple coherence protocols according to a programmer``s annotation. Unfortunately, it is very difficult for every programmer to understand dynamic behavior of applications. Consequently, a desirable DSM system should be able to dynamically maintain the page size and the coherence protocol to satisfy the sharing behavior of a given application without disturbing programmers. In this thesis, a mechanism which can dynamically detect data sharing patterns and apply multiple coherence protocols is proposed. Data sharing patterns can be largely divided into a migratory fashion and a producer-consumer fashion. The proposed detection mechanism can distinguish the page of each pattern from the pages showing both characteristics regardless data is associated with a synchronization primitive or not. Three software-only coherence protocols, BCP (Buddy Coherence Protocol), ERP (Exclusive Read... | eng |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.subject | Adaptive granularity | - |
dc.subject | Coherence protocol | - |
dc.subject | Distributed shared memory | - |
dc.subject | Data sharing pattern | - |
dc.subject | 데이타 공유유형 | - |
dc.subject | 적응적 일관성유지단위 | - |
dc.subject | 일관성 규약 | - |
dc.subject | 분산공유메모리 | - |
dc.title | (An) adaptive granularity handling scheme for page-based DSM | - |
dc.title.alternative | 페이지에 기초한 분산공유메모리 일관성 유지단위의 가변적 처리기법 | - |
dc.type | Thesis(Ph.D) | - |
dc.identifier.CNRN | 143510/325007 | - |
dc.description.department | 한국과학기술원 : 전산학과, | - |
dc.identifier.uid | 000949051 | - |
dc.contributor.localauthor | Lee, Joon-Won | - |
dc.contributor.localauthor | 이준원 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.