de
en
Schliessen
Detailsuche
Bibliotheken
Projekt
Impressum
Datenschutz
zum Inhalt
Detailsuche
Schnellsuche:
OK
Ergebnisliste
Titel
Titel
Inhalt
Inhalt
Seite
Seite
Im Dokument suchen
Lammich, Peter: Lock sensitive analysis of parallel programs. 2011
Inhalt
Introduction
Related Work
Contributions
Outline
Preliminaries
Notations
Automata
Word Automata
Tree Automata
Complexity
Big-O Notation
Size of Input Data
Computational Complexity
Models
Motivation
Dynamic Pushdown Networks
Interleaving Semantics
Tree-Semantics
Locks and Monitors
Lock-Sensitive Interleaving Semantics
Well-Nestedness
Lock-Sensitive Scheduler
Summary and Related Work
Lock-Sensitive Schedulability
Acquire/Release-Hedges
Mapping Execution-Hedges to A/R-Hedges
Schedules of Acquire/Release-Hedges
A Theory of Movers
Disciplined Schedules of Execution-Hedges
Acquisition Structures
Dependence-Graph
Acquisition- and Release-Graphs
A Tree Automaton for Schedulable A/R-Hedges
Summary and Related Work
Automata Constructions
A DPN-Acceptor for Schedulable Execution-Hedges
DPN-Acceptors
A DPN-Acceptor for Regular Sets of A/R-Hedges
Cross-Product Construction
Summary and Related Work
Lock-Sensitive Predecessor Sets
Definitions
Lock-Insensitive Predecessor Set Computation
Reduction to Lock-Insensitive Predecessor Set Computation
Applications
Atomic-Set Serializability Violation
EF-Formula
Bounded Model-Checking
Summary and Related Work
Optimizations
Pseudocode
Queries from the Start Configuration
Consistency Check
Immediate Predecessor Sets
Initial Releases
Deadlocks
Inescapable Locks
No Spawn inside Monitors
Deadlock Detection
Example
Discussion
Summary and Related Work
Non-Monitor Locking Disciplines
Well-Nested, Reentrant Locks
Well-Nested, Non-Reentrant Locks
Summary and Related Work
Complexity
Models and Properties
Monitors and Well-Nested, Non-Reentrant Locks
Lower Complexity Bounds
Upper Complexity Bounds
Stronger Synchronization Mechanisms
Discussion and Related Work
Conclusion
Bibliography