Please enable JavaScript.

Coggle requires JavaScript to display documents.

Chapter 3: Processes - Coggle Diagram

- - - - send(message)
      - receive(message)
  - - - Link established only if processes share a common mailbox
      - A link may be associated with many processes
      - Each pair of processes may share several communication links
      - Link may be unidirectional or bi-directional
  - - - Links are established automatically
      - A link is associated with exactly one pair of communicating processes
      - Between each pair there exists exactly one link
      - The link may be unidirectional, but is usually bi-directional
  - - - Blocking is considered synchronous
      - Non-blocking is considered asynchronous
      - Different combinations possible
  - - - Implemented in one of three ways
      - Zero capacity – no messages are queued on a link.Sender must wait for receiver (rendezvous)
      - Bounded capacity – finite length of n messagesSender must wait if link full
      - Unbounded capacity – infinite length Sender never waits
- - - - The program code, also called text section
      - Current activity including program counter, processor registers
      - Stack containing temporary data
      - Function parameters, return addresses, local variables
      - Data section containing global variables
      - Heap containing memory dynamically allocated during run time
- - - - Reasons for cooperating processes
        
        Information sharing
        
        Computation speedup
        
        Modularity
        
        Convenience
    - - Shared memory
      - Message passing