Tuple-based abstract data types: full parallelism - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 1992

Tuple-based abstract data types: full parallelism

Carmelo Malta
  • Fonction : Auteur

Résumé

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.
Fichier principal
Vignette du fichier
ISCIS92.pdf (355.38 Ko) Télécharger le fichier
Iscis92Slides.doc (104 Ko) Télécharger le fichier
Iscis92Slides.pdf (322.17 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Format : Autre
Format : Autre

Dates et versions

hal-00462315 , version 1 (09-03-2010)

Identifiants

Citer

José Martinez, Carmelo Malta. Tuple-based abstract data types: full parallelism. International Symposium on Computer and Information Sciences (ISCIS'92), Oct 1992, Antalya, Turkey. pp. 173-179. ⟨hal-00462315⟩
55 Consultations
158 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More