Several industries rely on accurate and efficient processing of 3D spatial queries over increasingly large datasets for decision optimization and exploration purposes. Examples include clinical diagnosis supported by 3D imaging of human tissues, numerical simulation of aerodynamics during the design of aircraft and vehicles, and the search for profitable deposits of minerals, oil and gas guided by 3D maps extrapolated from dense collections of rock samples. Despite the clear demand for spatial data processing in 3D space, existing systems supporting these organizations are scarce and scale poorly with data volume. This paper presents a GPU-based acceleration engine for SQL database management systems that can serve spatial queries orders of magnitude faster than solutions based on traditional software stacks.

This paper proposes an approach for integrating CPU/disk/network scheduling and memory management for supporting a variety of VCR operations and dynamic service changes efficiently. Under this approach we can optimize individual resources, and support a maximal number of clients on a given system. We present a framework of service modeling to characterize the requested video services and identify the scheduling parameters for supporting these services. A number of techniques and methodologies are developed for analyzing the behaviors of disk accesses, network operations, and CPU activities under the loads of both single and multiple clients. We also describe an admission control strategy that utilizes information about all the system resources to determine if a set of video services is acceptable.

The transport of compressed video without loss of picture quality requires the network to support large fluctuations in bandwidth requirements. This paper introduces a lossless smoothing algorithm designed to satisfy any given set of buffer and delay constraints for both stored and live video applications with the goal of minimizing the number of rate changes and maximum rate. The algorithm is shown to be effective in smoothing bursty bit streams as illustrated by the experimental demonstration of MPEG encoded video.

A technique for chaining the transistors in the layouts of static CMOS leaf cells is presented and analyzed. This new method is superior to existing techniques, since it can operate on a more general class of circuits and is very efficient. It is shown that the layout width of a CMOS leaf cell can be significantly reduced (nearly 40% in the average case) by transistor chaining. Moreover, more than half of the switching functions of four variables have optimal CMOS circuit implementations with non-series/parallel topologies. Therefore, the use of non-series/parallel circuits can have a positive global impact on layout area and performance. The transistor chaining technique presented in this paper produces the optimal solution for 82% of the circuits tested, and has linear time complexity.

A plane multigraph is said to be dual Eulerian if both it and its dual contain an Euler path or circuit and the Euler paths have corresponding edge sequences. In this paper several properties of plane multigraphs are derived, and a necessary and sufficient condition for a plane multigraph to be dual Eulerian is given. Although the necessary and sufficient condition for a multigraph to be Eulerian is somewhat trivial, the necessary and sufficient condition for a plane multigraph to be dual Eulerian is not. Nevertheless, the question of whether or not a plane multigraph is dual Eulerian can be answered in time proportional to a linear function of the number of edges of the graph, and an algorithm that answers this question is presented in this paper. This theory can be applied to the layout synthesis of functional cells for Complementary Metal-Oxide Semiconductor Very Large-Scale Integrated circuits.

A queueing model for the DQDB protocol with a single priority level is presented and analyzed. The state of a node is defined by the number of requests in the distributed queue prior to, and post generation of a segment. It is shown that the number of states that a node can be in, is finite and position dependent. Moreover, it is shown that the request rate and the network traffic that a node perceives at any particular moment are highly dependent on its state. An iterative technique is presented to calculate the request rate and network traffic for all the nodes in a DQDB network by carefully modeling the relationship between adjacent nodes. The node average waiting time and average throughput are analyzed as functions of the node position and state in the network. Our results illustrate the effect of the various parameters on the waiting time and throughput. Comparisons with simulation and existing analytical results are presented.

The Markov-Modulated Bernoulli Process (MMBP) model is used to analyze the delay experienced by messages in clocked, packed-switched Banyan networks with k x k output-buffered switches. This approach allows us to analyze both single packet messages and multipacket messages with general traffic pattern including uniform traffic, hot-spot traffic, locality of reference, etc. The ability to analyze multipacket messages is very important for multimedia applications. Previous work, which is only applicable to restricted message and traffic patterns, resorts to either heuristic correction factors to artificially tune the model or tedious computational efforts. In contrast, the proposed model, which is applicable to much more general message and traffic patterns, not only is an application of a theoretically complete model but also requires a minimal amount of computational effort. In all cases, the analytical results are compared with results obtained by simulation and are shown to be very accurate.

Communication between processors is one of the most important issues in parallel and distributed systems. The authors study the communication aspects of a well known multiprocessor structure, the cube-connected cycles (CCC). Only nonoptimal routing algorithms and bounds on the diameter of restricted subclasses of the CCC have been presented in earlier work. The authors present an optimal routing algorithm for the general CCC, with a formal proof of its optimality. Based on this routing algorithm, they derive the exact network diameter for the general CCC.>

We present a model, based on a network of DX/D/1 queues, to predict the communication performance of static interconnection networks under various communication patterns. Our model predicts delay time distributions in the links as well as the first and second moments of the overall delay time of messages in the system. These predictions are verified by the results of simulations.