Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Distributed Embedded Systems (2)
- Logic simulation (2)
- Real-Time Middleware (2)
- AHE (1)
- Adaptive and reflective middleware (1)
-
- Adaptive real-time image transmission. (1)
- Algorithms (1)
- Anytime algorithms (1)
- Beat Analysis (1)
- Branch-and-bound (1)
- Branch-and-cut (1)
- Circuit simulation (1)
- Composite structures (1)
- Contrast-enhancement (1)
- Data collection to cloud (1)
- Denial of Service (1)
- Design (1)
- Discrete event simulation (1)
- Distributed real-time and embedded middleware (1)
- Distributed systems (1)
- Event list algorithms (1)
- Event lists (1)
- Execution Security (1)
- Experimentation (1)
- First order logic. (1)
- Generative programming (1)
- Group Scheduling (1)
- Linear programming (1)
- Logic simulation machines (1)
- Logic simulators (1)
- Publication Year
Articles 511 - 540 of 683
Full-Text Articles in Computer Engineering
A General Matrix Iterative Model For Dynamic Load Balancing, Mark A. Franklin, Vasudha Govindan
A General Matrix Iterative Model For Dynamic Load Balancing, Mark A. Franklin, Vasudha Govindan
All Computer Science and Engineering Research
Effective load balancing algorithms are crucial in fully realizing the performance potential of parallel computer systems. This paper proposes a general matrix iterative model to represent a range of dynamic load balancing algorithms. The model and associated performance measures are used to evaluate and compare vairous load balancing algorithms and derive optimal algorithms and associated parameters for a given application and multiprocessor system. The model is parameterized to represent three load balancing algorithms - the random strategy, diffusion and complete redistribution algorithms. The model is validated by comparing the results with measured performance on a realistic workload. The parallel N-body …
Issues In Distributed Control For Atm Networks, Jonathan S. Turner
Issues In Distributed Control For Atm Networks, Jonathan S. Turner
All Computer Science and Engineering Research
Asynchronous Transfer Mode (ATM) network technology is expected to become a central part of the emerging global information infrastructure. ATM networks introduce a number of features that distinguish them from earlier technologies and introduce new issues in network control. This paper offers a framework for precisely defining and analyzing alternative approaches to the distributed control of ATM networks and explores some of the key design issues through a series of examples. It is hoped that it will provide a useful foundation for researchers in networking and distributed computing interested in exploring these issues further and developing more complete solutions.
Synchronized Data Objects, Marin Bezic
Synchronized Data Objects, Marin Bezic
All Computer Science and Engineering Research
Synchronized Data Objects (SDOs) are presented as a method of encapsulating, in the datatype definition, synchronization protocols that are used to control information exchange. SDOs are presented in the context of I/O abstraction, a programming model that seeks to separate communication from computation in order to support dynamic end-user configuration of distrivuted applications. SDOs can be used to implement a variety of synchronization paradigms, including remote invalidation, demand-driven data streams, remote procedure call, and promises. An implementation of SDOs is described in the context of The Programmers' Playground, a distributed application development environment that supports the I/O abstraction programming model. …
Euphoria Reference Manual, T. Paul Mccartney, Kenneth J. Goldman
Euphoria Reference Manual, T. Paul Mccartney, Kenneth J. Goldman
All Computer Science and Engineering Research
No abstract provided.
Building Interactive Distributed Applications In C++ With The Programmers' Playground, Kenneth J. Goldman, T. Paul Mccartney, Ram Sethuraman, Bala Swaminathan And Todd Rogers
Building Interactive Distributed Applications In C++ With The Programmers' Playground, Kenneth J. Goldman, T. Paul Mccartney, Ram Sethuraman, Bala Swaminathan And Todd Rogers
All Computer Science and Engineering Research
No abstract provided.
Maintaining High Throughput During Overload In Atm Switches, Jonathan S. Turner
Maintaining High Throughput During Overload In Atm Switches, Jonathan S. Turner
All Computer Science and Engineering Research
This report analyzes two popular heuristics for ensuring packet integrity in ATM switching systems. In particular, we analyze the behavior of packet tail discarding, in order to understand how the packet level link efficiency is dependent on the rates of individual virtual circuits and the degre of the imposed overload. In addition, we study early packet discard and show that the queue capacity needed to achieve high efficiency under worst-case conditions grows with the number of virtual circuits and we determine the efficiency obtainable with more limited queue capacities. Using the insights from these analyses, extensions to early packet discard …
Distributed Debugging With I/O Abstraction, Andrew S. Koransky
Distributed Debugging With I/O Abstraction, Andrew S. Koransky
All Computer Science and Engineering Research
This thesis presents a simple, yet powerful, set of mechanisms for testing and debugging distributed applications consisting of modules that communicate through well-defined data interfaces. The tools allow default or programmer-defined functions to be attached to various communication events so that particular data values at interesting points in the program are made available for testing and debugging. The debugging status of each component of the communication interface can be controlled separately so that various debugging information can be turned on and off during program execution. By attaching breakpoints to programmer-defined fucntions in a standard debugger, fine-grained examination of each module …
Time Variability While Training A Parallel Neural Net Network, Tina L. Seawell, Barry L. Kalman
Time Variability While Training A Parallel Neural Net Network, Tina L. Seawell, Barry L. Kalman
All Computer Science and Engineering Research
The algorithmic analysis, data collection, and statistical analysis required to isolate the cause of time variability observed while an Elman style recurrent neural network is trained in parallel on a twenty processor SPARCcenter 2000 is described in detail. Correlations of system metrics indicate the operating system scheduler or an interaction of kernel processes is the most probable explanation for the variability.
Euphoria: End-User Construction Of Direct Manipulation User Interfaces For Distributed Applications, T. Paul Mccartney, Kenneth J. Goldman, David E. Saff
Euphoria: End-User Construction Of Direct Manipulation User Interfaces For Distributed Applications, T. Paul Mccartney, Kenneth J. Goldman, David E. Saff
All Computer Science and Engineering Research
The Programmers' Playground is a software library and run-time system for creating distributed multimedia applications from collections of reusable software moduels. This paper presents the design and implementation of EUPHORIA, Playground's user interface management system. Implemented as a Playground module, EUPHORIA allows end-users to create direct manipulation graphical user interfaces (GUIs) exclusively through the use of a graphics editor. No programming is required. At run-time, attributes of the GUI state can be exposed and connected to external Playground modules, allowing the user to vosualize and directly manipulate state information in remote Playground modules. Features of EUPHORIA include real-time direct manipulation …
Redesigning The Bsd Callout And Timer Facilities, Adam M. Costello, George Varghese
Redesigning The Bsd Callout And Timer Facilities, Adam M. Costello, George Varghese
All Computer Science and Engineering Research
We describe a new implementation of the BSD callout and timer facilities. Current BSD kernels take time proportional to the number of outstanding timers to set or cancel timers. Our implementation takes constant time to start, stop, and maintain timers; this leads to a highly scalable design that can support thousands of outstanding timers without much overhead. Unlike the existing implementation, our routines are guaranteed to lock out interrupts only for a small, bounded amount of time. We also extend the setitimer() interface to allow a process to have multiple outstanding timers, thereby reducing the need for users to maintain …
Formal Specification Of A Dynamically Configurable Distributed System, Ram Sethuraman, Kenneth J. Goldman
Formal Specification Of A Dynamically Configurable Distributed System, Ram Sethuraman, Kenneth J. Goldman
All Computer Science and Engineering Research
The Programmers' Playground is a programming environment that supports end-user construction of distributed multimedia applications. The system implements a new programming model that is based, in part, upon ideas from the formal I/O automaton model of Lynch and Tuttle. Important features of The Programmers' Playground are a separation of communication and computation and graphical support for dynamic reconfiguration. This paper provides a formal specification of the Playground programming model and runtime system in terms of the I/O automaton model on which it is based. Exploiting the compositionality properties of the I/O automaton model, the formal specification is describd as a …
Error Control For Continuous Media And Multipoint Applications, Christos Papadopoulos, Guru Parulkar
Error Control For Continuous Media And Multipoint Applications, Christos Papadopoulos, Guru Parulkar
All Computer Science and Engineering Research
High-bandwidth multimedia applications pose new challenges to error control. These include the support of error control for Continuous Media (CM) streams and the scalable support of error control in multipoint applications where the number of participants is large. Current error control mechanisms provide no support for the above applications. In this report we present new error control mechanisms that provide the required support. Continuous media applications have strict timing requirements which greatly affect recovery. To support continuous media applications we have designed and implemented a point-to-point error control mechanism which features the following: (1) selective repeat retransmission, (2) conditional retransmission, …
User Interface Applications Of A Multi-Way Constraint Solver, T. Paul Mccartney
User Interface Applications Of A Multi-Way Constraint Solver, T. Paul Mccartney
All Computer Science and Engineering Research
Constraints are widely recognized as a useful tool for user interface constructino. Through constraints, relationships among user interface components can be defined declaratively, leaving the task of relationship management to a constraint solver. Multi-way constraint solvers supporting constraint hierarchies provide a means to specify preferential constraint relationships with a dynamically changing computation flow, making them especially well suited to interactive user interfaces. However, previous such constraint solvers lack the ability to enforce inequalities or to effectively handle cyclic constraint relationships. These deficiencies limit the problems that could be solved using a constraint-based approach. This paper presents a new algorithm called …
Reliable Fifo Load Balancing Over Multiple Fifo Channels, Hari Adieseshu, Gurudatta M. Parulkar, George Varghese
Reliable Fifo Load Balancing Over Multiple Fifo Channels, Hari Adieseshu, Gurudatta M. Parulkar, George Varghese
All Computer Science and Engineering Research
Link striping algorithms are often used to overcome transmission bottlenecks in computer networks. However, traidtional striping algorithms suffer from two major disadvantages. They provide inadequate load sharing in the presence of variable length packets, and may result in non-FIFO delivery of data. We describe a new family of link striping algorithms that solve both problems. Our scheme applies to packets at any layer (physical, data, link, network, and transport) that work over multiple FIFO channels. We deal with variable sized packets by showing how a class of fair queueing algorithms can be converted into load sharing algorithms. Our transformation results …
An Efficient Signaling Structure For Atm Networks, Dakang Wu
An Efficient Signaling Structure For Atm Networks, Dakang Wu
All Computer Science and Engineering Research
As ATM becomes widely accepted as the communication standard for high speed networks, the signaling system structure and protocols that support ATM become more and more important. To support existing, future and unknown applications, the signalign system has to be very flexible and efficient. In this paper we define the signaling problem, present several possible signaling system structures, compare the advantages and disadvantages of these systems, and then we propose a new signaling system structure. The fundamental idea of the new signaling system is the logical separation of the signaling system structure from the underlying communication network, even though they …
Can Declared Strategy Voting Be An Effective Instrument For Group Decision-Making?, Lorrie Faith Cranor
Can Declared Strategy Voting Be An Effective Instrument For Group Decision-Making?, Lorrie Faith Cranor
All Computer Science and Engineering Research
The goal of this research is to determine whether declared strategy voting can be an effective tool for group decision-making. Declared strategy voting is a novel group decision-making procedure in which preference is specified using voting strategies - first-order mathematical functions that specify a choice in terms of zero or more parameters. This research will focus on refining the declared strategy voting concept, developing an accessible implementation of declared strategy voting that can be used for mock elections, assessing the potential impacts of declared strategy voting, and evaluating the effectiveness of declared strategy voting for group decision-making. This proposal describes …
An Oo Encapsulation Of Lightweight Os Concurrency Mechanisms In The Ace Toolkit, Douglas C. Schmidt
An Oo Encapsulation Of Lightweight Os Concurrency Mechanisms In The Ace Toolkit, Douglas C. Schmidt
All Computer Science and Engineering Research
This paper describes the design of the ACE object-oriented thread encapsulation class library. The architecture of this class library is presented from an end-user and internal design perspective and several key design issues are discussed. Readers should gain an understanding of the overall design approach as well as the tradeoffs between various software quality factors such as performance, portability, and extensibility.
Strategies For The Parallel Training Of Simple Recurrent Neural Networks, Peter J. Mccann, Barry L. Kalman
Strategies For The Parallel Training Of Simple Recurrent Neural Networks, Peter J. Mccann, Barry L. Kalman
All Computer Science and Engineering Research
Two concurrent implementations of the method of conjugate gradients for training Elman networks are discussed. The parallelism is obtained in the computation of the error gradient and the method is therefore applicable to any gradient descent training technique for this form of network. The experimental results were obtained on a Sun Sparc Center 2000 multiprocessor. The Sparc 2000 is a shared memory machine well suited to coarse-grained distributed computations, but the concurrency could be extended to other architectures as well.
Congestion Control In Atm Networks, Apostolos Dailianas, Andreas Bovopoulos
Congestion Control In Atm Networks, Apostolos Dailianas, Andreas Bovopoulos
All Computer Science and Engineering Research
No abstract provided.
Efficient Quality Of Service Support In Multimedia Computer Operating Systems, Raman Gopalakrishna, Guru M. Parulkar
Efficient Quality Of Service Support In Multimedia Computer Operating Systems, Raman Gopalakrishna, Guru M. Parulkar
All Computer Science and Engineering Research
This report describes our approach towards providing quality of service (QoS) guarantees for network communication within the endsystems to support multimedia applications. We first address the problem of QoS specification by identifying a set of application classes and their QoS parameters that cover the communication requirements of most applications. We then describe the QoS mapping problem, and show how requirements for resources (such as the CPU, the network interface adaptor and network connections) can be automatically derived from the application QoS parameters. We then deal with the QoS enforcement issue in which we describe techniques for scheduling protocol processing threads …
Distributed Data Layout, Scheduling And Playout Control In A Large Scale Multimedia Storage Server, Milind M. Buddhikot, Guru Parulkar
Distributed Data Layout, Scheduling And Playout Control In A Large Scale Multimedia Storage Server, Milind M. Buddhikot, Guru Parulkar
All Computer Science and Engineering Research
No abstract provided.
Production Quality Video Over Broadband Networks: A Description Of The System And Two Interactive Applications, William D. Richard, Jerome R. Cox Jr., A. Maynard Engebretson, Jason Fritts And Brian L. Gottlieb And Craig Horn
Production Quality Video Over Broadband Networks: A Description Of The System And Two Interactive Applications, William D. Richard, Jerome R. Cox Jr., A. Maynard Engebretson, Jason Fritts And Brian L. Gottlieb And Craig Horn
All Computer Science and Engineering Research
The Washington University MultiMedia eXplorer (MMX) is a complete, host-independent multimedia system capable of transmitting and receiving JPEG-compressed video, CD-quality audio, and high-resolution radiographic images over the Washington University broadband ATM network. If the host is equipped with an ATM interface card, normal network traffic can be supported via an ATM extension port on the MMX. The major components of the MMX are an ATMizer and three multimedia channels. The ATMizer implements the host interface, the interface to the ATM network, and hte interface to the three multimdeia channels. This paper describes the architecture of the MMX, the software used …
Practical Methods For Approximating Shortest Paths On A Convex Polytope In R3, John Hershberger, Subhash Suri
Practical Methods For Approximating Shortest Paths On A Convex Polytope In R3, John Hershberger, Subhash Suri
All Computer Science and Engineering Research
We propose a n extremely simple approximation scheme for computing shortest paths on the surface of a convex polytope in three dimensions. Given a convex polytope P with n vertices and two points p,q on its surface, let dp (p,q) denote the shortest path distance between p and q on the surface of P. Our algorithm produces a path of length at most 2 × dp(p,q) in time O(n). Extending this results, we can also compute ana pproximation of the shortest path tree rooted at an arbitrary point χ Є P in time O(n log n). In the approximate tree, …
An Evaluation Of The Pavane Visualization System, Kenneth C. Cox, Gruia-Catalin Roman
An Evaluation Of The Pavane Visualization System, Kenneth C. Cox, Gruia-Catalin Roman
All Computer Science and Engineering Research
The Pavane program visualization system is an implementation of the declarative paradigm of visualization. After a brief report on the status of the Pavane implementation, we present the results of an evaluation of the usability of Pavane. This evaluation is based on the use of Pavane by its developers to construct program visualizations, on its use in a classroom setting as a tool for examining executing programs, and on its application to some simple scientific visualizations.
Visual Specification Of Interprocess And Intraprocess Communication, T. Paul Mccartney, Kenneth J. Goldman
Visual Specification Of Interprocess And Intraprocess Communication, T. Paul Mccartney, Kenneth J. Goldman
All Computer Science and Engineering Research
We present a visual specification language for constructing distributed applications and their direct manipulation graphical user interfaces. Each distributed application consists of a collection of independent modules and a configuration of logical connections that define communication among the data interfaces of the modules. Our specification language uses a single visual mechanism that allows end-users to define interprocess communication among distributed modules and to define intraprocess communication among objects within a module. This seamless specification provides a general encapsulation/abstraction mechanism and is designed to support dynamic change to the communication structure. User interfaces are completely decoupled from the module(s) they control.
Pipelined And Superscalar Architectures In Clocked And Asynchronous Environments, Mark A. Franklin, Tienyo Pan
Pipelined And Superscalar Architectures In Clocked And Asynchronous Environments, Mark A. Franklin, Tienyo Pan
All Computer Science and Engineering Research
In this paper, a set of simple, general, yet practical performance models for RISC architectures are developed. These models apply to a wide range of systems that include both pipelined and superscalar systems operating in either clocked or asynchronous environments. The models permit quantitative evaluation of various design choices (e.g., the number of pipelines in the system, the pipeline depth, and the choice between clocked and asynchronous methodologies) as functions of technology parameters, environmental operating parameters, and pipeline function characteristics. Design curves are presented indicating optimal pipeline depth and number of pipelines to employ under various conditions.
Self-Stabilization By Counter Flushing, George Varghese
Self-Stabilization By Counter Flushing, George Varghese
All Computer Science and Engineering Research
A useful way to design simple and robust protocols is to make them self-stabilitizing. We describe a simple technique for self-stabilization called counter flushign which is applicable to a number of distributed algorithms. A randomized version of counter flushing is shown to have extremely small expected stabilization time. We show how our technique helps to crisply understand and improve some previous distributed algorithms. Then we apply it to a variety of total algorithms for deadlock detection, propagation of information with feedback, resets and snapshots. Our stabilizing snapshot protocol has much better complexity than the previous stabilizing non-blocking snapshot protocol. Hence …
Reasoning About Places, Times, And Actions In The Presence Of Mobility, C. Donald Wilcox, Gruia-Catalin Roman
Reasoning About Places, Times, And Actions In The Presence Of Mobility, C. Donald Wilcox, Gruia-Catalin Roman
All Computer Science and Engineering Research
The current trend toward portable computing systems (e.g., cellular phones, laptop computers) brings with it the need for a new paradigm for thinking about designing distributed applications. We introduce the term mobile to refer to distributed systems that include moving, autonomous agents which loosely cooperate to accomplish a tastk. The fluid nature of hte interconnections between components in a mobile system provides new challenges and new opportunities for the research community. While we do not propsoe to have fully grasped the consequences of these systems, we believe that the notions of place, time, and action will be central in any …
High-Performance Training Of Feedforward & Simple Recurrent Networks, Barry L. Kalman, Stan C. Kwasny
High-Performance Training Of Feedforward & Simple Recurrent Networks, Barry L. Kalman, Stan C. Kwasny
All Computer Science and Engineering Research
TRAINREC is a system for training feedforward and recurrent neural networks that incorporates several ideas. It uses the conjugate-gradient method which is demonstrably more efficient than traditional backward error propagation. We assume epoch-based training and derive a new error function having several desirable properties absent from the traditional sum-of-squared-error function. We argue for skip (shortcut) connections where appropriate and the preference for a sigmoidal yielding values over the [-1,1] interval. The input feature space is often over-analyzed, but by using singular value decomposition, input patterns can be conditioned for better learning often with a reduced number of input units. Recurrent …
Learning And Teaching Of Boolean And Geometric Classes, H. David Mathias
Learning And Teaching Of Boolean And Geometric Classes, H. David Mathias
All Computer Science and Engineering Research
We consider the concept classes of DNF formulas and unions of discretized, axis-parallel d-dimensional boxes in discretized d-dimensional space with respect to several different learning models. In the model of learning with queries we present an algorithm to learn unions of boxes. We introduce a model of teaching that prevents illicit communication between the teacher and the leaner but that captures the intuitive aspect of teaching: a learner should perform at least as well with a cooperative teacher as with an adversarial teacher. We propose the study of teaching of DNF formulas and unions of boxes in this model. We …