jinan university

undergraduate syllabus for

__operating systems ____ (course title)

course code 60080015

course title operating systems

course type compulsory[√ ] specialized optional [ ] common optional [ ]

prerequisites c，java，problem solving and programming

credits 3.5

total course hours 63

majors applicableto computer science

students classification mainland[√] non-mainland [√]

department/schooloffering the course internationalschool

i. teachingobjectives and requirements

"operatingsystem" is a computer professional and compulsory basic course. it is atechnical and practical course. this course will enable students to fully graspthe exclusive formation and development of the operating system, processormemory management, device management, operations management and processes,synchronization, communication and deadlock, to learn how to use windows,linux, android, other different operating systems, and to solve practicalproblems.

teachingrequirements:

1) describe the basic organizationof computer systems

2) provide a grand tour of themajor components of operating systems

3) give an overview of the manytypes of computing environments

4) explore several open-sourceoperating systems

ii. key pointsand main areas of difficulty of the course

1) organization of computersystems

2) processor memory management,device management, operations management and processes, synchronization,communication and deadlock, protection & security,

iii. lab or practical work required to support thecourse

1) elevator schedule: a buildingof 20-floors,five interconnected elevator. based multi-thread, writing anelevator scheduler.

2) banker's algorithm: processesp0 through p4;3 resource types: a (10 instances), b (5instances), and c (7instances),snapshot at time t0: can request for (1,0,2) by p1 be granted?canrequest for (0,1,0) by p2 be granted?

3) protection: please givethe rights-set matrix, and implement the management system.

4) mit’s lab

iv. textbooks and references

a) text book:operating systems concepts

isbn:9787040209280

higher education press

b) reference materials:

isbn:9787302274896, 7302274894

n conference list

n journals directory

v. grading system and evaluation methods

n 30%: exam

n 30%: course project(source code, run video, presentations)

(13 persons/week for two weeks, between 15^nd and 16^th weeks)

n 20%: exercises and participation

n 20%: paper reviews and coursepresentations(20 mins/person )

(two persons/week for 13 weeks, between 2^nd and 14^th weeks)

vi. detailed points of teaching contents

n chapter 1,introduction, includes updated coverage of multiprocessor and multicoresystems, as well as a new section on kernel data structures. additionally, thecoverage of computing environments now includes mobile systems and cloudcomputing. we also have incorporated an overview of real-time systems.

n chapter 2,operating-system structures, provides new coverage of user interfaces formobile devices, including discussions of ios and android, and expanded coverage of mac os x as a type of hybrid system.

overview.chapters 1 and 2 explain what operating systems are, what they do, and how theyare designed and constructed. these chapters discuss what the common featuresof an operating system are and what an operating system does for the user. weinclude coverage of both traditional pc andserver operating systems, as well as operating systems for mobile devices.

n chapter 3, processes, now includes coverage ofmultitasking in mobileoperating systems, support for the multiprocess model ingoogle's chromeweb browser, and zombie and orphan processes in unix.·

n chapter 4, threads, supplies expanded coverage ofparallelism andamdahl's law. it also provides a new section on implicitthreading,including openmp and apple's grand central dispatch.·

n chapter 5, process synchronization (previouslychapter 6), adds a newsection on mutex locks as well as coverage ofsynchronization usingopenmp, as well as functional languages.·

n chapter 6, cpu scheduling (previouslychapter 5), contains new coverageof the linux cfs scheduler andwindows user-mode scheduling.coverageof real-time scheduling algorithms has also been integrated intothischapter.·

n chapter 7:deadlocks ，sections7.1 through 7.3 may be covered quickly for students already familiar withdeadlocks. the bankers algorithm makes an excellent chapter 7, deadlocks.

overview.process management.chapters 3 through 7 describe the process concept and concurrency as the heartof modern operating systems. a process is the unit of work in a system. such asystem consists of a collection of concurrently executing processes, some ofwhich are operating-system processes (those that execute system code) and therest of which are user processes (those that execute user code). these chapterscover methods for process scheduling, interprocess communication, processsynchronization, and deadlock handling. also included is a discussion ofthreads, as well as an examination of issues related to multicore systems andparallel programming.

n chapter 8, main memory, includes new coverage ofswapping on mobilesystems and intel 32- and 64-bit architectures. a new sectiondiscussesarm architecture.·

n chapter 9, virtual memory, updates kernel memorymanagement toinclude the linux slub and slob memory allocators.

·.memory management. chapters 8 and 9 deal with the managementof main memory during the execution of a process. to improve both the utilizationof the cpu and thespeed of its response to its users, the computer must keep several processes inmemory. there are many different memory-management schemes, reflecting variousapproaches to memory management, and the effectiveness of a particular algorithmdepends on the situation.

n chapter 10: mass-storage structure ，sections 10.1, 10.2, and10.4 may be covered quickly depending upon students' background. thedisk scheduling algorithms (section 10.4) make nice programmingexercises. adds cover-age of solid-state disks.·

n chapter 11, file-system interface (previouslychapter 10), is updatedwith information about current technologies.·

n chapter 12, file-system implementation (previouslychapter 11), isupdated with coverage of current technologies.·

n chapter 13, i/o, updates technologies andperformance numbers, expandscoverage of synchronous/asynchronous andblocking/nonblocking i/o,and adds a section on vectored i/o.·

·overview.storage management. chapters 10 through 13describe how mass storage, the file system, and i/o are handled in a modern computer system. thefile system provides the mechanism for on-line storage of and access to bothdata and programs. we describe the classic internal algorithms and structuresof storage management and provide a firm practical understanding of thealgorithms used their properties, advantages, and disadvantages. since the i/o devices that attach to acomputer vary widely, the operating system needs to provide a wide range offunctionality to applications to allow them to control all aspects of thesedevices. we discuss system i/o in depth, including i/o system design, interfaces, and internalsystem structures and functions. in many ways, i/o devices are the slowest major components ofthe computer. because they represent a performance bottleneck, we also examineperformance issues associated with i/o devices.

n chapter 14 protection，we recommend covering thischapter in its entirety in an advanced operating systems class.

n chapter 15, security, has a revised cryptographysection with modernnotation and an improved explanation of various encryptionmethods andtheir uses. the chapter also includes new coverage ofwindows 7security.·

··overview.protection and security. chapters 14 and 15 discussthe mechanisms necessary for the protection and security of computer systems.the processes in an operating system must be protected from one another's activities,and to provide such protection, we must ensure that only processes that havegained proper authorization from the operating system can operate on the files,memory, cpu, andother resources of the system. protection is a mechanism for controlling theaccess of programs, processes, or users to computer-system resources. thismechanism must provide a means of specifying the controls to be imposed, aswell as a means of enforcement. security protects the integrity of theinformation stored in the system (both data and code), as well as the physicalresources of the system, from unauthorized access, malicious destruction oralteration, and accidental introduction of inconsistency.·

n chapter20, the linux system

n appendix a:bsd unix

: the machsystem

n

overview.case studies. chapters 20 through 22 in the text, alongwith appendices a and b (which are available on (http://www.os-book.com),present detailed case studies of real operating systems, including linux,windows 7,freebsd, and mach. coverage of both linux and windows 7 are presentedthroughout this text; however, the case studies provide much more detail. it isespecially interesting to compare and contrast the design of these two verydifferent systems.

author’s signature shuhua zhu examiner’s signature_____________

date 01/03/2015 date____________________

(dd/mm/yy) (dd/mm/yy)

operating system-凯发k8官网下载客户端

i. thisform should be completed after discussionbetween the teaching and research section staff of the department concerned,and then confirmed and sealed by the corresponding college. regarding anyspecialized compulsory courses and specialized optional courses, which are notattached to any specific teaching and research section, or are lectured by oneteacher alone, discussion should be organized by the department, andconfirmation signed and sealed by the college. in the case of common optionalcourses, syllabuses should first be drawn up by the lecturer in charge, thendemonstrated and confirmed by specialists selected by the academic affairs department(aad) of the university, and finally approved and signed by the director incharge.

ii. thecontents of the syllabus should be consistent with undergraduate program ofyear 2006 students.

iii. “course type” refers to compulsoryspecialized optional or common optional course.

iv. “” refers tomainland student or non-mainland student.

v. “majorsapplicable to” refers to all the major titles that could be applied to acertain syllabus. “public compulsory course” should be marked as “all majors ofthe university”.

vi. “course offered by” refers to college,department and teaching and research section, or simply college and departmentif the course has no teaching and research section.

vii. “total course hours” are counted as 18hours per i credit for one course.

viii. “ contentsand requirements”. name of practicing/internship to be noted. for detailedinformation, see “laboratory syllabus” or “internship syllabus”.

ix. “textbooksand references” refers to the main textbooks used. instructors should selecttextbooks of high quality, or published within 3 years of the current academicyear; or those recommended by specified research fields. if the instructorschoose self-edited textbooks/ references, they must document the titles of thetextbooks or references and state the reasons for their choice.

x. “gradingsystem and evaluation methods”. grading system refers to the percentageallocation of final scores, with assignments, quizzes and attendance mark etc notexceeding 40% of the total score; evaluation methods refers to the form of theexamination, e.g. “open-book”, “closed-book” or “thesis writing” and so on.

xi. “main points of teaching contents”.instructors should fill in the objectives and requirements, key points, classhour allocation of each chapter, as well as the main contents of each chapter.