Paridhi Agarwal's Profile

Paridhi Agarwal

Recent Messages

#chat-analyser - August 28, 2024 at 01:59 PM

@channel

#dsa - October 19, 2021 at 06:32 PM

Revise:

#dsa - October 09, 2021 at 07:00 PM

Retry:

#thrift-here - February 08, 2021 at 08:16 PM

https://www.youtube.com/watch?v=yfoY53QXEnI

#thrift-here - February 08, 2021 at 08:06 PM

https://www.youtube.com/watch?v=JJSoEo8JSnc

#thrift-here - February 08, 2021 at 07:56 PM

https://www.freecodecamp.org/learn/

#thrift-here - February 08, 2021 at 07:52 PM

https://www.youtube.com/watch?v=jV8B24rSN5o

#dsa - January 15, 2021 at 12:00 PM

review again:

#dsa - January 12, 2021 at 03:30 PM

Doubts(thread)

#dsa - January 12, 2021 at 03:14 PM

• n-ary tree
• Cpp theory(heap memory, classes and objects, pointers, references)

#dsa - December 11, 2020 at 05:31 PM

practice again(thread):

#open-source - September 19, 2020 at 07:43 PM

Past WikiEduDashboard:

#open-source - September 19, 2020 at 07:43 PM

https://tanu1596.blogspot.com/

#general - July 01, 2020 at 06:15 PM

https://github.com/michelleful/TidyTextMining-Python

#distributed-systems - June 25, 2020 at 05:45 PM

4 a ii) https://docs.oracle.com/cd/E13211_01/wle/wle42/creclien/except.htm

#distributed-systems - June 25, 2020 at 05:44 PM

4a i) https://docs.oracle.com/cd/E13211_01/wle/naming/over.htm

#distributed-systems - June 25, 2020 at 05:38 PM

3 b v)

#distributed-systems - June 25, 2020 at 03:28 PM

3 b iv) Phases In The Fault Tolerance • Implementation of a fault tolerance technique depends on the design , configuration and application of a distributed system. • In general designers have suggested some general principles which have been followed. 1)Fault Detection 2)Fault Diagnosis 3)Evidence Generation 4)Assessment 5)Recovery

1)Fault Detection • Constantly monitoring the performance and comparing it with expected outcome. •Fault is reported if there is a deviation from expected outcome.
2)Fault Diagnosis •Done to understand the nature of the fault and possible root cause.
3) Evidence Generation •Report generated based on the outcome of the fault diagnosis.
4) Assessment • Understanding the extent of the damage caused by the faulty component. •Done by examining the flow of information that has passed out from the faulty component to the rest of the system. •A virtual Boundary is created.
5) Recovery Making the system fault free and restoring it to a consistent state- Forward recovery and Backward recovery.

#distributed-systems - June 25, 2020 at 03:13 PM

3 b iii contd

#distributed-systems - June 25, 2020 at 03:12 PM

3 b iii) Fault tolerance refers to the ability of a system (computer, network, cloud cluster, etc.) to continue operating without interruption when one or more of its components fail.
The objective of creating a fault-tolerant system is to prevent disruptions arising from a single point of failure, ensuring the high availability and business continuity of mission-critical applications or systems.
Fault-tolerant systems use backup components that automatically take the place of failed components, ensuring no loss of service. These include:
• Hardware systems that are backed up by identical or equivalent systems. For example, a server can be made fault tolerant by using an identical server running in parallel, with all operations mirrored to the backup server.
• Software systems that are backed up by other software instances. For example, a database with customer information can be continuously replicated to another machine. If the primary database goes down, operations can be automatically redirected to the second database.
• Power sources that are made fault tolerant using alternative sources. For example, many organizations have power generators that can take over in case main line electricity fails.
In similar fashion, any system or component which is a single point of failure can be made fault tolerant using redundancy.
Fault tolerance can play a role in a disaster recovery strategy. For example, fault-tolerant systems with backup components in the cloud can restore mission-critical systems quickly, even if a natural or human-induced disaster destroys on-premise IT infrastructure.

#distributed-systems - June 25, 2020 at 03:07 PM

3b i)Atomic multicast is a communication building block of scalable and highly available applications. With atomic multicast, messages can be ordered and reliably propagated to one or more groups of server processes. Because each message can be multicast to a different set of destinations, distributed message ordering is challenging. Some atomic multicast protocols address this challenge by ordering all messages using a fixed group of processes, regardless of the destination of the messages. To be efficient, however, an atomic multicast protocol must be genuine: only the message sender and destination groups should communicate to order a message.

To see why atomicity is so important, consider a replicated database constructed as an application on top of a distributed system. The distributed system offers reliable multicasting facilities. In particular, it allows the construction of process groups to which messages can be reliably sent. The replicated database is therefore constructed as a group of processes, one process for each replica. Update operations are always multicast to all replicas and subsequently performed locally. In other words, we assume that an active-replication protocol is used.

#distributed-systems - June 25, 2020 at 02:52 PM

eg:

#distributed-systems - June 25, 2020 at 02:50 PM

2b iii)

#distributed-systems - June 25, 2020 at 02:45 PM

2b ii) https://www.slashroot.in/difference-between-iterative-and-recursive-dns-query

#distributed-systems - June 25, 2020 at 02:43 PM

2b i)Names play a very important role in all computer systems. They are used to share resources, to uniquely identify entities, to refer to locations, and more. An important issue with naming is that a name can be resolved to the entity it refers to. Name resolution thus allows a process to access the named entity. To resolve names, it is necessary to implement a naming system. The difference between naming in distributed systems and nondistributed systems lies in the way naming systems are implemented.
 
In a distributed system, the implementation of a naming system is itself often distributed across multiple machines. How this distribution is done plays a key role in the efficiency and scalability of the naming system.

#distributed-systems - June 25, 2020 at 02:38 PM

1 a iii) https://www.redhat.com/en/topics/middleware/what-is-middleware

#writing - June 06, 2020 at 07:23 PM

https://medium.com/p/3c058098275c/edit

#goldman-sachs - May 28, 2020 at 05:55 PM

https://goldmansachs.zoom.us/j/2498671302 (Password: 524152)

#goldman-sachs - May 27, 2020 at 05:26 PM

This is chutiya shivam

#goldman-sachs - May 26, 2020 at 06:28 AM

2585122271 335422

#goldman-sachs - May 26, 2020 at 06:27 AM

3068111043 250120

#goldman-sachs - May 20, 2020 at 06:26 PM

symphony: 8041271991

#goldman-sachs - May 20, 2020 at 09:25 AM

332097