Physical Sciences and Mathematics Commons^™

High-Performance Bus-Based Architectures - Guest Editorial, Stephan Olariu, Rong Lin

Computer Science Faculty Publications

(First paragrapg) This special issue of VLSI Design presents a collection of seven papers selected out of more than 35 submissions received following the Call for Papers. Each submission was sent to three referees, all of them experts in the area of bus-based architectures. The result is impressive. The papers featured in this Special Issue cover a wide range of topics from sorting to string matching, to load balancing, to simulation, matrix operations, to robotics, to the design of high-performance scalable architectures.

Smart Objects, Dumb Archives: A User-Centric, Layered Digital Library Framework, Kurt Maly, Michael L. Nelson, Mohammad Zubair

Computer Science Faculty Publications

Discusses digital libraries, interoperability, and interfaces to access them, and proposes one universal protocol for communication for simple archives based on the hypertext transfer protocol (http). Describes the creation of a special class of digital objects called buckets, archives based on a NASA collection, and a set of digital library services. (Author/LRW)

Compute As Fast As The Engineers Can Think! Utrafast Computing Team Final Report, Robert T. Biedron, P. Mehrotra, Michael L. Nelson, M. L. Preston, J. J. Rehder, J. L. Rogersm, D. H. Rudy, J. Sobieski, O. O. Storaasli

Computer Science Faculty Publications

This report documents findings and recommendations by the Ultrafast Computing Team (UCT). In the period 10-12/98, UCT reviewed design case scenarios for a supersonic transport and a reusable launch vehicle to derive computing requirements necessary for support of a design process with efficiency so radically improved that human thought rather than the computer paces the process. Assessment of the present computing capability against the above requirements indicated a need for further improvement in computing speed by several orders of magnitude to reduce time to solution from tens of hours to seconds in major applications. Evaluation of the trends in computer …

A Digital Library For The National Advisory Committee For Aeronautics, Michael L. Nelson

Computer Science Faculty Publications

We describe the digital library (DL) for the National Advisory Committee for Aeronautics (NACA), the NACA Technical Report Server (NACATRS). The predecessor organization for the National Aeronautics and Space Administration (NASA), NACA existed from 1915 until 1958. The primary manifestation of NACA's research was the NACA report series. We describe the process of converting this collection of reports to digital format and making it available on the World Wide Web (WWW) and is a node in the NASA Technical Report Server (NTRS). We describe the current state of the project, the resulting DL technology developed from the project, and the …

Reconfigurable Shift Switching Parallel Comparators, R. Lin, S. Olariu

Computer Science Faculty Publications

We present novel asynchronous VLSI comparator schemes which are based on recently proposed reconfigurable shift switch logic and the traditional (precharged) CMOS domino logic. The schemes always produce a semaphore as a by-product of the process to indicate the end of domino process, which requires no additional delay and a minimal number of additional devices. For a large percentage of inputs the computations are much faster than traditional synchronous comparators due to the full utilization of the inherent speed of the circuits. Also the schemes are simple, area compact and stable.

On The P-Connectedness Of Graphs – A Survey, Luitpold Babel, Stephan Olariu

Computer Science Faculty Publications

A graph is said to be p-connected if for every partition of its vertices into two non-empty, disjoint, sets some chordless path with three edges contains vertices from both sets in the partition. As it turns out, p-connectedness generalizes the usual connectedness of graphs and leads, in a natural way, to a unique tree representation for arbitrary graphs.

This paper reviews old and new results, both structural and algorithmic, about p-connectedness along with applications to various graph decompositions.