Demonstrating the Effectiveness of Exclusion Control for Components

Potter, John; Shanneb, Abdelsalam; Yu, E.

doi:10.1109/aswec.2005.20

Cited by 2 publications

(2 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To date, we have implemented and demonstrated the viability of a general purpose exclusion lock which can be configured to exactly meet a specific locking requirement [4], [12]. We have also prototyped the algorithm outlined in Section 5 in Haskell.…”

Section: Resultsmentioning

confidence: 99%

Incremental Lock Selection for Composite Objects.

Potter¹,

Shanneb²

2007

JOT

View full text Add to dashboard Cite

With the trend towards multi-core processors, support for multi-threaded programming is increasingly important. We are interested in providing development and deployment options to allow programmers to select minimal locks, achieving maximal concurrency, at different levels of granularity within a composite system. We explore local properties of the fixpoint lattice of a Galois connection between exclusion requirements and concurrency potential of a composite object. This allows us to develop incremental algorithms for lock selection. Implemented within integrated development environments, such algorithms will allow programmers to interactively select minimal locks with safety.

show abstract

Section: Resultsmentioning

confidence: 99%

Incremental Lock Selection for Composite Objects.

Potter¹,

Shanneb²

2007

JOT

View full text Add to dashboard Cite

show abstract

“…In the 2004 CSJP Workshop [15] and also in [16], we demonstrated the effectiveness of a general-purpose exclusion lock that can provide any required exclusion. For locking of a single object, the experimental results confirmed the effectiveness of finegrain (method-level) exclusion control.…”

Section: Introductionmentioning

confidence: 99%

Lock selection made easy

Shanneb

Potter

2006

Australian Software Engineering Conference (ASWEC'06)

Self Cite

View full text Add to dashboard Cite

With the advent of multiprocessors on the desktop, software applications are increasingly likely to adopt multithreaded architectures. To cope with the complexity of concurrent systems, programmers build systems from threadsafe components. This produces excessive and redundant locking, restricting the potential for concurrency within the system.Rather than deploying individual thread-safe components, we advocate deferring the deployment of locks until the code dependencies are known. This avoids redundant locking, and allows the granularity of concurrency to be chosen in a flexible way. In earlier work we identified a formal relationship, known as a Galois connection, between the potential for concurrency in a composite system and the locking requirements for its components. This paper explores further properties of this relationship, and demonstrates how lock selection can be made easy with appropriate tool support.

show abstract

Demonstrating the Effectiveness of Exclusion Control for Components

Cited by 2 publications

References 5 publications

Incremental Lock Selection for Composite Objects.

Incremental Lock Selection for Composite Objects.

Lock selection made easy

Contact Info

Product

Resources

About