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 Edythe Meserand: Radio Pioneer and First President of American Women in Radio and Television(2014) Cox, Merrilee A.; Beasley, Maurine H.; Journalism; Digital Repository at the University of Maryland; University of Maryland (College Park, Md.)This historical dissertation examines the career of Edythe Meserand, a broadcast executive and the first president of American Women in Radio and Television, the oldest established professional association dedicated to advancing women in broadcasting. The research - the first in-depth account of Meserand's professional life - uses primary sources to investigate the tactics Meserand used to build a successful career in broadcasting's early decades, from the mid-1920s through the early 1950s. Her strategies reflected both her times and the conservative nature of the broadcasting industry. Much of her work took place in the gendered space that women typically occupied, but her most important work occurred during the fifteen years she spent in the male-dominated newsroom at WOR radio. This research adds to the historical record by providing a comprehensive case study of a notable woman whose career sheds light on the range of challenges and opportunities women faced. It also explores the prominent role she played in the founding and early development of AWRT where she inspired and mentored other women for more than 30 years. The author will argue that this work, and Meserand's ability to position herself as a worthy role-model for women in the broadcasting and media industry, is her most significant contribution.Item Algorithms for Data Migration(2005-06-15) Kim, Yoo-Ah; Khuller, Samir; Computer Science; Digital Repository at the University of Maryland; University of Maryland (College Park, Md.)This thesis is concerned with the problem related to data storage and management. A large storage server consists of several hundreds of disks. To balance the load across disks, the system computes data layouts that are typically adjusted according to the workload. As workloads change over time, the system recomputes the data layout, and rearranges the data items according to the new layout. We identify the problem of computing an efficient data migration plan that converts an initial layout to a target layout. We define the data migration problem as follows: for each item, there are a set of disks that have the item (sources) and a set of disks that want to receive the item (destinations). We want to migrate the data items from the sources to destinations. The crucial constraint is that each disk can participate in only one transfer at a time. The most common objective has been to minimize the makespan, which is the time when we finish all the migrations. The problem is NP-hard, and we develop polynomial time algorithms with constant factor approximation guarantees and several other heuristic algorithms. We present the performance evaluation of the different methods through an experimental study. We also consider the data migration problem to minimize the sum of completion times over all migration jobs or storage devices. Minimizing the sum of completion times of jobs is one of the most common objectives in scheduling literature. On the other hand, since a storage device may run inefficiently while the device is involved in migrations, another interesting objective is to minimize the sum of completion times over all storage devices. We present hardness results and constant factor approximation algorithms for these objectives. In addition, we consider the case when we have a heterogeneous collection of machines. We assume that heterogeneity is modeled by a non-uniform speed of the sending machine. For the basic problem of multicasting and broadcasting in the model, we show that Fastest Node First scheme gives a approximation ratio of 1.5 for minimizing the makespan. We also prove that there is a polynomial time approximation scheme.