Theses and Dissertations from UMD
Permanent URI for this communityhttp://hdl.handle.net/1903/2
New submissions to the thesis/dissertation collections are added automatically as they are received from the Graduate School. Currently, the Graduate School deposits all theses and dissertations from a given semester after the official graduation date. This means that there may be up to a 4 month delay in the appearance of a give thesis/dissertation in DRUM
More information is available at Theses and Dissertations at University of Maryland Libraries.
Browse
2 results
Search Results
Item The Ford Foundation-MENC Contemporary Music Project (1959-1973): A View of Contemporary Music in America(2013) Covey, Paul Michael; Davis, Shelley G; Music; Digital Repository at the University of Maryland; University of Maryland (College Park, Md.)Challenging the widespread belief that serial or otherwise atonal composers dominated the United States' contemporary music scene of the 1950s and '60s (a situation named the “serial tyranny” by Joseph Straus), this study of the Ford Foundation-funded Contemporary Music Project (CMP) concludes that tonality was prevailingly considered an acceptably “contemporary” compositional orientation at the time (1959-1973). The evidence examined includes music by the 73 composers-in-residence the CMP placed in public school systems and communities nationwide, as well as syllabi and lesson plans for 90 Project-sponsored courses on purportedly “contemporary” music, also spread throughout the country, most at college level. Both the former and the content of the latter are placed in tonal or atonal categories, and the result tabulated. The study is in four main parts: Part 1 gives a working definition of tonality and discusses the Project's early stages (1959-63), when it was called the Young Composers Project and featured only composer residencies. Throughout discussion of these residencies, the Project's absence of bias with regard to style is highlighted. Part 2 details its expansion, as the CMP, to include educational programs such as Seminars and Workshops (1964-1966). Part 3 concerns the Institutes for Music in Contemporary Education (IMCE)--which included experimental musicianship courses at 33 universities--and the final years of school system residencies. Part 4 outlines the Project's final years, which continued workshops and moved composer residencies from schools to communities. The study's account of the content of the CMP's educational programs provides a statistical image of the contemporary canon as of the mid-to-late 1960s: the works and composers from within then-living memory that were considered most significant. Tonal music forms unambiguously the greater portion of this canon, and is also prevalent within the output of the resident composers, a group including many later well-known names. In addition to these findings, the study documents the remarkable collaboration of numerous significant composers and other musical figures, with various individual proclivities, on a massive undertaking that had both the goal and effect of cultivating and promoting contemporary music in a full and open-minded range of styles.Item Using Locality and Interleaving Information to Improve Shared Cache Performance(2009) Liu, Wanli; Yeung, Donald; Electrical Engineering; Digital Repository at the University of Maryland; University of Maryland (College Park, Md.)The cache interference is found to play a critical role in optimizing cache allocation among concurrent threads for shared cache. Conventional LRU policy usually works well for low interference workloads, while high cache interference among threads demands explicit allocation regulation, such as cache partitioning. Cache interference is shown to be tied to inter-thread memory reference interleaving granularity: high interference is caused by ne-grain interleaving while low interference is caused coarse-grain interleaving. Proling of real multi-program workloads shows that cache set mapping and temporal phase result in the variation of interleaving granularity. When memory references from dierent threads map to disjoint cache sets, or they occur in distinct time windows, they tend to cause little interference due to coarse-grain interleaving. The interleaving granularity measured by runlength in workloads is found to correlate with the preference of cache management policy: ne-grain interleaving workloads perform better with cache partitioning, and coarse-grain interleaving workloads perform better with LRU. Most existing shared cache management techniques are based on working set locality analysis. This dissertation studies the shared cache performance by taking both locality and interleaving information into consideration. Oracle algorithm which provides theoretical best performance is investigated to provide insight into how to design a better practical policy. Proling and analysis of Oracle algorithm lead to the proposal of probabilistic replacement (PR), a novel cache allocation policy. With aggressor threads information learned on-line, PR evicts the bad locality blocks of aggressor threads probabilistically while preserving good locality blocks of non-aggressor threads. PR is shown to be able to adapt to the different interleaving granularities in different sets over time. Its flexibility in tuning eviction probability also improves fairness among thread performance. Evaluation indicates that PR outperforms LRU, UCP, and ideal cache partitioning at moderate hardware cost. For single program cache management, this dissertation also proposes a novel technique: reuse distance last touch predictor (RD-LTP). RD-LTP is able to capture reuse distance information, which represents the intrinsic memory reference pattern. Based on this improved LT predictor, an MRU LT eviction policy is developed to select the right victim at the presence of incorrect LT prediction. In addition to LT predictor, another predictor: reuse distance predictors (RDPs) is proposed, which is able to predict actual reuse distance values. Compared to various existing cache management techniques, these two novel predictors deliver higher cache performance with higher prediction coverage and accuracy at moderate hardware cost.