Subheap-Augmented Garbage Collection

Automated memory management avoids the tedium and danger of manual techniques. However, as no programmer input is required, no widely available interface exists to permit principled control over sometimes unacceptable performance costs. This dissertation explores the idea that performance-oriented languages should give programmers greater control over where and when the garbage collector (GC) expends effort. We describe an interface and implementation to expose heap partitioning and collection decisions without compromising type safety. We show that our interface allows the programmer to encode a form of reference counting using Hayes\u27 notion of key objects. Preliminary experimental data suggests that our proposed mechanism can avoid high overheads suffered by tracing collectors in some scenarios, especially with tight heaps. However, for other applications, the costs of applying subheaps---in human effort and runtime overheads---remain daunting

Limited Copies and Leased References for Distributed Persistent Objects

As businesses become global organisations and as e-commerce opens up markets to customers across the Internet, demand grows for increasingly ambitious distributed software applications and platforms. Where these applications run over potentially huge collections of data, sophisticated management of data storage and communication is required. There is a need for well-integrated persistence and distribution support that considers the implications for long-term maintenance of valuable persistent data. Orthogonal persistence is intended to ease the programmer's job by providing support for data management that is integrated with a programming language. The simplicity of the orthogonal persistence model argues for its use in distributed systems, in order to make life simpler for the application programmer. PJRMI is an implementation of Java RMI for the orthogonally-persistent PJama platform. This dissertation addresses two problem areas raised by combining orthogonal persistence with support for distributed applications. These problem areas are illustrated by PJRMI. The first problem is raised as a consequence of attempting to provide the illusion of a persistent connection between stores. Distribution-related errors easily break this illusion. In an open system, it can be difficult to determine when an object should become persistent by remote reachability. In the long term, persistent references to remote objects threaten the maintainability of the persistent stores involved. A solution has been implemented to address the problems raised by maintaining persistent references between distributed stores. Greater autonomy of individual stores is achieved by limiting remote access to objects to a duration of time associated with a specific distributed application's lifetime. Within the application's lifetime, the benefits are retained of persistence of inter-store references for resilience. The second problem is encountered when copying object graphs between stores. Large object graphs tend to build up in persistent stores over time. Copying such large object graphs can be prohibitively expensive in terms of resources and performance. A programmer may assume that the size of graph they are copying is acceptable, based on their knowledge of a system in its infancy. However, the problem is that, in a long-lived system, their assumptions may be challenged, since the size of an object graph and the context in which it is used are more likely to change during a persistent object graph's lifetime. The combination of a typically statically-defined policy for passing objects to remote sites and programmer assumptions that fail to take into account the lifetime of an object can also result in other problems. These problems include failure to support different requirements on remote use of the same object graph by different applications during that object graph's lifetime. A solution has been implemented to address the problems raised by remote copying of large object graphs. Flexibility of control over such copying is achieved. Separation of policy from object definition ensures flexibility. Choice of object-copying policy for a specific distributed application's lifetime provides control, while ensuring it is adaptable to changes in size of persistent object graphs over their lifetime and to changes in the context in which these graphs are used

Examining Stakeholder Engagement Processes and The Shared Value Creation of Sustainability Partnership Program at Two Fairmont Hotels

Initially perceived as the individual philanthropic activities assumed by a businessperson or merely a useful marketing tool, CSR has undoubtedly become one of the primary focus areas of many business entities worldwide (Lee, Ham, & Koh, 2019). Evidently, businesses way of thinking has changed considerably since (Friedman, 1962, 1970) postulated that businesses only responsibility was to maximize their owners’ and shareholders’ wealth. Specifically, businesses have begun to recognize the importance of identifying stakeholder expectations and responding to such expectations (Font, Guix & Bonilla-Priego, 2016). Accordingly, in the tourism industry there have been growing pressures from external stakeholders to behave in a more sustainable way (Font et al., 2012). Comparatively, there has been growing interest in scholarship as well, as over 70% of all articles on the subject of CSR in tourism and hospitality have been published within the last five years (Font & Lynes, 2018). Simply, CSR has become more a matter of how than why (Smith, 2003). This basic qualitative study explores the processes by which the Sustainability Partnership Program creates value between Fairmont and the communities surrounding Chateau Lake Louise and Banff Springs. Particularly, external stakeholders (ie. government, NGOs, and suppliers) are the focus of this dissertation. This study found that Fairmont has been able to foster a shared sense of responsibility amongst employees and external stakeholders for planning and implementing impactful initiatives, leading to improved levels of efficiency in not only identifying community needs but also responding to them

An investigation of the success of organizations involved in community engagement initiatives

Organizations seeking to invest human and financial resources in community-building initiatives have lacked an empirical study that determines what factors are present in successful initiatives for previous organizations. This study is an exploratory study, examining the success of 36 diverse organizations, cross-tabbed with corporate social responsibility indicators to determine which, if any, of the indicators are necessary for successful implementation. Additionally, organizational demographics were also studied for the same purpose. Significant corporate social responsibility indicators included corporate identity, stakeholder interest, altruism/moral duty, and employee equity. The organizational demographic that was significant was an indication of whether the process of engagement had shown some “philosophical change” in the organization. This study illustrates that broader research should be done in order to assist organizations that are seeking to be socially involved in their communities

Sixth Goddard Conference on Mass Storage Systems and Technologies Held in Cooperation with the Fifteenth IEEE Symposium on Mass Storage Systems

This document contains copies of those technical papers received in time for publication prior to the Sixth Goddard Conference on Mass Storage Systems and Technologies which is being held in cooperation with the Fifteenth IEEE Symposium on Mass Storage Systems at the University of Maryland-University College Inn and Conference Center March 23-26, 1998. As one of an ongoing series, this Conference continues to provide a forum for discussion of issues relevant to the management of large volumes of data. The Conference encourages all interested organizations to discuss long term mass storage requirements and experiences in fielding solutions. Emphasis is on current and future practical solutions addressing issues in data management, storage systems and media, data acquisition, long term retention of data, and data distribution. This year's discussion topics include architecture, tape optimization, new technology, performance, standards, site reports, vendor solutions. Tutorials will be available on shared file systems, file system backups, data mining, and the dynamics of obsolescence

2007-2008, University of Memphis bulletin

University of Memphis bulletin containing the graduate catalog for 2007-2008.https://digitalcommons.memphis.edu/speccoll-ua-pub-bulletins/1427/thumbnail.jp

2006-2007, University of Memphis bulletin

University of Memphis bulletin containing the graduate catalog for 2006-2007.https://digitalcommons.memphis.edu/speccoll-ua-pub-bulletins/1426/thumbnail.jp

2008-2009, University of Memphis bulletin

University of Memphis bulletin containing the graduate catalog for 2008-2009.https://digitalcommons.memphis.edu/speccoll-ua-pub-bulletins/1428/thumbnail.jp

1992 July, Memphis State University bulletin

Vol. 81, No. 4 of the Memphis State University bulletin containing the graduate catalog for 1992-93, 1992 July.https://digitalcommons.memphis.edu/speccoll-ua-pub-bulletins/1175/thumbnail.jp