New TR on Selective Recompilation with Intermodule Dependencies (Jeffrey Dean)
Wed, 14 Sep 1994 14:51:29 GMT

          From comp.compilers

Related articles
New TR on Selective Recompilation with Intermodule Dependencies (1994-09-14)
| List of all articles for this month |

Newsgroups: comp.compilers,comp.object
From: (Jeffrey Dean)
Keywords: OOP, report, available, FTP, WWW
Organization: University of Washington
Date: Wed, 14 Sep 1994 14:51:29 GMT

The Cecil group at the University of Washington is pleased to announce
the availability of the following technical report:

    TR 94-09-07: A Framework for Selective Recompilation in the Presence
                              of Complex Intermodule Dependencies

                    By Craig Chambers, Jeffrey Dean, and David Grove

The paper is available at the bottom of our WWW page:

It's also available via anonymous ftp from:

The abstract of the report is:

Compilers and other programming environment tools derive information
from the source code of programs; derived information includes
compiled code, interprocedural summary information, and call graph
views. If the source program changes, the derived information needs to
be updated. We present a simple framework for maintaining intermodule
dependencies, embodying different tradeoffs in terms of space usage,
speed of processing, and selectivity of invalidation, that eases the
implementation of incremental update of derived information. Our
framework augments a directed acyclic graph representation of
dependencies with factoring nodes (to save space) and filtering nodes
(to increase selectivity), and it includes an algorithm for efficient
invalidation processing. We show how several schemes for selective
recompilation, such as smart recompilation, filter sets for
interprocedural summary information, and dependencies for
whole-program optimization of object-oriented languages, map naturally
onto our framework. For this latter application, by exploiting the
facilities of our framework, we are able to reduce the number of lines
of source code recompiled by a factor of seven over a header
file-based scheme, and by a factor of two over the previous
state-of-the-art selective dependency mechanism without consuming
additional space.

-- Jeff

Jeffrey Dean ( Graduate Student
Dept. of Computer Science & Engineering University of Washington

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.