Page 1 |
Save page Remove page | Previous | 1 of 136 | Next |
|
small (250x250 max)
medium (500x500 max)
Large (1000x1000 max)
Extra Large
large ( > 500x500)
Full Resolution
All (PDF)
|
This page
All
|
DEPENDENCE ANALYSIS FOR
DISTRIBUTED EVENT-BASED SYSTEMS
by
Daniel Popescu
A Dissertation Presented to the
FACULTY OF THE USC GRADUATE SCHOOL
UNIVERSITY OF SOUTHERN CALIFORNIA
In Partial Ful llment of the
Requirements for the Degree
DOCTOR OF PHILOSOPHY
(COMPUTER SCIENCE)
December 2011
Copyright 2011 Daniel Popescu
Object Description
| Title | Dependence analysis for distributed event-based systems |
| Author | Popescu, Daniel |
| Author email | dpopescu@usc.edu;popescu@gatech.edu |
| Degree | Doctor of Philosophy |
| Document type | Dissertation |
| Degree program | Computer Science |
| School | Viterbi School of Engineering |
| Date defended/completed | 2011-10-24 |
| Date submitted | 2011-11-07 |
| Date approved | 2011-11-07 |
| Restricted until | 2011-11-07 |
| Date published | 2011-11-07 |
| Advisor (committee chair) | Medvidovic, Nenad |
| Advisor (committee member) |
Halfond, William G.J. Madigan, Stephen A. |
| Abstract | In recent years, distributed event-based (DEB) systems that have been developed using message-oriented middleware platforms have become widespread. In DEB systems, a software component does not directly call other software components via explicit references, but instead implicitly invokes other software components by publishing messages. Consequently, DEB components are highly decoupled and enable highly scalable, easy-to-evolve, concurrent, distributed, heterogeneous applications. ❧ At the same time, implicit invocations render more difficult the analysis of the impact of a particular change to a system. Software engineers who perform impact analysis investigate a software system's dependencies, in order to determine how a proposed change to a component affects other components. In the absence of explicit references between DEB components, an engineer has to assume that any component in the system may potentially interact with, and thus depend on, any other component. Thus, investigating the impact of proposed changes in DEB systems becomes especially hard and time-consuming. ❧ Existing automated dependence analysis techniques inadequately facilitate impact analysis of DEB systems because the dependencies that these techniques extract are too imprecise and incomplete. Therefore, the research of this dissertation devises techniques that extract more precise dependencies with a significantly higher degree of completeness from the implementations of DEB systems. ❧ The results of this dissertation research are the identification of the specific obstacles that make dependence analysis challenging for DEB systems, and the development of two novel dependence analysis techniques, named Message Dependency Analyzer (MDA) and Rapid Message Dependency Analyzer (RMDA), that extract more precise and complete dependencies from DEB system than existing techniques. MDA and RMDA analyze the source code of a DEB system, in order to identify the types of messages each component may consume and publish, as well as how published and consumed messages depend on each other. The two techniques make different tradeoffs between speed, precision, completeness, and applicability. While MDA is aimed at extracting control-flow-based dependencies from a broad range of existing implemented DEB systems, RMDA defines a set of implementation constraints and extracts control-flow-based and data-flow-based dependencies only from DEB systems that are compliant to these constraints. RMDA's implementation constraints enable RMDA to extract significantly faster precise and complete dependencies than MDA. The dissertation evaluates the degree of precision and completeness that MDA and RMDA achieve in the analysis of existing DEB systems. Overall, the evaluation demonstrates that MDA and RMDA extract more precise and complete dependencies from DEB systems than existing techniques. |
| Keyword | software engineering; dependence analysis; distributed event-based systems; impact analysis; message-oriented middleware |
| Language | English |
| Part of collection | University of Southern California dissertations and theses |
| Publisher (of the original version) | University of Southern California |
| Place of publication (of the original version) | Los Angeles, California |
| Publisher (of the digital version) | University of Southern California. Libraries |
| Provenance | Electronically uploaded by the author |
| Type | texts |
| Legacy record ID | usctheses-m |
| Contributing entity | University of Southern California |
| Rights | Popescu, Daniel |
| Physical access | The author retains rights to his/her dissertation, thesis or other graduate work according to U.S. copyright law. Electronic access is being provided by the USC Libraries in agreement with the author, as the original true and official version of the work, but does not grant the reader permission to use the work if the desired use is covered by copyright. It is the author, as rights holder, who must provide use permission if such use is covered by copyright. The original signature page accompanying the original submission of the work to the USC Libraries is retained by the USC Libraries and a copy of it may be obtained by authorized requesters contacting the repository e-mail address given. |
| Repository name | University of Southern California Digital Library |
| Repository address | USC Digital Library, University of Southern California, University Park Campus MC 7002, 106 University Village, Los Angeles, California 90089-7002, USA |
| Repository email | cisadmin@lib.usc.edu |
| Archival file | uscthesesreloadpub_Volume71/etd-PopescuDan-393.pdf |
Description
| Title | Page 1 |
| Contributing entity | University of Southern California |
| Repository email | cisadmin@lib.usc.edu |
| Full text | DEPENDENCE ANALYSIS FOR DISTRIBUTED EVENT-BASED SYSTEMS by Daniel Popescu A Dissertation Presented to the FACULTY OF THE USC GRADUATE SCHOOL UNIVERSITY OF SOUTHERN CALIFORNIA In Partial Ful llment of the Requirements for the Degree DOCTOR OF PHILOSOPHY (COMPUTER SCIENCE) December 2011 Copyright 2011 Daniel Popescu |
