Tuple-based abstract data types: full parallelism

Details Tuple-based abstract data types: full parallelism Tuple-based abstract data types: full parallelism

2010-03-25

arxiv.org/abs/1003.4827v1

International Symposium on Computer and Information Sciences (ISCIS'92), Antalya : Turkey (1992)

Computer Science

Databases

Scientific paper

Commutativity has the same inherent limitations as compatibility. Then, it is worth conceiving simple concurrency control techniques. We propose a restricted form of commutativity which increases parallelism without incurring a higher overhead than compatibility. Advantages of our proposition are: (1) commutativity of operations is determined at compile-time, (2) run-time checking is as efficient as for compatibility, (3) neither commutativity relations, (4) nor inverse operations, need to be specified, and (5) log space utilization is reduced.

Affiliated with

Also associated with

No associations

Rating

Tuple-based abstract data types: full parallelism does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Tuple-based abstract data types: full parallelism, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Tuple-based abstract data types: full parallelism will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-556106