Introduction Flashcards

(7 cards)

1
Q

What is a distributed system?
(Defintion, Concept, work done)

A

A distributed system is a collection of autonomous computing elements that appears to its users as a single coherent system.

Concept: Multiple interconnected computers that cooperate together to provide some service.

You can get work done:
* wherever you are
* whenever you want
* even if parts of the system aren’t working
* no matter how many other people are using it
* as if it was a single dedicated system just for you
* that (almost) never fails

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Why are distributed Systems used?
(4 points) (ARAC)

A
  1. allow geographic separation
  2. Reliable Systems
  3. Combine systems for higher capacity
  4. Customise computers for specific tasks (email server, backup server)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What are the main challenges with Distributed Systems?
(2 Points) (KH)

A
  1. Keep working in the presence of partial failures, without effecting user experience.
  2. Handle inherent concurrency in the application context (Managing multiple tasks that can occur simultaneously)

Solutions to the first aggravate/worsen the second!

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

How is reliablity / Failure measured in distributed systems? (Leave for now?)

A

Mean Time before Failure

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Why is Distributed Systems hard?
(6 points) (SFCPIS)

A
  1. System Design (Spliting responsibilities between client and server)
  2. Failures are regularly occuring, partial and ambigious.
  3. Concurrency and consistency.
  4. Performance
  5. Implementation and testing
  6. Security
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

What properties do we want in a Distributed System?
(6 Points) (FHSRCS)

A
  1. Fault-Tolerant
  2. Highly Available
  3. Scalable
  4. Recoverable
  5. Consistent
  6. Secure
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What is Brewer’s Conjecture (2000)
(Definition)

A

A computer science theory, in which Eric Brewer states; “it is impossible for a distributed service to provide more than two of the following”:
1. Consistency (all clients see the same data at the same time)
2. Availability (any client making a request for data gets a response, even in presence of partial failures)
3. Partition Tolerance (The system continues to operate despite an arbitrary number of messages being dropped (or delayed) by the network between nodes.)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly