Soumettre la recherche
Mettre en ligne
Advanced Operating System Lecture Notes
•
Télécharger en tant que PPT, PDF
•
4 j'aime
•
7,251 vues
Anirudhan Guru
Suivre
Formation
Technologie
Signaler
Partager
Signaler
Partager
1 sur 40
Télécharger maintenant
Recommandé
Distributed Operating System_1
Distributed Operating System_1
Dr Sandeep Kumar Poonia
Distributed file system
Distributed file system
Anamika Singh
Parallel computing persentation
Parallel computing persentation
VIKAS SINGH BHADOURIA
operating system structure
operating system structure
Waseem Ud Din Farooqui
contiguous memory allocation.pptx
contiguous memory allocation.pptx
Rajapriya82
Ddb 1.6-design issues
Ddb 1.6-design issues
Esar Qasmi
Data base security & integrity
Data base security & integrity
Pooja Dixit
Memory management
Memory management
Vishal Singh
Recommandé
Distributed Operating System_1
Distributed Operating System_1
Dr Sandeep Kumar Poonia
Distributed file system
Distributed file system
Anamika Singh
Parallel computing persentation
Parallel computing persentation
VIKAS SINGH BHADOURIA
operating system structure
operating system structure
Waseem Ud Din Farooqui
contiguous memory allocation.pptx
contiguous memory allocation.pptx
Rajapriya82
Ddb 1.6-design issues
Ddb 1.6-design issues
Esar Qasmi
Data base security & integrity
Data base security & integrity
Pooja Dixit
Memory management
Memory management
Vishal Singh
computer system structure
computer system structure
HAMZA AHMED
Process state in OS
Process state in OS
Khushboo Jain
OS - Process Concepts
OS - Process Concepts
Mukesh Chinta
Introduction to Parallel and Distributed Computing
Introduction to Parallel and Distributed Computing
Sayed Chhattan Shah
System calls
System calls
Bernard Senam
2 phase locking protocol DBMS
2 phase locking protocol DBMS
Dhananjaysinh Jhala
deadlock handling
deadlock handling
Suraj Kumar
Demand paging
Demand paging
Trinity Dwarka
SCHEDULING ALGORITHMS
SCHEDULING ALGORITHMS
Dhaval Sakhiya
Inter Process Communication Presentation[1]
Inter Process Communication Presentation[1]
Ravindra Raju Kolahalam
Deadlock ppt
Deadlock ppt
Sweetestangel Kochar
Process synchronization
Process synchronization
Syed Hassan Ali
Database System Architectures
Database System Architectures
Information Technology
Dead Lock in operating system
Dead Lock in operating system
Ali Haider
distributed Computing system model
distributed Computing system model
Harshad Umredkar
Crash recovery in database
Crash recovery in database
Prof.Nilesh Magar
DeadLock in Operating-Systems
DeadLock in Operating-Systems
Venkata Sreeram
Memory Management in OS
Memory Management in OS
vampugani
Type Checking(Compiler Design) #ShareThisIfYouLike
Type Checking(Compiler Design) #ShareThisIfYouLike
United International University
Process scheduling
Process scheduling
Riya Choudhary
Complete Operating System notes
Complete Operating System notes
Lakshmi Sarvani Videla
Advanced Operating System- Introduction
Advanced Operating System- Introduction
Debasis Das
Contenu connexe
Tendances
computer system structure
computer system structure
HAMZA AHMED
Process state in OS
Process state in OS
Khushboo Jain
OS - Process Concepts
OS - Process Concepts
Mukesh Chinta
Introduction to Parallel and Distributed Computing
Introduction to Parallel and Distributed Computing
Sayed Chhattan Shah
System calls
System calls
Bernard Senam
2 phase locking protocol DBMS
2 phase locking protocol DBMS
Dhananjaysinh Jhala
deadlock handling
deadlock handling
Suraj Kumar
Demand paging
Demand paging
Trinity Dwarka
SCHEDULING ALGORITHMS
SCHEDULING ALGORITHMS
Dhaval Sakhiya
Inter Process Communication Presentation[1]
Inter Process Communication Presentation[1]
Ravindra Raju Kolahalam
Deadlock ppt
Deadlock ppt
Sweetestangel Kochar
Process synchronization
Process synchronization
Syed Hassan Ali
Database System Architectures
Database System Architectures
Information Technology
Dead Lock in operating system
Dead Lock in operating system
Ali Haider
distributed Computing system model
distributed Computing system model
Harshad Umredkar
Crash recovery in database
Crash recovery in database
Prof.Nilesh Magar
DeadLock in Operating-Systems
DeadLock in Operating-Systems
Venkata Sreeram
Memory Management in OS
Memory Management in OS
vampugani
Type Checking(Compiler Design) #ShareThisIfYouLike
Type Checking(Compiler Design) #ShareThisIfYouLike
United International University
Process scheduling
Process scheduling
Riya Choudhary
Tendances
(20)
computer system structure
computer system structure
Process state in OS
Process state in OS
OS - Process Concepts
OS - Process Concepts
Introduction to Parallel and Distributed Computing
Introduction to Parallel and Distributed Computing
System calls
System calls
2 phase locking protocol DBMS
2 phase locking protocol DBMS
deadlock handling
deadlock handling
Demand paging
Demand paging
SCHEDULING ALGORITHMS
SCHEDULING ALGORITHMS
Inter Process Communication Presentation[1]
Inter Process Communication Presentation[1]
Deadlock ppt
Deadlock ppt
Process synchronization
Process synchronization
Database System Architectures
Database System Architectures
Dead Lock in operating system
Dead Lock in operating system
distributed Computing system model
distributed Computing system model
Crash recovery in database
Crash recovery in database
DeadLock in Operating-Systems
DeadLock in Operating-Systems
Memory Management in OS
Memory Management in OS
Type Checking(Compiler Design) #ShareThisIfYouLike
Type Checking(Compiler Design) #ShareThisIfYouLike
Process scheduling
Process scheduling
En vedette
Complete Operating System notes
Complete Operating System notes
Lakshmi Sarvani Videla
Advanced Operating System- Introduction
Advanced Operating System- Introduction
Debasis Das
CS9222 ADVANCED OPERATING SYSTEMS
CS9222 ADVANCED OPERATING SYSTEMS
Kathirvel Ayyaswamy
CS9222 ADVANCED OPERATING SYSTEMS
CS9222 ADVANCED OPERATING SYSTEMS
Kathirvel Ayyaswamy
CS9222 ADVANCED OPERATING SYSTEMS
CS9222 ADVANCED OPERATING SYSTEMS
Kathirvel Ayyaswamy
CS9222 ADVANCED OPERATING SYSTEMS
CS9222 ADVANCED OPERATING SYSTEMS
Kathirvel Ayyaswamy
Final Exam OS fall 2012-2013 with answers
Final Exam OS fall 2012-2013 with answers
Arab Open University and Cairo University
Os Question Bank
Os Question Bank
Sonali Chauhan
CS9222 Advanced Operating System
CS9222 Advanced Operating System
Kathirvel Ayyaswamy
Operating system notes pdf
Operating system notes pdf
Jasleen Kaur (Chandigarh University)
Operating system notes
Operating system notes
SANTOSH RATH
SOLUTION MANUAL OF OPERATING SYSTEM CONCEPTS BY ABRAHAM SILBERSCHATZ, PETER B...
SOLUTION MANUAL OF OPERATING SYSTEM CONCEPTS BY ABRAHAM SILBERSCHATZ, PETER B...
vtunotesbysree
En vedette
(12)
Complete Operating System notes
Complete Operating System notes
Advanced Operating System- Introduction
Advanced Operating System- Introduction
CS9222 ADVANCED OPERATING SYSTEMS
CS9222 ADVANCED OPERATING SYSTEMS
CS9222 ADVANCED OPERATING SYSTEMS
CS9222 ADVANCED OPERATING SYSTEMS
CS9222 ADVANCED OPERATING SYSTEMS
CS9222 ADVANCED OPERATING SYSTEMS
CS9222 ADVANCED OPERATING SYSTEMS
CS9222 ADVANCED OPERATING SYSTEMS
Final Exam OS fall 2012-2013 with answers
Final Exam OS fall 2012-2013 with answers
Os Question Bank
Os Question Bank
CS9222 Advanced Operating System
CS9222 Advanced Operating System
Operating system notes pdf
Operating system notes pdf
Operating system notes
Operating system notes
SOLUTION MANUAL OF OPERATING SYSTEM CONCEPTS BY ABRAHAM SILBERSCHATZ, PETER B...
SOLUTION MANUAL OF OPERATING SYSTEM CONCEPTS BY ABRAHAM SILBERSCHATZ, PETER B...
Plus de Anirudhan Guru
London Olympics 2012
London Olympics 2012
Anirudhan Guru
ANNA UNIVERSITY, CHENNAI AFFILIATED INSTITUTIONS R - 2008 B.E. CIVIL ENGINEER...
ANNA UNIVERSITY, CHENNAI AFFILIATED INSTITUTIONS R - 2008 B.E. CIVIL ENGINEER...
Anirudhan Guru
ANNA UNIVERSITY, CHENNAI AFFILIATED INSTITUTIONS R-2008 B.E. BIOMEDICAL ENGIN...
ANNA UNIVERSITY, CHENNAI AFFILIATED INSTITUTIONS R-2008 B.E. BIOMEDICAL ENGIN...
Anirudhan Guru
Gate 2013- how to prepare
Gate 2013- how to prepare
Anirudhan Guru
Electromechanical Energy Conversion ppt 2
Electromechanical Energy Conversion ppt 2
Anirudhan Guru
Electromechnical Energy Conversion ppt
Electromechnical Energy Conversion ppt
Anirudhan Guru
ANNA UNIVERSITY, CHENNAI AFFILIATED INSTITUTIONS R-2008 B.E. BIOMEDICAL ENGIN...
ANNA UNIVERSITY, CHENNAI AFFILIATED INSTITUTIONS R-2008 B.E. BIOMEDICAL ENGIN...
Anirudhan Guru
Stickyteaching
Stickyteaching
Anirudhan Guru
ANNA UNIVERSITY, CHENNAI AFFILIATED INSTITUTIONS R-2008 B.TECH. INFORMATION T...
ANNA UNIVERSITY, CHENNAI AFFILIATED INSTITUTIONS R-2008 B.TECH. INFORMATION T...
Anirudhan Guru
ANNA UNIVERSITY, CHENNAI AFFILIATED INSTITUTIONS R-2008 B.E. COMPUTER SCIENCE...
ANNA UNIVERSITY, CHENNAI AFFILIATED INSTITUTIONS R-2008 B.E. COMPUTER SCIENCE...
Anirudhan Guru
ANNA UNIVERSITY, CHENNAI AFFILIATED INSTITUTIONS R - 2008 B.E. AERONAUTICAL E...
ANNA UNIVERSITY, CHENNAI AFFILIATED INSTITUTIONS R - 2008 B.E. AERONAUTICAL E...
Anirudhan Guru
ANNA UNIVERSITY, CHENNAI AFFILIATED INSTITUTIONS R - 2008 B.E. ELECTRICAL AND...
ANNA UNIVERSITY, CHENNAI AFFILIATED INSTITUTIONS R - 2008 B.E. ELECTRICAL AND...
Anirudhan Guru
Plus de Anirudhan Guru
(12)
London Olympics 2012
London Olympics 2012
ANNA UNIVERSITY, CHENNAI AFFILIATED INSTITUTIONS R - 2008 B.E. CIVIL ENGINEER...
ANNA UNIVERSITY, CHENNAI AFFILIATED INSTITUTIONS R - 2008 B.E. CIVIL ENGINEER...
ANNA UNIVERSITY, CHENNAI AFFILIATED INSTITUTIONS R-2008 B.E. BIOMEDICAL ENGIN...
ANNA UNIVERSITY, CHENNAI AFFILIATED INSTITUTIONS R-2008 B.E. BIOMEDICAL ENGIN...
Gate 2013- how to prepare
Gate 2013- how to prepare
Electromechanical Energy Conversion ppt 2
Electromechanical Energy Conversion ppt 2
Electromechnical Energy Conversion ppt
Electromechnical Energy Conversion ppt
ANNA UNIVERSITY, CHENNAI AFFILIATED INSTITUTIONS R-2008 B.E. BIOMEDICAL ENGIN...
ANNA UNIVERSITY, CHENNAI AFFILIATED INSTITUTIONS R-2008 B.E. BIOMEDICAL ENGIN...
Stickyteaching
Stickyteaching
ANNA UNIVERSITY, CHENNAI AFFILIATED INSTITUTIONS R-2008 B.TECH. INFORMATION T...
ANNA UNIVERSITY, CHENNAI AFFILIATED INSTITUTIONS R-2008 B.TECH. INFORMATION T...
ANNA UNIVERSITY, CHENNAI AFFILIATED INSTITUTIONS R-2008 B.E. COMPUTER SCIENCE...
ANNA UNIVERSITY, CHENNAI AFFILIATED INSTITUTIONS R-2008 B.E. COMPUTER SCIENCE...
ANNA UNIVERSITY, CHENNAI AFFILIATED INSTITUTIONS R - 2008 B.E. AERONAUTICAL E...
ANNA UNIVERSITY, CHENNAI AFFILIATED INSTITUTIONS R - 2008 B.E. AERONAUTICAL E...
ANNA UNIVERSITY, CHENNAI AFFILIATED INSTITUTIONS R - 2008 B.E. ELECTRICAL AND...
ANNA UNIVERSITY, CHENNAI AFFILIATED INSTITUTIONS R - 2008 B.E. ELECTRICAL AND...
Dernier
2024-NATIONAL-LEARNING-CAMP-AND-OTHER.pptx
2024-NATIONAL-LEARNING-CAMP-AND-OTHER.pptx
MaritesTamaniVerdade
TỔNG ÔN TẬP THI VÀO LỚP 10 MÔN TIẾNG ANH NĂM HỌC 2023 - 2024 CÓ ĐÁP ÁN (NGỮ Â...
TỔNG ÔN TẬP THI VÀO LỚP 10 MÔN TIẾNG ANH NĂM HỌC 2023 - 2024 CÓ ĐÁP ÁN (NGỮ Â...
Nguyen Thanh Tu Collection
Russian Escort Service in Delhi 11k Hotel Foreigner Russian Call Girls in Delhi
Russian Escort Service in Delhi 11k Hotel Foreigner Russian Call Girls in Delhi
kauryashika82
The basics of sentences session 2pptx copy.pptx
The basics of sentences session 2pptx copy.pptx
heathfieldcps1
Python Notes for mca i year students osmania university.docx
Python Notes for mca i year students osmania university.docx
Ramakrishna Reddy Bijjam
Basic Civil Engineering first year Notes- Chapter 4 Building.pptx
Basic Civil Engineering first year Notes- Chapter 4 Building.pptx
Denish Jangid
Measures of Dispersion and Variability: Range, QD, AD and SD
Measures of Dispersion and Variability: Range, QD, AD and SD
Thiyagu K
1029-Danh muc Sach Giao Khoa khoi 6.pdf
1029-Danh muc Sach Giao Khoa khoi 6.pdf
QucHHunhnh
microwave assisted reaction. General introduction
microwave assisted reaction. General introduction
Maksud Ahmed
Activity 01 - Artificial Culture (1).pdf
Activity 01 - Artificial Culture (1).pdf
ciinovamais
Presentation by Andreas Schleicher Tackling the School Absenteeism Crisis 30 ...
Presentation by Andreas Schleicher Tackling the School Absenteeism Crisis 30 ...
EduSkills OECD
Application orientated numerical on hev.ppt
Application orientated numerical on hev.ppt
RamjanShidvankar
Energy Resources. ( B. Pharmacy, 1st Year, Sem-II) Natural Resources
Energy Resources. ( B. Pharmacy, 1st Year, Sem-II) Natural Resources
Shubhangi Sonawane
psychiatric nursing HISTORY COLLECTION .docx
psychiatric nursing HISTORY COLLECTION .docx
PoojaSen20
Sociology 101 Demonstration of Learning Exhibit
Sociology 101 Demonstration of Learning Exhibit
jbellavia9
The basics of sentences session 3pptx.pptx
The basics of sentences session 3pptx.pptx
heathfieldcps1
Unit-V; Pricing (Pharma Marketing Management).pptx
Unit-V; Pricing (Pharma Marketing Management).pptx
VishalSingh1417
Class 11th Physics NEET formula sheet pdf
Class 11th Physics NEET formula sheet pdf
AyushMahapatra5
Web & Social Media Analytics Previous Year Question Paper.pdf
Web & Social Media Analytics Previous Year Question Paper.pdf
Jayanti Pande
Making and Justifying Mathematical Decisions.pdf
Making and Justifying Mathematical Decisions.pdf
Chris Hunter
Dernier
(20)
2024-NATIONAL-LEARNING-CAMP-AND-OTHER.pptx
2024-NATIONAL-LEARNING-CAMP-AND-OTHER.pptx
TỔNG ÔN TẬP THI VÀO LỚP 10 MÔN TIẾNG ANH NĂM HỌC 2023 - 2024 CÓ ĐÁP ÁN (NGỮ Â...
TỔNG ÔN TẬP THI VÀO LỚP 10 MÔN TIẾNG ANH NĂM HỌC 2023 - 2024 CÓ ĐÁP ÁN (NGỮ Â...
Russian Escort Service in Delhi 11k Hotel Foreigner Russian Call Girls in Delhi
Russian Escort Service in Delhi 11k Hotel Foreigner Russian Call Girls in Delhi
The basics of sentences session 2pptx copy.pptx
The basics of sentences session 2pptx copy.pptx
Python Notes for mca i year students osmania university.docx
Python Notes for mca i year students osmania university.docx
Basic Civil Engineering first year Notes- Chapter 4 Building.pptx
Basic Civil Engineering first year Notes- Chapter 4 Building.pptx
Measures of Dispersion and Variability: Range, QD, AD and SD
Measures of Dispersion and Variability: Range, QD, AD and SD
1029-Danh muc Sach Giao Khoa khoi 6.pdf
1029-Danh muc Sach Giao Khoa khoi 6.pdf
microwave assisted reaction. General introduction
microwave assisted reaction. General introduction
Activity 01 - Artificial Culture (1).pdf
Activity 01 - Artificial Culture (1).pdf
Presentation by Andreas Schleicher Tackling the School Absenteeism Crisis 30 ...
Presentation by Andreas Schleicher Tackling the School Absenteeism Crisis 30 ...
Application orientated numerical on hev.ppt
Application orientated numerical on hev.ppt
Energy Resources. ( B. Pharmacy, 1st Year, Sem-II) Natural Resources
Energy Resources. ( B. Pharmacy, 1st Year, Sem-II) Natural Resources
psychiatric nursing HISTORY COLLECTION .docx
psychiatric nursing HISTORY COLLECTION .docx
Sociology 101 Demonstration of Learning Exhibit
Sociology 101 Demonstration of Learning Exhibit
The basics of sentences session 3pptx.pptx
The basics of sentences session 3pptx.pptx
Unit-V; Pricing (Pharma Marketing Management).pptx
Unit-V; Pricing (Pharma Marketing Management).pptx
Class 11th Physics NEET formula sheet pdf
Class 11th Physics NEET formula sheet pdf
Web & Social Media Analytics Previous Year Question Paper.pdf
Web & Social Media Analytics Previous Year Question Paper.pdf
Making and Justifying Mathematical Decisions.pdf
Making and Justifying Mathematical Decisions.pdf
Advanced Operating System Lecture Notes
1.
Advanced Operating Systems
Lecture notes Dr. Clifford Neuman University of Southern California Information Sciences Institute Copyright © 1995-2006 Clifford Neuman and Dongho Kim - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE
2.
Administration
• Class e-mail: csci555@usc.edu • Office hours: No office hours today. Dr. Neuman is out of town. • Reading report #1 will be posted by Tuesday • Class Web page http://gost.isi.edu/555 Copyright © 1995-2006 Clifford Neuman and Dongho Kim - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE
3.
CSci555:
Advanced Operating Systems Lecture 2 – September 1, 2006 Dr. Tatyana Ryutov University of Southern California Information Sciences Institute Copyright © 1995-2006 Clifford Neuman and Dongho Kim - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE
4.
Outline: Communications Models
• Communication Models: – General concepts. – Message passing. – Distributed shared memory (DSM). – Remote procedure call (RPC) [Birrel et al.] ▪ Light-weight RPC [Bershad et al.] – DSM case studies ▪ IVY [Li et al.] ▪ Linda [Carriero et al.] Copyright © 1995-2006 Clifford Neuman and Dongho Kim - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE
5.
Communication Models
• Support for processes to communicate among themselves. • Traditional (centralized) OS’s: – Provide local (within single machine) communication support. – Distributed OS’s: must provide support for communication across machine boundaries. ▪ Over LAN or WAN. Copyright © 1995-2006 Clifford Neuman and Dongho Kim - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE
6.
Communication Paradigms
• 2 paradigms – Message Passing (MP) – Distributed Shared Memory (DSM) • Message Passing – Processes communicate by sending messages. • Distributed Shared Memory – Communication through a “virtual shared memory”. Copyright © 1995-2006 Clifford Neuman and Dongho Kim - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE
7.
Message Passing
• Basic communication primitives: Sending Q – Send message. ... Send – Receive message. Receiving Q Receive ... • Modes of communication: – Synchronous versus asynchronous. • Semantics: – Reliable versus unreliable. Copyright © 1995-2006 Clifford Neuman and Dongho Kim - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE
8.
Synchronous Communication
• Blocking send – Blocks until message is transmitted – Blocks until message acknowledged • Blocking receive – Waits for message to be received • Process synchronization. Copyright © 1995-2006 Clifford Neuman and Dongho Kim - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE
9.
Asynchronous Communication
• Non-blocking send: sending process continues as soon message is queued. • Blocking or non-blocking receive: – Blocking: ▪ Timeout. ▪ Threads. – Non-blocking: proceeds while waiting for message. ▪ Message is queued upon arrival. ▪ Process needs to poll or be interrupted. Copyright © 1995-2006 Clifford Neuman and Dongho Kim - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE
10.
Reliability of Communication
• Unreliable communication: – “best effort” - send and hope for the best – No ACKs or retransmissions. – Application must provide its own reliability. – Example: User Datagram Protocol (UDP) ▪ Applications using UDP either don’t need reliability or build their own (e.g., UNIX NFS and DNS (both UDP and TCP), some audio or video applications) Copyright © 1995-2006 Clifford Neuman and Dongho Kim - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE
11.
Reliability of Communication
• Reliable communication: – Different degrees of reliability. – Processes have some guarantee that messages will be delivered. – Example: Transmission Control Protocol (TCP) – Reliability mechanisms: ▪ Positive acknowledgments (ACKs). ▪ Negative Acknowledgments (NACKs). – Possible to build reliability atop unreliable service (E2E argument). Copyright © 1995-2006 Clifford Neuman and Dongho Kim - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE
12.
Distributed Shared Memory
• Motivated by development of shared- memory multiprocessors which do share memory. • Abstraction used for sharing data among processes running on machines that do not share memory. • Processes think they read from and write to a “virtual shared memory”. Copyright © 1995-2006 Clifford Neuman and Dongho Kim - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE
13.
DSM 2
• Primitives: read and write. • OS ensures that all processes see all updates. – Happens transparently to processes. Copyright © 1995-2006 Clifford Neuman and Dongho Kim - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE
14.
DSM and MP
• DSM is an abstraction! – Gives programmers the flavor of a centralized memory system, which is a well-known programming environment. – No need to worry about communication and synchronization. • But, it is implemented atop MP. – No physically shared memory. – OS takes care of required communication. Copyright © 1995-2006 Clifford Neuman and Dongho Kim - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE
15.
Caching in DSM
• For performance, DSM caches data locally. – More efficient access (locality). – But, must keep caches consistent. – Caching of pages for of page-based DSM. • Issues: – Page size. – Consistency mechanism. Copyright © 1995-2006 Clifford Neuman and Dongho Kim - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE
16.
Approaches to DSM
• Hardware-based: – Multi-processor architectures with processor-memory modules connected by high-speed LAN (E.g., Stanford’s DASH). – Specialized hardware to handle reads and writes and perform required consistency mechanisms. Copyright © 1995-2006 Clifford Neuman and Dongho Kim - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE
17.
Approaches to DSM
• Page-based: – Example: IVY. – DSM implemented as region of processor’s virtual memory; occupies same address space range for every participating process. – OS keeps DSM data consistency as part of page fault handling. Copyright © 1995-2006 Clifford Neuman and Dongho Kim - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE
18.
Approaches to DSM
• Library-based: – Or language-based. – Example: Linda. – Language or language extensions. – Compiler inserts appropriate library calls whenever processes access DSM items. – Library calls access local data and communicate when necessary. Copyright © 1995-2006 Clifford Neuman and Dongho Kim - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE
19.
DSM Case Studies:
IVY • Environment:”loosely coupled” multiprocessor. – Memory is physically distributed. – Memory mapping managers (OS kernel): ▪ Map local memories to shared virtual space. ▪ Local memory as cache of shared virtual space. ▪ Memory reference may cause page fault; page retrieved and consistency handled. Copyright © 1995-2006 Clifford Neuman and Dongho Kim - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE
20.
IVY
• Issues: – Read-only versus writable data. – Locality of reference. – Granularity (1 Kbyte page size). ▪ Bigger pages versus smaller pages. Copyright © 1995-2006 Clifford Neuman and Dongho Kim - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE
21.
IVY
• Memory coherence strategies: – Page synchronization ▪ Invalidation ▪ Write broadcast – Page ownership ▪ Fixed: page always owned by same processor ▪ Dynamic Copyright © 1995-2006 Clifford Neuman and Dongho Kim - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE
22.
IVY Page Synchronization
• Invalidation: – On write fault, invalidate all copies; give faulting process write access; gets copy of page if not already there. – Problem: must update page on reads. • Write broadcast: – On write fault, fault handler writes to all copies. – Expensive! Copyright © 1995-2006 Clifford Neuman and Dongho Kim - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE
23.
IVY Memory Coherence
• Paper discusses approaches to memory coherence in page-based DSM. – Centralized: single manager residing on a single processor managing all pages. – Distributed: multiple managers on multiple processors managing subset of pages. Copyright © 1995-2006 Clifford Neuman and Dongho Kim - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE
24.
DSM Case Studies:
Linda • Language-based approach to DSM. • Environment: – Similar to IVY, ie, loosely coupled machines connected via fast broadcast bus. – Instead of shared address space, processes make library calls inserted by compiler when accessing DSM. – Libraries access local data and communicate to maintain consistency. Copyright © 1995-2006 Clifford Neuman and Dongho Kim - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE
25.
Linda
• DSM: tuple space. • Basic operations: – out (data): data added to tuple space. – in (data): removes matching data from TS; destructive. – read (data): same as “in”, but tuple remains in TS (non-destructive). Copyright © 1995-2006 Clifford Neuman and Dongho Kim - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE
26.
Linda Primitives: Examples
• out (“P”, 5, false) : tuple (“P”, 5, false) added to TS. – “P” : name – Other components are data values. – Implementation reported on the paper: every node stores complete copy of TS. – out (data) causes data to be broadcast to every node. Copyright © 1995-2006 Clifford Neuman and Dongho Kim - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE
27.
Linda Primitives: Examples
• in (“P”, int I, bool b): tuple (“P”, 5, false) removed from TS. – If matching tuple found locally, local kernel tries to delete tuple on all nodes. Copyright © 1995-2006 Clifford Neuman and Dongho Kim - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE
28.
Remote Procedure Call
• Builds on MP. • Main idea: extend traditional (local) procedure call to perform transfer of control and data across network. • Easy to use: analogous to local calls. • But, procedure is executed by a different process, probably on a different machine. • Fits very well with client-server model. Copyright © 1995-2006 Clifford Neuman and Dongho Kim - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE
29.
RPC Mechanism
1. Invoke RPC. 2. Calling process suspends. 3. Parameters passed across network to target machine. 4. Procedure executed remotely. 5. When done, results passed back to caller. 6. Caller resumes execution. Is this synchronous or asynchronous? Copyright © 1995-2006 Clifford Neuman and Dongho Kim - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE
30.
RPC Advantages
• Easy to use. • Well-known mechanism. • Abstract data type – Client-server model. – Server as collection of exported procedures on some shared resource. – Example: file server. • Reliable. Copyright © 1995-2006 Clifford Neuman and Dongho Kim - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE
31.
RPC Semantics 1
• Delivery guarantees. • “Maybe call”: – Clients cannot tell for sure whether remote procedure was executed or not due to message loss, server crash, etc. – Usually not acceptable. Copyright © 1995-2006 Clifford Neuman and Dongho Kim - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE
32.
RPC Semantics 2
• “At-least-once” call: – Remote procedure executed at least once, but maybe more than once. – Retransmissions but no duplicate filtering. – Idempotent operations OK; e.g., reading data that is read-only. Copyright © 1995-2006 Clifford Neuman and Dongho Kim - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE
33.
RPC Semantics 3
• “At-most-once” call – Most appropriate for non-idempotent operations. – Remote procedure executed 0 or 1 time, ie, exactly once or not at all. – Use of retransmissions and duplicate filtering. – Example: Birrel et al. implementation. ▪ Use of probes to check if server crashed. Copyright © 1995-2006 Clifford Neuman and Dongho Kim - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE
34.
RPC Implementation (Birrel
et al.) Caller Callee User RPC RPC Server User stub runtime Call runtime stub Server packet rcv call call xmit unpk pck args work Result pck return unpk rcv xmit return result result Copyright © 1995-2006 Clifford Neuman and Dongho Kim - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE
35.
RPC Implementation 2
• RPC runtime mechanism responsible for retransmissions, acknowledgments. • Stubs responsible for data packaging and un-packaging; – AKA marshalling and un- marshalling: putting data in form suitable for transmission. Example: Sun’s XDR. Copyright © 1995-2006 Clifford Neuman and Dongho Kim - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE
36.
Binding
• How to determine where server is? Which procedure to call? – “Resource discovery” problem ▪ Name service: advertises servers and services. ▪ Example: Birrel et al. uses Grapevine. • Early versus late binding. – Early: server address and procedure name hard-coded in client. – Late: go to name service. Copyright © 1995-2006 Clifford Neuman and Dongho Kim - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE
37.
Synchronous & Asynchronous
RPC Synchronous Asynchronous Client Server Client Server Copyright © 1995-2006 Clifford Neuman and Dongho Kim - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE
38.
RPC Performance
• Sources of overhead – data copying – scheduling and context switch. • Light-Weight RPC – Shows that most invocations took place on a single machine. – LW-RPC: improve RPC performance for local case. – Optimizes data copying and thread scheduling for local case. Copyright © 1995-2006 Clifford Neuman and Dongho Kim - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE
39.
LW-RPC 1
• Argument copying – RPC: 4 times – copying between kernel and user space. – LW-RPC: common data area (A-stack) shared by client and server and used to pass parameters and results; access by client or server, one at a time. Copyright © 1995-2006 Clifford Neuman and Dongho Kim - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE
40.
LW-RPC 2
• A-stack avoids copying between kernel and user spaces. • Client and server share the same thread: less context switch (like regular calls). user 4. executes & returns 1. copy args 2. traps A 3. upcall client server kernel Copyright © 1995-2006 Clifford Neuman and Dongho Kim - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE
Télécharger maintenant