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

Computer Engineering Commons

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

Washington University in St. Louis

Discipline
Keyword
Publication Year
Publication
Publication Type

Articles 331 - 360 of 733

Full-Text Articles in Computer Engineering

The Open Network Laboratory (A Resource For High Performance Networking Research), John Dehart, Fred Kuhns, Jyoti Parwatikar, Jonathan Turner, Ken Wong Sep 2005

The Open Network Laboratory (A Resource For High Performance Networking Research), John Dehart, Fred Kuhns, Jyoti Parwatikar, Jonathan Turner, Ken Wong

All Computer Science and Engineering Research

The Open Network Laboratory (ONL) is a remotely accessible network testbed designed to enable network researchers to conduct experiments using high performance routers and applications. ONL™s Remote Laboratory Interface (RLI) allows users to easily configure a network topology, initialize and modify the routers™ routing tables, packet classification tables and queuing parameters. It also enables users to add software plugins to the embedded processors available at each of the routers™ ports, enabling the introduction of new functionality. The routers provide a large number of built-in counters to track various aspects of system usage, and the RLI software makes these available through …


Cut-And-Solve: A Linear Search Strategy For Combinatorial Optimization Problems, Sharlee Climer, Weixiong Zhang Aug 2005

Cut-And-Solve: A Linear Search Strategy For Combinatorial Optimization Problems, Sharlee Climer, Weixiong Zhang

All Computer Science and Engineering Research

Branch-and-bound and branch-and-cut use search trees to identify optimal solutions. In this paper, we introduce a linear search strategy which we refer to as cut-and-solve and prove optimality and completeness for this method. This search is different from traditional tree searching as there is no branching. At each node in the search path, a relaxed problem and a sparse problem are solved and a constraint is added to the relaxed problem. The sparse problems provide incumbent solutions. When the constraining of the relaxed problem becomes tight enough, its solution value becomes no better than the incumbent solution value. At this …


Efficient And Effective Schemes For Streaming Media Delivery, Cheng Huang Aug 2005

Efficient And Effective Schemes For Streaming Media Delivery, Cheng Huang

All Computer Science and Engineering Research

The rapid expansion of the Internet and the increasingly wide deployment of wireless networks provide opportunities to deliver streaming media content to users at anywhere, anytime. To ensure good user experience, it is important to battle adversary effects, such as delay, loss and jitter. In this thesis, we first study efficient loss recovery schemes, which require pure XOR operations. In particular, we propose a novel scheme capable of recovering up to 3 packet losses, and it has the lowest complexity among all known schemes. We also propose an efficient algorithm for array codes decoding, which achieves significant throughput gain and …


Spawn: Service Provision In Ad-Hoc Wireless Networks, Radu Handorean, Gruia-Catalin Roman, Rohan Sen, Gregory Hackmann, Christopher Gill Aug 2005

Spawn: Service Provision In Ad-Hoc Wireless Networks, Radu Handorean, Gruia-Catalin Roman, Rohan Sen, Gregory Hackmann, Christopher Gill

All Computer Science and Engineering Research

The increasing ubiquity of wireless mobile computing platforms has opened up the potential for unprecedented levels of communication, coordination and collaboration among mobile computing devices, most of which will occur in an ad hoc, on-demand manner. This paper describes SPAWN, a middleware supporting service provision in ad-hoc wireless networks. The aim of SPAWN is to provide the software resources on mobile devices that facilitate electronic collaboration. This is achieved by applying the principles of service oriented computing (SOC), an emerging paradigm that has seen success in wired settings. SPAWN is an adaptation and extension of the Jini model of SOC …


A Collision Detection Chip On Reconfigurable Hardware, Nuzhet Atay, John W. Lockwood, Burchan Bayazit Jul 2005

A Collision Detection Chip On Reconfigurable Hardware, Nuzhet Atay, John W. Lockwood, Burchan Bayazit

All Computer Science and Engineering Research

Collision detection algorithms check the intersection between two given surfaces or volumes. They are computationally-intensive and the capabilities of conventional processors limit their performance. Hardware acceleration of these algorithms can greatly benefit the systems that need collision detection to be performed in real-time. A Field Programmable Gate Array (FPGA) is a great platform to achieve such acceleration. An FPGA is a collection of digital gates which can be reprogrammed at run time, i.e., it can be used as a CPU that reconfigures itself for a given task. In this paper, we present an FPGA based collision detection chip. The chip …


Real-Time Power Aware Routing In Wireless Sensor Networks, Octav Chipara, Zhimin He, Guoliang Xing, Qin Chen, Xiaorui Wang, Chenyang Lu, John Stankovic, Tarek Abdelzaher Jul 2005

Real-Time Power Aware Routing In Wireless Sensor Networks, Octav Chipara, Zhimin He, Guoliang Xing, Qin Chen, Xiaorui Wang, Chenyang Lu, John Stankovic, Tarek Abdelzaher

All Computer Science and Engineering Research

Many mission-critical wireless sensor network applications must resolve the inherent conflict between the tight resource constraints on each sensor node, particularly in terms of energy, with the need to achieve desired quality of service such as end-to-end real-time performance. To address this challenge we propose the Real-time Power-Aware Routing (RPAR) protocol. RPAR achieves required communication delays at minimum energy cost by dynamically adapting the transmission power and routing decisions based on packet deadlines. RPAR integrates a geographic forwarding policy cognizant of deadlines, power, and link quality with new algorithms for on-demand power adaptation and efficient neighborhood discovery. Simulations based on …


Auto-Pipe: A Pipeline Design And Evaluation System, Mark A. Franklin, John Maschmeyer, Eric Tyson, James Buckley, Patrick Crowley Jun 2005

Auto-Pipe: A Pipeline Design And Evaluation System, Mark A. Franklin, John Maschmeyer, Eric Tyson, James Buckley, Patrick Crowley

All Computer Science and Engineering Research

Auto-Pipe is a tool that aids in the design, evaluation, and implementation of pipelined applications that are distributed across a set of heterogeneous devices including multiple processors and FPGAs. It has been developed to meet the needs arising in the domains of communications, computation on large datasets, and real time streaming data applications. In this paper, the Auto-Pipe design flow is introduced and two sample applications, developed for compatibility with the Auto-Pipe system, are presented. The sample applications are the Triple-DES encryption standard and a subset of the signal-processing pipeline for VERITAS, a high-energy gamma-ray astrophysics experiment. These applications are …


Architectures For Rule Processing Intrusion Detection And Prevention Systems, Michael E. Attig May 2005

Architectures For Rule Processing Intrusion Detection And Prevention Systems, Michael E. Attig

All Computer Science and Engineering Research

High-performance intrusion detection and prevention systems are needed by network administrators in order to protect Internet systems from attack. Researchers have been working to implement components of intrusion detection and prevention systems for the highly popular Snort system in reconfigurable hardware. While considerable progress has been made in the areas of string matching and header processing, complete systems have not yet been demonstrated that effectively combine all of the functionality necessary to perform intrusion detection and prevention for real network systems. In this thesis, three architectures to perform rule processing, the heart of intrusion detection and prevention, are presented. The …


Improving The Performance Of Internet Data Transport, Anshul Kantawala, Jonathan S. Turner May 2005

Improving The Performance Of Internet Data Transport, Anshul Kantawala, Jonathan S. Turner

All Computer Science and Engineering Research

With the explosion of the World Wide Web, the Internet infrastructure faces new challenges in providing high performance for data traffic. First, it must be able to pro-vide a fair-share of congested link bandwidth to every flow. Second, since web traffic is inherently interactive, it must minimize the delay for data transfer. Recent studies have shown that queue management algorithms such as Tail Drop, RED and Blue are deficient in providing high throughput, low delay paths for a data flow. Two major shortcomings of the current algorithms are: they allow TCP flows to get synchronized and thus require large buffers …


Static Determination Of Allocation Rates To Support Real-Time Garbage Collection, Tobias Mann Apr 2005

Static Determination Of Allocation Rates To Support Real-Time Garbage Collection, Tobias Mann

All Computer Science and Engineering Research

While it is generally accepted that garbage-collected languages offer advantages over languages in which objects must be explicitly deallocated, real-time developers are leery of the adverse effects a garbage collector might have on real-time performance. Semiautomatic approaches based on regions have been proposed, but incorrect usage could cause unbounded storage leaks or program failure. Moreover, correct usage cannot be guaranteed at compile-time. Recently, real-time garbage collectors have been developed that provide a guaranteed fraction of the CPU to the application, and the correct operation of those collectors has been proven, subject only to the specification of certain statistics related to …


Composable Timed Automata Models For Real-Time Embedded Systems Middleware, Venkita Subramonian, Christopher Gill, Cesar Sanchez, Henny Sipma Apr 2005

Composable Timed Automata Models For Real-Time Embedded Systems Middleware, Venkita Subramonian, Christopher Gill, Cesar Sanchez, Henny Sipma

All Computer Science and Engineering Research

Middleware for distributed real-time embedded (DRE) systems has grown more and more complex in recent years, to address functional and temporal requirements of complex real-time applications. While current approaches for modeling middleware have eased the task of assembling, deploying and configuring middleware and applications, a more formal, fundamental and lower-level set of models is needed to be able to uncover subtle safety and timing errors introduced by interference between computations, particularly in the face of alternative concurrency strategies in the middleware layer. In this paper, we examine how formal models of lower-level middleware building blocks provide an appropriate level of …


What A Mesh: Dependent Data Types For Correct Mesh Manipulation Algorithms, Joel R. Brandt Apr 2005

What A Mesh: Dependent Data Types For Correct Mesh Manipulation Algorithms, Joel R. Brandt

All Computer Science and Engineering Research

The Edinburgh Logical Framework (LF) has been proposed as a system for expressing inductively defined sets. I will present an inductive definition of the set of manifold meshes in LF. This definition takes into account the topological characteri-zation of meshes, namely their Euler Characteristic. I will then present a set of dependent data types based on this inductive def-inition. These data types are defined in a programming language based on LF. The language’s type checking guarantees that any typeable expression represents a correct manifold mesh. Furthermore, any mesh can be represented using these data types. Hence, the encoding is sound …


Smartacking: Improving Tcp Performance From The Receiving End, Daniel K. Blandford, Sally A. Goldman, Sergey Gorinsky, Yan Zhou, Daniel R. Dooly Jan 2005

Smartacking: Improving Tcp Performance From The Receiving End, Daniel K. Blandford, Sally A. Goldman, Sergey Gorinsky, Yan Zhou, Daniel R. Dooly

All Computer Science and Engineering Research

We present smartacking, a technique that improves performance of Transmission Control Protocol (TCP) via adaptive generation of acknowledgments (ACKs) at the receiver. When the bottleneck link is underutilized, the receiver transmits an ACK for each delivered data segment and thereby allows the connection to acquire the available capacity promptly. When the bottleneck link is at its capacity, the smartacking receiver sends ACKs with a lower frequency reducing the control traffic overhead and slowing down the congestion window growth to utilize the network capacity more effectively. To promote quick deployment of the technique, our primary implementation of smartacking modifies only the …


Minimum Power Configuration In Wireless Sensor Networks, Guoliang Xing, Chenyang Lu, Ying Zhang, Qingfeng Huang, Robert Pless Dec 2004

Minimum Power Configuration In Wireless Sensor Networks, Guoliang Xing, Chenyang Lu, Ying Zhang, Qingfeng Huang, Robert Pless

All Computer Science and Engineering Research

This paper proposes the minimum power configuration (MPC) approach to energy conservation in wireless sensor networks. In sharp contrast to earlier research that treats topology control, power-aware routing, and sleep management in isolation, MPC integrates them as a joint optimization prob-lem in which the power configurationof a network consists of a set of active nodes and the transmission powers of the nodes. We show through analysis that the minimum power configu-ration of a network is inherently dependent on the data rates of sources. We propose several approximation algorithms with provable performance bounds compared to the optimal solu-tion, and a practical …


Using Fine-Grained Cycle Stealing To Improve Throughput, Efficiency And Response Time On A Dedicated Cluster While Maintaining Quality Of Service, Gary Stiehr Dec 2004

Using Fine-Grained Cycle Stealing To Improve Throughput, Efficiency And Response Time On A Dedicated Cluster While Maintaining Quality Of Service, Gary Stiehr

All Computer Science and Engineering Research

For various reasons, a dedicated cluster is not always fully utilized even when all of its processors are allocated to jobs. This occurs any time that a running job does not use 100% of each of the processors allocated to it. Keeping in mind the needs of both the cluster’s system administrators and its users, we would like to increase the throughput and efficiency of the cluster while maintaining or improving the average turnaround time of the jobs and the quality of service of the “primary” jobs originally scheduled on the cluster. To increase the throughput and efficiency of the …


Integrated Coverage And Connectivity Configuration For Energy Conservation In Sensor Networks, Guoliang Xing, Xiaorui Wang, Yuanfang Zhang, Chenyang Lu, Robert Pless, Christopher Gill Nov 2004

Integrated Coverage And Connectivity Configuration For Energy Conservation In Sensor Networks, Guoliang Xing, Xiaorui Wang, Yuanfang Zhang, Chenyang Lu, Robert Pless, Christopher Gill

All Computer Science and Engineering Research

An effective approach for energy conservation in wireless sensor networks is scheduling sleep intervals for extraneous nodes, while the remaining nodes stay active to provide continuous service. For the sensor network to operate successfully, the active nodes must maintain both sensing coverage and network connectivity. Fur-thermore, the network must be able to configure itself to any feasible degrees of coverage and connectivity in order to support different applications and environments with diverse requirements. This paper presents the design and analysis of novel protocols that can dynamically configure a network to achieve guaranteed degrees of coverage and connectivity. This work differs …


Automated Motion Synthesis For Virtual Choreography, Gazihan Alankus, A. Alphan Bayazit, O. Burchan Bayazit Oct 2004

Automated Motion Synthesis For Virtual Choreography, Gazihan Alankus, A. Alphan Bayazit, O. Burchan Bayazit

All Computer Science and Engineering Research

In this paper, we present a technique to automati-cally synthesize dancing moves for arbitrary songs. Our current implementation is for virtual characters, but it is easy to use the same algorithms for entertainer robots, such as robotic dancers, which fits very well to this year’s conference theme. Our technique is based on analyzing a musical tune (can be a song or melody) and synthesizing a motion for the virtual character where the character’s movement synchronizes to the musical beats. In order to analyze beats of the tune, we developed a fast and novel algorithm. Our motion synthesis algorithm analyze library …


Techniques And Patterns For Safe And Efficient Real-Time Middleware, Angelo Corsaro Sep 2004

Techniques And Patterns For Safe And Efficient Real-Time Middleware, Angelo Corsaro

All Computer Science and Engineering Research

Over 90 percent of all microprocessors are now used for real-time and embedded applications. The behavior of these applications is often constrained by the physical world. It is therefore important to devise higher-level languages and middleware that meet conventional functional requirements, as well as dependably and productively enforce real-time constraints. Real-Time Java is emerging as a safe, real-time environment. In this thesis we use it as our experimentation platform; however, our findings are easily adapted to other similar platforms. This thesis provides the following contributions to the study of safe and efficient real-time middleware. First, it identifies potential bottlenecks and …


Tcp Processor: Design, Implementation, Operation, And Usage, David V. Schuehler Sep 2004

Tcp Processor: Design, Implementation, Operation, And Usage, David V. Schuehler

All Computer Science and Engineering Research

There is a critical need to perform advanced data processing on network traffic. In order to accom-plish this, protocol processing must first be performed to reassemble individual network packets into consistent data streams representing the exact dataset being transferred between end systems. This task is currently performed by protocol stacks running on end systems. Similar protocol processing opera-tions are needed to process the data on the interior of the network. Given millions of network connections operating on multi-gigabit per second network links, this task is extremely difficult. The TCP-Processor addresses this challenge. It is a hardware circuit designed to perform …


Run-Time Modification Of The Class Hierarchy In A Live Java Development Environment, Joel R. Brandt, Kenneth J. Goldman Sep 2004

Run-Time Modification Of The Class Hierarchy In A Live Java Development Environment, Joel R. Brandt, Kenneth J. Goldman

All Computer Science and Engineering Research

Class hierarchy design is central to object-oriented software development. However, it is sometimes difficult for developers to anticipate all the implications of a design until implementation is underway. To support experimentation with different designs, we extend prior work on live development environments to allow run-time modification of the class hierarchy. The result is a more fluid object-oriented development process, in which immediate feedback from the executing program can be used to guide hierarchy design. This paper presents a framework and developer support for run-time modification of class inheritance relations in JPie, a live visual programming environment for Java. Most notably, …


Scheduling Algorithms For Cioq Switches, Prashanth Pappu, Jonathan S. Turner Aug 2004

Scheduling Algorithms For Cioq Switches, Prashanth Pappu, Jonathan S. Turner

All Computer Science and Engineering Research

Most scalable switches are required to buffer packets at both their inputs and outputs to overcome the slow memory speeds of packet queues. This thesis deals with the design of scheduling algorithms for such Combined Input and Output Queued (CIOQ) switches. For crossbar based CIOQ switches, we demonstrate the underperformance of commercially used scheduling algorithms under overload traffic conditions using targeted stress tests and present ideas to develop robust, stress resistant versions of these algorithms that are still simple enough to be implemented in high speed switches. To regulate the flow of traffic in buffered, multi-stage switches, we introduce a …


Discovering Transcriptional Regulatory Rules From Gene Expression And Tf-Dna Binding Data By Decision Tree Learning, Jianhua Ruan, Weixiong Zhang Jul 2004

Discovering Transcriptional Regulatory Rules From Gene Expression And Tf-Dna Binding Data By Decision Tree Learning, Jianhua Ruan, Weixiong Zhang

All Computer Science and Engineering Research

Background: One of the most promising but challenging task in the post-genomic era is to reconstruct the transcriptional regulatory networks. The goal is to reveal, for each gene that responds to a certain biological event, which transcription factors affect its transcription, and how several transcription factors coordinate to accomplish specific regulations. Results: Here we propose a supervised machine learning approach to address these questions. We build decision trees to associate the expression level of a gene with the transcription factor binding data of its promoter. From the decision trees, we extract regulatory rules that specify how the binding of a …


A Spatiotemporal Query Service For Mobile Users In Sensor Networks, Chenyang Lu, Guoliang Xing, Octav Chipara, Chien-Liang Fok, Sangeeta Bhattacharya May 2004

A Spatiotemporal Query Service For Mobile Users In Sensor Networks, Chenyang Lu, Guoliang Xing, Octav Chipara, Chien-Liang Fok, Sangeeta Bhattacharya

All Computer Science and Engineering Research

This paper presents MobiQuery, a spatiotemporal query service that allows mobile users to periodically gather information from their surrounding areas through a wireless sensor network. A key advantage of MobiQuery lies in its capability to meet stringent spatiotemporal performance constraints crucial to many applications. These constraints include query latency, data freshness and fidelity, and changing query areas due to user mobility. A novel just-in-time prefetching algorithm enables MobiQuery to main-tain robust spatiotemporal guarantees even when nodes op-erate under extremely low duty cycles. Furthermore, it sig-nificantly reduces the storage cost and network contention caused by continuous queries from mobile users. We …


Composing Systemic Aspects Into Component-Oriented Doc Middleware, Nanbor Wang May 2004

Composing Systemic Aspects Into Component-Oriented Doc Middleware, Nanbor Wang

All Computer Science and Engineering Research

The advent and maturation of component-based middleware frameworks have sim-plified the development of large-scale distributed applications by separating system devel-opment and configuration concerns into different aspects that can be specified and com-posed at various stages of the application development lifecycle. Conventional component middleware technologies, such as J2EE [73] and .NET [34], were designed to meet the quality of service (QoS) requirements of enterprise applications, which focus largely on scalability and reliability. Therefore, conventional component middleware specifications and implementations are not well suited for distributed real-time and embedded (DRE) ap-plications with more stringent QoS requirements, such as low latency/jitter, timeliness, and …


Fusion And Perspective Correction Of Multiple Networked Video Sensors, Christopher E. Neely, John W. Lookwood May 2004

Fusion And Perspective Correction Of Multiple Networked Video Sensors, Christopher E. Neely, John W. Lookwood

All Computer Science and Engineering Research

A network of adaptive processing elements has been developed that transforms and fuses video captured from multiple sensors. Unlike systems that rely on end-systems to process data, this system distributes the computation throughout the network in order to reduce overall network bandwidth. The network architecture is scalable because it uses a hierarchy of processing engines to perform signal processing. Nodes within the network can be dynamically reprogrammed in order to compose video from multiple sources, digitally transform camera perspectives, and adapt the video format to meet the needs of specific applications. A prototype has been developed using reconfigurable hardware that …


Run-Time Modification Of The Class Hierachy In A Live Java Development Environment, Joel R. Brandt May 2004

Run-Time Modification Of The Class Hierachy In A Live Java Development Environment, Joel R. Brandt

All Computer Science and Engineering Research

Class hierarchy design is central to object-oriented software development. How-ever, it is sometimes difficult for developers to anticipate all the implications of a design until implementation is underway. To support experimentation with different designs, we extend prior work on live development environments to allow run-time modification of the class hierarchy. The result is a more fluid object-oriented development process, in which immediate feedback from the executing program can be used to guide hierarchy design. This thesis presents a framework and developer support for run-time modification of class inheritance relations in JPie, a live visual programming environment for Java. Most notably, …


Automatic Determination Of Factors For Real-Time Garbage Collection, Tobias Mann, Ron K. Cytron Apr 2004

Automatic Determination Of Factors For Real-Time Garbage Collection, Tobias Mann, Ron K. Cytron

All Computer Science and Engineering Research

Several approaches to hard, real-time garbage collection have been recently proposed. All of these approaches require knowing certain statistical properties about a program's execution, such as the maximum extent of live storage, the rate of storage allocation, and the number of non-null object references. While these new approaches offer the possibility of guaranteed, reasonably bounded behavior for garbage collection, the determination of the required information may not be straight forward for the application programmer. In this paper we present evidence suggesting that the necessary factors can vary widely over the program's execution, indicating that an automatic, phased approach may be …


Static Analysis Of Memory-Accessing Gestures In Java, Christopher R. Hill Mar 2004

Static Analysis Of Memory-Accessing Gestures In Java, Christopher R. Hill

All Computer Science and Engineering Research

We propose the notion of Java-program gestures that are composed of a series of memory-accessing instructions. By finding patterns in gestures whose execution can be atomic, we can load them in an intelligent memory controller. This process can improve performance of the Java Virtual Machine, decrease code footprint, and reduce power consumption in hardware. In this thesis we formally define a language of gestures and introduce a method of detecting them statically at compile-time. We introduce a simple heuristic for reducing the number of gestures that must be loaded into the memory controller and show that finding the minimum number …


Design And Implementation Of A String Matching System For Network Intrusion Detection Using Fpga-Based Bloom Filters, Sarang Dharmapurikar, Michael Attig, John Lockwood Mar 2004

Design And Implementation Of A String Matching System For Network Intrusion Detection Using Fpga-Based Bloom Filters, Sarang Dharmapurikar, Michael Attig, John Lockwood

All Computer Science and Engineering Research

Modern Network Intrusion Detection Systems (NIDS) inspect the network packet payload to check if it conforms to the security policies of the given network. This process, of-ten referred to as deep packet inspection, involves detection of predefined signature strings or keywords starting at an arbitrary location in the payload. String matching is a computationally intensive task and can become a potential bottleneck without high-speed processing. Since the conventional software-implemented string matching algorithms have not kept pace with the increasing network speeds, special purpose hardware solutions have been introduced. In this paper we show how Bloom filters can be used effectively …


Service Oriented Computing Imperatives In Ad Hoc Wireless Settings, Rohan Sen, Radu Handorean, Gruia-Catalin Roman, Christopher Gill Mar 2004

Service Oriented Computing Imperatives In Ad Hoc Wireless Settings, Rohan Sen, Radu Handorean, Gruia-Catalin Roman, Christopher Gill

All Computer Science and Engineering Research

Service oriented computing is a new paradigm that is gaining popularity in dis-tributed computing environments due to its emphasis on highly specialized, modular and platform-agnostic code facilitating interoperability of systems. It borrows concepts from more mature paradigms such as object-oriented and component computing. This results in a progression from object-oriented computing to component computing and finally to service oriented computing, a new paradigm for designing and delivering software. Just as an object encapsulates state and behavior at a fine level of granularity, a service offers similar encapsulation at a larger scale. This evolution raises the level of abstraction at which …