Minimizing ripple recompilation in a persistent software environment

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Minimizing ripple recompilation in a persistent software environment

Full text

Pdf (803 KB)

Source

ACM Annual Computer Science Conference archive
Proceedings of the 1990 ACM annual conference on Cooperation table of contents

Washington, D.C., United States

Pages: 166 - 172

Year of Publication: 1990

ISBN:0-89791-348-5

Authors

M. Kazerooni-Zand	Department of Computer Science, Langston University, Langston, Oklahoma
M. H. Samadzadeh	Department of Computing Information Science, Oklahoma State University, Stillwater, Oklahoma
K. M. George	Department of Computing Information Science, Oklahoma State University, Stillwater, Oklahoma

Sponsor

ACM: Association for Computing Machinery

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 8, Citation Count: 1

Additional Information:

abstract references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/100348.100374 What is a DOI?

ABSTRACT

The ripple recompilation problem is caused by modifying one or more modules in an integrated set of modules, or it results from forming a new integrated set of modules. This problem could be significant if the modified modules are widely used in the set. The main objective of this paper is to present the systematic and efficient technique employed in ROPCO (Reuse On Persistent Code and Object code) to limit this effect in a persistent reuse environment. The problem is addressed in the context of strongly-typed and separately-compiled programming languages. The approach presented consists of two phases. In the first phase, the compilation dependency graph of all modules is generated, change sets are computed, and candidate modules are marked. In the second phase, modules that are candidates for recompilation are visited and two lists for logical and physical inconsistencies are generated. Algorithms are given for both phases. An analysis of the computational complexity of the algorithms is also included.

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.

	AH83	Alfred V. Aho , John E. Hopcroft , Jeffrey Ullman , J. D. Ullman , J. E. Hopcroft, Data Structures and Algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1983
	AS86	Alfred V. Aho , Ravi Sethi , Jeffrey D. Ullman, Compilers: principles, techniques, and tools, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1986
	BR82	Barbara G. Ryder, Incremental data flow analysis, Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.167-176, January 24-26, 1983, Austin, Texas [doi>10.1145/567067.567084]
	HK86	Hausi A Muller , Robert Hood , Ken Kennedy, Efficient recompilation of module interfaces in a software development environment, Proceedings of the second ACM SIGSOFT/SIGPLAN software engineering symposium on Practical software development environments, p.180-189, December 09-11, 1986, Palo Alto, California, United States
	KF89	M. Kazerooni-Zand and D. D. Fisher, "Deletion on Persistent B-trees," Proc. Workshop on Applied Computing '89, ACM, Oklahoma, 90-96 (1989).
	KG89	M. Kazerooni-Zand, M. H. Samadzadeh, and K. M. George,"ROPCO: Art Environment for Micro-lncremental Reuse," To be appear in Proceedings of IEEE International Phoenix Conference on Computer and Communications, Arizona, March (1990).
	MM76	M. D. Mcllory, "Mass-Produced Software Component," Software Engineering Concepts and Techniques, Petrocelli/Charter, Brussels, Belgium, 88-98 (1976).
	RC86	Martin Carroll , Barbara G Ryder, An incremental algorithm for software analysis, ACM SIGPLAN Notices, v.22 n.1, p.171-179, January 1987
	RP86	Barbara G. Ryder , Marvin C. Paull, Incremental data-flow analysis algorithms, ACM Transactions on Programming Languages and Systems (TOPLAS), v.10 n.1, p.1-50, Jan. 1988 [doi>10.1145/42192.42193]
	SK88	Robert W. Schwanke , Gail E. Kaiser, Smarter recompilation, ACM Transactions on Programming Languages and Systems (TOPLAS), v.10 n.4, p.627-632, Oct. 1988 [doi>10.1145/48022.214505]
	TB85	Walter F. Tichy , Mark C. Baker, Smart recompilation, Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.236-244, January 14-16, 1985, New Orleans, Louisiana, United States [doi>10.1145/318593.318648]
	WT84	W. Teitelman, '~rhe Cedar Programming Environment: A Midterm Report and Examination," CSL-83-11, June (1984).
	WT86	Walter F. Tichy, Smart recompilation, ACM Transactions on Programming Languages and Systems (TOPLAS), v.8 n.3, p.273-291, July 1986 [doi>10.1145/5956.5959]
	WT85	Walter F. Tichy, RCS—a system for version control, Software—Practice & Experience, v.15 n.7, p.637-654, July 1985 [doi>10.1002/spe.4380150703]