운영체제 - William Stallings 운영체제 교재 연습문제 정답모음
닫기
  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 7
  • 8
  • 9
  • 10
  • 11
  • 12
  • 13
  • 14
  • 15
  • 16
  • 17
  • 18
  • 19
  • 20
  • 21
  • 22
  • 23
  • 24
  • 25
  • 26
  • 27
  • 28
  • 29
  • 30
  • 31
  • 32
  • 33
  • 34
  • 35
  • 36
  • 37
  • 38
  • 39
  • 40
  • 41
  • 42
  • 43
  • 44
  • 45
  • 46
  • 47
  • 48
  • 49
  • 50
해당 자료는 10페이지 까지만 미리보기를 제공합니다.
10페이지 이후부터 다운로드 후 확인할 수 있습니다.

소개글

운영체제 - William Stallings 운영체제 교재 연습문제 정답모음에 대한 보고서 자료입니다.

목차

운영체제 - William Stallings 운영체제 교재 연습문제 정답모음
도움이 되시길 바랍니다.

본문내용

4.2 Because, with ULTs, the thread structure of a process is not visible to the operating system, which only schedules on the basis of processes.
4.3 a. The use of sessions is well suited to the needs of an interactive graphics interface for personal computer and workstation use. It provides a uniform mechanism for keeping track of where graphics output and keyboard/mouse input should be directed, easing the task of the operating system.
b. The split would be the same as any other process/thread scheme, with address space and files assigned at the process level.
4.4 The issue here is that a machine spends a considerable amount of its waking hours waiting for I/O to complete. In a multithreaded program, one KLT can make the blocking system call, while the other KLTs can continue to run. On uniprocessors, a process that would otherwise have to block for all these calls can continue to run its other threads. Source: [LEWI96]
4.5 No. When a process exits, it takes everything with it—the KLTs, the process structure, the memory space, everything—including threads. Source: [LEWI96]
4.6 As much information as possible about an address space can be swapped out with the address space, thus conserving main memory.
4.7 a. If a conservative policy is used, at most 20/4 = 5 processes can be active simultaneously. Because one of the drives allocated to each process can be idle most of the time, at most 5 drives will be idle at a time. In the best case, none of the drives will be idle.
b. To improve drive utilization, each process can be initially allocated with three tape drives. The fourth one will be allocated on demand. In this policy, at most 20/3 = 6 processes can be active simultaneously. The minimum number of idle drives is 0 and the maximum number is 2. Source: Advanced Computer Architecture, K. Hwang, 1993.
  • 가격3,000
  • 페이지수50페이지
  • 등록일2009.12.16
  • 저작시기2004.5
  • 파일형식워드(doc)
  • 자료번호#567886
본 자료는 최근 2주간 다운받은 회원이 없습니다.
청소해
다운로드 장바구니