DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Park, Kyu-Ho | - |
dc.contributor.advisor | 박규호 | - |
dc.contributor.author | Kim, Kyung-Ho | - |
dc.contributor.author | 김경호 | - |
dc.date.accessioned | 2011-12-14 | - |
dc.date.available | 2011-12-14 | - |
dc.date.issued | 2003 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=231115&flag=dissertation | - |
dc.identifier.uri | http://hdl.handle.net/10203/35165 | - |
dc.description | 학위논문(박사) - 한국과학기술원 : 전기및전자공학전공, 2003.8, [ x, 99 p. ] | - |
dc.description.abstract | The files in integrated file server consists of dynamic files, static files and stream files. The server must satisfy not only the fast responses of both the dynamic data requests and the static data requests, but also the guaranteed bandwidth of the stream requests. This thesis introduces two kinds of researches to improve the disk I/O performance of the integrated file server. The first one, as a simulation result, deals with a block allocation method for the fast query response times of the dynamic files. The second one, as the major research topic, deals with a disk bandwidth allocation method for the stream or the static files, adaptive read ahead method of the allocated files and a disk scheduling method of the read ahead requests. The adaptive read ahead method and the file system about the file allocation method are integrated to CORE file server of our laboratory, and the disk scheduling method is in progress to be integrated. The block allocation method for the dynamic files is to maximize the concurrent disk I/O on the multiple disks. A dynamic file is represented by the Cartesian product file. Based on a quantum-inspired evolutionary computing algorithm, it distributes blocks of a binary Cartesian product file among disks. It manages the probability distribution matrix to represent the qualities of the genes. Determining the excellent genes quickly makes the method to have faster convergence than the previous work, DAGA. It gives better solutions and 3.2 - 11.3 times faster convergence than DAGA. The file allocation method is to maximize the disk I/O throughput of the static files and the stream files. The modern disk drive has multi-zones of which outer zones have higher transfer rates than the inner zones. The static file request is small and the stream file request is large. The method allocates the stream files to the outer zones with the large block sizes and the static files to the inner zones with the small block sizes. For the allocation,... | eng |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.subject | Integrated File Server | - |
dc.subject | Disk I/O | - |
dc.subject | 디스크 I/O | - |
dc.subject | 통합 파일 서버 | - |
dc.title | Disk I/O performance improvement by the file allocation, adaptive read ahead and scheduling of disks for integrated file server | - |
dc.title.alternative | 통합 파일 서버에서 디스크의 파일 할당, 적응 미리 읽기, 스케줄링에 의한 디스크 입출력 성능 향상 기법 | - |
dc.type | Thesis(Ph.D) | - |
dc.identifier.CNRN | 231115/325007 | - |
dc.description.department | 한국과학기술원 : 전기및전자공학전공, | - |
dc.identifier.uid | 000985032 | - |
dc.contributor.localauthor | Park, Kyu-Ho | - |
dc.contributor.localauthor | 박규호 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.