Abstract
Since advance resource reservation is a widely used mechanism in distributed systems and high-performance networks, the optimization of its performance has been greatly concerned. And the performance of the data structure plays an important role for the overall performance of the advance resource reservation. In this paper, the authors figured out the disadvantages in the existing data structures used in advance resource reservation and proposed an improved data structure called ’tacked list’, to overcome these disadvantages. To demonstrate the performance of this improved data structure, the authors made mathematical analysis to explore the tradeoff between performance and cost. At last, the result of the simulation experiments show that the improved data structure can highly improve the performance of the whole reservation system at the starting up phase and still have a relatively good performance at the stable phase.
Chapter PDF
Similar content being viewed by others
References
Burchard, L.-O.: Analysis of data structures for admission control of advance reservation requests. IEEE Transactions on Knowledge and Data Engineering 17(3), 413–424 (2005)
Wu, L., Yu, T., He, Y., Li, F.: Index linked list suited for resource reservation. Journal of Wut (Information & Management Engineering) 33(6), 904–908 (2011) (in Chinese)
Yu, T.: Research of Data Structures and Algorithms on the Reservation of Grid Resource. M.Sc. Thesis. Wuhan University, China (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 IFIP International Federation for Information Processing
About this paper
Cite this paper
Wu, Lb., Fan, J., Nie, L., Liu, By. (2014). Tacked Link List - An Improved Linked List for Advance Resource Reservation. In: Hsu, CH., Shi, X., Salapura, V. (eds) Network and Parallel Computing. NPC 2014. Lecture Notes in Computer Science, vol 8707. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44917-2_47
Download citation
DOI: https://doi.org/10.1007/978-3-662-44917-2_47
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-44916-5
Online ISBN: 978-3-662-44917-2
eBook Packages: Computer ScienceComputer Science (R0)