ACM Home Page
Please provide us with feedback. Feedback
Reengineering a complex application using a scalable data structure compiler
Full text PdfPdf (920 KB)
Source Foundations of Software Engineering archive
Proceedings of the 2nd ACM SIGSOFT symposium on Foundations of software engineering table of contents
New Orleans, Louisiana, United States
Pages: 111 - 120  
Year of Publication: 1994
ISBN:0-89791-691-3
Also published in ...
Authors
Don Batory  Department of Computer Sciences, The University of Texas at Austin, Austin, Texas
Jeff Thomas  Department of Computer Sciences, The University of Texas at Austin, Austin, Texas
Marty Sirkin  Department of Computer Sciences, The University of Texas at Austin, Austin, Texas
Sponsor
SIGSOFT: ACM Special Interest Group on Software Engineering
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 0,   Downloads (12 Months): 22,   Citation Count: 9
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/193173.195299
What is a DOI?

ABSTRACT

P2 is a scalable compiler for collection data structures. High-level abstractions insulate P2 users from data structure implementation details. By specifying a target data structure as a composition of components from a reuse library, the P2 compiler replaces abstract operations with their concrete implementations.LEAPS is a production system compiler that produces the fastest sequential executables of OPS5 rule sets. LEAPS is a hand-written, highly-tuned, performance-driven application that relies on complex data structures. Reengineering LEAPS using P2 was an acid test to evaluate P2's scalability, productivity benefits, and generated code performance.In this paper, we present some of our experimental results and experience in this reengineering exercise. We show that P2 scaled to this complex application, substantially increased productivity, and provided unexpected performance gains.


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.

 
ACM91
Association for Computing Machinery, "Next Generation Database Systems", Communications of the ACM, October 1991.
 
Bat88
Bat92
Bat93
 
Bat94a
 
Bat94b
 
Big94
T. BiggerStaff. "The Library Scaling Problem and the Limits of Concrete Component Reuse", IEEE International Conference on Software Reuse, November 1994.
 
Bra91
Bra93
 
Bro94
J. Browne, et al. "A New Approach to Modularity in Rule-Based Programming", Department of Computer Sciences, University of Texas at Austin, April 1994.
 
Cog93
L. Coglianese and R. Szymanski, "DSSA-ADAGE: An Environment for Architecture-based Avionics Development", Proc. AGARD, 1993. Also, Technical Report ADAGE-IBM-93-04, IBM Owego, New York, May 1993.
 
For81
C. Forgy, OPS5 User's Manual, Technical Report CMU-CS-81-135, Carnegie Mellon University, 1981.
Hei93
 
Hut91
 
McD78
J. McDermott, A. Newall, and J. Moore, "The Efficiency of Certain Production Systems", Pattern Directed Inference Systems, Waterman, Hayes, Roth (ed), Academic Press, New York, 1978.
 
Mir90
D. Miranker, D. Brant, B. Lofaso, and D. Gadbois, "On the Performance of Lazy Matching in Production Systems", Proc. National Conference on Artificial Intelligence, 1990.
 
Mir91
 
Sir93
 
Sir94

CITED BY  9

Collaborative Colleagues:
Don Batory: colleagues
Jeff Thomas: colleagues
Marty Sirkin: colleagues