Concurrent data structure: Difference between revisions

Revision as of 14:36, 24 November 2009

Revision as of 14:38, 24 November 2009

Line 84:

data structure implementation.

A key measure for performance is scalability, captured by the the [[speedup}]] of the implementation. Speedup is a measure of how

effectively the application is utilizing the machine it is running

on. On a machine with P processors, the '''speedup''' is the ratio of the structures execution time on a single processor to its execution time on T processors. Ideally, we want linear speedup: we would like to achieve a

speedup of P when using P processors. Data structures whose

speedup grows with P are called '''scalable'''.

==References==