A concurrent linked list problem solution using explicit locks.
A linked list it is a data structure consisting of a group of nodes which together represent a sequence. Under the simplest form, each node is composed of data and a reference (in other words, a link) to the next node in the sequence. In this context, this data structure can perform the operations of insertion, remove and search of elements in the list. Thus, to perform concurrently it is necessary that these operations do not interfere in the behavior of the others, so that one can maintain correctness in the functions.
You will need to install the modules below to run the program:
There are two ways to run this software:
- Compile the IDE (Eclipse - Java IDE):
- Just open the IDE.
- Import the project folder as a Java Project.
- After, click in the "Run" button.
- From this it only interacts with the system.
- Compile by terminal:
- Enter the src folder and compile all the .java files with the following command:
$ java * .java -d <target_address_name>
- Enter the chosen destination directory and run the following command:
$ java gui.Main
- From this it only interacts with the system.
- Eclipse - A IDE used
- Luís Eduardo Anunciado Silva (cruxiu@ufrn.edu.br)
- Erick de Oliveira Silva (erickos@ufrn.edu.br)
- Everton Ranielly de Sousa Cavalcante (everton@dimap.ufrn.br)
See also the list of contributors who participated in this project.
This project is licensed under the GPL 3.0 - see the LICENSE file for details