DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Maeng, Seung-Ryoul | - |
dc.contributor.advisor | 맹승렬 | - |
dc.contributor.author | Yu, Jung-Lok | - |
dc.contributor.author | 유정록 | - |
dc.date.accessioned | 2011-12-13T05:26:20Z | - |
dc.date.available | 2011-12-13T05:26:20Z | - |
dc.date.issued | 2007 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=263531&flag=dissertation | - |
dc.identifier.uri | http://hdl.handle.net/10203/33227 | - |
dc.description | 학위논문(박사) - 한국과학기술원 : 전산학전공, 2007.2, [ viii, 80 p. ] | - |
dc.description.abstract | The advent of fast networks and efficient user-level communication protocols has made clusters an attractive alternative to traditional multiprocessor systems. Due to the incremental scalability, cost-effectiveness and high-availability, cluster systems have recently gained increased acceptance as general-purpose multi-programmed computing servers for a variety of scientific and business applications. These applications are generally composed of multiple processes running on distinct CPUs that communicate frequently. Due to the synchronization needs of such applications, performance is greatly hampered if their processes are not scheduled simultaneously on the CPUs. Implicit coscheduling (ICS) is a well-known technique to address this problem in multi-programmed clusters, however, traditional ICS schemes do not incorporate steps to adequately deal with priority boost conflicts, leading to significantly degraded performance. In this thesis, we propose the use of runtime difference in contention across nodes to provide more sophisticated coscheduling decisions in response to the conflicts. We also present a novel coscheduling scheme termed PROC (Process ReOrdering-based Coscheduling) that adaptively regulates the scheduling sequence of conflicting processes based on the rescheduling latency of their correspondents in remote nodes. We perform extensive simulation-based experiments using both synthetic and realistic workloads to analyze the performance of PROC compared to alternatives such as local scheduling, a widely used batch scheduling, gang scheduling, and existing ICS schemes. The results show that all ICS schemes commonly experience priority boost conflicts, and that the proposed PROC significantly outperforms other ICS alternatives (or batch scheduling) by up to 50.4% (or 72.5%) in the average job response time. This improvement is achieved by reducing wasted idle time and spinning time without sacrificing fairness. We also present a generic c... | eng |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.subject | parallel job scheduling | - |
dc.subject | coscheduling | - |
dc.subject | multi-programmed clusters | - |
dc.subject | priority boost conflcit | - |
dc.subject | 우선순위 높임 충돌 | - |
dc.subject | 병렬 작업 스케쥴링 | - |
dc.subject | 동시 스케쥴링 | - |
dc.subject | 다중 프로그램화된 클러스터 | - |
dc.title | (A) runtime resolution scheme for priority boost conflict in implicit coscheduling | - |
dc.title.alternative | 암묵적 동시 스케쥴링에서 우선순위 높임 충돌을 해결하기 위한 효율적인 스케쥴링 기법에 관한 연구 | - |
dc.type | Thesis(Ph.D) | - |
dc.identifier.CNRN | 263531/325007 | - |
dc.description.department | 한국과학기술원 : 전산학전공, | - |
dc.identifier.uid | 020015177 | - |
dc.contributor.localauthor | Maeng, Seung-Ryoul | - |
dc.contributor.localauthor | 맹승렬 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.