operating systems - university of limerickgarryowen.csisdmz.ul.ie/~cs4023/resources/lect01.pdf ·...

Administrive DetailsTo Do

AnnouncementsSyllabus

Why Operating Systems

Operating Systems

P. Healy

CS1-08Computer Science Bldg.

tel: [email protected]

Autumn 2019–2020

P. Healy (University of Limerick) CS4023 Autumn 2019–2020 1 / 32




Outline

1 Administrive DetailsMeeting TimesGeneral IssuesAssessment

2 To Do3 Announcements4 Syllabus

OverviewIn DetailLearning Outcomes

5 Why Operating SystemsSoftware Complexity





Meeting TimesGeneral IssuesAssessment

Outline










Lectures / Labs / Tutes

Lecture Hours: Mon. 12h00 ERB001Tue. 10h00 ERB001 AD2010

Tute Wed. 17h00 SR3007Mon. 13h00 KBG12

Lab 2A Tue. 16h00 CS2(0)442B Tue. 17h00 CS2(0)442C Thu. 11h00 CS2(0)44

4 contact hours→ 6 non-contact hours






Outline










Attendance

Attendance at all lectures and labs / tutes is expectedTute attendance will be recordedHanding up all assigned lab exercises is a good ideaHanding up other people’s work is a serious

What’s this about? Why is this on the slide?






Class Home Page

1 All lectures, homeworks, past exams, etc. can be found onthe class home page:garryowen.csisdmz.ul.ie/~cs4023/ (alsogoo.gl/4INPZ)

2 Class lists and attendance records will also be availablehere






Acknowledgements

Atif Azad’s CS4023 slides (via PH, NN in previous years)Wikipedia imagesVarious OS lectures from around the world / web






Outline










Assessment Instruments

Lab Assignments: 6 × 5% Week{03,04,06,08,09,10}Mid-Term Exam: 10% Week07Final: 60% Week15

Labs start this week; tutes start next weekSeptember repeat exam will count for same as final

What this means...






Grade Bands

F 0 – 29D2 30 – 34D1 35 – 39C3 40 – 47C2 48 – 51C1 52 – 55B3 56 – 59B2 60 – 63B1 64 – 71A2 72 – 79A1 80 – 100






Reading List

1 Silberschatz, Galvin & GagneOperating System Concepts (Wiley)ISBN 0-470-12872-0 On SL inlibrary (ed.s 6 & 8)http://www.os-book.com/

2 Silberschatz, et al. (earlier eds ofabove)

3 Loads of other OS books in library


http://www.os-book.com/




To Do (for You)

Ü Linux password resetting1 will be done by Liam O’Riordan(CS2-004) between 14.30 - 15.30 from today onwardsDon’t forget to register online at http://www.si.ul.ieDrop in to First Seven Weeks Centre (SU Courtyard) forStudy Skills; also go to First 7 Weeks page on Facebook,www.Facebook.com/first7weeks

1Needed only if you’ve forgotten your old one!P. Healy (University of Limerick) CS4023 Autumn 2019–2020 13 / 32

http://www.si.ul.ie




Announcements

Labs start in Week01Tutes in Week02





CS4023

CS4023 (like school) (like life) is hard“Genius is one percent inspiration, ninety-nine percentperspiration.” Thomas Edison (Sept. 1932)“Not every legend is a myth, some are flesh and blood.Some legends walk among us, but they aren’t born, they’rebuilt. Legends are made from iron & sweat, mind andmuscle, blood and vision and victory. ...” ArnoldSchwarzenegger


https://en.wikipedia.org/wiki/Thomas_Edison

http://www.azquotes.com/quote/921969

http://www.azquotes.com/quote/921969





Outline










Rationale and Purpose

On successful completion of this module a student should havea clear understanding of the

logical structure of, and facilities provided by, a modern OSconcepts of processes, threads and multithreading andhow they are implemented in a modern OSproblems that arise when processes collaborate andcompete and well as being able to demonstrate practicalexperience of mechanisms for handling these situationdifferent ways of implementing virtual memoryuse of system calls






Overview of Syllabus

Overview of Operating-System Structure and OperationsProcess ManagementMemory ManagementStorage ManagementProtection and Security






Outline










Detailed Syllabus

Positioning the operating system (OS) between the userand the hardware; the need for the OS; different types ofOSs; interfaces to an OS and the interface with thehardwareThe concept of a process and a thread; representation ofprocesses and threads; process and thread state; processcreation and termination; thread creation, scheduling andtermination; multithreadingScheduling; context switching; concurrency, includinginteraction between threadsInter process communication (IPC); synchronization andmutual exclusion problems; software algorithms for IPC; 2processes, n processes






Detailed Syllabus (contd.)

Low and high level mechanisms for IPC andsynchronization: signals; spinlocks; semaphores, messagepassing and monitors; deadlock; use of semaphores forsynchronization, mutual exclusion, resource allocation;implementation of semaphores; use of event counts andsequencers for classical IPC problems; conditional criticalregions; monitors and condition variablesPhysical and virtual memory; address translation; baseand length registers; segmentation and paging; cachememory; system services for memory managementI/O subsystem, directory name space; inodes;synchronous and asynchronous I/O; locking; buffering






Detailed Syllabus (contd.)

File systems and file management; file system types; diskorganization; mounting a file system; device drivers; filesystem based IPC; pipes; the socket mechanism; IPCusing socketsFault tolerance and security






Outline










Learning Outcomes

On successful completion of this module students will be ableto:

Explain the objectives and functions of modern operatingsystemsDescribe the logical structure of, and facilities provided by,a modern operating systemAnalyze the tradeoffs inherent in operating system designDifferentiate between the concepts of processes, threadsand multithreadingDemonstrate practical experience of mechanisms forhandling situations of process collaboration andcompetitionIdentify the problems that arise when processescollaborate and compete






Learning Outcomes (contd.)

Categorise different ways of implementing virtual memoryDiscuss networked, client-server, distributed operatingsystems and how they differ from single user operatingsystemsSummarise the use of system calls





Software Complexity

Internet Users

No. of internet users per 100 inhabitants:

Somebody2 better be managing how this volume of people usethe Internet

2Or some thing.P. Healy (University of Limerick) CS4023 Autumn 2019–2020 26 / 32




Software Complexity

Speed of Computation

Moore’s Law over the past 120 Years:

Somebody3 better be managing how this computing power isharnessed


https://en.wikipedia.org/wiki/Moore%27s_law




Software Complexity

Anatomy of an Internet Search Query

Somebody4 better be managing these communications steps





Software Complexity

Outline









Software Complexity

Lines of code

1975 Unix kernel: 10,500 lines of code2008 Linux 2.6.24 line counts:

85,000 processes430,000 sound drivers490,000 network protocols710,000 file systems1,000,000 different CPU architectures4,000,000 drivers7,800,000 Total





Software Complexity

Lines of code (contd.)





Software Complexity

Taming this complexity

Every piece of computer hardware differentDifferent CPU

Pentium, PowerPC, ColdFire, ARM, MIPSDifferent amounts of memory, disk, . . .Different types of devicesMice, Keyboards, Sensors, Cameras, Fingerprint readersDifferent networking environment

Cable, DSL, Wireless, VPN, Firewalls, . . .Issues:

Does the programmer need to write a single program thatcovers all operations of computer systems? Modularity?Does every program have to be altered for every piece ofhardware? Re-usability?Does a faulty program crash everything? Fault isolation?Does every program have access to all hardware?Security?


operating systems - university of limerickgarryowen.csisdmz.ul.ie/~cs4023/resources/lect01.pdf ·...

Documents