Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Institution
- Keyword
-
- Computer network architectures (2)
- Computer networks (2)
- Electronic data processing -- Distributed processing (2)
- Multimedia systems (2)
- Parallel processing (Electronic computers) (2)
-
- Adaptive computing systems (1)
- Associative memory (1)
- Bounded Query (1)
- Cartesian-Closed Increment (1)
- Conjunctive Query (1)
- DCOM (Computer architecture) (1)
- Database (1)
- Datalog Query (1)
- Derivatives in Probabilistic Production Cost (1)
- Electronic data proceesing -- Distributed processing (1)
- Emissions Control (1)
- Heteroassociative recall (1)
- Incremental Evaluation (1)
- Inductive Definition (1)
- Integrated services digital networks -- Quality control (1)
- Marginal Cost Curve (1)
- Microcomputer workstations (1)
- Microprocessors -- Programming (1)
- Neural network architecture (1)
- Object-oriented methods (Computer science) (1)
- On-Line Evaluation (1)
- Operating systems (Computers) -- Experiments (1)
- Operating systems -- Customization (1)
- Optimization (1)
- Parallel computers (1)
Articles 1 - 15 of 15
Full-Text Articles in OS and Networks
Simulation Modeling Within Workflow Technology, John A. Miller, Amit P. Sheth, Krzysztof J. Kochut, Xuzhong Wang, Arun Murugan
Simulation Modeling Within Workflow Technology, John A. Miller, Amit P. Sheth, Krzysztof J. Kochut, Xuzhong Wang, Arun Murugan
Kno.e.sis Publications
This paper presents an approach for integrating simulation modeling and analysis capabilities within the workflow management system (WFMS) being developed in the Large Scale Distributed Information Systems (LSDIS) Lab at the University of Georgia. Simulation modeling can be used for studying the efficiency of workflow designs as well as studying the general performance and reliability of WFMSs. We also discuss the importance of using sophisticated monitoring and animation capabilities, and the use of workflow management technology to advance simulation technology itself. Finally, we demonstrate a sample simulation where tasks and task managers are simulated.
On The Equivalence Of Upward And Downward Inheritance Reasoners, Krishnaprasad Thirunarayan
On The Equivalence Of Upward And Downward Inheritance Reasoners, Krishnaprasad Thirunarayan
Kno.e.sis Publications
In this paper, we analyze systematically the downward (property flow) and the upward (individual flow) views of inheritance for different categories of inheritance networks. We observe that both these views assign the same meaning to tree-structured hierarchies, and explain the divergence in the interpretation of more general networks in terms of their expressive power. This simple analysis sheds light on the inherent nature of nonmonotonic inheritance and can form the basis for the design of efficient algorithms for certain classes of queries. In addition, we describe the notion of preferential inheritance to specify additional conflict resolution information that can be …
Customizable Operating Systems, Jonathan Walpole, Crispin Cowan, Andrew P. Black, Jon Inouye, Calton Pu, Shanwei Cen
Customizable Operating Systems, Jonathan Walpole, Crispin Cowan, Andrew P. Black, Jon Inouye, Calton Pu, Shanwei Cen
Computer Science Faculty Publications and Presentations
A customizable operating system is one that can adapt to improve its functionality or performance. The need for customizable and application-specific operating systems has been recognized for many years, but they have yet to appear in the commercial market. This paper explores the notion of operating system customizability and examines the limits of existing approaches. The paper begins by surveying system structuring approaches for the safe and efficient execution of customizable operating systems. Then it discusses the burden that existing approaches impose on application software, and explores techniques for reducing this burden. Finally, support for customizability in the Synthetix project …
Device And Physical Data Independence For Multimedia Presentations, Richard Staehli, Jonathan Walpole, David Maier
Device And Physical Data Independence For Multimedia Presentations, Richard Staehli, Jonathan Walpole, David Maier
Computer Science Faculty Publications and Presentations
Multimedia computing promises access to any type of visual or aural medium on the desktop. But in this networked future, will every type of media be accessible from every terminal device? Current multimedia standards do not allow content that is authored for high-bandwidth workstations to scale down for low-bandwidth applications. The problem is that application requests are commonly interpreted as requests for the highest possible quality and resource overloads are handled by ad hoc methods. We can begin to solve this problem by specifying Quality of Service (QOS) requirements based on functionality rather than on content encoding and device capabilities.
Device And Physical Data Independence For Multimedia Presentations, Richard Staehli, Jonathan Walpole, David Maier
Device And Physical Data Independence For Multimedia Presentations, Richard Staehli, Jonathan Walpole, David Maier
Computer Science Faculty Publications and Presentations
Multimedia computing promises access to any type of visual or aural medium on the desktop. But in this networked future, will every type of media be accessible from every terminal device? Current multimedia standards do not allow content that is authored for high-bandwidth workstations to scale down for low-bandwidth applications. The problem is that application requests are commonly interpreted as requests for the highest possible quality and resource overloads are handled by ad hoc methods. We can begin to solve this problem by specifying Quality of Service (QOS) requirements based on functionality rather than on content encoding and device capabilities.
Power Systems Marginal Cost Curve And Its Applications, Shaojun Wang, S. M. Shahidehpour, Nian-De Xiang
Power Systems Marginal Cost Curve And Its Applications, Shaojun Wang, S. M. Shahidehpour, Nian-De Xiang
Kno.e.sis Publications
This paper presents a forward recursive procedure to calculate the expected system marginal cost curve (EMC). The EMC formulation allows for multi-state and multi-block dispatch of generating units and is used to determine the optimal energy of pumped-storage units. A new approach is developed to compute the first and second derivatives of the expected generation energy of a thermal unit with respect to the capacity of all thermal units in the system. The salient feature of the proposed approach is that it applies to hydro-thermal systems with multiple limited-energy hydro units.
Predicting Conserved Water-Mediated Interactions In Protein Active Sites, Michael L. Raymer, Sridhar Venkataraman, William F. Punch, Erik D. Goodman, Brenda Kuhn
Predicting Conserved Water-Mediated Interactions In Protein Active Sites, Michael L. Raymer, Sridhar Venkataraman, William F. Punch, Erik D. Goodman, Brenda Kuhn
Kno.e.sis Publications
No abstract provided.
Fast Byte Copying: A Re-Evaluation Of The Opportunities For Optimization, Jon Inouye, Jonathan Walpole, Ke Zhang
Fast Byte Copying: A Re-Evaluation Of The Opportunities For Optimization, Jon Inouye, Jonathan Walpole, Ke Zhang
Computer Science Faculty Publications and Presentations
High-performance byte copying is important for many operating systems because it is the principle method used for transferring data between kernel and user protection domains. For example, byte copying is commonly used for transferring data from kernel buffers to user buffers during file system read and IPC recv calls and to kernel buffers from user buffers during 'Write and-send calls. Because of its impact on overall system performance, commercial operating systems tend to employ many specialized byte copy routines, each one optimized for a different circumstance.
This paper revisits the opportunities for optimizing byte copy performance by discussing a series …
A Meta-Interpreter For Circuit-Extraction, Krishnaprasad Thirunarayan
A Meta-Interpreter For Circuit-Extraction, Krishnaprasad Thirunarayan
Kno.e.sis Publications
The design of a VLSI circuit consists of a description of the circuit in terms of its components and subcomponents, at various levels of detail. To verify that the layout of a VLSI circuit conforms to its design, one needs to work backwards from the lowest-level description of the circuit and recognize the higher-level components it constitutes. This paper is concerned with the application of logic programming techniques in the formal verification of the structural correctness of the VLSI circuit layouts. In particular, we review Michael Dukes' Generalized Extraction System (1990) that compiles design descriptions into a set of extraction …
Mist: Pvm With Transparent Migration And Checkpointing, Jeremy Casas, Dan Clark, Phil Galbiati, Ravi Konuru, Steve Otto, Robert Prouty, Jonathan Walpole
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 …
Mpvm: A Migration Transparent Version Of Pvm, Jeremy Casas, Dan Clark, Ravi Konuru, Steve Otto, Robert Prouty, Jonathan Walpole
Mpvm: A Migration Transparent Version Of Pvm, Jeremy Casas, Dan Clark, Ravi Konuru, Steve Otto, Robert Prouty, Jonathan Walpole
Computer Science Faculty Publications and Presentations
Parallel Virtual Machine (PVM) is a widely-used software system that allows a heterogeneous set of parallel and serial UNIX-based computers to be programmed as a single message-passing parallel machine, In this paper, an extension to PVM to support dynamic process migration is presented. Support for migration is important in general-purpose workstation environments since it allows parallel computations to co-exist with other applications, using idle-cycles as they become available and off-loading from workstations when they are no longer free. A description and evaluation of the design and implementation of the prototype Migratable PVM system is presented together with some performance results.
Nonrecursive Incremental Evaluation Of Datalog Queries, Guozhu Dong, Jianwen Su, Rodney Topor
Nonrecursive Incremental Evaluation Of Datalog Queries, Guozhu Dong, Jianwen Su, Rodney Topor
Kno.e.sis Publications
We consider the problem of repeatedly evaluating the same (computationally expensive) query to a database that is being updated between successive query requests. In this situation, it should be possible to use the difference between successive database states and the answer to the query in one state to reduce the cost of evaluating the query in the next state. We use nonrecursive Datalog (which are unions of conjunctive queries) to compute the differences, and call this process “incremental query evaluation using conjunctive queries”. After formalizing the notion of incremental query evaluation using conjunctive queries, we give an algorithm that constructs, …
Scheduling Of Parallel Jobs On Dynamic, Heterogenous Networks, Dan Clark, Jeremy Casas, Steve Otto, Robert Prouty, Jonathan Walpole
Scheduling Of Parallel Jobs On Dynamic, Heterogenous Networks, Dan Clark, Jeremy Casas, Steve Otto, Robert Prouty, Jonathan Walpole
Computer Science Faculty Publications and Presentations
In using a shared network of workstations for parallel processing, it is not only important to consider heterogeneity and differences in processing power between the workstations but also the dynamics of the system as a whole. In such a computing environment where the use of resources vary as other applications consume and release resources, intelligent scheduling of the parallel jobs onto the available resources is essential to maximize resource utilization. Despite this realization, however, there are few systems available that provide an infrastructure for the easy development and testing of these intelligent schedulers. In this paper, an infrastructure is presented …
Optimizing Object Invocation Using Optimistic Incremental Specialization, Jon Inouye, Andrew P. Black, Charles Consel, Calton Pu, Jonathan Walpole
Optimizing Object Invocation Using Optimistic Incremental Specialization, Jon Inouye, Andrew P. Black, Charles Consel, Calton Pu, Jonathan Walpole
Computer Science Faculty Publications and Presentations
To make object invocation efficient, it is important to minimize overhead. In general, overhead is incurred in order to maintain transparency; with the advent of mobile computer systems, persistence, increasing security and privacy concerns, transparency becomes more expensive and overhead is increasing. Invocation mechanisms maintain transparency by finding objects, choosing communication media, performing data translation into common formats (e.g., XDR), marshalling arguments, encrypting confidential data, etc. Performing all of these operations on every invocation would lead to unacceptable performance, so designers often avoid operations by specializing object invocation for more restricted environments. For example, the Emerald compiler performs several optimizations …
Adaptive Resonance Associative Map, Ah-Hwee Tan
Adaptive Resonance Associative Map, Ah-Hwee Tan
Research Collection School Of Computing and Information Systems
This article introduces a neural architecture termed Adaptive Resonance Associative Map (ARAM) that extends unsupervised Adaptive Resonance Theory (ART) systems for rapid, yet stable, heteroassociative learning. ARAM can be visualized as two overlapping ART networks sharing a single category field. Although ARAM is simpler in architecture than another class of supervised ART models known as ARTMAP, it produces classification performance equivalent to that of ARTMAP. As ARAM network structure and operations are symmetrical, associative recall can be performed in both directions. With maximal vigilance settings, ARAM encodes pattern pairs explicitly as cognitive chunks and thus guarantees perfect storage and recall …