Contact Us
Sign In / Sign Up for FREE
Go to advanced search...


Comments (0) Cite this document
The application successfully demonstrates the distributed database operations as it allows the user to not only view the records of both London and Scotland sites, but also to manipulate the data by inserting new or updating existing records. However, still there is a lot of…
Download full paperFile format: .doc, available for editing
GRAB THE BEST PAPER91.4% of users find it useful
Read TextPreview

Extract of sample "DISTRIBUTED SYSTEMS"

Download file to see previous pages Due to time limitation, this problem has not been resolved yet and therefore, the application still requires to be fine tuned to allow it to be run through IIS rather than involving Visual Studio’s internal ASP.NET Development Server.
Currently, this application’s backend, SQL Server 2005, does not store any data locally. It simply contains two linked servers which are called whenever the application requires carrying out some data operation – viewing, inserting and updating records. Excessive communication with linked servers may result in increase of network traffic, hence, minimizing the performance of only the application itself but of the entire corporate network as well.
Therefore, it is very important to maintain some part of the data locally in SQL Server 2005 in order to reduce the network load by minimizing the communication with remote servers. This can be achieved through re-designing the database involving three key aspects – data fragmentation, data replication and data allocation.
Data Fragmentation refers to the process of breaking up the database into logical units called fragments which can be stored at different sites. The simplest logical units are the table themselves (Padigela, n.d.).
Fragmented or Partitioned refers to partitioning of database into disjoint fragments, with each fragment assigned to one site (no replication). This is also called ‘non-redundant allocation’ (Padigela, n.d.).
Complete Replication involves maintenance of a complete copy of database at each site (no fragmentation) and therefore, storage costs and communication costs for updates are main drawbacks of this strategy. To overcome this, snapshots – a copy of the data at a given time – are used to update copies of database periodically (Padigela, n.d.).
It was not easy to work on this coursework as it was extremely challenging and ...Download file to see next pagesRead More
Cite this document
  • APA
  • MLA
(“DISTRIBUTED SYSTEMS Essay Example | Topics and Well Written Essays - 3000 words”, n.d.)
DISTRIBUTED SYSTEMS Essay Example | Topics and Well Written Essays - 3000 words. Retrieved from
(DISTRIBUTED SYSTEMS Essay Example | Topics and Well Written Essays - 3000 Words)
DISTRIBUTED SYSTEMS Essay Example | Topics and Well Written Essays - 3000 Words.
“DISTRIBUTED SYSTEMS Essay Example | Topics and Well Written Essays - 3000 Words”, n.d.
  • Cited: 0 times
Comments (0)
Click to create a comment or rate a document


PSM: Distributed systems

...significant is related to the uptime and availability of services at all times. In addition, cloud computing is also efficient for handling large data sets incorporated by the services associated with web 2.0. The pay for use business model facilitates academic institutions to analyze data in terabytes by distributed computing over hundreds of computers in only short time cost (Han 2010). Furthermore, the integration of Web 2.0 and semantic web has produced a new revolutionary e-portfolio. Previously, the development and implementation approach of e-portfolios have faced various challenges and limitations. However, a research by (Kim, Ng et al. 2010) on a design based on Private-Public data index systems...
10 Pages(2500 words)Essay

Distributed Systems

...DISTRIBUTED SYSTEMS Java RMI RMI is an abbreviation for Remote method invocation. It allows us to implement RPC style applications in java. In fact, it's a technology which is native to java. RMI applications (client applications) invoke methods in remote objects wherein a remote object is one which resides in another JVM. The other JVM can be on the same machine or any other machine on the network. However, the only thing it requires is for the JVM to be present at both sides. It implements remote interface developed by us and also language specifications, which is used by the server to provide the service as per the method call. It comprises of a stub and skeleton each at the client and server side respectively, wherein the stub... ...
5 Pages(1250 words)Essay

Distributed and Parallel Systems

...Distributed and Parallel Systems Table of Contents Introduction...4 2. Amdahl's Law....4 3. Concurrency ..6 4. The Dining Philosopher's Problem..7 5. Logical Clocks.8 6. The Bully Algorithm..11 a. Example...11 b. Performance of Bully Algorithm...11 7. Conclusion...12 8. References....13 Table of Figures 1. Amdahl's Law..5 2. Fixed load speedup Model and Amdahl's Law.6 a. Fixed Workload.6 b. Decreasing Execution time6 c. Speed up with a fixed load.6 3. Logical Clock...10 4. Bully Algorithm example...12 Table of tables 1. Lamport timestamp..9 List of Terminology 1. Parallel Computing System: A computer with more than one processor for parallel processing. 2....
9 Pages(2250 words)Term Paper

Distributed Systems assessment

...Communication between components in a distributed system may be done using "Message Passing", "Remote Procedure Call" or "Remote Object Invocation". The key features of these three mechanisms are given below: Message Passing: The Message Passing Interface (MPI) model refers to a computing model in which a computation comprises one or more processes that communicate by calling library routines to send and receive messages to and from other processes. In most implementations of MPI, a fixed set of processes is created at program initialization, and one process is created per processor. However, these processes may execute different programs. Hence, the MPI programming model is also referred to as Multiple Program Multiple Data (MPMD... to the...
5 Pages(1250 words)Essay

Distributed Information Systems

...Detailed Technical Proposal for Car-Free Motel Information System Table of Contents: Introduction Body of Report Logical System Design Analysis Technical Details Naming Conventions & Definition Design Class Diagram Design Class & Functionality Model And Documentation Sequence Diagram Statement of Assumptions Interface Definition Language Code Testing Pseudo Code Critical Evaluation Conclusion Reference Appendix Introduction: The Customer: Car-free Motel Company with 47 branches. Care-free would like to replace a mixture of legacy of non-integrated systems presently causing of inefficiency and errors in...
18 Pages(4500 words)Assignment

One of the most widely used services in many distributed systems is the File Service. Investigate the issue of distributed file systems

...Introduction: Distributed file systems allow users to share the resources of a network including storage. The design of the network protocol determines the level of access that clients have to files and thus it is possible for the server to restrict access to storage and network files. Ainsworth (2009, p. 22) points out that the design and implementation of distributed file systems faces many challenges such as caching techniques, naming service and transparency, file replication, access control and scalability considerations, and support for concurrency and availability. These challenges will be discussed in this section and also there will be a description of the main architectural features of the Network File System version 4... in...
6 Pages(1500 words)Essay

Distributed Systems Security

Client and data encryption are highly recommended on the storage devices which means that corresponding blocks of data corresponds both in the directory and the file but does not know content interpretation, below are the various methods of ensuring secure distributed file system. The initial secure distributed file sharing system was the use of AFS which was later followed by the use of DFS. In the AFS system, servers store data on subtrees in the file system and use the Kerberos in the provision of the authenticated access to all trees. Every server is the one in the management of the meta-data which has full access to the file data. The DFS advanced in the options link in the encryption level in order to prevent the eavesdroppe...
2 Pages(500 words)Essay

Distributed systems and cloud computing

...Introduction The aim of this document is to propose a distributed and cloud based solution to a company d ‘Letting Agency’ that sells purchases property. The Agency stores the property information and allows its employees to store and access the property information from its own internal computer network. However, the Agency decides to allow the employees to access the property information even from their own computer network and the employees can add data and access the system from the public network. The document discusses a solution based on the distributed and cloud computing to meet the requirements of the Agency, keeping in view the main issues includes: the security, cost,...
10 Pages(2500 words)Coursework

Advantages of Distributed Operating Systems

...Distributed Operating Systems Assignment Although distributed operating system have been said to enable the implementation of powerful resource-sharing schemes, enhance performance, increase reliability and ensure better communication, evidence shows that these systems to do not actually offer all these benefits. These systems do however offer some of these benefits, but only to a small degree. The process of developing and using distributed systems actually erodes these benefits. First, evidence shows that distributed operating systems pose major security risks to the...
2 Pages(500 words)Assignment

Distributed Database Management Systems

...Centralized DDBMS versus a Decentralized Database Insert Insert Introduction A distributed database management system manages a distributed database. That is a database whose storage is in multiple computing systems that may or may not be in the same location. Consequently, the work of the DDBMS is control such a database as though it was working in the same place (Moris, February 4, 2014). The purpose is to synchronize the data and ensure that actions like updates are in all other areas in case of multiple users. Decentralized database, on the other hand, is an example of a massive database being divided into smaller ones. It is done so that an individual data subject is...
1 Pages(250 words)Essay
sponsored ads
We use cookies to create the best experience for you. Keep on browsing if you are OK with that, or find out how to manage cookies.

Let us find you another Essay on topic DISTRIBUTED SYSTEMS for FREE!

Contact Us