DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Kim, Myoung Ho | - |
dc.contributor.advisor | 김명호 | - |
dc.contributor.author | Lim, Sung-Chae | - |
dc.contributor.author | 임성채 | - |
dc.date.accessioned | 2011-12-13T05:25:55Z | - |
dc.date.available | 2011-12-13T05:25:55Z | - |
dc.date.issued | 2004 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=237670&flag=dissertation | - |
dc.identifier.uri | http://hdl.handle.net/10203/33201 | - |
dc.description | 학위논문(박사) - 한국과학기술원 : 전산학전공, 2004.2, [ vii, 103 p. ] | - |
dc.description.abstract | With fast advances in the computing power and networking technologies, demands for presentations of time-based data increasingly grow in the computing industry. Time-based data such as digitized video and sound are frequently called the continuous media since the playback of such data requires continuous data retrievals during the period of play-back. For the continuous media playbacks, disk-resident data should be read for the online delivery towards a client``s device so that the device continuously consumes data at a specific rate in order to reproduce a sequence of frames or sampled sounds. This requirement for the continuous media playback is referred to continuity requirement. Such continuity requirement should be fulfilled by a continuous media server that provides concurrent play-backs of continuous streams in online mode. To this end, the continuous media server is designed to have a deliberated algorithm for real-time disk scheduling meeting the continuity requirements of simultaneous continuous media streams. Besides the data requests from continuous media streams, there may exist data requests asking for time-independent data such as images, textual files, HTML documents stored in the continuous media server. Therefore, the continuous media server also needs to provide a mechanism to read time-independent data without missing deadlines of continuous requests. The mixed service of continuous requests and time-independent requests is a tough problem to be tackled in this dissertation. In this dissertation, we first develop a new scheduling method combining the EDF algorithm with the SCAN algorithm to service a number of continuous media streams. In the previous works, the combination of these two algorithms has been done such a limited way that the SCAN algorithm is applied for a small number of data requests with the same deadline. Since the SCAN algorithm cannot reverse the direction of disk head movement for a long while and retrieval orders of dat... | eng |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.subject | SCHEDULING | - |
dc.subject | DISK | - |
dc.subject | REAL-TIME | - |
dc.subject | MULTIMEDIA | - |
dc.subject | 멀티미디어 | - |
dc.subject | 스케줄링 | - |
dc.subject | 디스크 | - |
dc.subject | 실시간 | - |
dc.title | Real-time disk scheduling for the mixed workloads of multimedia data | - |
dc.title.alternative | 멀티미디어 데이터의 혼합된 작업요청을 위한 실시간 디스크 스케줄링 기법 | - |
dc.type | Thesis(Ph.D) | - |
dc.identifier.CNRN | 237670/325007 | - |
dc.description.department | 한국과학기술원 : 전산학전공, | - |
dc.identifier.uid | 000945354 | - |
dc.contributor.localauthor | Kim, Myoung Ho | - |
dc.contributor.localauthor | 김명호 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.