Computer Engineering Commons^™

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 13, Number 10, December 1997, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A twelve page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

Flow And Congestion Control For Internet Streaming Applications, Shanwei Cen, Calton Pu, Jonathan Walpole

Computer Science Faculty Publications and Presentations

The emergence of streaming multimedia players provides users with low latency audio and video content over the Internet. Providing high-quality, best-effort, real-time multimedia content requires adaptive delivery schemes that fairly share the available network bandwidth with reliable data protocols such as TCP. This paper proposes a new flow and congestion control scheme, SCP (Streaming Control Protocol) , for real-time streaming of continuous multimedia data across the Internet. The design of SCP arose from several years of experience in building and using adaptive real-time streaming video players. SCP addresses two issues associated with real-time streaming. First, it uses a congestion control …

A Modeling And Simulation Approach To Characterize Network Layer Internet Survivability, Leif S. King

Theses and Dissertations

The Air Force Core Competency of Information Superiority will be achieved in an age of decreasing AF manpower and corporate expertise. Increased AF reliance on COTS solutions, coupled with nearly ubiquitous points of entry to communication networks, create unique challenges in maintaining the Information Superiority edge. The protection of the internet is part of this equation. The internet supports the daily business traffic of the Air Force. Personnel, finance, and supply data flow through its routers. Controlling an adversary's access to our information systems, either the data, or the hardware and software that control the data and transform it into …

Modeling And Simulation Support For Parallel Algorithms In A High-Speed Network, Dustin E. Yates

Theses and Dissertations

This thesis investigates the ability of a simulation model to compare and contrast parallel processing algorithms in a high-speed network. The model extends existing modeling, analysis, and comparison of parallel algorithms by providing graphics based components that facilitate the measurement of system resources. Simulation components are based on the Myrinet local area network standard. The models provide seven different topologies to contrast the performance of five variations of Fast Fourier Transform (FFT) algorithms. Furthermore, the models were implemented using a commercially developed product that facilitates the testing of additional topologies and the investigation of hardware variations. Accurate comparisons are statistically …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 13, Number 9, November 1997, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A twelve page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

Searches For Scalar Top And Scalar Bottom Quarks At Lep2, Barate, R.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

Searches for scalar top and bottom quarks have been performed with data collected by the ALEPH detector at LEP. The data sample consists of 21.7 pb−1 taken at √ s = 161, 170, and 172 GeV and 5.7 pb−1 taken at √ s = 130 and 136 GeV. No evidence for scalar top quarks or scalar bottom quarks was found in the channels ˜t → cχ, ˜t → bℓν˜, and b˜ → bχ. For the channel ˜t → cχ a limit of 67 GeV/c 2 has been set on the scalar top quark mass, independent of the mixing angle between …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 13, Number 8, October 1997, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A twelve page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

Formal Specification Of Fragmentation And Reassembly In Ipv6, Ibrahim Sahin

Electrical & Computer Engineering Theses & Dissertations

Development and implementation of a networking standard such as the new Internet Protocol (IPv6) is a very difficult process. Different implementations of the standard must be fully compatible to allow different computers to communicate with each other. However, standards are often ambiguous, frequently a result of providing specifications in the English language. A more formal specification could assist in the design of systems. This thesis demonstrates that capability using the Prototype Verification System (PVS).

In this thesis study, a formal specification for fragmentation and reassembly in IPv6 was created to provide a tool for the standardization of IPv6 using PVS. …

Modeling And Comparison Of Wormhole Routed Mesh And Torus Networks, Ronald I. Greenberg, Lee Guan

Computer Science: Faculty Publications and Other Works

2D-mesh and torus networks have often been proposed as the interconnection pattern for parallel computers. In addition, wormhole routing has increasingly been advocated as a method of reducing latency. Most analysis of wormhole routed networks, however, has focused on the torus and the broader class of k-ary n-cubes to which it belongs. This paper presents a performance model for the wormhole routed mesh, and it compares the performance of the mesh and torus based on theoretical and empirical analyses.

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 13, Number 7, September 1997, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A ten page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

A Measurement Of The Qcd Colour Factors And A Limit On The Light Gluino, Barate, R.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

Using data collected from 1992 to 1995 with the ALEPH detector at LEP, a measurement of the colour factor ratios CA/CF and TF /CF and the strong coupling constant αs = CFαs(MZ)/(2π) has been performed by fitting theoretical predictions simultaneously to the measured differential two-jet rate and angular distributions in four-jet events. The result is found to be in excellent agreement with QCD, {fx4-1} Fixing CA/CF and TF/CF to the QCD values permits a determination of αs(MZ) and ηf, the number of active flavours. With this measurement the existence of a gluino with mass below 6.3 GeV/c2 is excluded at …

An Improved Analytical Model For Wormhole Routed Networks With Application To Butterfly Fat-Trees, Ronald I. Greenberg, Lee Guan

Computer Science: Faculty Publications and Other Works

A performance model for wormhole routed interconnection networks is presented and applied to the butterfly fat-tree network. Experimental results agree very closely over a wide range of load rate. Novel aspects of the model, leading to accurate and simple performance predictions, include (1) use of multiple-server queues, and (2) a general method of correcting queuing results based on Poisson arrivals to apply to wormhole routing. These ideas can also be applied to other networks.

Dynamic Load Distribution In Mist, K. Al-Saqabi, R. M. Prouty, Dylan Mcnamee, Steve Otto, Jonathan Walpole

Computer Science Faculty Publications and Presentations

This paper presents an algorithm for scheduling parallel applications in large-scale, multiuser, heterogeneous distributed systems. The approach is primarily targeted at systems that harvest idle cycles in general-purpose workstation networks, but is also applicable to clustered computer systems and massively parallel processors. The algorithm handles unequal processor capacities, multiple architecture types and dynamic variations in the number of processes and available processors. Scheduling decisions are driven by the desire to minimize turnaround time while maintaining fairness among competing applications. For efficiency, the virtual processors (VPs) of each application are gang scheduled on some subset of the available physical processors.

Specification And Verification Of Generic Cell Rate Algorithms In Pvs, Huseyin Ozgungor

Electrical & Computer Engineering Theses & Dissertations

Formal verification methods have been considered as a powerful complementary approach to define standards and to prove correctness of the systems. In this work, formal specification of Generic Cell Rate Algorithms are defined and proved. The specification process enables standardization for constructing Generic Cell Rate Algorithms. Standardization is an important process in the Asynchronous Transfer Mode (ATM) networks. By employing formal methods, the necessary standards could be constructed to allow different algorithms to be employed which still meet system requirements. Those system requirements are quantified in the Quality of Service (QOS).

Congestion management is a vital concept for networks in …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 13, Number 6, June 1997, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

Wright State University College of Engineering and Computer Science

A Toolkit For Specializing Production Operating System Code, Crispin Cowan, Dylan Mcnamee, Andrew P. Black, Calton Pu, Jonathan Walpole, Charles Krasic, Perry Wagle, Qian Zhang

Computer Science Faculty Publications and Presentations

Specialization has been recognized as a powerful technique for optimizing operating systems. However, specialization has not been broadly applied beyond the research community because the current techniques, based on manual specialization, are time-consuming and error-prone. This paper describes a specialization toolkit that should help broaden the applicability of specializing operating systems by assisting in the automatic generation of specialized code, and {\em guarding} the specialized code to ensure the specialized system continues to be correct. We demonstrate the effectiveness of the toolkit by describing experiences we have had applying it in real, production environments. We report on our experiences with …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 13, Number 5, May 1997, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A twelve page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

Predictable File Access Latency For Multimedia, Dan Revel, Crispin Cowan, Dylan Mcnamee, Calton Pu, Jonathan Walpole

Computer Science Faculty Publications and Presentations

Multimedia applications are sensitive to I/O latency and jitter when accessing data in secondary storage. Transparent adaptive prefetching (TAP) uses software feedback to provide multimedia applications with file system quality of service (QoS) guarantees. We are investigating how QoS requirements can be communicated and how they can be met by adaptive resource management. A preliminary test of adaptive prefetching is presented.

Single Row Routing: Theoretical And Experimental Performance Evaluation, And New Heuristic Development, David A. Hysom

Computer Science Theses & Dissertations

The Single Row Routing Problem (SRRP) is an abstraction arising from real-world multilayer routing concerns. While NP-Complete, development of efficient SRRP routing heuristics are of vital concern to VLSI design. Previously, researchers have introduced various heuristics for SRRP; however, a comprehensive examination of SRRP behavior has been lacking.

We are particularly concerned with the street-congestion minimization constraint, which is agreed to be the constraint of greatest interest to industry. Several theorems stating lower bounds on street congestion are known. We show that these bounds are not tight in general, and argue they may be in error by at least 50% …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 13, Number 4, April 1997, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A ten page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

Mlpq: A Linear Constraint Database System With Aggregate Operators, Yiming Li

School of Computing: Dissertations, Theses, and Student Research

In this project report, I will discuss a Multiple Linear Programming Query (MLPQ) system and the theoretical background of this system.The MPLQ system is developed to solve some realistic problems involving both linear programming (UP) techniques and linear constraint databases (LCDBs) theory. The MLPQ system is aimed at providing a mechanism of bridging these two important areas. system basically consists of three parts which are a linear constraint database, an LP solver, and an interface between the LCDB and the LP solver. The LCDB of the MLPQ system contains multiple linear programming problems. The LP solver used in the MPLQ …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 13, Number 3, March 1997, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A ten page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 13, Number 2, February 1997, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A twelve page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

A Global Computing Environment For Networked Resources, Haluk Topcuoglu, Salim Hariri

Electrical Engineering and Computer Science - All Scholarship

Current advances in high-speed networks and WWW technologies have made network computing a cost-effective, high-performance computing alternative. New software tools are being developed to utilize efficiently the network computing environment. Our project, called Virtual Distributed Computing Environment (VDCE), is a high-performance computing environment that allows users to write and evaluate networked applications for different hardware and software configurations using a web interface. In this paper we present the software architecture of VDCE by emphasizing application development and specification, scheduling, and execution/runtime aspects.

Physical Media Independence: System Support For Dynamically Available Network Interfaces, Jon Inouye, Jim Binkley, Jonathan Walpole

Computer Science Faculty Publications and Presentations

Advances in hardware technology has fueled the proliferation of dynamically configurable network interface cards. This empowers mobile laptop users to select the most appropriate interface for their current environment. Unfortunately, the majority of system software remains "customized" for a particular network configuration, and assumes many network characteristics remain invariant over the runtime of the software. Physical Media Independence (PMI) is the concept of making assumptions about a particular device explicit, detecting events which invalidate these assumptions, and recovering once events are detected. This paper presents a model supporting PMI. Based on device availablilty, the model identifies implicit device-related assumptions made …

A Study Of Τ Decays Involving Η And Ω Mesons, D. Buskulic, M. Thulasidas

Research Collection School Of Computing and Information Systems

The 132 pbt - 1 of data collected by ALEPH from 1991 to 1994 have been used to analyze η and ω production in τ decays. The following branching fractions have been measured: B(τ−→ντωh−)=(1.91±0.07±0.06)×10−2,B(τ−→ντωh−)=(1.91±0.07±0.06)×10−2, B(τ−→ντωh−π0)=(4.3±0.6±0.5)×10−3,B(τ−→ντωh−π0)=(4.3±0.6±0.5)×10−3, B(τ−→ντηK−)=(2.9+1.3−1.2±0.7)×10−4,B(τ−→ντηK−)=(2.9−1.2+1.3±0.7)×10−4, B(τ−→ντηh−π0)=(1.8±0.4±0.2)×10−3B(τ−→ντηh−π0)=(1.8±0.4±0.2)×10−3 and the 95% C.L. limit B(τ− → ντηπt -) t - 4 has been obtained. The ωπt- and ηπt -π0 rates and dynamics are found in agreement with the predictions made from e+e∼ - annihilation data with the help of isospin invariance (CVC).

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 13, Number 1, January 1997, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A twelve page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

Optimizing The Performance Of The Corba Internet Inter-Orb Protocol Over Atm, Aniruddha Gokhale, Douglas C. Schmidt

All Computer Science and Engineering Research

The Internet Inter-ORB Protocol (IIOP) enables heterogeneous CORBA-compliant Object Request Brokers (ORBs) to interoperate over TCP/IP networks. The IIOP uses the Common Data Representation (CDR) transfer syntax to map CORBA Interface Definition Langauge (IDL) data types into a bi-canonical wire format. Due to the excessive marshaling/demarshaling overhead, data copying, and high-levels of function call overhead, conventional implementation of IIOP protocols yield poor performance over high-speed networks. To meet the demands of emerging distributed multimedia applications, CORBA-compliant ORBs must support both interoperable and highly efficient IIOP implementations. This paper provides two contributions to the study and design of high performance CORBA …

Expressing Code Mobility In Mobile Unity, Gian Pietro Picco, Gruia-Catalin Roman, Peter J. Mccann

All Computer Science and Engineering Research

Advancements in network technology have led to the emergence of new computing paradigms that challenge established programming practices by employing weak forms of consistency and dynamic forms of binding. Code mobility, for instance, allows for invocation-time binding between a code fragment and the location where it executes. Similarly, mobile computing allows hosts (and the software they execute) to alter their physical location. Despite apparent similarities, the two paradigms are distinct in their treatment of location and movement. This paper seeks to uncover a common foundation for the two paradigms by exploring the manner in which stereotypical forms of code mobility …

Symmetrical Routes And Reverse Path Congestion Control, Rajib Ghosh, George Varghese

All Computer Science and Engineering Research

We describe new mechanisms to deal with asymmetries that arise in routing protocols. We show how to avoid route asymmetries (due to non-unique shortest paths) by adding random integer link costs. We show in detail how RIP can be modified to avoid route asymmetry with high probability, without affecting either its efficiency or performance metrics such as convergence time. Symmetrical intra-domain routing also makes possible a new form of congestion control that we call Reverse Path Congestion Control (RPCC). We show, using simulations, that RPCC can augment existing TCP congestion control mechanisms to improve start up behavior and to avoid …