ASU Electronic Theses and Dissertations
This collection includes most of the ASU Theses and Dissertations from 2011 to present. ASU Theses and Dissertations are available in downloadable PDF format; however, a small percentage of items are under embargo. Information about the dissertations/theses includes degree information, committee members, an abstract, supporting data or media.
In addition to the electronic theses found in the ASU Digital Repository, ASU Theses and Dissertations can be found in the ASU Library Catalog.
Dissertations and Theses granted by Arizona State University are archived and made available through a joint effort of the ASU Graduate College and the ASU Libraries. For more information or questions about this collection contact or visit the Digital Repository ETD Library Guide or contact the ASU Graduate College at gradformat@asu.edu.
Filtering by
- Creators: Davulcu, Hasan
in the configuration may have been thoroughly tested, faults still arise due to interactions among the components composed, making the configuration faulty. When there are k components, combinatorial testing algorithms can be used to identify faulty interactions for t or fewer components, for some threshold 2 <= t <= k on the size of interactions considered. In general these methods do not identify specific faults, but rather indicate the presence or absence of some fault. To identify specific faults, an adaptive testing regime repeatedly constructs and tests configurations in order to determine, for each interaction of interest, whether it is faulty or not. In order to perform such testing in a loosely coupled distributed environment such as
the cloud, it is imperative that testing results can be combined from many different servers. The TA defines rules to permit results to be combined, and to identify the faulty interactions. Using the TA, configurations can be tested concurrently on different servers and in any order. The results, using the TA, remain the same.
the central idea is that multiple tenant applications can be developed using compo
nents stored in the SaaS infrastructure. Recently, MTA has been extended where
a tenant application can have its own sub-tenants as the tenant application acts
like a SaaS infrastructure. In other words, MTA is extended to STA (Sub-Tenancy
Architecture ). In STA, each tenant application not only need to develop its own
functionalities, but also need to prepare an infrastructure to allow its sub-tenants to
develop customized applications. This dissertation formulates eight models for STA,
and proposes a Variant Point based customization model to help tenants and sub
tenants customize tenant and sub-tenant applications. In addition, this dissertation
introduces Crowd- sourcing to become the core of STA component development life
cycle. To discover fit tenant developers or components to help building and com
posing new components, dynamic and static ranking models are proposed. Further,
rank computation architecture is presented to deal with the case when the number of
tenants and components becomes huge. At last, an experiment is performed to prove
rank models and the rank computation architecture work as design.