Thesis (M.C.S.) - Carleton University, 2007. / Includes bibliographical references (p. 114-118). Also available in electronic format on the Internet.

Thesis (M.S.)--Brigham Young University. School of Technology, 2007. / Includes bibliographical references (p. 123-126).

Thesis (M.S.S.I.S.)--Regis University, Denver, Colo., 2009. / Title from PDF title page (viewed on Jun. 25, 2010). Includes bibliographical references.

Thesis (M.S.C.I.T.)--Regis University, Denver, Colo., 2009. / Title from PDF title page (viewed on Jul. 14, 2010). Includes bibliographical references.

Thesis (M.S. in Information Technology Management)--Naval Postgraduate School, 2004. / Title from title screen (viewed Nov. 7, 2005). "September 2004." Includes bibliographical references. Also issued in paper format.

Thesis (M.S.)--University of Florida, 2002. / Title from title page of source document. Document formatted into pages; contains 112 p.; also contains graphics. Includes vita. Includes bibliographical references.

Increased production and use of multimedia data has led to the development of a more advanced Database Management System (DBMS), like an Object Relational Database Management System (ORDBMS). These advanced databases are necessitated by the complexity in structure and the functionality required by multimedia data. Unfortunately, no suitable benchmarks exist with which to test the performance of databases when handling multimedia data. This thesis describes the design of a benchmark to measure the performance of basic functionality found in multimedia databases. The benchmark, called MORD (Multimedia Object Relational Databases), targets Oracle, a well known commercial Object Relational Database Management System (ORDBMS) that can handle multimedia data. Although MORD targets Oracle, it can easily be applied to other Multimedia Database Management System (MMDBMS) as a result of a design that stressed its portability, and simplicity. MORD consists of a database schema, test data, and code to simulate representative queries on multimedia databases. A number of experiments are described that validate MORD and ensure its correct design and that its objectives are met. A by-product of these experiments is an initial understanding of the performance of multimedia databases. The experiments show that with multimedia data the buffer cache should be at least large enough to hold the largest dataset, a bigger block size improves the performance, and turning off logging and caching for bulk loading improves the performance. MORD can be used to compare different ORDBMS or to assist in the configuration of a specific database.

We study three models of job scheduling in a distributed server system. For each of them we suggest scheduling algorithms that are computationally efficient and provably achieve a performance objective related to the model. For this we consider jobs to be an abstraction of executable programs that request specific resources e.g. memory, CPU. Resources need to be reserved in one of the servers for the duration the programs run, which is unknown. The first model considers queue-based scheduling algorithms, in which jobs belong to a finite set of types and each type has a separate queue. The scheduling objective under this formulation is to keep the size of all queues bounded, which translates to bounded queuing delay. The two families of algorithms for this model can achieve the objective for the maximum theoretical workload. Most importantly they follow vastly different paradigms and are both viable alternatives depending on what other trade-offs the scheduling has to achieve. The second model considers that resource requirements of jobs come from an unknown distribution. Jobs are queued and the objective is again to keep the number of jobs in the queue bounded and consequently the queuing delay. In this harder formulation there is no previous characterization of the maximum workload that can achieve the objective. We provide such a characterization and algorithms that achieve at least 2/3 of that maximum. Lastly, we consider a model without queues in which jobs are admitted or rejected on arrival, with the goal to maximize the total utility of the jobs that run. Algorithms of this model were proven to achieve at least 1/2 of the maximum, but further analysis suggests that this limit can be as high as 1 − e (exponent -1). In all models we made simplifying assumptions that allow us to prove the desired properties of the system, but despite the theoretical nature of this work, we also discuss how the algorithms can be applied and tailored to the needs of different cloud applications. We hope they will eventually inspire improvements to existing cloud infrastructure management deployments.

The scope of this project includes a re-engineering of the internal architecture of the Solicitation Management System (SMS), a web-based application that facilitates the running of grant proposal solicitations for the Office of Technology Transfer and Commercialization at California State University San Bernardino (CSUSB). A goal of the project is to increase consistency and efficiency of the code base of the system, making it easier to understand, maintain, and extend. The previous version of SMS was written to rely on the Spring and Hibernate frameworks. The project includes a restructuring of the system to remove reliance on the Spring framework, but maintain reliance on Hibernate. The result is an updated version of the SMS. The system was written using current technologies such as Java, JSP, and CSS.

To increase productivity, application developers are using tools that allow them to create higher quality applications faster. One such set of tools, open-source frameworks, allows application developers to reuse software artifacts and should increase application quality. However, given the vast number of open-source frameworks available, users must be able to differentiate among frameworks and select the one best suited for them. In this study, we expand the taxonomy of open-source frameworks and analyze the impact of the framework's characteristics, technical quality, and social pressure on perceived usefulness and continued framework usage intention. Our findings suggest that understandability and flexibility have a significant impact on perceived ease of use, while perceived usefulness is mainly determined by flexibility and efficiency. Our research can be used to understand what influences developers to continue using frameworks and to improve framework development. / viii, 129 leaves : ill. ; 29 cm