Abstract
The skip list is a more memory efficient version of a single level linked list. Searching for the required data elements in a skip list is more efficient than in a single level linked list because a skip list allows us to skip to the searched element in it. We have created a C# .NET application that uses a skip list with structured data in its data elements. This application can perform search operations within these data elements using serial, threaded, and parallelized instance methods, and simultaneously it is able to measure the execution times of particular methods. By comparing these times, we have examined the execution efficiency of parallelized instance methods of the object of the .NET application compared to threaded and serial instance methods of the same object. The results and evaluation of this examination are listed in the paper.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Adamchik, V.S.: Linked Lists. http://www.cs.cmu.edu/~adamchik/15-121/lectures/Linked%20Lists/linked%20lists.html. Accessed 17 July 2021
Košťál, I.: Comparison of execution efficiency of the use of a skip list and simple list in a .NET application. In: Laukaitis, G. (eds.) Recent Advances in Technology Research and Education Proceedings of the 17th International Conference on Global Research and Education Inter-Academia – 2018. LNNS, vol. 53, pp. 252–259. Springer, Cham (2019)
Microsoft Corporation: Documentation. https://docs.microsoft.com. Accessed 17 July 2021
Niemann, T.: Sorting and Searching Algorithms. epaperpress.com (1999)
Pugh, W.: Skip lists: a probabilistic alternative to balanced trees. Commun. ACM 33(6), 668–676 (1990)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Košt’ál, I. (2022). A Parallelization of Instance Methods of a .NET Application that Search for Required Structured Data Stored in a Skip List. In: Khakhomov, S., Semchenko, I., Demidenko, O., Kovalenko, D. (eds) Research and Education: Traditions and Innovations. INTER-ACADEMIA 2021. Lecture Notes in Networks and Systems, vol 422. Springer, Singapore. https://doi.org/10.1007/978-981-19-0379-3_11
Download citation
DOI: https://doi.org/10.1007/978-981-19-0379-3_11
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-19-0378-6
Online ISBN: 978-981-19-0379-3
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)