Data Integrity and Concurrency Control in Threaded Applications (Example)

Document Preview:

Data Integrity and Concurrency Control in Threaded Applications Student’s name: Professor’s name: Date: Data Integrity and Concurrency Control in Threaded Applications Simply put a sorting algorithm an algorithm that puts elements of a list in a particular order. To optimize the use of other algorithms such as search and merge algorithms efficient sorting is essential which requires input data to be in sorted lists. Threading allows multiple activities to coexist within a single process. Most operating systems support threads. Java is the first programming language to include threading within the Java language itself. Threads can also be called as lightweight processes. Just like processes threads are also independent concurrent paths of execution through a program. Each thread has its stack its program counter and its local variables. (Sivathanu et al. 2005)Threads that are within a process are less the implementations of the application through the use of (Default=IgnoreError). (Anand 2005)This modification will help in the solving of data integrity issue that may be faced by the implementation of the threaded application example for this paper and thus ensure that the implementation is done correctly and that the data is sorted without any issues affecting its ACID properties. References Papathomas Michael. "Concurrency issues in object-oriented programming languages." Object Oriented Development (1989): 207-245. Michael Teeling. “What is Data Integrity? Learn How to Ensure Database Data Integrity via Checks Tests & Best Practices” (2012) T.K. Anand. Handling Data Integrity Issues in Analysis Services.”(2005) Sivathanu Gopalan Charles P. Wright and Erez Zadok. "Ensuring data integrity in storage: Techniques and applications." Proceedings of the 2005 ACM workshop on Storage security and survivability. ACM 2005.3 Strategies to Maintain Data Integrity. explorance.com. 2005 [...]

Order Description:

You have had the opportunity to evaluate the performance of a threaded version of a sort algorithm and a non-threaded version of a sort algorithm. For this Assignment, you will extend your evaluation by examining the implementation with respect to concurrency control issues. To prepare: Evaluate the threaded implementation of the sort algorithm relative to data integrity and concurrency control. By Day 7, write a 2- to 3-page paper evaluating the implementation of the sort algorithm. Answer the following questions: Is the threaded implementation correct, or are there data integrity concerns due to concurrency control? If your implementation is correct, what protections are in place to ensure atomicity and consistency? Could a more effective method of ensuring data integrity be implemented in your solution? If you ran into trouble with your implementation, provide specifics about the data integrity problems you encountered and explain the modifications that will be necessary to correct the data integrity and concurrency issues. Include in your analysis an explanation of the operation of the threaded implementation, and if there are data integrity issues, suggest one or more modifications to the implementation to resolve these concerns. (Threaded Sort Algorithm background research added as attachment. )