On the performance of concurrent tree algorithms

Journal Article · Thu Mar 01 04:00:00 EST 1990 · Journal of Parallel and Distributed Computing; (USA)

DOI:https://doi.org/10.1016/0743-7315(90)90100-4· OSTI ID:6779539

Ford, R ^[1]; Jipping, M J ^[2]; Shultz, R; Wenhardt, D ^[3]

---

1. Dept. of Computer Science, Univ. of Kansas, Lawrence, KS (US)
2. Dept. of Computer Science, Hope College, Holland, MI (US)
3. Rockwell International Corp., Cedar Rapids, IA (US)

Various algorithms have been proposed to allow independent concurrent process to access shared tree- structured objects, while guaranteeing that the object remains in a consistent state. Although algorithms can be classified as either optimistic or conservative, on the basis of their approach to concurrency control, it is very difficult to compare the expected performance of two concurrent algorithms that use different approaches. The authors demonstrate an approach to performance comparison that combines both analytical evaluation and detailed simulation. The authors' analysis predicts the frequency of highly time dependent activities, such as interference and recovery, that dominate performance of optimistic algorithms. The authors' simulation measures the performance of concurrent algorithms in a particular application, that of a central file server.

• OSTI ID: 6779539
• Journal Information: Journal of Parallel and Distributed Computing; (USA), Journal Name: Journal of Parallel and Distributed Computing; (USA) Vol. 8:3; ISSN JPDCE; ISSN 0743-7315
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
990200* -- Mathematics & Computers
ALGORITHMS
ANALYTICAL SOLUTION
ARRAY PROCESSORS
MATHEMATICAL LOGIC
PARALLEL PROCESSING
PERFORMANCE
PROGRAMMING
SIMULATION