Publications
Detailed Information
실시간 멀티프로세서 시스템에서 동적 우선순위 스케줄링 알고리즘의 예측가능성 분석 : (An)analysis of the predictability of dynamic priority scheduling algorithms for real-time multiprocessor systems
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | 조유근 | - |
| dc.contributor.author | 한상철 | - |
| dc.date.accessioned | 2010-02-02T08:25:50Z | - |
| dc.date.available | 2010-02-02T08:25:50Z | - |
| dc.date.copyright | 2007. | - |
| dc.date.issued | 2007 | - |
| dc.identifier.uri | http://dcollection.snu.ac.kr:80/jsp/common/DcLoOrgPer.jsp?sItemId=000000044637 | kog |
| dc.identifier.uri | https://hdl.handle.net/10371/48492 | - |
| dc.description | 학위논문(박사) --서울대학교 대학원 :전기. 컴퓨터공학부,2007. | ko |
| dc.format.extent | v, 67 장 | ko |
| dc.language.iso | ko | ko |
| dc.publisher | 서울대학교 대학원 | ko |
| dc.subject | 멀티프로세서 | ko |
| dc.subject | multiprocessor | ko |
| dc.subject | 실시간 시스템 | ko |
| dc.subject | real-time system | ko |
| dc.subject | 우선순위 스케줄링 | ko |
| dc.subject | priority-driven scheduling | ko |
| dc.subject | 여유시간 | ko |
| dc.subject | laxity | ko |
| dc.subject | 예측가능성 | ko |
| dc.subject | predictability | ko |
| dc.subject | Least Laxity First | ko |
| dc.subject | Least Laxity First | ko |
| dc.subject | Earliest Deadline Zero Laxity | ko |
| dc.subject | Earliest Deadline Zero Laxity | ko |
| dc.title | 실시간 멀티프로세서 시스템에서 동적 우선순위 스케줄링 알고리즘의 예측가능성 분석 | ko |
| dc.title.alternative | (An)analysis of the predictability of dynamic priority scheduling algorithms for real-time multiprocessor systems | ko |
| dc.type | Thesis | - |
| dc.contributor.department | 전기. 컴퓨터공학부 | - |
| dc.description.degree | Doctor | ko |
- Appears in Collections:
- Files in This Item:
- There are no files associated with this item.
Item View & Download Count
Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.