The cache-optimized concurrent skip list is a set of algorithms for maintaining dynamic ordered mappings. Top-down balancing algorithms minimize cache-misses while using a per-node read-write spinlock to coordinate shared access. Designed for Linux 2.4.
Release Date:
Topics:
License:
Operating System:
Intended Audience:
Programming Language:
Registered:
Ratings and Reviews
Be the first to post a text review of Cache-Optimized Concurrent Skip List. Rate and review a project by clicking thumbs up or thumbs down in the right column.
Project Feed
-
File released: /SLPC/slpc-20021220/slpc-20021220.tar.gz
-
SLPC slpc-20021220 file released: slpc-20021220.tar.gz
-
Tracker comment added
jmacd commented on the STL Set interface? artifact -
File released: /Templatized C++ Version/20020227/slp.h
-
File released: /SLPC/20020227/slpc-20020227.tar.gz
-
SLPC 20020227 file released: slpc-20020227.tar.gz
-
Templatized C++ Version 20020227 file released: slp.h
-
Tracker artifact added
Anonymous created the STL Set interface? artifact -
SLPC 20011028 file released: slpc-20011028.tar.gz
-
File released: /Experimental Results/Skip List Concurrency/40-20-40-0-rw.gif
Rate and Review
Be the first person to add a text review.
Related Projects
-
-
PAPAS: Path Planning Algorithms Suite
PAPAS (Path Planning Algorithms Suite) is a set of algorithms intended for path planning. It has common algorithms like PRM, RRT, Wavefront Planner, etc. The implementation is done in C language and the code has been developed for about two years.
-
parity
Parity is a utility to compile native Windows executables and shared libraries from a UNIX like Environment like Microsoft SUA, while using a GCC like frontend. It provides various features, not available on windows normally (runpaths, preloading, etc.).
Cache-Optimized Concurrent Skip List Actions
About SourceForge
Develop Software
Copyright © 2009 Geeknet, Inc. All rights reserved. Terms of Use
