ACM Home Page
Please provide us with feedback. Feedback
Exclusion for composite objects
Full text PdfPdf (276 KB)
Source Conference on Object Oriented Programming Systems Languages and Applications archive
Proceedings of the 15th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications table of contents
Minneapolis, Minnesota, United States
Pages: 13 - 28  
Year of Publication: 2000
ISBN:1-58113-200-X
Also published in ...
Authors
James Noble  Computer Science, Victoria University of Wellington, New Zealand
David Holmes  DSTC Pty Ltd, Brisbane
John Potter  Computer Science and Engineering, University of New South Wales, Sydney
Sponsor
SIGPLAN: ACM Special Interest Group on Programming Languages
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 20,   Citation Count: 4
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/353171.353173
What is a DOI?

ABSTRACT

Designing concurrent object-oriented programs is hard. Correct programs must coordinate multiple threads accessing composite objects, using low-level mechanisms such as locks and read-write sets. Efficient programs must balance the complexity and overhead of the coordination mechanisms against the increased performance possible through concurrency. A method-level algebra of exclusion provides a succinct description of the conditions under which a thread must be excluded from a component of a composite object. Using the algebra, programmers can check whether their programs meet their exclusion requirements, can eliminate redundant exclusion controls, and can remove synchronisation overhead by reducing concurrency.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
P. S. Almeida. Baloon Types: Controlling sharing of state in data types. In ECOOP Proceedings, June 1997.
 
4
 
5
C. Atkinson, S. Goldsack, A. D. Maio, and R. Bayan. Object oriented concurrency and distribution in DRAGOON. Journal of Object- Oriented Programming (JOOP), 4(1):11-19, 1991.
 
6
7
8
9
 
10
 
11
G. Booch. Software Components With Ada: Structures, Tools, and Subsystems. Benjamin/Cummings, 1990.
 
12
13
 
14
 
15
16
17
 
18
D. L. Detlefs, K. R. M. Leino, G. Nelson, and J. B. Saxe. Extended static checking. Technical Report 159, COMPAQ Systems Research Center, Dec. 1998.
 
19
 
20
E. Gamma, R. Helm, R. E. Johnson, and J. Vlissides. Design Patterns. Addison-Wesley, 1994.
 
21
 
22
L. Gunaseelan and R. J. LeBlanc. Distributed Eiffel: a language for programming multi-granular distributed objects. In International Conference on Computer Languages Proceedings, 1992.
23
 
24
 
25
D. Holmes. Synehronisation Rings: Composable Synehronisation for Object-Oriented Systems. PhD thesis, Macquarie Unviersity, Sydney, 1999.
 
26
 
27
G. Kiczales, J. Lamping, A. Mendhekar, C. Maeda, C. V. Lopes, J.-M. Loingtier, and J. Irwin. Aspect oriented programming. In ECOOP Proceedings, 1997.
 
28
 
29
D. Lea. util.concurrent, a Java package. http://g.oswego, edu/, Apr. 1999.
30
 
31
C. V. Lopes. D: A Language Framework for Distributed Programming. PhD thesis, Northeastern University, 1997.
 
32
 
33
 
34
 
35
S. E. Mitchell. TAO -- A Model for the Integration of Concurrency and Synehronisation in Object Oriented Programming. PhD thesis, University of York, 1995.
 
36
 
37
 
38
D. C. Schmidt. Strategized locking, thead-safe interface, and scoped locking: Patterns and idioms for simplifying multi-threaded C++ components. C++ Report, 11(9), Sept. 1999.
39
 
40
41


Collaborative Colleagues:
James Noble: colleagues
David Holmes: colleagues
John Potter: colleagues