No description available.

This thesis proposes a new dynamic resource management architecture, Magnet, to meet the requirements of users in flexible and adaptive systems. Computer systems no longer operate in centralized isolated static environments. Technological advances, such as smaller and faster hardware, and higher reliability of networks have resulted in the growth of mobility of computing and the need for run-time reconfigurability. The dynamic management of this diversity of resources is the central issue addressed in this thesis. Applications in environments with frequently changing characteristics are required to participate in dynamic resource management, to adapt to ever-changing conditions, and to express their requirements in terms of quality of service. Magnet enables dynamic trading of resources which can be requested indirectly by the type of service they offer, rather than directly by their name. A dedicated component, the Trader, matches requests for services against demands and establishes a component binding - resource allocation. In addition, the architecture is extensible - it does not constrain the information on services and allows user-customization of the matching process. Consequently, this allows resource definitions to be parametrized (to include QoS-based characteristics), and the matching process to be user-customized (to preform QoS-based negotiation). In order to fulfill the requirements of users relying on ever-changing conditions, Magnet enables runtime adaptation (dynamic rebinding) to changes in the environment, constant monitoring of resources, and scalability of the architecture. The generality of the Magnet architecture is illustrated with several examples of resource allocation in dynamic environments.

by Ma Hon-chung. / Bibliography: leaves [199]-[204] / Thesis (M.Ph.)--Chinese University of Hong Kong, 1984

Typescript (photocopy). / Digitized by Kansas Correctional Industries

Disk space fragmentation is the proliferation of small and unusable gaps. This problem is considered within the context of IBM's VM operating system. Facing this problem, researchers resorted to using algorithms based on memory management techniques, such as placement strategies (first-fit, best-fit, and worst-fit). Solutions based on these algorithms do not yield optimum results. Furthermore, in many cases, their efficiency and cost effectiveness are questionable. This work proposes a new method to address the disk fragmentation problem using improved I/0 techniques. Optimum results and efficiency are some of the qualities that contribute to the superiority of this approach. The algorithm was implemented and test figures were compared with calculated figures. The results clearly favor this new algorithm. / Graduation date: 1991

Thesis (M.S. in Computer Science)--Naval Postgraduate School, June 2003. / Thesis advisor(s): Cynthia E. Irvine, Roger R. Schell. Includes bibliographical references (p. 83-92). Also available online.

No description available.

Includes bibliography. / 246 p. : ill. ; 30 cm. / Title page, contents and abstract only. The complete thesis in print form is available from the University Library. / This thesis explores the implementation of orthogonally persistent systems that make direct use of the attributes of paged virtual memory found in the majority of conventional computing platforms. These attributes are exploited to support object movement for persistent storage to addressable memory, to aid in garbage collection, to provide the illusion of larger storage spaces than the underlying architecture allows, and to provide distribution of the persistent system. It also explores the different models of distribution, communication mechanisms between federated spaces and the problem of maintaining consistency between separate persistent spaces in a manner which ensures both a reliable and resilient computational environment. / Thesis (Ph.D.)--University of Adelaide, Dept. of Computer Science,1995

Includes bibliography. / 246 p. : ill. ; 30 cm. / Title page, contents and abstract only. The complete thesis in print form is available from the University Library. / This thesis explores the implementation of orthogonally persistent systems that make direct use of the attributes of paged virtual memory found in the majority of conventional computing platforms. These attributes are exploited to support object movement for persistent storage to addressable memory, to aid in garbage collection, to provide the illusion of larger storage spaces than the underlying architecture allows, and to provide distribution of the persistent system. It also explores the different models of distribution, communication mechanisms between federated spaces and the problem of maintaining consistency between separate persistent spaces in a manner which ensures both a reliable and resilient computational environment. / Thesis (Ph.D.)--University of Adelaide, Dept. of Computer Science,1995

Thesis (M.Comp.)--Unitec New Zealand, 2009. / Includes bibliographical references (leaves 106-112).