SkiplistBased Concurrent Priority Queues Itay Lotan Stanford University and Nir Shavit Sun Microsystems Labortatories This paper addresses the problem of designing scalable concurrent priority queues
Priority queues are fundamental in the design of modern multiprocessor algorithms with many classical applications ranging from numerical algorithms through discrete event simulation and expert systems While highly scalable approaches have been intr
Embed this Presentation
Available Downloads
Download Notice
Download Presentation The PPT/PDF document "SkiplistBased Concurrent Priority Queues..." is the property of its rightful owner. Permission is granted to download and print the materials on this website for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.