UNT Libraries - 5 Matching Results

Search Results

Results: 1 - 5
open access

Dynamic Resource Management in RSVP- Controlled Unicast Networks

Description: Resources are said to be fragmented in the network when they are available in non-contiguous blocks, and calls are dropped as they may not end sufficient resources. Hence, available resources may remain unutilized. In this thesis, the effect of resource fragmentation (RF) on RSVP-controlled networks was studied and new algorithms were proposed to reduce the effect of RF. In order to minimize the effect of RF, resources in the network are dynamically redistributed on different paths to make the… more
Date: December 2001
Creator: Iyengar Prasanna, Venkatesan
Item Type: Refine your search to only Thesis or Dissertation
open access

Extensions to Jinni Mobile Agent Architecture

Description: We extend the Jinni mobile agent architecture with a multicast network transport layer, an agent-to-agent delegation mechanism and a reflection based Prolog-to-Java interface. To ensure that our agent infrastructure runs efficiently, independently of router-level multicast support, we describe a blackboard based algorithm for locating a randomly roaming agent. As part of the agent-to-agent delegation mechanism, we describe an alternative to code-fetching mechanism for stronger mobility of mobil… more
Date: May 2001
Creator: Tyagi, Satyam
Item Type: Refine your search to only Thesis or Dissertation
open access

Higher Compression from the Burrows-Wheeler Transform with New Algorithms for the List Update Problem

Description: Burrows-Wheeler compression is a three stage process in which the data is transformed with the Burrows-Wheeler Transform, then transformed with Move-To-Front, and finally encoded with an entropy coder. Move-To-Front, Transpose, and Frequency Count are some of the many algorithms used on the List Update problem. In 1985, Competitive Analysis first showed the superiority of Move-To-Front over Transpose and Frequency Count for the List Update problem with arbitrary data. Earlier studies due to Bit… more
Date: August 2001
Creator: Chapin, Brenton
Item Type: Refine your search to only Thesis or Dissertation

Memory Management and Garbage Collection Algorithms for Java-Based Prolog

Description: Implementing a Prolog Runtime System in a language like Java which provides its own automatic memory management and safety features such as built--in index checking and array initialization requires a consistent approach to memory management based on a simple ultimate goal: minimizing total memory management time and extra space involved. The total memory management time for Jinni is made up of garbage collection time both for Java and Jinni itself. Extra space is usually requested at Jinni's g… more
Access: Restricted to UNT Community Members. Login required if off-campus.
Date: August 2001
Creator: Zhou, Qinan
Item Type: Refine your search to only Thesis or Dissertation

Temporally Correct Algorithms for Transaction Concurrency Control in Distributed Databases

Description: Many activities are comprised of temporally dependent events that must be executed in a specific chronological order. Supportive software applications must preserve these temporal dependencies. Whenever the processing of this type of an application includes transactions submitted to a database that is shared with other such applications, the transaction concurrency control mechanisms within the database must also preserve the temporal dependencies. A basis for preserving temporal dependencies i… more
Access: Restricted to UNT Community Members. Login required if off-campus.
Date: May 2001
Creator: Tuck, Terry W.
Item Type: Refine your search to only Thesis or Dissertation
Back to Top of Screen