Open Access. Powered by Scholars. Published by Universities.®

Systems Architecture Commons

Open Access. Powered by Scholars. Published by Universities.®

OS and Networks

Institution
Keyword
Publication Year
Publication
Publication Type

Articles 121 - 141 of 141

Full-Text Articles in Systems Architecture

Automatically Discovering The Number Of Clusters In Web Page Datasets, Zhongmei Yao Jun 2005

Automatically Discovering The Number Of Clusters In Web Page Datasets, Zhongmei Yao

Computer Science Faculty Publications

Clustering is well-suited for Web mining by automatically organizing Web pages into categories, each of which contains Web pages having similar contents. However, one problem in clustering is the lack of general methods to automatically determine the number of categories or clusters. For the Web domain in particular, currently there is no such method suitable for Web page clustering. In an attempt to address this problem, we discover a constant factor that characterizes the Web domain, based on which we propose a new method for automatically determining the number of clusters in Web page data sets. We discover that the …


Staging Transformations For Multimodal Web Interaction Management, Michael Narayan, Christopher Williams, Saverio Perugini, Naren Ramakrishnan Jan 2004

Staging Transformations For Multimodal Web Interaction Management, Michael Narayan, Christopher Williams, Saverio Perugini, Naren Ramakrishnan

Computer Science Faculty Publications

Multimodal interfaces are becoming increasingly ubiquitous with the advent of mobile devices, accessibility considerations, and novel software technologies that combine diverse interaction media. In addition to improving access and delivery capabilities, such interfaces enable flexible and personalized dialogs with websites, much like a conversation between humans. In this paper, we present a software framework for multimodal web interaction management that supports mixed-initiative dialogs between users and websites. A mixed-initiative dialog is one where the user and the website take turns changing the flow of interaction. The framework supports the functional specification and realization of such dialogs using staging transformations – …


Program Transformations For Information Personalization, Saverio Perugini Jan 2004

Program Transformations For Information Personalization, Saverio Perugini

Computer Science Faculty Publications

Personalization constitutes the mechanisms and technologies necessary to customize information access to the end-user. It can be defined as the automatic adjustment of information content, structure, and presentation. The central thesis of this dissertation is that modeling interaction explicitly in a representation, and studying how partial information can be harnessed in it by program transformations to direct the flow of the interaction, can provide insight into, reveal opportunities for, and define a model for personalized interaction. To evaluate this thesis, a formal modeling methodology is developed for personalizing interactions with information systems, especially hierarchical hypermedia, based on program transformations. The …


Automatically Generating Interfaces For Personalized Interaction With Digital Libraries, Saverio Perugini, Naren Ramakrishnan, Edward A. Fox Jan 2004

Automatically Generating Interfaces For Personalized Interaction With Digital Libraries, Saverio Perugini, Naren Ramakrishnan, Edward A. Fox

Computer Science Faculty Publications

We present an approach to automatically generate interfaces supporting personalized interaction with digital libraries; these interfaces augment the user-DL dialog by empowering the user to (optionally) supply out-of-turn information during an interaction, flatten or restructure the dialog, and inquire about dialog options. Interfaces generated using this approach for CITIDEL are described.


The Staging Transformation Approach To Mixing Initiative, Robert Capra, Michael Narayan, Saverio Perugini, Naren Ramakrishnan, Manuel A. Pérez-Quiñones Jan 2003

The Staging Transformation Approach To Mixing Initiative, Robert Capra, Michael Narayan, Saverio Perugini, Naren Ramakrishnan, Manuel A. Pérez-Quiñones

Computer Science Faculty Publications

Mixed-initiative interaction is an important facet of many conversational interfaces, flexible planning architectures, intelligent tutoring systems, and interactive information retrieval systems. Software systems for mixed-initiative interaction must enable us to both operationalize the mixing of initiative (i.e., support the creation of practical dialogs) and to reason in real-time about how a flexible mode of interaction can be supported (e.g., from a meta-dialog standpoint). In this paper, we present the staging transformation approach to mixing initiative, where a dialog script captures the structure of the dialog and dialog control processes are realized through generous use of program transformation techniques (e.g., partial …


Load Balancing And Congestion Avoidance Routing, Konstantinos N. Kokkinos Dec 2002

Load Balancing And Congestion Avoidance Routing, Konstantinos N. Kokkinos

Dissertations

Today’s high speed backbone networks are expected to support a wide range of communication-intensive applications. One of the most important issues in Quality of Service (QoS) is efficient routing. Many QoS routing solutions have been published lately for different criteria of QoS requirements and resource constraints. In this dissertation we focus on the design of regular network topologies and suggest efficient routing schemes to reduce the probability of hot spot creation in the network. Furthermore, we provide a detection of congestion mechanism that reroutes traffic to maintain balancing with small communication cost. Several theoretical results relatively to network traffic balancing …


Issues In Implementing Ipv6 In The X-Kernel Simulator, Raja Singam Thillainathan Jan 2002

Issues In Implementing Ipv6 In The X-Kernel Simulator, Raja Singam Thillainathan

Student Works (2000-2009)

The new Internet Protocol Version 6(IPv6) or Internet Protocol Next Generation (TPNG) is bound to replace the existing Internet Protocol Version 4(TPv4). This new protocol is to address and resolve the limitations of the existing Internet Protocols. At the moment the new protocol is still in its infancy stage, and it is being implemented by both the research society and the private sector. The x-kernel being a research project done by University of Arizona is freely available on the Internet. This x-kemel is a networking software almost similar to the Berkeley version (BSD) and it is bundled together with a …


Development Of Objective-Oriented Components For Atm Networks Simulation With Emphasis On Switch Architecture, Boon Pin Tan Feb 2001

Development Of Objective-Oriented Components For Atm Networks Simulation With Emphasis On Switch Architecture, Boon Pin Tan

Student Works (2000-2009)

Asynchronous Transfer Mode (ATM) is considered to be the ground on which B-ISDN is to be built. It is the new generation of communication networks that are being deployed throughout the telecommunication industry. The basic functions of ATM switch are to direct cells from input port to output port and to buffer cell destined to the same output port from different input port. This project focuses on the development of an object-oriented simulator for simulation. The simulator is designed and implemented to ensure the correctness of routing within the switch fabric, fairness of switching and to guarantee quality of service …


Network Simulation And Performance Evalution Of Ip Multicast Using Pim-Dm In Umjanetsim, Jui Hiangh Teoh Jan 2001

Network Simulation And Performance Evalution Of Ip Multicast Using Pim-Dm In Umjanetsim, Jui Hiangh Teoh

Student Works (2000-2009)

The demand for multicast capabilities in IP networks is growing very rapidly. New applications that take advantage of IP Multicast are being introduced constantly. Therefore, IP Multicast is regarded as one of the most important technologies in IP networks today. This dissertation focuses on the simulation and performance evaluation of IP Multicast using Protocol Independent Multicast- Dense Mode (PIM-OM) as the multicast routing protocol. The simulation is executed in a network simulator named UMJaNetSim, where custom components are built in order to simulate IP Multicast. First, the advantages and applications of IP Multicast, multicast addressing, Internet Group Management Protocol (IGMP), …


Design And Develop A Generic Cut-Through Switch, Nazaruddin Noraini Jan 2001

Design And Develop A Generic Cut-Through Switch, Nazaruddin Noraini

Student Works (2000-2009)

Today's advancement in network is related to the advancement of packet switching technology. Switching directs network traffic in an efficient manner – it sends information directly from the port of origin to only its destination port. Without switching, many networks are experiencing bandwidth shortages because of an increase in traffic due to the increased numbers of users, the amount of data transported between client/server applications, and the inefficient traffic patterns of some networks. Transmission of data from one destination to another is unguaranty successful. Sometimes the data will lost or conupted during transmission to destination port. To make data more …


Personalizing The Gams Cross-Index, Saverio Perugini, Priya Lakshminarayanan, Naren Ramakrishnan Jan 2000

Personalizing The Gams Cross-Index, Saverio Perugini, Priya Lakshminarayanan, Naren Ramakrishnan

Computer Science Faculty Publications

The NIST Guide to Available Mathematical Software (GAMS) system at http://gams.nist .gov serves as the gateway to thousands of scientific codes and modules for numerical computation. We describe the PIPE personalization facility for GAMS, whereby content from the cross-index is specialized for a user desiring software recommendations for a specific problem instance. The key idea is to (i) mine structure, and (ii) exploit it in a programmatic manner to generate personalized web pages. Our approach supports both content-based and collaborative personalization and enables information integration from multiple (and complementary) web resources. We present case studies for the domain of linear, …


Dynamic Modeling Of Cell Flow For An Atm Network, Sok Kem Tay Jan 2000

Dynamic Modeling Of Cell Flow For An Atm Network, Sok Kem Tay

Student Works (2000-2009)

This project is to study dynamic modeling of cell flow for an A TM network using Simulink tools. The A TM network consists of a maximum of four nodes configured into single hop, multi hop, ring, mesh and star topology. The dynamic simulation will examining the cell flow (bit per second), cell dropped cell received and link utilization for above topology.


Development Of Object Oriented Components For Atm Network Simulation With Emphasis On Congestion Control, Wen Dee Lee Jan 2000

Development Of Object Oriented Components For Atm Network Simulation With Emphasis On Congestion Control, Wen Dee Lee

Student Works (2000-2009)

Asynchronous Transfer Mode (ATM) provides the required flexibility for the support of heterogeneous services for Broadband Integrated Services Digital Networks (8-ISDN) environment. A TM has proven to be efficient and flexible in handling a wide range of integrated service traffic. The most outstanding feature of ATM is that it provides the Quality of Service (QoS) guarantees between connections. In a network environment, congestion control is an important factor to consider as to guarantee the negotiated QoS. To study, observe and develop the congestion control mechanism in an ATM network, simulation modelling provides the ideal domain. The aim of this project …


Development Of Object Oriented Components For Atm Network Simulation With Emphasis On Switch Architecture, Meng Kiat Gan Jan 2000

Development Of Object Oriented Components For Atm Network Simulation With Emphasis On Switch Architecture, Meng Kiat Gan

Student Works (2000-2009)

Asynchronous Transfer Mode (ATM) is considered to be the foundation on which B­ISON is to be built. It is the new generation of communication protocol that being deployed throughout the telecommunication industry. An important component of this communication networks is the ATM switch whose basic functions are to direct cells from input port to output port and to buffer cell destined to the same output port from different input port. Understanding an ATM switch before building it, is a challenging task as one must consider the design of switching architecture and cell buffering at the same time. As the switching …


Cheetahs Are Fast, But Nearly Irrelevant, Calton Pu, Jonathan Walpole, Charles Consel Aug 1997

Cheetahs Are Fast, But Nearly Irrelevant, Calton Pu, Jonathan Walpole, Charles Consel

Computer Science Faculty Publications and Presentations

A brief paper submitted to the NSF Workshop on New Challenges and Directions for Systems Research, held in St. Louis, Mo., July 31-August 1, 1997. Outlines the case for more cooperation among software system architects, and a less reductionistic approach to software development.


Designing A High-Quality Network: An Application-Oriented Approach, Sudheer Dharanikota Apr 1997

Designing A High-Quality Network: An Application-Oriented Approach, Sudheer Dharanikota

Computer Science Theses & Dissertations

As new computer network technologies emerge, the application designers and the application users expect an increasing level of quality of service from them. Hence, it is a common practice in the newer technologies to provide more Quality of Service (QoS) components. Until now, these QoS solutions have been both network-technology specific and network-oriented solutions. In this thesis, we present an application-oriented approach to design a high quality network which is independent of the underlying communication technology. In this thesis, we propose a QoS architecture to "provide predictable performance to the end-to-end application users in a high quality networking environment." In …


A Migratable User-Level Process Package For Pvm, Ravi Kunuru, Steve Otto, Jonathan Walpole Jan 1997

A Migratable User-Level Process Package For Pvm, Ravi Kunuru, Steve Otto, Jonathan Walpole

Computer Science Faculty Publications and Presentations

Shared, multi-user, workstation networks are characterized by unpredictable variability in system load. Further, the concept of workstation ownership is typically present. For efficient and unobtrusive computing in such environments, applications must not only overlap their computation with communication but also redistribute their computations adaptively based on changes in workstation availability and load. Managing these issues at application level leads to programs that are difficult to write and debug. In this paper, we present a system that manages this dynamic multi-processor environment while exporting a simple message-based programming model of a dedicated, distributed memory multiprocessor to applications. Programmers are thus insulated …


Mist: Pvm With Transparent Migration And Checkpointing, Jeremy Casas, Dan Clark, Phil Galbiati, Ravi Konuru, Steve Otto, Robert Prouty, Jonathan Walpole May 1995

Mist: Pvm With Transparent Migration And Checkpointing, Jeremy Casas, Dan Clark, Phil Galbiati, Ravi Konuru, Steve Otto, Robert Prouty, Jonathan Walpole

Computer Science Faculty Publications and Presentations

We are currently involved in research to enable PVM to take advantage of shared networks of workstations (NOWs) more effectively. In such a computing environment, it is important to utilize workstations unobtrusively and recover from machine failures. Towards this goal, we have enhanced PVM with transparent task migration, checkpointing, and global scheduling. These enhancements are part of the MIST project which takes an open systems approach in developing a cohesive, distributed parallel computing environment. This open systems approach promotes plug-and-play integration of independently developed modules, such as Condor, DQS, A VS, Prospero, XPVM, PIOUS, Ptools, etc. Transparent task migration, in …


Comet: A Synthetic Benchmark For Message-Passing Architectures, Nalini Ganapati, Steve Otto, Jonathan Walpole Feb 1994

Comet: A Synthetic Benchmark For Message-Passing Architectures, Nalini Ganapati, Steve Otto, Jonathan Walpole

Computer Science Faculty Publications and Presentations

Rapid advances in hardware technology have led to wide diversity in parallel computer architectures. This diversity makes it difficult to evaluate or compare the performance of different parallel computers. Existing benchmarks tend either to be too architecture-specific, or too high-level. Both problems can result in benchmarks that not only provide insufficient information on the performance characteristics of the computer being tested, but are also difficult to port. New benchmarking approaches are needed for new architectural classes, particularly distributed-memory, message-passing computers. This paper focuses on benchmarking distributed-memory message-passing computers. A synthetic benchmark called CoMet (COmmunication METrics), is presented. CoMet is based …


Smimd - A Synchronous Multiple Instruction Multiple Data Computer Architecture, Cathy C. Roberts Jan 1992

Smimd - A Synchronous Multiple Instruction Multiple Data Computer Architecture, Cathy C. Roberts

Computer Science Theses & Dissertations

This thesis assesses the feasibility of utilizing a hypercube interconnect topology to link a heterogeneous processor array in a very long instruction word (VLIW) computer architecture. The research focused upon the selection of a suitable arrangement of processors for the computer and the subsequent demonstration of the architecture's capability to handle simple loop iterations. Previous attempts at VLIW computer design are summarized, the new SMIMD architecture is presented, and suggestions for future research are given. The thesis concludes with results of the initial performance evaluations of the architecture design.


Randomized Routing On Fat-Trees, Ronald I. Greenberg Oct 1985

Randomized Routing On Fat-Trees, Ronald I. Greenberg

Computer Science: Faculty Publications and Other Works

Fat-trees are a class of routing networks for hardware-efficient parallel computation. This paper presents a randomized algorithm for routing messages on a fat-tree. The quality of the algorithm is measured in terms of the load factor of a set of messages to be routed, which is a lower bound on the time required to deliver the messages. We show that if a set of messages has load factor lambda on a fat-tree with n processors, the number of delivery cycles (routing attempts) that the algorithm requires is O(lambda+lgnlglgn) with probability 1-O(1/ …