Midterm 1 (longer version)

0.0(0)
Studied by 0 people
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/383

encourage image

There's no tags or description

Looks like no tags are added yet.

Last updated 12:47 AM on 10/15/26
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai
Chat

No analytics yet

Send a link to your students to track their progress

384 Terms

1
New cards

Define a networked computer system.

Multiple computers linked by a communication network; they need not provide a single integrated service.

2
New cards

Define a distributed system (textbook emphasis).

A networked system with processes and resources sufficiently spread across computers to meet its goals.

3
New cards

Define a decentralized system (textbook emphasis).

A networked system where processes and resources must be spread across computers, e.g., because of ownership or location.

4
New cards

Why isn't decentralization automatically desirable?

It adds coordination, failure handling, and management complexity; distribute only as necessary.

5
New cards

What's the integrative view of networking?

Connect previously independent systems or services, often across organizational boundaries.

6
New cards

What's the expansive view of networking?

Extend an existing service across machines for capacity, location, or dependability.

7
New cards

What distinguishes distributed multicomputers from shared-memory multiprocessors?

Multicomputers have separate memories and clocks; they communicate over a network and can fail independently.

8
New cards

Two fundamental absences in distributed systems?

Shared memory and a perfect global clock.

9
New cards

What is a partial failure?

One node, process, or link fails while other parts continue functioning.

10
New cards

Why can distributed systems have hidden dependencies?

A service may rely on remote processes, network links, data replicas, or middleware outside the user's view.

11
New cards

List the four prominent design goals taught in class.

Resource sharing, transparency, openness, scalability.

12
New cards

Why share remote resources?

Efficiency and collaboration: common storage, databases, services, and devices are easier to use jointly.

13
New cards

What is distribution transparency?

Hiding selected aspects of distribution from users or applications.

14
New cards

Why is complete transparency impossible or undesirable?

Networks incur latency and ambiguous failures; masking distribution has cost and may obscure helpful information.

15
New cards

What is access transparency?

Hide differences in how a resource is accessed or represented locally versus remotely.

16
New cards

What is location transparency?

Hide where a resource or service is physically located.

17
New cards

What is migration transparency?

Hide that a resource or component may move to another host.

18
New cards

What is relocation transparency?

Hide movement of a resource while that resource is in use.

19
New cards

Migration vs relocation transparency?

Relocation adds the requirement that movement be hidden during active use.

20
New cards

What is replication transparency?

Hide the existence of multiple copies from clients.

21
New cards

What is concurrency transparency?

Hide interference caused by simultaneous independent clients accessing shared resources.

22
New cards

What is failure transparency?

Hide component failures and recovery insofar as feasible.

23
New cards

Is financial transparency one of the textbook's distribution transparencies?

No; access, location, migration, relocation, replication, concurrency, and failure are covered.

24
New cards

What is an open distributed system?

A system with defined interfaces and standards allowing components from different implementations to cooperate.

25
New cards

What is interoperability?

Different systems or implementations can communicate and work together.

26
New cards

What is portability?

Software can be moved to another platform with little change.

27
New cards

What is extensibility?

A system can be expanded or modified without rebuilding everything.

28
New cards

Name three scalability dimensions.

Size, geographic, and administrative.

29
New cards

What is size scalability?

Handling growth in users, requests, nodes, or data volume.

30
New cards

What is geographic scalability?

Maintaining useful behavior across greater geographic distances and latency.

31
New cards

What is administrative scalability?

Operating across distinct organizations with different ownership, trust, and policies.

32
New cards

Why can moving from a LAN to a WAN be difficult?

Latency, unreliable paths, and loss of convenient local broadcast undermine synchronous assumptions.

33
New cards

What is partitioning (data distribution)?

Splitting data or computation so different machines own different portions.

34
New cards

What is replication (data distribution)?

Maintaining copies of the same data/service on multiple machines.

35
New cards

What is caching?

Keeping frequently used data close to consumers to reduce access time and origin load.

36
New cards

What is the main problem introduced by replication and caching?

Consistency: one copy may be updated before others.

37
New cards

Partitioning vs replication?

Partitioning splits responsibility across machines; replication duplicates information across machines.

38
New cards

Cache vs authoritative database?

A cache accelerates reads, but may be stale; authoritative state determines correctness-critical decisions.

39
New cards

Why place CDN servers near users?

To reduce network distance, latency, and origin traffic.

40
New cards

What is a CDN?

A content delivery network that places cached or replicated content at distributed serving locations.

41
New cards

What is Metcalfe's Law as taught in lecture?

A heuristic that network value scales roughly with the square of connected users, proportional to n squared.

42
New cards

What is Moore's Law?

A historical observation that transistor counts tended to double roughly every two years, not a guarantee.

43
New cards

Why use multiple cores and machines?

Single-core clock-speed gains are limited; parallelism can increase throughput and capacity.

44
New cards

What is a computational cluster?

A collection of machines jointly handling computing tasks, typically under coordinated management.

45
New cards

What is grid computing?

Federated resource sharing across distinct systems or administrative domains, often for scientific computing.

46
New cards

What is cloud computing broadly?

On-demand access to network-hosted computing, storage, platforms, or applications.

47
New cards

What are distributed information systems?

Distributed applications integrating data and transactions across services and databases.

48
New cards

What are pervasive distributed systems?

Computing embedded in mobile, sensor, and ambient environments, often without a traditional administrator.

49
New cards

Why is mobility a motivation?

People and devices must access services while moving between networks/locations.

50
New cards

What is delegated operation?

Outsourcing specialized functionality, hosting, storage, or management to other services.

51
New cards

Why is incremental growth attractive?

Capacity can be added in smaller units instead of replacing one monolithic machine.

52
New cards

Availability vs reliability (textbook's precise distinction)?

Availability: ready at a given instant. Reliability: uninterrupted correct operation over a time interval.

53
New cards

What is safety in a dependable system?

A temporary failure must not cause catastrophic harm.

54
New cards

What is maintainability?

Ease and speed of restoring a system after failure.

55
New cards

What is MTTF?

Mean time to failure: average operation time before failure.

56
New cards

What is MTTR?

Mean time to repair: average time needed to recover.

57
New cards

What is MTBF in the textbook?

Mean time between failures = MTTF + MTTR.

58
New cards

Steady-state availability from MTTF and MTTR?

MTTF / (MTTF + MTTR), under the usual repair-cycle model.

59
New cards

Fault vs error vs failure?

Fault causes an erroneous state; an error can lead to externally incorrect service, a failure.

60
New cards

What is fault tolerance?

Continuing to provide an acceptable service even when some faults occur.

61
New cards

What is a transient fault?

A one-time fault that disappears, e.g., a brief wireless disturbance.

62
New cards

What is an intermittent fault?

A fault that disappears and reappears unpredictably.

63
New cards

What is a permanent fault?

A fault that remains until the underlying cause is fixed or removed.

64
New cards

What is fail-stop behavior?

A component ceases operation in a model where its failure can be reliably detected.

65
New cards

What is a halt/crash failure?

A component stops responding without necessarily notifying anyone.

66
New cards

What is a fail-restart failure?

A component stops then resumes and may have stale state.

67
New cards

What is an omission failure?

A process or channel fails to send or deliver a required message.

68
New cards

What is a timing failure?

An operation or message does not complete within the expected time bounds.

69
New cards

What is a network partition?

Nodes remain running but disconnected into groups that cannot communicate.

70
New cards

What is a Byzantine failure?

A component behaves arbitrarily or gives incorrect, potentially contradictory information.

71
New cards

What can cause Byzantine behavior?

Software faults, hardware errors, bad data, or adversarial interference.

72
New cards

Does a timeout prove failure?

No; a slow server or delayed/blocked network path can also cause a timeout.

73
New cards

Why is failure detection inherently uncertain?

A crashed machine and an arbitrarily delayed response can be observationally indistinguishable.

74
New cards

What is redundancy for high availability?

Maintaining extra components so service continues when some fail.

75
New cards

Two independent replicas have 5% failure probability each; chance both fail?

0.05 times 0.05 = 0.0025 = 0.25%, if independent.

76
New cards

Why does independence matter in availability calculations?

Shared power, software, or network faults can fail replicas together, invalidating simple multiplication.

77
New cards

What if a service needs every replica to be available?

Adding required components creates more ways for the service to become unavailable.

78
New cards

What is no-global-knowledge?

Each node knows local state and delayed reports, not a perfect simultaneous global snapshot.

79
New cards

Why is global clock agreement difficult?

Clocks drift and messages arrive after unpredictable delays.

80
New cards

Why are distributed systems hard to test and debug?

Nondeterministic timing, partial failures, concurrent events, multiple hosts, and changing environments.

81
New cards

What is confidentiality?

Information is disclosed only to authorized parties.

82
New cards

What is integrity?

Information is modified only in authorized ways.

83
New cards

What is authentication?

Verifying a claimed identity.

84
New cards

What is authorization?

Deciding which actions an identified principal is allowed to perform.

85
New cards

Authentication vs authorization?

Authentication establishes identity; authorization establishes permitted actions.

86
New cards

What is a replay attack?

An adversary repeats an earlier legitimate message to cause an unwanted repeated effect.

87
New cards

What lesson does the Knight Capital case teach?

Inconsistent deployment/configuration across servers can have system-wide consequences.

88
New cards

Name the eight fallacies of distributed computing.

The network is reliable, secure, homogeneous, static; latency and transport cost are zero; bandwidth infinite; one administrator.

89
New cards

Why is assuming zero latency dangerous?

A design can make too many blocking calls across a comparatively slow network.

90
New cards

Why is assuming infinite bandwidth dangerous?

Replicating or moving too much data overwhelms links and increases costs.

91
New cards

Why is assuming one administrator dangerous?

Different organizations may enforce different policies, control, and access rights.

92
New cards

Why is assuming the topology never changes dangerous?

Nodes join, leave, move, crash, and get replaced.

93
New cards

Software architecture vs system architecture?

Software architecture describes logical components and interactions; system architecture describes physical placement.

94
New cards

What is an architectural style?

Rules governing components, connectors, exchanged data, and organization of a system.

95
New cards

What is a software component?

A modular unit with defined required and provided interfaces.

96
New cards

Why are stable interfaces valuable?

You can replace or upgrade implementations without breaking dependent components.

97
New cards

What is a layered architecture?

A stack of abstractions in which each layer offers services to layers above it.

98
New cards

What is pure layering?

Each layer calls only an adjacent lower layer through its interface.

99
New cards

What is mixed layering?

A higher layer may use multiple lower layers or bypass intermediate layers.

100
New cards

What is an upcall?

A lower layer notifies or invokes a higher layer, usually by callback/event.