{ "@context": "https://schema.org", "@type": "Organization", "name": "Brainscape", "url": "https://www.brainscape.com/", "logo": "https://www.brainscape.com/pks/images/cms/public-views/shared/Brainscape-logo-c4e172b280b4616f7fda.svg", "sameAs": [ "https://www.facebook.com/Brainscape", "https://x.com/brainscape", "https://www.linkedin.com/company/brainscape", "https://www.instagram.com/brainscape/", "https://www.tiktok.com/@brainscapeu", "https://www.pinterest.com/brainscape/", "https://www.youtube.com/@BrainscapeNY" ], "contactPoint": { "@type": "ContactPoint", "telephone": "(929) 334-4005", "contactType": "customer service", "availableLanguage": ["English"] }, "founder": { "@type": "Person", "name": "Andrew Cohen" }, "description": "Brainscape’s spaced repetition system is proven to DOUBLE learning results! Find, make, and study flashcards online or in our mobile app. Serious learners only.", "address": { "@type": "PostalAddress", "streetAddress": "159 W 25th St, Ste 517", "addressLocality": "New York", "addressRegion": "NY", "postalCode": "10001", "addressCountry": "USA" } }
Brainscape's Knowledge GenomeTM


Top Flashcards (Certified)
All Flashcards

Distributed Sustems > Exams multiple > Flashcards

Exams multiple Flashcards

(86 cards)

Start Studying
1
Q

What is meant by access transparency?

A

Local and remote resources are accessed using the same operations

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

what is meant by location transparency?

A

Remote resources are accessed using location independent names

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

What is meant by concurrency transparency?

A

Processes can access resources without interfering with each other

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

What is meant by failure transparency?

A

Failures are concealed for the users of a resource

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

What is meant by replication transparency?

A

Users of a resource access it as if it was not replicated

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

What is significant for a client server architecture?

A

The client is the active part

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

What would we call a system where one node is always reacting on requests and other nodes only communicate with this node?

A

A client server system

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

What is significant for a peer-to-peer architecture?

A

All nodes are active and can be the initiator of operations

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

What do we know in a synchronous system?

A

The upper bound of the time to perform an operation

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

What is significant for an asynchronous system?

A

That the time to perform an operation does not have an upper bound

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

What do we call a system where the maximum times for operations and messages delivery are known?

A

A synchronous system

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

What is provided by UDP?

A

A best effort delivery of messages to a process

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

What is provided by TCP?

A

A full-duplex stream between two processes

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

Which address can be found in the TCP header?

A

The port numbers

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

What is significant for synchronous communication?

A

The send operation blocks and waits for the receive operation

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

What is significant asynchronous communication?

A

A sender can continue without waiting for the receive operation

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

Can a synchronous communication interface be used in an asynchronous way?

A

Yes, by performing the send operation in a separate thread

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

What is the difference between the two nodes that are communicating over a stream socket?

A

Nothing, they have equal rights and responsibilities

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

The erlang call gen_tcp:recv(Socket,0) will return

A

The first part(possibly the whole) message sent to Socket

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

What is the purpose of the marshaling procedure?

A

To encode application layer structures in an external form

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

How are arguments passed in Java RMI?

A

At most once

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

What level of transparency is provided by method invocation in Java RMI?

A

Location transparency only since we need to capture remote exceptions

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

What level of transparency is provided by method invocation in Java RMI?

A

Location transparency only since we need to capture remote exceptions

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

How do Erlang processes communicate?

A

Asynchronous message passing

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
25
Does Erlang provide a form of location transparency?
Yes a process can use a process identifier without having to know the address of the node where the process lives
26
How is the destination defined in an Erlang send operation?
As process identifier or a local or remote registered name
27
What is a soft link in a file system?
A path that is resolved to another path
28
What is a hard link in a file system?
A mapping of a name to a file identifier
29
What is the purpose of the Unix Iseek operation?
Set the write/read pointer of an opened file
30
How is a NFS client-side cashe entry validated?
If the validity was checked less than t second ago or if the server notification time is equal to the client notification time
31
How is authentication control handled in Sun NFS?
Authentication is provided by RPC in each operation
32
How does a NFS server know at what position to read and write an opened file?
Each read and write operation holds the position
33
How is AFS client side cashing implemented?
The server promise to notify the client if a file is modified by another client
34
Can two client have an inconsistent view of a file using AFS?
Yes, if a call-back message is lost a cashed copy can be used although the original has been modified
35
What is true if A happened real time before B?
A could have happened before B
36
What is true for events A and B?
If A caused B then A happened before B
37
What can we know if we use Lamport clocks?
if L(a)
38
What can we know if we use Lamport clocks?
if but not only, if a happened before b then L(a)
39
What can we conclude looking at the Lamport clock timestamps of two events?
if L(a) !
40
What is the most that we know if we use vector clocks
V(a)
41
What is the definition of a consist cut?
If e is in the cut and f happened before e then f is in the cut
42
What is the definition of a stable global state predicate?
If a system enters a state where the predicate holds true it will remain true in all future states
43
What is the definition of a unstable global state predicate?
The predicate could hold true in a state but then be false in future states.
44
What is the difference between a URL and a URN?
URN resolves into any replica of a resource matching the URI.
45
How are inconsistencies of the resolver cache handled in the DNS architecture?
Each entry has a time to live
46
What is the advantage of using recursive navigation for DNS queries?
Servers can hide internal DNS hierachy
47
How are inconsistent cashed entries removed from a DNS resolver?
All entries have en expiration time set when cashed
48
How can we make two computer clocks perfectly synchronized?
we cannot
49
What accuracy can be provided using Christian's algorithm?
remember the equation!
50
What is the purpose of Berkley algorithm?
to perform internal synchronization
51
What does the reply from a NTP server contain?
send and receive time of request and send time of reply
52
What is true if A happened before B?
A must have occurred in real time before B
53
Give an example of a stable global state predicate
Deadlock
54
What are the requirements for using the Bully algorithm ?
We must have reliable failure detectors
55
What is the benefit of a reliable multicast?
messages are guaranteed to be delivered to all correct processes
56
Can we implement a reliable multicast using only basic multicast?
yes, by re sending each received message to all the other nodes
57
What is the definition of total order multicast?
Messages are delivered in the same sequence
58
What is a dirty read during the transaction?
reading a value that has not been committed
59
What is two-phase locking in a transaction?
not taking any locks once a lock has been released
60
What does it mean that a transaction meets the atomicity property?
either all or no operations in the transaction are performed
61
What does it mean that a transaction meets the isolation property?
intermediate results must no be visible to other transactions
62
What does it mean that a transaction meets the durability property?
The effects of the transaction will remain even if we have a server crash
63
What is two phase commit?
A protocol that ensures atomicity in a distributed transaction
64
What is a phantom deadlock?
One that is detected but not stable
65
What is a view, created by a group membership service?
The set of processes belonging to a group
66
In view-synchronous group membership protocol, a process that enters the group and is included in the delivered vie, will be guaranteed to be delivered:
All messages starting from the view when it enters
67
Why is view synchronous communication different from reliable multicast?
A message is sent and delivered only by processes belonging to the same view
68
Distributed hash tables are designed to limit the number of hops to reach any key to
at most log(N)
69
When is it better to use the Berkley algorithm rather than NTP for clock synchronization?
When implementing internal synchronization
70
Assume that a NTP server cannot respond to received request in less than 40 ms, how does this influence the accuracy of synchronizing clients?
Not at all
71
At time 117 you received a NTP reply with the following information: requst sent at 82, received at 111, reply sent at 120. How should you adjust your time?
Advanced 16 steps
72
What is the difference between a Lamport clock and a Vector clock?
Only the vector clock gives a complete description of the happened before order
73
When is it problematic to use vectors clocks?
When we have a dynamic set of process
74
What do we know if we record a snapshot using the algorithm by Chandy and Lamport?
There is a linearization from the original state to the final state that passes through the snapshot
75
Assuming that we collect all state transitions of nodes and have them tagged with vector clocks what can we then do?
For any unstable predicates determine if it possibly was true during the execution
76
How can we detect that non-stable predicate definitely was true during ab execution?
Generate all consistent runs and show that the predicate is true at one point in all
77
What is the advantage of a bully algorithm compared to a ring-based algorithm?
Better turnaround time
78
What does Lamport clocks give us when implementing distributed mutual-exclusion?
The system is prevented to dead-lock
79
What does Ricart and Agrawalas mutual exclusion algorithm perform better than a central solution?
Under high congestion since only one message is needed to release and obtain the lock
80
How are FIFO, causal and total order multicast related?
A causal order is also a FIFO order
81
What is a good reason for choosing UDP rather than TCP?
You have a small message that should be sent with littke delay
82
What is a good reason for choosing TCP rather than UDP?
You have large messages or a sequence of messages
83
What is the maximum TCP capacity in a 100MBPS link with 250ms round trip latency using a 64 Kbyte window size?
2Mbps
84
What is the maximum TCP capasity in a 100 Mbps link with 25ms round trip latency using 64Kbyte window size?
20Mbps
85
What is a remote object passed as a reference and not as a copy in Java RMI?
The object contains a mutable state that should not be duplicated
86
Can we have a circular construction in Erlang?
Yes, processes can refer to each other in a circular way

Distributed Sustems (3 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2025 Bold Learning Solutions. Terms and Conditions