ACM Home Page
Please provide us with feedback. Feedback
Obtaining sequential efficiency for concurrent object-oriented languages
Full text PdfPdf (1.09 MB)
Source Annual Symposium on Principles of Programming Languages archive
Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages table of contents
San Francisco, California, United States
Pages: 311 - 321  
Year of Publication: 1995
ISBN:0-89791-692-1
Authors
John Plevyak  Department of Computer Science, 1304 W. Springfield Avenue, Urbana, IL
Xingbin Zhang  Department of Computer Science, 1304 W. Springfield Avenue, Urbana, IL
Andrew A. Chien  Department of Computer Science, 1304 W. Springfield Avenue, Urbana, IL
Sponsors
SIGPLAN: ACM Special Interest Group on Programming Languages
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 12,   Citation Count: 14
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/199448.199524
What is a DOI?

ABSTRACT

Concurrent object-oriented programming (COOP) languages focus the abstraction and encapsulation power of abstract data types on the problem of concurrency control. In particular, pure fine-grained concurrent object-oriented languages (as opposed to hybrid or data parallel) provides the programmer with a simple, uniform, and flexible model while exposing maximum concurrency. While such languages promise to greatly reduce the complexity of large-scale concurrent programming, the popularity of these languages has been hampered by efficiency which is often many orders of magnitude less than that of comparable sequential code. We present a sufficiency set of techniques which enables the efficiency of fine-grained concurrent object-oriented languages to equal that of traditional sequential languages (like C) when the required data is available. These techniques are empirically validated by the application to a COOP implementation of the Livermore Loops.


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
 
4
5
6
7
 
8
 
9
 
10
Andrew A. Chien, Vijay Karamcheti, John Plevyak, and X#ngbin Zhang. Concurrent aggregates language :#eport 2.0. Available via anonymous ftp from Ics.uiuc.edu in /pub/csag or from http://www-csa#.cs.uiuc.edu/, September 1993.
11
 
12
 
13
Cray Research, Inc., Eagan, Minnesota 55121. CRAY T3D So}-tware Overwew Technical Note, 1992. /
14
15
16
 
17
 
18
19
20
 
21
C. Hewitt and H. Baker. Actors and continuous functionals. In Proceedings of the IFIP Working Conference on Formal Description of Programming Concepts, pages 367-87, August 1977.
22
23
24
25
 
26
Waldemar Horwat. Concurrent Smalltalk on the message-driven processor. Master's thesis, Massachusetts Institute of Technology, Cambridge, Massachusetts, June 1989.
27
28
29
30
 
31
32
 
33
34
 
35
F. H. McMahon. The Livermore Fortran kernels: a computer test of the numerical performance range. Technical report UCRL-53745, Lawerence Livermore National Laboratory, Liverraore, California, 1986.
 
36
Stephan Murer, Jerome A. Feldman, Chu-Cheow Lira, and Martina-Maria Seidel. pSather: Layered extensions to an object-oriented language for efficient parallel computation. Technical Report TR- 93-028, International Computer Science institute, Berkeley, Calif., December 1993. (2nd revised edition).
 
37
38
 
39
 
40
R. J. Smith, II. Experimental systems kit final project report. Technical Report ACT-ESP-077-91, Micro electronics and Computer Technology Corporation (MCC), Austin, Texas., 1991.
41
 
42
Thinking Machines Corporation, 245 First Street, Cambridge, MA 02154-1264. The Connection Machine CM-5 Technical Summary, October 1991.
 
43
44
 
45
 
46
 
47

CITED BY  14

Collaborative Colleagues:
John Plevyak: colleagues
Xingbin Zhang: colleagues
Andrew A. Chien: colleagues