Incremental Lock Selection for Composite Objects

John Potter and Abdelsalam Shanneb
Programming Languages and Compilers Group, School of Computer Science and Engineering, University of New South Wales, Sydney, Australia

REFEREED
ARTICLE

PDF Version

Abstract

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 dierent levels of granularity within a composite system. We explore local properties of the xpoint 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.

Note: Due to the typographical sophistication of this article, no HTML version is available. Please use the PDF version.

About the authors

John Potter is currently with the Programming and Compilers Research Group at University of New SouthWales, Sydney. He can be reached via potter@cse.unsw.edu.au. His research interests include ownership type systems, programmatic access control, and concurrency for objects.

Abdelsalam Shanneb recently completed his PhD studies at UNSW. His research is focused on concurrency control for object systems.

Cite this document as follows: John Potter, Abdelsalam Shanneb "Incremental Lock Selection for Composite Objects", in Journal of Object Technology, vol. 6, no. 9, Special Issue: TOOLS EUROPE 2007, October 2007, pages 477-494, http://www.jot.fm/issues/issue_2007_10/paper24/

Previous paper

Next paper