Scribd Logo
Upload

Welcome to Scribd!

  • 35 views

    Lecture 3 Multiprocessor Vs Multicomputer Vs DS

    Uploaded by

    eric
    This document discusses multiple processor systems and distributed systems. It covers topics like multiprocessors, multicomputers, distributed operating systems, load balancing, network hardware, network protocols, document-based middleware, file system-based middleware, shared object-based middleware, and coordination-based middleware. The key aspects of these topics are defined and examples are provided to illustrate concepts like shared memory multiprocessors, message passing multicomputers, distributed shared memory, and middleware architectures like the web, AFS, CORBA, Globe, Linda, and Jini.

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd

    Lecture 3 Multiprocessor Vs Multicomputer Vs DS

    Uploaded by

    eric
    35 views55 pages
    This document discusses multiple processor systems and distributed systems. It covers topics like multiprocessors, multicomputers, distributed operating systems, load balancing, network hardware, network protocols, document-based middleware, file system-based middleware, shared object-based middleware, and coordination-based middleware. The key aspects of these topics are defined and examples are provided to illustrate concepts like shared memory multiprocessors, message passing multicomputers, distributed shared memory, and middleware architectures like the web, AFS, CORBA, Globe, Linda, and Jini.

    Original Title

    Lecture 3 Multiprocessor vs Multicomputer vs DS (1)

    Copyright

    © © All Rights Reserved

    Available Formats

    PPT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document discusses multiple processor systems and distributed systems. It covers topics like multiprocessors, multicomputers, distributed operating systems, load balancing, network hardware, network protocols, document-based middleware, file system-based middleware, shared object-based middleware, and coordination-based middleware. The key aspects of these topics are defined and examples are provided to illustrate concepts like shared memory multiprocessors, message passing multicomputers, distributed shared memory, and middleware architectures like the web, AFS, CORBA, Globe, Linda, and Jini.

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd
    Download as ppt, pdf, or txt
    35 views55 pages

    Lecture 3 Multiprocessor Vs Multicomputer Vs DS

    Uploaded by

    eric
    This document discusses multiple processor systems and distributed systems. It covers topics like multiprocessors, multicomputers, distributed operating systems, load balancing, network hardware, network protocols, document-based middleware, file system-based middleware, shared object-based middleware, and coordination-based middleware. The key aspects of these topics are defined and examples are provided to illustrate concepts like shared memory multiprocessors, message passing multicomputers, distributed shared memory, and middleware architectures like the web, AFS, CORBA, Globe, Linda, and Jini.

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd
    Download as ppt, pdf, or txt
    You are on page 1of 55

    Lecture 3

    Multiple Processor Systems

    8.1 Multiprocessors
    8.2 Multicomputers
    8.3 Distributed systems
    Multiprocessor Systems

    • Continuous need for faster computers


    – shared memory model
    – message passing multiprocessor
    – wide area distributed system
    Multiprocessors

    Definition:
    A computer system in which two or
    more CPUs share full access to a
    common RAM
    Multiprocessor Hardware (1)

    Bus-based multiprocessors
    4
    Multiprocessor Hardware (2)

    • UMA Multiprocessor using a crossbar switch


    Multiprocessor Hardware (3)

    • UMA multiprocessors using multistage switching


    networks can be built from 2x2 switches

    (a) 2x2 switch (b) Message format


    Multiprocessor Hardware (4)

    • Omega Switching Network


    Multiprocessor Hardware (5)

    NUMA Multiprocessor Characteristics


    1. Single address space visible to all CPUs
    2. Access to remote memory via commands
    - LOAD
    - STORE
    3. Access to remote memory slower than to local
    Multiprocessor Hardware (6)

    (a) 256-node directory based multiprocessor


    (b) Fields of 32-bit memory address
    (c) Directory at node 36
    Multiprocessor OS Types (1)

    Bus

    Each CPU has its own operating system


    Multiprocessor OS Types (2)

    Bus

    Master-Slave multiprocessors
    Multiprocessor OS Types (3)

    Bus

    • Symmetric Multiprocessors
    – SMP multiprocessor model
    Multiprocessor Synchronization (1)

    TSL instruction can fail if bus already locked


    Multiprocessor Synchronization (2)

    Multiple locks used to avoid cache thrashing


    Multiprocessor Synchronization (3)
    Spinning versus Switching
    • In some cases CPU must wait
    – waits to acquire ready list
    • In other cases a choice exists
    – spinning wastes CPU cycles
    – switching uses up CPU cycles also
    – possible to make separate decision each time
    locked mutex encountered
    Multiprocessor Scheduling (1)

    • Timesharing
    – note use of single data structure for scheduling
    Multiprocessor Scheduling (2)

    • Space sharing
    – multiple threads at same time across multiple CPUs
    Multiprocessor Scheduling (3)

    • Problem with communication between two threads


    – both belong to process A
    – both running out of phase
    Multiprocessor Scheduling (4)

    • Solution: Gang Scheduling


    1. Groups of related threads scheduled as a unit (a gang)
    2. All members of gang run simultaneously
    •
    on different timeshared CPUs
    3. All gang members start and end time slices together
    Multiprocessor Scheduling (5)

    Gang Scheduling
    Multicomputers

    • Definition:
    Tightly-coupled CPUs that do not share
    memory

    • Also known as
    – cluster computers
    – clusters of workstations (COWs)
    Multicomputer Hardware (1)

    • Interconnection topologies
    (a) single switch (d) double torus
    (b) ring (e) cube
    (c) grid (f) hypercube
    Multicomputer Hardware (2)

    • Switching scheme
    – store-and-forward packet switching
    Multicomputer Hardware (3)

    Network interface boards in a multicomputer


    Low-Level Communication Software (1)

    • If several processes running on node


    – need network access to send packets …
    • Map interface board to all process that need it

    • If kernel needs access to network …


    • Use two network boards
    – one to user space, one to kernel
    Low-Level Communication Software (2)

    Node to Network Interface Communication


    • Use send & receive rings
    • coordinates main CPU with on-board CPU
    User Level Communication Software

    (a) Blocking send call


    • Minimum services
    provided
    – send and receive
    commands

    • These are blocking


    (synchronous) calls

    (b) Nonblocking send call


    Remote Procedure Call (1)

    • Steps in making a remote procedure call


    – the stubs are shaded gray
    Remote Procedure Call (2)
    Implementation Issues
    • Cannot pass pointers
    – call by reference becomes copy-restore (but might fail)
    • Weakly typed languages
    – client stub cannot determine size
    • Not always possible to determine parameter types
    • Cannot use global variables
    – may get moved to remote machine
    Distributed Shared Memory (1)

    • Note layers where it can be implemented


    – hardware
    – operating system
    – user-level software
    Distributed Shared Memory (2)

    Replication
    (a) Pages distributed on 4 machines

    (b) CPU 0 reads page 10

    (c) CPU 1 reads page 10


    Distributed Shared Memory (3)

    • False Sharing
    • Must also achieve sequential consistency
    Multicomputer Scheduling
    Load Balancing (1)

    Process

    • Graph-theoretic deterministic algorithm


    Load Balancing (2)

    • Sender-initiated distributed heuristic algorithm


    – overloaded sender
    Load Balancing (3)

    • Receiver-initiated distributed heuristic algorithm


    – under loaded receiver
    Distributed Systems (1)

    Comparison of three kinds of multiple CPU systems


    Distributed Systems (2)

    Achieving uniformity with middleware


    Network Hardware (1)

    Computer

    (a) (b)

    • Ethernet
    (a) classic Ethernet
    (b) switched Ethernet
    Network Hardware (2)

    The Internet
    Network Services and Protocols (1)

    Network Services
    Network Services and Protocols (2)

    • Internet Protocol
    • Transmission Control Protocol
    • Interaction of protocols
    Document-Based Middleware (1)

    • The Web
    – a big directed graph of documents
    Document-Based Middleware (2)
    How the browser gets a page
    1. Asks DNS for IP address
    2. DNS replies with IP address
    3. Browser makes connection
    4. Sends request for specified page
    5. Server sends file
    6. TCP connection released
    7. Browser displays text
    8. Browser fetches, displays images
    File System-Based Middleware (1)

    (b)
    (a)

    • Transfer Models
    (a) upload/download model
    (b) remote access model
    File System-Based Middleware (2)

    Naming Transparency
    (b) Clients have same view of file system
    (c) Alternatively, clients with different view
    File System-Based Middleware (3)

    • Semantics of File sharing


    – (a) single processor gives sequential consistency
    – (b) distributed system may return obsolete value
    File System-Based Middleware (4)

    Client's view
    • AFS – Andrew File System
    – workstations grouped into cells
    – note position of venus and vice
    Shared Object-Based Middleware (1)

    • Main elements of CORBA based system


    – Common Object Request Broker Architecture
    Shared Object-Based Middleware (2)
    • Scaling to large systems
    – replicated objects
    – flexibility
    • Globe
    – designed to scale to a billion users
    – a trillion objects around the world
    Shared Object-Based Middleware (3)

    Globe structured object


    Shared Object-Based Middleware (4)

    • A distributed shared object in Globe


    – can have its state copied on multiple computers at once
    Shared Object-Based Middleware (5)

    Internal structure of a Globe object


    Coordination-Based Middleware (1)
    • Linda
    – independent processes
    – communicate via abstract tuple space
    • Tuple
    – like a structure in C, record in Pascal

    1. Operations: out, in, read, eval


    Coordination-Based Middleware (2)

    Publish-Subscribe architecture
    Coordination-Based Middleware (3)
    • Jini - based on Linda model
    – devices plugged into a network
    – offer, use services
    • Jini Methods
    1. read
    2. write
    3. take
    4. notify

    You might also like