Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

CSSE4004 > Final Exam Practice > Flashcards

Final Exam Practice Flashcards

1
Q

Distributed Computing: Explain what is meant by location transparency. List three other different types of distribution transparency

A

Location Transparency: When using a DS, you don’t know what server you are connected to etc. Other transparencies: Access, concurrency and replication

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

Distributed Computing: What does openness mean for distributed system? How do you define a portable distributed system?

A

This is the extent by which to implementations of systems or components can coexist and work together. Portability: So when we actually have two different systems, for example A and B and they use the same interface, can I switch them out? And the distributed system will continue working

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

Distributed Computing: Suppose a process in a distributed system runs on one node and accesses data from another node. After some time, for load balancing purposes, this process relocates to a different node. What kind of transparencies should be provided for this process in a distributed system? Explain your answers.

A

Migration, relocation transparencies

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

Communication: What are the main issues to consider in passing parameters in RPC?

A

Need to do parameter marshalling. Client and server could be different OSs and need to package data correctly.

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

Fault Tolerance: Describe how redundancy can be useful to mask failures in a distributed system. (2 marks)

A

Redundancy can be useful

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

Synchronisation: What are the benefits of logical clocks over physical clocks?

A

No physically synchronous global clock, so logical clocks provide a global ordering in DS.

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

Messaging: Do messaging systems such as IBM WebSphere MQ provide transient and synchronous communication? Explain your answer. (2 marks)

A

INSERT ANSWER

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

Communication: Compare and contrast the iterative and recursive approaches used by DNS for resolving URLs. (5 marks)

A

In recursive, the client only sends query to 1st server then server will send request to next server until query is resolved. In iterative client is responsible for sending query to different servers until query is resolved.

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

Processes: Describe two examples of applications for which their client processes would benefit from multi-threading. Explain.

A

Better CPU utilization.

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

Processes: What are the two approaches to implementing a thread package?

A

There are basically two approaches to implement a thread package. The first approach is to construct a thread library that is executed entirely in user mode. The second approach is to have the kernel be aware of threads and schedule them

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

Synchronisation: Given reasons why thread synchronization is important to support a functional multi-thread process.

A

INSERT ANSWER

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

Fault Tolerance: Consider Byzantine failures. To achieve agreement in a distributed system that tolerates k faulty processes, what is the required replication of resources? Explain your answer. (4 marks)

A

INSERT ANSWER

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

INSERT ANSWER

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

Synchronisation

A

INSERT ANSWER HERE

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

Assume a DS with 4 machines. Their internal clocks are supposed to tick 1000 times per msec. One machine perfectly performs that while the second one only ticks 995 times per msec, the third one does 1002 ticks per msec and the fourth one does 1004 ticks per msec. If we have UTC updates come every 20 seconds, what is the maximum clock skew that will occur? (5 marks)

A

INSERT ANSWER HERE

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

Pervasive Computing: What is the role of the Fusion Layer in processing sensed context information? (4 marks)

A

INSERT ANSWER

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

Pervasive Computing: Describe different types of adaptation that can be applied at the application layer. (6 marks)

A

INSERT ANSWER HERE

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

a) A consistency model uses a small number of locks. Each lock protects updates to a different variable. i. What kind of consistency model is this? Explain. (3 marks)

A

INSERT ANSWER HERE

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

A consistency model uses a small number of locks. Each lock protects updates to a different variable.

ii. Describe pros and cons for protecting each variable separately. (3 marks)

A

INSERT ANSWER HERE

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

What kind of consistency is provided for replicated databases if all operation requests are delivered by totally ordered multicast? Explain your answer. (4 marks)

A

INSERT ANSWER HERE

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

INSERT ANSWER HERE

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

INSERT ANSWER HERE

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

Distributed Computing: Explain what is meant by access transparency. List three other different types of distribution transparency. (5 marks)

A

INSERT ANSWER HERE

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

Distributed Computing: What does scalability mean for distributed system? Scalability can be achieved applying different techniques. What are these techniques? (5 marks)

A

INSERT ANSWER HERE

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

Communication: (a) Describe the role of the middleware layer as part of the conventional Open Systems Interconnection Reference Model (OSI). (4 marks)

A

INSERT ANSWER HERE

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

Communication: What are the differences between persistent communication and transient communication? Give an example for persistent communication and transient communication (4 marks)

A

INSERT ANSWER HERE

27
Q

Describe a communication paradigm that can help you to achieve highly asynchronous communication. (4 marks)

A

INSERT ANSWER HERE

28
Q

Naming: Explain the differences between structured naming and attribute-based naming. Give one example for each of the naming schemes. (6 marks)

A

INSERT ANSWER HERE

29
Q

Naming: Describe the Hierarchical Approach for resolving Flat names (4 marks)

A

INSERT ANSWER HERE

30
Q

Fault Tolerance: (a) Explain the concept of Distributed Commit. (2 marks)

A

INSERT ANSWER HERE

31
Q

To achieve agreement in a distributed system with k faulty processes, what is the required replication of resources? Explain your answer. (4 marks)

A

INSERT ANSWER HERE

32
Q
A

INSERT ANSWER HERE

33
Q

Synchronisation: Define a totally ordered multicast operation. Explain why in totally ordered multicasting every message has to be acknowledged. (5 marks)

A

INSERT ANSWER HERE

34
Q
A

INSERT ANSWER HERE

35
Q

Synchronisation: Assume a DS with 4 machines. Their internal clocks are supposed to tick 1000 times per msec. One machine perfectly performs that while the second one only ticks 995 times per msec, the third one does 1002 ticks per msec and the fourth one does 1004 ticks per msec. If we have UTC updates come every 20 seconds, what is the maximum clock skew that will occur? (5 marks)

A

INSERT ANSWER HERE

36
Q
A

INSERT ANSWER HERE

37
Q

Pervasive Systems: Address the following issue related to pervasive systems: (a) How would you design the context repository (context data store) to support fault tolerance of context-aware systems? Explain your answer. (6 marks)

A

INSERT ANSWER HERE

38
Q

Consistency: In your own words, explain why and how consistency matters in developing distributed systems. (4 marks)

A

INSERT HERE

39
Q

Consider an application for mobile users that requires the monotonic-read consistency. Would you use the Gifford’s scheme based protocol or the primarybackup-local-write protocol? Explain why. (5 marks)

A

INSERT ANSWER HERE

40
Q

Consider the Gifford’s scheme in a system with N replications and NR read quorum, NW write quorum i. What are the conditions on N, NR, and NW in order to sustain consistency (2 marks) ii. What is the significance of NR=1? (2 marks)

A

INSERT ANSWER HERE

41
Q
A

INSERT ANSWER HERE

42
Q
A

INSERT ANSWER HERE

43
Q

Distributed Systems: (a) Describe the role of the middleware in Distributed Systems. (3 marks)

A

INSERT ANSWER HERE

44
Q

If a distributed system needs to grow to support many more users worldwide, which kinds of scalability does it need to achieve? (3 marks)

A

Insert answer here

45
Q

What does openness means for distributed system? Indicate the core component to achieve openness for distributed systems. (4 marks)

A

Insert answer here

46
Q

Describe a method to hide network latency when a client and a server are placed far apart. Give an example. (4 marks)

A

insert answer here

47
Q

Compare and contrast RPC and RMI. (4 marks)

A
48
Q

What are the main issue to consider in passing parameters in RPC? (3 marks)

A

Insert answer here

49
Q

Naming: Explain the differences between flat naming and structured naming. Give one example for each of the naming schemes. (6 marks)

A

insert answer here

50
Q

Naming: Pick out a flat naming resolving scheme and explain how it works. (3 marks)

A

insert answer here

51
Q
A

insert answer here

52
Q

fault tolerance: Explain why Byzantine failures require more replicated resources to deal with, compared to silent failures. (3 marks)

A

insert answer here

53
Q
A

insert answer here

54
Q

Synchronisation: Assume a DS with 4 machines. Their internal clocks are supposed to tick 1000 times per msec. One machine perfectly performs that while the second one only ticks 998 times per msec, the third one does 1004 ticks per msec and the fourth one does 1007 ticks per msec. If we have UTC updates come every 30 seconds, what is the maximum clock skew that will occur? (5 marks)

A

Insert answer here

55
Q
A

insert answer here

56
Q

What is the role of Interface Definition Languages (IDL) in distributed computing? Indicate when in the software development process, IDL and its components must be implemented. (5 marks)

A

insert answer here

57
Q

Distributed Systems: ) Explain the difficulties in achieving interoperability for distributed systems (i.e. the difficulties in developing distributed applications where application components (objects) would be placed on various distributed computing middleware, hardware, OS environments etc.). (5 marks)

A

Insert Answer here

58
Q

Should the client and server-side CORBA objects for asynchronous method invocation be persistent? Explain your answer. (4 marks)

A

Insert answer here

59
Q

A file is replicated on 5 servers.

i. List all the combinations of read and write quorums permitted by Gifford’s scheme. (2 marks)
ii. Do all of these combinations make sense? (1 mark)
iii. What is the significance of a read quorum of 1? (2 marks)

A

insert answer here

60
Q
A

insert answer here

61
Q
A

insert answer here

62
Q
A

insert answer here

63
Q
A

CSSE4004 (6 decks)

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