Trees and Forests: A Framework for Parallel Processing and Management of Networks
|International Journal of Engineering Trends and Technology (IJETT)||
|© 2018 by IJETT Journal|
|Year of Publication : 2018|
|Authors : C. P. E. Agbachi
|DOI : 10.14445/22315381/IJETT-V57P202|
C. P. E. Agbachi "Trees and Forests: A Framework for Parallel Processing and Management of Networks", International Journal of Engineering Trends and Technology (IJETT), V57(1),6-10 March 2018. ISSN:2231-5381. www.ijettjournal.org. published by seventh sense research group
It is a cardinal principle in program engineering to match data structures to tasks in order to lay the ground for efficient and concise algorithms. One of such data structures are trees. They are very versatile and in forests provide a model interface for parallel processing of survey networks. This paper evaluates the modality and applications in Geomatic Engineering.
 Niklaus Wirth, “Algorithms and Data Structures”, © N. Wirth 1985.
 Jean-Paul Tremblay, Paul G. Sorenson, “An Introduction to Data Structures With Applications”, McGraw Hill Computer Science Series 2nd Edition.
 Milton Rosenstein, “Data Structuresfor Programmers” Copyright © 1988 John Wiley & Sons, Inc.
 C. P. E. Agbachi, “Parallel Multiple Key Sort Algorithm for Traverse Data Set”, IJETT, Volume 56 Number X1 – February 2018.
 C. P. E. Agbachi, “A Hands Free Approach to Automated-Cartography: Case Study of Land Records”, IJETT, Volume 40 Number 2 - October 2016.
 C. P. E. Agbachi, “Algorithm for Dynamic Formation of Condition Equations in N-Dimensional Network”, IJMTT, Volume 52 Number 9 - December 2017.
 Doug Lea, “Concurrent Programming in Java”, State University of New York at Oswego.
 C. K. Ayo, “Operating System (OS) Concepts,” Department of Computer & Information Sciences Covenant University Ota – Nigeria (NOUN).
 Jerry Breecher, “Operating Systems memory Management”, http://web.cs.wpi.edu/~cs3013/c07/lectures/Section08-Memory_Management.pdf
 Silberschatz, Galvin and Gagne ©2005,Operating System Concepts, Memory Management,http://www2.latech.edu/ ~box/os/ch08.pdf.
Datum, Origin, Digraph, Tasks, Multiprogramming, Multithreading, Concurrency.