Efficient Computation via Delayed Reorganization

Efficient Computation via Delayed Reorganization

The main mission of computer science is to invent new data structures and algorithms which can solve some concerned problems effectively. Insertion and deletion are the operations defined almost on every data structure. Effectiveness of these two main operations has a high impact on performance of the data structure and its applications. In most data structures, when insertion is performed, the reorganization of that data structure is also carried out simultaneously. In this paper, we introduce a data structure that unlike most data structures, insertion is performed easily with the lowest cost, and instead, reorganization is performed when a data item is being deleted. This property lets most of the operations on this data structure could be accomplished in ) 1( O amortized time. This characteristic has made it to become the most suitable data structure in solving some especially important problems like issues related to satellite networks, leader election, routing algorithms, data segmentation and mobile networks

The main mission of computer science is to invent new data structures and algorithms which can solve some concerned problems effectively. Insertion and deletion are the operations defined almost on every data structure. Effectiveness of these two main operations has a high impact on performance of the data structure and its applications. In most data structures, when insertion is performed, the reorganization of that data structure is also carried out simultaneously. In this paper, we introduce a data structure that unlike most data structures, insertion is performed easily with the lowest cost, and instead, reorganization is performed when a data item is being deleted. This property lets most of the operations on this data structure could be accomplished in ) 1( O amortized time. This characteristic has made it to become the most suitable data structure in solving some especially important problems like issues related to satellite networks, leader election, routing algorithms, data segmentation and mobile networks